/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/product-lines/minepump_spec5_product50.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 22:57:36,784 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 22:57:36,851 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-15 22:57:36,856 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 22:57:36,856 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 22:57:36,877 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 22:57:36,877 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 22:57:36,878 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 22:57:36,878 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 22:57:36,881 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 22:57:36,881 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 22:57:36,882 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 22:57:36,882 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 22:57:36,883 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 22:57:36,883 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 22:57:36,883 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 22:57:36,883 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 22:57:36,884 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 22:57:36,884 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 22:57:36,884 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 22:57:36,884 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 22:57:36,884 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 22:57:36,884 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 22:57:36,885 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 22:57:36,885 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 22:57:36,885 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 22:57:36,885 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 22:57:36,885 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 22:57:36,886 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 22:57:36,886 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 22:57:36,886 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 22:57:36,886 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 22:57:36,887 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 22:57:36,887 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 22:57:36,887 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 22:57:36,887 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 22:57:36,887 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 22:57:36,887 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 22:57:36,887 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 22:57:36,887 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 22:57:36,887 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 22:57:36,888 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 22:57:36,888 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 22:57:36,888 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> true [2023-12-15 22:57:37,083 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 22:57:37,099 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 22:57:37,101 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 22:57:37,102 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 22:57:37,102 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 22:57:37,103 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/minepump_spec5_product50.cil.c [2023-12-15 22:57:38,121 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 22:57:38,323 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 22:57:38,324 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/minepump_spec5_product50.cil.c [2023-12-15 22:57:38,333 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8240a87c8/a6536e7a89aa434495888dd6514e421e/FLAGd6288f846 [2023-12-15 22:57:38,342 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8240a87c8/a6536e7a89aa434495888dd6514e421e [2023-12-15 22:57:38,344 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 22:57:38,345 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 22:57:38,345 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 22:57:38,345 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 22:57:38,354 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 22:57:38,355 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 10:57:38" (1/1) ... [2023-12-15 22:57:38,356 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73b49cce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:57:38, skipping insertion in model container [2023-12-15 22:57:38,356 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 10:57:38" (1/1) ... [2023-12-15 22:57:38,418 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 22:57:38,519 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/product-lines/minepump_spec5_product50.cil.c[1605,1618] [2023-12-15 22:57:38,642 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 22:57:38,653 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 22:57:38,659 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [49] [2023-12-15 22:57:38,661 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [58] [2023-12-15 22:57:38,661 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [279] [2023-12-15 22:57:38,661 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [349] [2023-12-15 22:57:38,661 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [453] [2023-12-15 22:57:38,661 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification5_spec.i","") [819] [2023-12-15 22:57:38,661 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [868] [2023-12-15 22:57:38,662 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [906] [2023-12-15 22:57:38,668 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/product-lines/minepump_spec5_product50.cil.c[1605,1618] [2023-12-15 22:57:38,713 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 22:57:38,725 INFO L206 MainTranslator]: Completed translation [2023-12-15 22:57:38,726 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:57:38 WrapperNode [2023-12-15 22:57:38,726 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 22:57:38,727 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 22:57:38,727 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 22:57:38,727 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 22:57:38,739 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:57:38" (1/1) ... [2023-12-15 22:57:38,751 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:57:38" (1/1) ... [2023-12-15 22:57:38,773 INFO L138 Inliner]: procedures = 58, calls = 102, calls flagged for inlining = 26, calls inlined = 22, statements flattened = 212 [2023-12-15 22:57:38,774 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 22:57:38,774 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 22:57:38,774 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 22:57:38,775 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 22:57:38,782 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:57:38" (1/1) ... [2023-12-15 22:57:38,782 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:57:38" (1/1) ... [2023-12-15 22:57:38,783 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:57:38" (1/1) ... [2023-12-15 22:57:38,796 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-15 22:57:38,796 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:57:38" (1/1) ... [2023-12-15 22:57:38,796 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:57:38" (1/1) ... [2023-12-15 22:57:38,800 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:57:38" (1/1) ... [2023-12-15 22:57:38,803 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:57:38" (1/1) ... [2023-12-15 22:57:38,803 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:57:38" (1/1) ... [2023-12-15 22:57:38,804 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:57:38" (1/1) ... [2023-12-15 22:57:38,806 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 22:57:38,806 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 22:57:38,806 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 22:57:38,806 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 22:57:38,807 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:57:38" (1/1) ... [2023-12-15 22:57:38,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 22:57:38,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 22:57:38,842 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-15 22:57:38,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-15 22:57:38,872 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 22:57:38,872 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2023-12-15 22:57:38,873 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2023-12-15 22:57:38,873 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2023-12-15 22:57:38,873 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2023-12-15 22:57:38,873 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2023-12-15 22:57:38,873 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2023-12-15 22:57:38,873 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__highWaterSensor [2023-12-15 22:57:38,873 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__highWaterSensor [2023-12-15 22:57:38,873 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2023-12-15 22:57:38,873 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2023-12-15 22:57:38,874 INFO L130 BoogieDeclarations]: Found specification of procedure isPumpRunning [2023-12-15 22:57:38,874 INFO L138 BoogieDeclarations]: Found implementation of procedure isPumpRunning [2023-12-15 22:57:38,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 22:57:38,874 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2023-12-15 22:57:38,874 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2023-12-15 22:57:38,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 22:57:38,874 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 22:57:38,943 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 22:57:38,944 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 22:57:39,093 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 22:57:39,158 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 22:57:39,158 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-15 22:57:39,159 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 10:57:39 BoogieIcfgContainer [2023-12-15 22:57:39,159 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 22:57:39,161 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 22:57:39,161 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 22:57:39,163 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 22:57:39,164 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 10:57:38" (1/3) ... [2023-12-15 22:57:39,164 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ba76f50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 10:57:39, skipping insertion in model container [2023-12-15 22:57:39,164 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:57:38" (2/3) ... [2023-12-15 22:57:39,164 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ba76f50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 10:57:39, skipping insertion in model container [2023-12-15 22:57:39,164 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 10:57:39" (3/3) ... [2023-12-15 22:57:39,165 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec5_product50.cil.c [2023-12-15 22:57:39,177 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 22:57:39,177 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-15 22:57:39,211 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 22:57:39,216 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@126a7848, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 22:57:39,216 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-15 22:57:39,220 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 50 states have (on average 1.54) internal successors, (77), 58 states have internal predecessors, (77), 12 states have call successors, (12), 7 states have call predecessors, (12), 7 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-15 22:57:39,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-15 22:57:39,226 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:57:39,227 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 22:57:39,227 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:57:39,230 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:57:39,230 INFO L85 PathProgramCache]: Analyzing trace with hash 2052317173, now seen corresponding path program 1 times [2023-12-15 22:57:39,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:57:39,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161354625] [2023-12-15 22:57:39,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:57:39,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:57:39,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:57:39,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 22:57:39,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:57:39,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-15 22:57:39,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:57:39,369 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-15 22:57:39,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:57:39,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161354625] [2023-12-15 22:57:39,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161354625] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:57:39,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 22:57:39,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-15 22:57:39,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843138539] [2023-12-15 22:57:39,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:57:39,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-15 22:57:39,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:57:39,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-15 22:57:39,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 22:57:39,394 INFO L87 Difference]: Start difference. First operand has 71 states, 50 states have (on average 1.54) internal successors, (77), 58 states have internal predecessors, (77), 12 states have call successors, (12), 7 states have call predecessors, (12), 7 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-15 22:57:39,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:57:39,447 INFO L93 Difference]: Finished difference Result 140 states and 203 transitions. [2023-12-15 22:57:39,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-15 22:57:39,449 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2023-12-15 22:57:39,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:57:39,454 INFO L225 Difference]: With dead ends: 140 [2023-12-15 22:57:39,455 INFO L226 Difference]: Without dead ends: 66 [2023-12-15 22:57:39,457 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 22:57:39,459 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 22:57:39,460 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 22:57:39,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2023-12-15 22:57:39,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2023-12-15 22:57:39,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 47 states have (on average 1.425531914893617) internal successors, (67), 54 states have internal predecessors, (67), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-15 22:57:39,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 90 transitions. [2023-12-15 22:57:39,503 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 90 transitions. Word has length 22 [2023-12-15 22:57:39,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:57:39,504 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 90 transitions. [2023-12-15 22:57:39,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-15 22:57:39,505 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 90 transitions. [2023-12-15 22:57:39,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-15 22:57:39,510 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:57:39,510 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 22:57:39,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-15 22:57:39,511 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:57:39,512 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:57:39,512 INFO L85 PathProgramCache]: Analyzing trace with hash 449360776, now seen corresponding path program 1 times [2023-12-15 22:57:39,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:57:39,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028032455] [2023-12-15 22:57:39,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:57:39,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:57:39,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:57:39,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 22:57:39,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:57:39,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-15 22:57:39,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:57:39,614 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-15 22:57:39,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:57:39,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028032455] [2023-12-15 22:57:39,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028032455] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:57:39,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 22:57:39,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 22:57:39,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337581060] [2023-12-15 22:57:39,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:57:39,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 22:57:39,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:57:39,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 22:57:39,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 22:57:39,617 INFO L87 Difference]: Start difference. First operand 66 states and 90 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-15 22:57:39,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:57:39,664 INFO L93 Difference]: Finished difference Result 105 states and 143 transitions. [2023-12-15 22:57:39,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 22:57:39,664 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2023-12-15 22:57:39,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:57:39,666 INFO L225 Difference]: With dead ends: 105 [2023-12-15 22:57:39,666 INFO L226 Difference]: Without dead ends: 58 [2023-12-15 22:57:39,667 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 22:57:39,668 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 11 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 22:57:39,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 119 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 22:57:39,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2023-12-15 22:57:39,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2023-12-15 22:57:39,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 42 states have (on average 1.4523809523809523) internal successors, (61), 49 states have internal predecessors, (61), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-15 22:57:39,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 79 transitions. [2023-12-15 22:57:39,673 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 79 transitions. Word has length 23 [2023-12-15 22:57:39,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:57:39,673 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 79 transitions. [2023-12-15 22:57:39,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-15 22:57:39,674 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 79 transitions. [2023-12-15 22:57:39,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-15 22:57:39,674 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:57:39,674 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 22:57:39,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-15 22:57:39,675 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:57:39,675 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:57:39,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1288234241, now seen corresponding path program 1 times [2023-12-15 22:57:39,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:57:39,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068645998] [2023-12-15 22:57:39,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:57:39,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:57:39,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:57:39,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-15 22:57:39,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:57:39,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-15 22:57:39,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:57:39,768 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-15 22:57:39,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:57:39,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068645998] [2023-12-15 22:57:39,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068645998] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:57:39,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 22:57:39,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 22:57:39,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327448869] [2023-12-15 22:57:39,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:57:39,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 22:57:39,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:57:39,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 22:57:39,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-15 22:57:39,776 INFO L87 Difference]: Start difference. First operand 58 states and 79 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-15 22:57:39,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:57:39,851 INFO L93 Difference]: Finished difference Result 114 states and 157 transitions. [2023-12-15 22:57:39,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-15 22:57:39,853 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2023-12-15 22:57:39,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:57:39,854 INFO L225 Difference]: With dead ends: 114 [2023-12-15 22:57:39,854 INFO L226 Difference]: Without dead ends: 58 [2023-12-15 22:57:39,854 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-15 22:57:39,855 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 82 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 22:57:39,855 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 112 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 22:57:39,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2023-12-15 22:57:39,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2023-12-15 22:57:39,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 42 states have (on average 1.4285714285714286) internal successors, (60), 49 states have internal predecessors, (60), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-15 22:57:39,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 78 transitions. [2023-12-15 22:57:39,861 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 78 transitions. Word has length 26 [2023-12-15 22:57:39,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:57:39,862 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 78 transitions. [2023-12-15 22:57:39,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-15 22:57:39,862 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 78 transitions. [2023-12-15 22:57:39,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-15 22:57:39,863 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:57:39,863 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 22:57:39,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-15 22:57:39,864 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:57:39,866 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:57:39,866 INFO L85 PathProgramCache]: Analyzing trace with hash 283298297, now seen corresponding path program 1 times [2023-12-15 22:57:39,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:57:39,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305790702] [2023-12-15 22:57:39,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:57:39,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:57:39,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:57:39,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-15 22:57:39,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:57:39,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 22:57:39,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:57:39,939 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-15 22:57:39,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:57:39,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305790702] [2023-12-15 22:57:39,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305790702] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:57:39,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 22:57:39,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 22:57:39,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541958138] [2023-12-15 22:57:39,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:57:39,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 22:57:39,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:57:39,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 22:57:39,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 22:57:39,942 INFO L87 Difference]: Start difference. First operand 58 states and 78 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-15 22:57:39,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:57:39,995 INFO L93 Difference]: Finished difference Result 156 states and 213 transitions. [2023-12-15 22:57:39,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 22:57:39,996 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 31 [2023-12-15 22:57:39,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:57:39,999 INFO L225 Difference]: With dead ends: 156 [2023-12-15 22:57:40,000 INFO L226 Difference]: Without dead ends: 100 [2023-12-15 22:57:40,004 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 22:57:40,007 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 61 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 22:57:40,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 128 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 22:57:40,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-12-15 22:57:40,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2023-12-15 22:57:40,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 71 states have (on average 1.380281690140845) internal successors, (98), 78 states have internal predecessors, (98), 14 states have call successors, (14), 12 states have call predecessors, (14), 12 states have return successors, (18), 14 states have call predecessors, (18), 14 states have call successors, (18) [2023-12-15 22:57:40,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 130 transitions. [2023-12-15 22:57:40,019 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 130 transitions. Word has length 31 [2023-12-15 22:57:40,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:57:40,019 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 130 transitions. [2023-12-15 22:57:40,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-15 22:57:40,020 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 130 transitions. [2023-12-15 22:57:40,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-15 22:57:40,028 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:57:40,028 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 22:57:40,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-15 22:57:40,029 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:57:40,029 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:57:40,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1469249665, now seen corresponding path program 1 times [2023-12-15 22:57:40,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:57:40,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237585134] [2023-12-15 22:57:40,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:57:40,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:57:40,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:57:40,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-15 22:57:40,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:57:40,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 22:57:40,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:57:40,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-12-15 22:57:40,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:57:40,213 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-15 22:57:40,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:57:40,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237585134] [2023-12-15 22:57:40,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237585134] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:57:40,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 22:57:40,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 22:57:40,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858872588] [2023-12-15 22:57:40,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:57:40,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 22:57:40,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:57:40,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 22:57:40,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 22:57:40,216 INFO L87 Difference]: Start difference. First operand 98 states and 130 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-15 22:57:40,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:57:40,322 INFO L93 Difference]: Finished difference Result 218 states and 294 transitions. [2023-12-15 22:57:40,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 22:57:40,323 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 38 [2023-12-15 22:57:40,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:57:40,325 INFO L225 Difference]: With dead ends: 218 [2023-12-15 22:57:40,325 INFO L226 Difference]: Without dead ends: 122 [2023-12-15 22:57:40,326 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-15 22:57:40,327 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 49 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 22:57:40,328 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 192 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 22:57:40,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-12-15 22:57:40,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2023-12-15 22:57:40,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 88 states have (on average 1.375) internal successors, (121), 95 states have internal predecessors, (121), 16 states have call successors, (16), 12 states have call predecessors, (16), 15 states have return successors, (23), 17 states have call predecessors, (23), 16 states have call successors, (23) [2023-12-15 22:57:40,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 160 transitions. [2023-12-15 22:57:40,350 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 160 transitions. Word has length 38 [2023-12-15 22:57:40,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:57:40,350 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 160 transitions. [2023-12-15 22:57:40,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-15 22:57:40,350 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 160 transitions. [2023-12-15 22:57:40,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-15 22:57:40,354 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:57:40,354 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 22:57:40,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-15 22:57:40,355 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:57:40,355 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:57:40,355 INFO L85 PathProgramCache]: Analyzing trace with hash 189385987, now seen corresponding path program 1 times [2023-12-15 22:57:40,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:57:40,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665235258] [2023-12-15 22:57:40,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:57:40,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:57:40,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:57:40,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-15 22:57:40,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:57:40,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 22:57:40,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:57:40,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-12-15 22:57:40,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:57:40,440 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-15 22:57:40,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:57:40,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665235258] [2023-12-15 22:57:40,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665235258] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:57:40,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 22:57:40,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 22:57:40,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442272493] [2023-12-15 22:57:40,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:57:40,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 22:57:40,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:57:40,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 22:57:40,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 22:57:40,442 INFO L87 Difference]: Start difference. First operand 120 states and 160 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-15 22:57:40,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:57:40,559 INFO L93 Difference]: Finished difference Result 247 states and 337 transitions. [2023-12-15 22:57:40,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 22:57:40,560 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 38 [2023-12-15 22:57:40,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:57:40,563 INFO L225 Difference]: With dead ends: 247 [2023-12-15 22:57:40,563 INFO L226 Difference]: Without dead ends: 129 [2023-12-15 22:57:40,563 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-15 22:57:40,565 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 54 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 22:57:40,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 192 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 22:57:40,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2023-12-15 22:57:40,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 122. [2023-12-15 22:57:40,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 90 states have (on average 1.3666666666666667) internal successors, (123), 97 states have internal predecessors, (123), 16 states have call successors, (16), 12 states have call predecessors, (16), 15 states have return successors, (23), 17 states have call predecessors, (23), 16 states have call successors, (23) [2023-12-15 22:57:40,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 162 transitions. [2023-12-15 22:57:40,590 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 162 transitions. Word has length 38 [2023-12-15 22:57:40,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:57:40,591 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 162 transitions. [2023-12-15 22:57:40,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-15 22:57:40,592 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 162 transitions. [2023-12-15 22:57:40,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-15 22:57:40,594 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:57:40,594 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 22:57:40,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-15 22:57:40,594 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:57:40,594 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:57:40,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1398961915, now seen corresponding path program 1 times [2023-12-15 22:57:40,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:57:40,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577943775] [2023-12-15 22:57:40,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:57:40,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:57:40,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:57:40,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-15 22:57:40,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:57:40,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 22:57:40,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:57:40,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-12-15 22:57:40,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:57:40,684 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-15 22:57:40,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:57:40,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577943775] [2023-12-15 22:57:40,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577943775] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:57:40,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 22:57:40,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 22:57:40,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443616229] [2023-12-15 22:57:40,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:57:40,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 22:57:40,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:57:40,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 22:57:40,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 22:57:40,686 INFO L87 Difference]: Start difference. First operand 122 states and 162 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-15 22:57:40,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:57:40,844 INFO L93 Difference]: Finished difference Result 364 states and 497 transitions. [2023-12-15 22:57:40,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-15 22:57:40,845 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 38 [2023-12-15 22:57:40,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:57:40,848 INFO L225 Difference]: With dead ends: 364 [2023-12-15 22:57:40,848 INFO L226 Difference]: Without dead ends: 244 [2023-12-15 22:57:40,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-15 22:57:40,851 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 187 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 22:57:40,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 202 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 22:57:40,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2023-12-15 22:57:40,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 236. [2023-12-15 22:57:40,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 172 states have (on average 1.319767441860465) internal successors, (227), 183 states have internal predecessors, (227), 34 states have call successors, (34), 28 states have call predecessors, (34), 29 states have return successors, (53), 34 states have call predecessors, (53), 34 states have call successors, (53) [2023-12-15 22:57:40,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 314 transitions. [2023-12-15 22:57:40,874 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 314 transitions. Word has length 38 [2023-12-15 22:57:40,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:57:40,874 INFO L495 AbstractCegarLoop]: Abstraction has 236 states and 314 transitions. [2023-12-15 22:57:40,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-15 22:57:40,874 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 314 transitions. [2023-12-15 22:57:40,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-12-15 22:57:40,876 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:57:40,876 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 22:57:40,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-15 22:57:40,876 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:57:40,876 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:57:40,877 INFO L85 PathProgramCache]: Analyzing trace with hash -175084680, now seen corresponding path program 1 times [2023-12-15 22:57:40,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:57:40,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818332541] [2023-12-15 22:57:40,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:57:40,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:57:40,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:57:40,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-15 22:57:40,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:57:40,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 22:57:40,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:57:40,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 22:57:40,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:57:40,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-15 22:57:40,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:57:40,957 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-15 22:57:40,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:57:40,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818332541] [2023-12-15 22:57:40,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818332541] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:57:40,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 22:57:40,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 22:57:40,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895507541] [2023-12-15 22:57:40,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:57:40,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 22:57:40,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:57:40,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 22:57:40,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-15 22:57:40,964 INFO L87 Difference]: Start difference. First operand 236 states and 314 transitions. Second operand has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-15 22:57:41,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:57:41,170 INFO L93 Difference]: Finished difference Result 474 states and 635 transitions. [2023-12-15 22:57:41,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-15 22:57:41,171 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 41 [2023-12-15 22:57:41,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:57:41,172 INFO L225 Difference]: With dead ends: 474 [2023-12-15 22:57:41,172 INFO L226 Difference]: Without dead ends: 240 [2023-12-15 22:57:41,173 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2023-12-15 22:57:41,174 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 105 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 22:57:41,174 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 247 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 22:57:41,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2023-12-15 22:57:41,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 232. [2023-12-15 22:57:41,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 168 states have (on average 1.2797619047619047) internal successors, (215), 179 states have internal predecessors, (215), 34 states have call successors, (34), 28 states have call predecessors, (34), 29 states have return successors, (53), 34 states have call predecessors, (53), 34 states have call successors, (53) [2023-12-15 22:57:41,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 302 transitions. [2023-12-15 22:57:41,193 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 302 transitions. Word has length 41 [2023-12-15 22:57:41,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:57:41,193 INFO L495 AbstractCegarLoop]: Abstraction has 232 states and 302 transitions. [2023-12-15 22:57:41,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-15 22:57:41,193 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 302 transitions. [2023-12-15 22:57:41,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-12-15 22:57:41,194 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:57:41,194 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 22:57:41,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-15 22:57:41,194 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:57:41,194 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:57:41,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1716994453, now seen corresponding path program 1 times [2023-12-15 22:57:41,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:57:41,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023714318] [2023-12-15 22:57:41,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:57:41,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:57:41,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:57:41,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-15 22:57:41,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:57:41,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-15 22:57:41,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:57:41,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-12-15 22:57:41,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:57:41,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 22:57:41,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:57:41,363 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-15 22:57:41,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:57:41,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023714318] [2023-12-15 22:57:41,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023714318] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:57:41,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 22:57:41,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-15 22:57:41,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132931279] [2023-12-15 22:57:41,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:57:41,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 22:57:41,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:57:41,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 22:57:41,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-15 22:57:41,364 INFO L87 Difference]: Start difference. First operand 232 states and 302 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 6 states have internal predecessors, (32), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-15 22:57:41,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:57:41,706 INFO L93 Difference]: Finished difference Result 718 states and 973 transitions. [2023-12-15 22:57:41,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-15 22:57:41,707 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 6 states have internal predecessors, (32), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 42 [2023-12-15 22:57:41,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:57:41,709 INFO L225 Difference]: With dead ends: 718 [2023-12-15 22:57:41,709 INFO L226 Difference]: Without dead ends: 532 [2023-12-15 22:57:41,710 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=386, Unknown=0, NotChecked=0, Total=506 [2023-12-15 22:57:41,712 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 344 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 22:57:41,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 296 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 22:57:41,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2023-12-15 22:57:41,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 449. [2023-12-15 22:57:41,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 326 states have (on average 1.2791411042944785) internal successors, (417), 350 states have internal predecessors, (417), 65 states have call successors, (65), 49 states have call predecessors, (65), 57 states have return successors, (104), 67 states have call predecessors, (104), 65 states have call successors, (104) [2023-12-15 22:57:41,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 586 transitions. [2023-12-15 22:57:41,742 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 586 transitions. Word has length 42 [2023-12-15 22:57:41,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:57:41,743 INFO L495 AbstractCegarLoop]: Abstraction has 449 states and 586 transitions. [2023-12-15 22:57:41,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 6 states have internal predecessors, (32), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-15 22:57:41,743 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 586 transitions. [2023-12-15 22:57:41,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-12-15 22:57:41,745 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:57:41,745 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 22:57:41,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-15 22:57:41,745 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:57:41,746 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:57:41,746 INFO L85 PathProgramCache]: Analyzing trace with hash -12859544, now seen corresponding path program 1 times [2023-12-15 22:57:41,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:57:41,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460848100] [2023-12-15 22:57:41,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:57:41,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:57:41,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:57:41,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-15 22:57:41,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:57:41,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 22:57:41,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:57:41,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:57:41,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:57:41,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 22:57:41,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:57:41,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 22:57:41,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:57:41,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-15 22:57:41,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:57:41,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 22:57:41,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:57:41,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-15 22:57:41,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:57:41,834 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-12-15 22:57:41,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:57:41,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460848100] [2023-12-15 22:57:41,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460848100] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 22:57:41,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1459084159] [2023-12-15 22:57:41,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:57:41,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 22:57:41,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 22:57:41,837 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 22:57:41,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-15 22:57:41,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:57:41,914 INFO L262 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-15 22:57:41,920 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 22:57:42,031 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 20 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 22:57:42,032 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 22:57:42,154 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-15 22:57:42,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1459084159] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 22:57:42,154 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 22:57:42,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2023-12-15 22:57:42,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899713081] [2023-12-15 22:57:42,155 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 22:57:42,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-15 22:57:42,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:57:42,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-15 22:57:42,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2023-12-15 22:57:42,156 INFO L87 Difference]: Start difference. First operand 449 states and 586 transitions. Second operand has 12 states, 10 states have (on average 8.5) internal successors, (85), 8 states have internal predecessors, (85), 4 states have call successors, (18), 6 states have call predecessors, (18), 5 states have return successors, (16), 5 states have call predecessors, (16), 4 states have call successors, (16) [2023-12-15 22:57:42,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:57:42,774 INFO L93 Difference]: Finished difference Result 964 states and 1292 transitions. [2023-12-15 22:57:42,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-12-15 22:57:42,775 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 8.5) internal successors, (85), 8 states have internal predecessors, (85), 4 states have call successors, (18), 6 states have call predecessors, (18), 5 states have return successors, (16), 5 states have call predecessors, (16), 4 states have call successors, (16) Word has length 76 [2023-12-15 22:57:42,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:57:42,777 INFO L225 Difference]: With dead ends: 964 [2023-12-15 22:57:42,778 INFO L226 Difference]: Without dead ends: 559 [2023-12-15 22:57:42,779 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 167 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=255, Invalid=1005, Unknown=0, NotChecked=0, Total=1260 [2023-12-15 22:57:42,780 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 212 mSDsluCounter, 705 mSDsCounter, 0 mSdLazyCounter, 893 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 828 SdHoareTripleChecker+Invalid, 949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 893 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-15 22:57:42,780 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 828 Invalid, 949 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 893 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-15 22:57:42,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2023-12-15 22:57:42,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 504. [2023-12-15 22:57:42,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 363 states have (on average 1.258953168044077) internal successors, (457), 393 states have internal predecessors, (457), 74 states have call successors, (74), 62 states have call predecessors, (74), 66 states have return successors, (95), 69 states have call predecessors, (95), 74 states have call successors, (95) [2023-12-15 22:57:42,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 626 transitions. [2023-12-15 22:57:42,845 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 626 transitions. Word has length 76 [2023-12-15 22:57:42,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:57:42,846 INFO L495 AbstractCegarLoop]: Abstraction has 504 states and 626 transitions. [2023-12-15 22:57:42,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 8.5) internal successors, (85), 8 states have internal predecessors, (85), 4 states have call successors, (18), 6 states have call predecessors, (18), 5 states have return successors, (16), 5 states have call predecessors, (16), 4 states have call successors, (16) [2023-12-15 22:57:42,846 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 626 transitions. [2023-12-15 22:57:42,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-12-15 22:57:42,848 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:57:42,848 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 22:57:42,867 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-15 22:57:43,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-12-15 22:57:43,055 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:57:43,055 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:57:43,055 INFO L85 PathProgramCache]: Analyzing trace with hash 854554517, now seen corresponding path program 1 times [2023-12-15 22:57:43,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:57:43,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254196089] [2023-12-15 22:57:43,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:57:43,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:57:43,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:57:43,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-15 22:57:43,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:57:43,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 22:57:43,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:57:43,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:57:43,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:57:43,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 22:57:43,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:57:43,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 22:57:43,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:57:43,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:57:43,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:57:43,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 22:57:43,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:57:43,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 22:57:43,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:57:43,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-12-15 22:57:43,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:57:43,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:57:43,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:57:43,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-15 22:57:43,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:57:43,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-15 22:57:43,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:57:43,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2023-12-15 22:57:43,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:57:43,290 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 75 proven. 21 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-12-15 22:57:43,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:57:43,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254196089] [2023-12-15 22:57:43,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254196089] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 22:57:43,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1361926312] [2023-12-15 22:57:43,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:57:43,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 22:57:43,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 22:57:43,306 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 22:57:43,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-15 22:57:43,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:57:43,401 INFO L262 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-15 22:57:43,405 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 22:57:43,519 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 110 proven. 3 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2023-12-15 22:57:43,519 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 22:57:43,771 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 66 proven. 31 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2023-12-15 22:57:43,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1361926312] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 22:57:43,771 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 22:57:43,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 21 [2023-12-15 22:57:43,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415866974] [2023-12-15 22:57:43,772 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 22:57:43,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-15 22:57:43,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:57:43,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-15 22:57:43,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2023-12-15 22:57:43,774 INFO L87 Difference]: Start difference. First operand 504 states and 626 transitions. Second operand has 21 states, 21 states have (on average 7.190476190476191) internal successors, (151), 18 states have internal predecessors, (151), 10 states have call successors, (28), 8 states have call predecessors, (28), 9 states have return successors, (27), 9 states have call predecessors, (27), 10 states have call successors, (27) [2023-12-15 22:57:44,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:57:44,277 INFO L93 Difference]: Finished difference Result 1060 states and 1361 transitions. [2023-12-15 22:57:44,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-15 22:57:44,277 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 7.190476190476191) internal successors, (151), 18 states have internal predecessors, (151), 10 states have call successors, (28), 8 states have call predecessors, (28), 9 states have return successors, (27), 9 states have call predecessors, (27), 10 states have call successors, (27) Word has length 133 [2023-12-15 22:57:44,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:57:44,278 INFO L225 Difference]: With dead ends: 1060 [2023-12-15 22:57:44,278 INFO L226 Difference]: Without dead ends: 0 [2023-12-15 22:57:44,280 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 284 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=340, Invalid=1066, Unknown=0, NotChecked=0, Total=1406 [2023-12-15 22:57:44,280 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 388 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 701 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-15 22:57:44,280 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 325 Invalid, 842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 701 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-15 22:57:44,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-15 22:57:44,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-15 22:57:44,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 22:57:44,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-15 22:57:44,281 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 133 [2023-12-15 22:57:44,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:57:44,281 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-15 22:57:44,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 7.190476190476191) internal successors, (151), 18 states have internal predecessors, (151), 10 states have call successors, (28), 8 states have call predecessors, (28), 9 states have return successors, (27), 9 states have call predecessors, (27), 10 states have call successors, (27) [2023-12-15 22:57:44,282 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-15 22:57:44,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-15 22:57:44,283 INFO L805 garLoopResultBuilder]: Registering result SAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-15 22:57:44,291 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-15 22:57:44,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-12-15 22:57:44,490 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-15 22:57:46,172 INFO L899 garLoopResultBuilder]: For program point processEnvironment__wrappee__baseEXIT(lines 102 108) no Hoare annotation was computed. [2023-12-15 22:57:46,172 INFO L902 garLoopResultBuilder]: At program point processEnvironment__wrappee__baseFINAL(lines 102 108) the Hoare annotation is: true [2023-12-15 22:57:46,172 INFO L899 garLoopResultBuilder]: For program point L381-1(lines 377 388) no Hoare annotation was computed. [2023-12-15 22:57:46,172 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 377 388) the Hoare annotation is: true [2023-12-15 22:57:46,172 INFO L899 garLoopResultBuilder]: For program point changeMethaneLevelEXIT(lines 377 388) no Hoare annotation was computed. [2023-12-15 22:57:46,172 INFO L899 garLoopResultBuilder]: For program point L929(line 929) no Hoare annotation was computed. [2023-12-15 22:57:46,172 INFO L899 garLoopResultBuilder]: For program point cleanupEXIT(lines 908 937) no Hoare annotation was computed. [2023-12-15 22:57:46,173 INFO L899 garLoopResultBuilder]: For program point L922(lines 922 926) no Hoare annotation was computed. [2023-12-15 22:57:46,173 INFO L902 garLoopResultBuilder]: At program point L922-1(lines 922 926) the Hoare annotation is: true [2023-12-15 22:57:46,173 INFO L902 garLoopResultBuilder]: At program point L918-2(lines 918 932) the Hoare annotation is: true [2023-12-15 22:57:46,173 INFO L902 garLoopResultBuilder]: At program point L914(line 914) the Hoare annotation is: true [2023-12-15 22:57:46,173 INFO L899 garLoopResultBuilder]: For program point L914-1(line 914) no Hoare annotation was computed. [2023-12-15 22:57:46,173 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 908 937) the Hoare annotation is: true [2023-12-15 22:57:46,173 INFO L899 garLoopResultBuilder]: For program point L933(lines 908 937) no Hoare annotation was computed. [2023-12-15 22:57:46,173 INFO L895 garLoopResultBuilder]: At program point L155(line 155) the Hoare annotation is: (let ((.cse1 (< |old(~pumpRunning~0)| 1)) (.cse0 (= 0 ~systemActive~0))) (and (or (not (= |old(~pumpRunning~0)| 0)) (and (= ~pumpRunning~0 0) (= |old(~waterLevel~0)| ~waterLevel~0)) .cse0 (< 2 |old(~waterLevel~0)|)) (or (not (= |old(~waterLevel~0)| 2)) .cse1 .cse0) (or (< 1 |old(~waterLevel~0)|) (< |old(~switchedOnBeforeTS~0)| 1) .cse1 .cse0))) [2023-12-15 22:57:46,173 INFO L899 garLoopResultBuilder]: For program point L155-1(lines 136 160) no Hoare annotation was computed. [2023-12-15 22:57:46,173 INFO L899 garLoopResultBuilder]: For program point L89-1(lines 89 95) no Hoare annotation was computed. [2023-12-15 22:57:46,174 INFO L895 garLoopResultBuilder]: At program point L849(line 849) the Hoare annotation is: (let ((.cse0 (= ~pumpRunning~0 |old(~pumpRunning~0)|)) (.cse6 (= ~pumpRunning~0 0)) (.cse13 (<= ~waterLevel~0 1)) (.cse14 (<= (+ ~waterLevel~0 1) |old(~waterLevel~0)|)) (.cse7 (= |timeShift___utac_acc__Specification5_spec__3_~tmp~8#1| ~waterLevel~0)) (.cse2 (<= 1 ~switchedOnBeforeTS~0))) (let ((.cse3 (not (= |old(~waterLevel~0)| 2))) (.cse10 (and .cse6 .cse13 .cse14 .cse7 .cse2)) (.cse11 (< |old(~switchedOnBeforeTS~0)| 1)) (.cse12 (and .cse0 .cse13 .cse14 .cse7 .cse2)) (.cse4 (< |old(~pumpRunning~0)| 1)) (.cse8 (not (= |old(~pumpRunning~0)| 0))) (.cse5 (= 0 ~systemActive~0)) (.cse9 (= |old(~waterLevel~0)| ~waterLevel~0))) (and (let ((.cse1 (= ~waterLevel~0 1))) (or (and .cse0 (= |timeShift___utac_acc__Specification5_spec__3_~tmp~8#1| 1) .cse1 .cse2) .cse3 .cse4 .cse5 (and .cse6 .cse7 .cse1 .cse2))) (or .cse8 .cse3 .cse5) (or (and .cse0 .cse7 .cse9 .cse2) .cse10 .cse11 .cse12 .cse4 .cse5 (< 2 |old(~waterLevel~0)|) (and .cse6 .cse7 .cse9 .cse2)) (or (not (= |old(~waterLevel~0)| 1)) .cse10 .cse11 .cse12 .cse4 .cse5) (or (< 1 |old(~waterLevel~0)|) .cse8 .cse5 (and .cse6 .cse7 .cse9))))) [2023-12-15 22:57:46,174 INFO L899 garLoopResultBuilder]: For program point L849-1(line 849) no Hoare annotation was computed. [2023-12-15 22:57:46,174 INFO L899 garLoopResultBuilder]: For program point L82(lines 82 88) no Hoare annotation was computed. [2023-12-15 22:57:46,174 INFO L899 garLoopResultBuilder]: For program point L82-2(lines 78 100) no Hoare annotation was computed. [2023-12-15 22:57:46,174 INFO L899 garLoopResultBuilder]: For program point L144(lines 144 152) no Hoare annotation was computed. [2023-12-15 22:57:46,174 INFO L899 garLoopResultBuilder]: For program point L140(lines 140 157) no Hoare annotation was computed. [2023-12-15 22:57:46,174 INFO L895 garLoopResultBuilder]: At program point L834(line 834) the Hoare annotation is: (let ((.cse1 (= ~pumpRunning~0 0)) (.cse0 (not (= |old(~pumpRunning~0)| 0))) (.cse6 (= |old(~waterLevel~0)| ~waterLevel~0)) (.cse8 (= ~pumpRunning~0 |old(~pumpRunning~0)|)) (.cse2 (= 2 ~waterLevel~0)) (.cse3 (= ~switchedOnBeforeTS~0 |old(~switchedOnBeforeTS~0)|)) (.cse4 (not (= |old(~waterLevel~0)| 2))) (.cse7 (< |old(~pumpRunning~0)| 1)) (.cse5 (= 0 ~systemActive~0))) (and (or .cse0 (and .cse1 .cse2 .cse3) .cse4 .cse5) (or (< 1 |old(~waterLevel~0)|) (and .cse1 .cse3 .cse6) .cse0 .cse5) (or (< |old(~switchedOnBeforeTS~0)| 1) .cse7 .cse5 (and .cse8 .cse3 .cse6) (< 2 |old(~waterLevel~0)|)) (or (and .cse8 .cse2 .cse3) .cse4 .cse7 .cse5))) [2023-12-15 22:57:46,174 INFO L899 garLoopResultBuilder]: For program point L834-1(line 834) no Hoare annotation was computed. [2023-12-15 22:57:46,175 INFO L899 garLoopResultBuilder]: For program point L54(line 54) no Hoare annotation was computed. [2023-12-15 22:57:46,175 INFO L899 garLoopResultBuilder]: For program point L851(lines 851 861) no Hoare annotation was computed. [2023-12-15 22:57:46,175 INFO L899 garLoopResultBuilder]: For program point L847(lines 847 864) no Hoare annotation was computed. [2023-12-15 22:57:46,175 INFO L899 garLoopResultBuilder]: For program point L847-1(lines 839 867) no Hoare annotation was computed. [2023-12-15 22:57:46,175 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 75 101) the Hoare annotation is: (let ((.cse1 (= ~pumpRunning~0 0)) (.cse0 (not (= |old(~pumpRunning~0)| 0))) (.cse6 (= |old(~waterLevel~0)| ~waterLevel~0)) (.cse8 (= ~pumpRunning~0 |old(~pumpRunning~0)|)) (.cse2 (= 2 ~waterLevel~0)) (.cse3 (= ~switchedOnBeforeTS~0 |old(~switchedOnBeforeTS~0)|)) (.cse4 (not (= |old(~waterLevel~0)| 2))) (.cse7 (< |old(~pumpRunning~0)| 1)) (.cse5 (= 0 ~systemActive~0))) (and (or .cse0 (and .cse1 .cse2 .cse3) .cse4 .cse5) (or (< 1 |old(~waterLevel~0)|) (and .cse1 .cse3 .cse6) .cse0 .cse5) (or (< |old(~switchedOnBeforeTS~0)| 1) .cse7 .cse5 (and .cse8 .cse3 .cse6) (< 2 |old(~waterLevel~0)|)) (or (and .cse8 .cse2 .cse3) .cse4 .cse7 .cse5))) [2023-12-15 22:57:46,175 INFO L899 garLoopResultBuilder]: For program point L261(lines 261 265) no Hoare annotation was computed. [2023-12-15 22:57:46,175 INFO L899 garLoopResultBuilder]: For program point L261-2(lines 261 265) no Hoare annotation was computed. [2023-12-15 22:57:46,175 INFO L895 garLoopResultBuilder]: At program point L150(line 150) the Hoare annotation is: (let ((.cse0 (= ~pumpRunning~0 |old(~pumpRunning~0)|)) (.cse1 (<= 1 ~switchedOnBeforeTS~0))) (let ((.cse2 (not (= |old(~waterLevel~0)| 2))) (.cse5 (not (= |old(~pumpRunning~0)| 0))) (.cse6 (< |old(~switchedOnBeforeTS~0)| 1)) (.cse7 (and .cse0 (<= ~waterLevel~0 1) (<= (+ ~waterLevel~0 1) |old(~waterLevel~0)|) .cse1)) (.cse3 (< |old(~pumpRunning~0)| 1)) (.cse4 (= 0 ~systemActive~0))) (and (or (and .cse0 (= ~waterLevel~0 1) .cse1) .cse2 .cse3 .cse4) (or .cse5 .cse2 .cse4) (or (and .cse0 (= |old(~waterLevel~0)| ~waterLevel~0) .cse1) .cse6 .cse7 .cse3 .cse4 (< 2 |old(~waterLevel~0)|)) (or (< 1 |old(~waterLevel~0)|) .cse5 .cse4) (or (not (= |old(~waterLevel~0)| 1)) .cse6 .cse7 .cse3 .cse4)))) [2023-12-15 22:57:46,175 INFO L899 garLoopResultBuilder]: For program point L852(lines 852 858) no Hoare annotation was computed. [2023-12-15 22:57:46,175 INFO L899 garLoopResultBuilder]: For program point timeShiftEXIT(lines 75 101) no Hoare annotation was computed. [2023-12-15 22:57:46,175 INFO L899 garLoopResultBuilder]: For program point timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION(line 54) no Hoare annotation was computed. [2023-12-15 22:57:46,175 INFO L899 garLoopResultBuilder]: For program point L357(lines 357 361) no Hoare annotation was computed. [2023-12-15 22:57:46,176 INFO L899 garLoopResultBuilder]: For program point L357-2(lines 353 364) no Hoare annotation was computed. [2023-12-15 22:57:46,176 INFO L895 garLoopResultBuilder]: At program point L341(lines 292 342) the Hoare annotation is: false [2023-12-15 22:57:46,176 INFO L899 garLoopResultBuilder]: For program point L990(lines 990 997) no Hoare annotation was computed. [2023-12-15 22:57:46,176 INFO L899 garLoopResultBuilder]: For program point L990-2(lines 990 997) no Hoare annotation was computed. [2023-12-15 22:57:46,176 INFO L899 garLoopResultBuilder]: For program point L313(lines 313 319) no Hoare annotation was computed. [2023-12-15 22:57:46,176 INFO L899 garLoopResultBuilder]: For program point L313-1(lines 313 319) no Hoare annotation was computed. [2023-12-15 22:57:46,176 INFO L895 garLoopResultBuilder]: At program point L338(lines 293 340) the Hoare annotation is: (let ((.cse0 (<= 1 ~pumpRunning~0)) (.cse5 (<= ~waterLevel~0 1)) (.cse6 (= ~pumpRunning~0 0)) (.cse1 (= 2 ~waterLevel~0)) (.cse2 (= |ULTIMATE.start_main_~tmp~9#1| 1)) (.cse3 (= |ULTIMATE.start_test_~splverifierCounter~0#1| 0)) (.cse4 (not (= 0 ~systemActive~0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse2 .cse3 (<= 1 ~switchedOnBeforeTS~0) .cse4) (and .cse6 .cse5 .cse2 .cse3 .cse4) (and .cse6 .cse1 .cse2 .cse3 .cse4))) [2023-12-15 22:57:46,176 INFO L895 garLoopResultBuilder]: At program point L305(line 305) the Hoare annotation is: (let ((.cse0 (<= 1 ~pumpRunning~0)) (.cse5 (<= ~waterLevel~0 1)) (.cse6 (= ~pumpRunning~0 0)) (.cse1 (= 2 ~waterLevel~0)) (.cse2 (= |ULTIMATE.start_main_~tmp~9#1| 1)) (.cse3 (= |ULTIMATE.start_test_~splverifierCounter~0#1| 0)) (.cse4 (not (= 0 ~systemActive~0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse2 .cse3 (<= 1 ~switchedOnBeforeTS~0) .cse4) (and .cse6 .cse5 .cse2 .cse3 .cse4) (and .cse6 .cse1 .cse2 .cse3 .cse4))) [2023-12-15 22:57:46,176 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-15 22:57:46,176 INFO L899 garLoopResultBuilder]: For program point L331(lines 331 335) no Hoare annotation was computed. [2023-12-15 22:57:46,176 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-15 22:57:46,176 INFO L895 garLoopResultBuilder]: At program point L331-2(lines 323 336) the Hoare annotation is: (let ((.cse0 (<= 1 ~pumpRunning~0)) (.cse5 (<= ~waterLevel~0 1)) (.cse6 (= ~pumpRunning~0 0)) (.cse1 (= 2 ~waterLevel~0)) (.cse2 (= |ULTIMATE.start_main_~tmp~9#1| 1)) (.cse3 (= |ULTIMATE.start_test_~splverifierCounter~0#1| 0)) (.cse4 (not (= 0 ~systemActive~0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse2 .cse3 (<= 1 ~switchedOnBeforeTS~0) .cse4) (and .cse6 .cse5 .cse2 .cse3 .cse4) (and .cse6 .cse1 .cse2 .cse3 .cse4))) [2023-12-15 22:57:46,176 INFO L899 garLoopResultBuilder]: For program point L294(lines 293 340) no Hoare annotation was computed. [2023-12-15 22:57:46,176 INFO L899 garLoopResultBuilder]: For program point L323(lines 323 336) no Hoare annotation was computed. [2023-12-15 22:57:46,176 INFO L895 garLoopResultBuilder]: At program point L315(line 315) the Hoare annotation is: (let ((.cse0 (<= 1 ~pumpRunning~0)) (.cse5 (<= ~waterLevel~0 1)) (.cse6 (= ~pumpRunning~0 0)) (.cse1 (= 2 ~waterLevel~0)) (.cse2 (= |ULTIMATE.start_main_~tmp~9#1| 1)) (.cse3 (= |ULTIMATE.start_test_~splverifierCounter~0#1| 0)) (.cse4 (not (= 0 ~systemActive~0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse2 .cse3 (<= 1 ~switchedOnBeforeTS~0) .cse4) (and .cse6 .cse5 .cse2 .cse3 .cse4) (and .cse6 .cse1 .cse2 .cse3 .cse4))) [2023-12-15 22:57:46,177 INFO L899 garLoopResultBuilder]: For program point L344(lines 283 348) no Hoare annotation was computed. [2023-12-15 22:57:46,177 INFO L899 garLoopResultBuilder]: For program point L303(lines 303 309) no Hoare annotation was computed. [2023-12-15 22:57:46,177 INFO L899 garLoopResultBuilder]: For program point L303-1(lines 303 309) no Hoare annotation was computed. [2023-12-15 22:57:46,177 INFO L895 garLoopResultBuilder]: At program point L124(line 124) the Hoare annotation is: (let ((.cse0 (= 0 ~systemActive~0))) (and (or (< 2 ~waterLevel~0) (not (= |old(~pumpRunning~0)| 0)) (and (= ~pumpRunning~0 0) (= |processEnvironment__wrappee__highWaterSensor_~tmp~0#1| 0)) .cse0) (or (< 1 ~waterLevel~0) (< ~switchedOnBeforeTS~0 1) (< |old(~pumpRunning~0)| 1) .cse0))) [2023-12-15 22:57:46,177 INFO L899 garLoopResultBuilder]: For program point L118(lines 118 126) no Hoare annotation was computed. [2023-12-15 22:57:46,177 INFO L899 garLoopResultBuilder]: For program point L114(lines 114 131) no Hoare annotation was computed. [2023-12-15 22:57:46,177 INFO L899 garLoopResultBuilder]: For program point L434(lines 434 440) no Hoare annotation was computed. [2023-12-15 22:57:46,177 INFO L899 garLoopResultBuilder]: For program point L242(lines 242 246) no Hoare annotation was computed. [2023-12-15 22:57:46,177 INFO L899 garLoopResultBuilder]: For program point L242-2(lines 242 246) no Hoare annotation was computed. [2023-12-15 22:57:46,177 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 110 134) the Hoare annotation is: (let ((.cse0 (not (= |old(~pumpRunning~0)| 0))) (.cse1 (= ~pumpRunning~0 0)) (.cse3 (< 1 ~waterLevel~0)) (.cse2 (= 0 ~systemActive~0))) (and (or .cse0 .cse1 (not (= 2 ~waterLevel~0)) .cse2) (or .cse0 .cse1 .cse3 .cse2) (or (= ~pumpRunning~0 |old(~pumpRunning~0)|) .cse3 (< ~switchedOnBeforeTS~0 1) (< |old(~pumpRunning~0)| 1) .cse2))) [2023-12-15 22:57:46,177 INFO L899 garLoopResultBuilder]: For program point isHighWaterSensorDry_returnLabel#1(lines 430 443) no Hoare annotation was computed. [2023-12-15 22:57:46,177 INFO L895 garLoopResultBuilder]: At program point L129(line 129) the Hoare annotation is: (let ((.cse0 (not (= |old(~pumpRunning~0)| 0))) (.cse1 (< 1 ~waterLevel~0)) (.cse2 (= 0 ~systemActive~0))) (and (or .cse0 .cse1 .cse2) (or .cse0 (not (= 2 ~waterLevel~0)) .cse2) (or (= ~pumpRunning~0 |old(~pumpRunning~0)|) .cse1 (< ~switchedOnBeforeTS~0 1) (< |old(~pumpRunning~0)| 1) .cse2))) [2023-12-15 22:57:46,177 INFO L899 garLoopResultBuilder]: For program point L129-1(lines 110 134) no Hoare annotation was computed. [2023-12-15 22:57:46,177 INFO L899 garLoopResultBuilder]: For program point processEnvironment__wrappee__highWaterSensorEXIT(lines 110 134) no Hoare annotation was computed. [2023-12-15 22:57:46,177 INFO L899 garLoopResultBuilder]: For program point L369-1(lines 365 376) no Hoare annotation was computed. [2023-12-15 22:57:46,177 INFO L899 garLoopResultBuilder]: For program point waterRiseEXIT(lines 365 376) no Hoare annotation was computed. [2023-12-15 22:57:46,178 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 365 376) the Hoare annotation is: (let ((.cse1 (not (= ~pumpRunning~0 0))) (.cse5 (= 2 ~waterLevel~0)) (.cse6 (not (= |old(~waterLevel~0)| 2))) (.cse0 (< 1 |old(~waterLevel~0)|)) (.cse4 (< ~pumpRunning~0 1)) (.cse2 (= |old(~waterLevel~0)| ~waterLevel~0)) (.cse3 (= 0 ~systemActive~0))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse4 .cse5 .cse6 .cse3) (or .cse1 .cse5 .cse6 .cse3) (or .cse0 .cse4 (< ~switchedOnBeforeTS~0 1) .cse2 .cse3))) [2023-12-15 22:57:46,178 INFO L899 garLoopResultBuilder]: For program point isPumpRunningEXIT(lines 188 196) no Hoare annotation was computed. [2023-12-15 22:57:46,178 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 188 196) the Hoare annotation is: true [2023-12-15 22:57:46,179 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 22:57:46,181 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-15 22:57:46,191 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 10:57:46 BoogieIcfgContainer [2023-12-15 22:57:46,191 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-15 22:57:46,191 INFO L158 Benchmark]: Toolchain (without parser) took 7846.74ms. Allocated memory was 300.9MB in the beginning and 361.8MB in the end (delta: 60.8MB). Free memory was 250.0MB in the beginning and 243.6MB in the end (delta: 6.4MB). Peak memory consumption was 192.6MB. Max. memory is 8.0GB. [2023-12-15 22:57:46,191 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 221.2MB. Free memory is still 173.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 22:57:46,191 INFO L158 Benchmark]: CACSL2BoogieTranslator took 380.74ms. Allocated memory is still 300.9MB. Free memory was 249.7MB in the beginning and 229.7MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2023-12-15 22:57:46,192 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.45ms. Allocated memory is still 300.9MB. Free memory was 229.7MB in the beginning and 227.5MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-15 22:57:46,192 INFO L158 Benchmark]: Boogie Preprocessor took 31.37ms. Allocated memory is still 300.9MB. Free memory was 227.5MB in the beginning and 225.1MB in the end (delta: 2.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-15 22:57:46,192 INFO L158 Benchmark]: RCFGBuilder took 352.59ms. Allocated memory is still 300.9MB. Free memory was 225.1MB in the beginning and 265.9MB in the end (delta: -40.8MB). Peak memory consumption was 21.4MB. Max. memory is 8.0GB. [2023-12-15 22:57:46,193 INFO L158 Benchmark]: TraceAbstraction took 7029.64ms. Allocated memory was 300.9MB in the beginning and 361.8MB in the end (delta: 60.8MB). Free memory was 265.4MB in the beginning and 243.6MB in the end (delta: 21.8MB). Peak memory consumption was 206.9MB. Max. memory is 8.0GB. [2023-12-15 22:57:46,194 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 221.2MB. Free memory is still 173.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 380.74ms. Allocated memory is still 300.9MB. Free memory was 249.7MB in the beginning and 229.7MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 47.45ms. Allocated memory is still 300.9MB. Free memory was 229.7MB in the beginning and 227.5MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.37ms. Allocated memory is still 300.9MB. Free memory was 227.5MB in the beginning and 225.1MB in the end (delta: 2.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 352.59ms. Allocated memory is still 300.9MB. Free memory was 225.1MB in the beginning and 265.9MB in the end (delta: -40.8MB). Peak memory consumption was 21.4MB. Max. memory is 8.0GB. * TraceAbstraction took 7029.64ms. Allocated memory was 300.9MB in the beginning and 361.8MB in the end (delta: 60.8MB). Free memory was 265.4MB in the beginning and 243.6MB in the end (delta: 21.8MB). Peak memory consumption was 206.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 49]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [49] - GenericResultAtLocation [Line: 58]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [58] - GenericResultAtLocation [Line: 279]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [279] - GenericResultAtLocation [Line: 349]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [349] - GenericResultAtLocation [Line: 453]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [453] - GenericResultAtLocation [Line: 819]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification5_spec.i","") [819] - GenericResultAtLocation [Line: 868]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [868] - GenericResultAtLocation [Line: 906]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [906] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 54]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 71 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.0s, OverallIterations: 11, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1531 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1493 mSDsluCounter, 2721 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1921 mSDsCounter, 437 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2710 IncrementalHoareTripleChecker+Invalid, 3147 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 437 mSolverCounterUnsat, 800 mSDtfsCounter, 2710 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 656 GetRequests, 524 SyntacticMatches, 8 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 673 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=504occurred in iteration=10, InterpolantAutomatonStates: 117, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 165 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 21 LocationsWithAnnotation, 705 PreInvPairs, 804 NumberOfFragments, 1001 HoareAnnotationTreeSize, 705 FormulaSimplifications, 3031 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 21 FormulaSimplificationsInter, 6248 FormulaSimplificationTreeSizeReductionInter, 1.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 717 NumberOfCodeBlocks, 717 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 911 ConstructedInterpolants, 0 QuantifiedInterpolants, 1755 SizeOfPredicates, 5 NumberOfNonLiveVariables, 770 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 15 InterpolantComputations, 9 PerfectInterpolantSequences, 483/552 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 293]: Loop Invariant Derived loop invariant: ((((((((1 <= pumpRunning) && (2 == waterLevel)) && (tmp == 1)) && (splverifierCounter == 0)) && !((0 == systemActive))) || ((((((1 <= pumpRunning) && (waterLevel <= 1)) && (tmp == 1)) && (splverifierCounter == 0)) && (1 <= switchedOnBeforeTS)) && !((0 == systemActive)))) || (((((pumpRunning == 0) && (waterLevel <= 1)) && (tmp == 1)) && (splverifierCounter == 0)) && !((0 == systemActive)))) || (((((pumpRunning == 0) && (2 == waterLevel)) && (tmp == 1)) && (splverifierCounter == 0)) && !((0 == systemActive)))) - InvariantResult [Line: 292]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 918]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2023-12-15 22:57:46,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...