/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_product36.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 22:57:27,198 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 22:57:27,283 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:27,289 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 22:57:27,289 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 22:57:27,315 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 22:57:27,316 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 22:57:27,316 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 22:57:27,317 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 22:57:27,320 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 22:57:27,321 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 22:57:27,321 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 22:57:27,321 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 22:57:27,322 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 22:57:27,323 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 22:57:27,323 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 22:57:27,323 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 22:57:27,323 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 22:57:27,323 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 22:57:27,324 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 22:57:27,325 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 22:57:27,325 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 22:57:27,325 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 22:57:27,325 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 22:57:27,326 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 22:57:27,326 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 22:57:27,326 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 22:57:27,326 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 22:57:27,327 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 22:57:27,327 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 22:57:27,328 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 22:57:27,328 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 22:57:27,328 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 22:57:27,328 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 22:57:27,328 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 22:57:27,329 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 22:57:27,329 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 22:57:27,329 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 22:57:27,329 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 22:57:27,329 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 22:57:27,329 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 22:57:27,329 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 22:57:27,330 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 22:57:27,330 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:27,543 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 22:57:27,564 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 22:57:27,569 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 22:57:27,570 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 22:57:27,570 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 22:57:27,571 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/minepump_spec5_product36.cil.c [2023-12-15 22:57:28,796 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 22:57:29,007 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 22:57:29,007 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/minepump_spec5_product36.cil.c [2023-12-15 22:57:29,024 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d28d9d841/9e62fcd2a9d14f5885d3e2c7d67e0f1f/FLAGdad61aa90 [2023-12-15 22:57:29,035 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d28d9d841/9e62fcd2a9d14f5885d3e2c7d67e0f1f [2023-12-15 22:57:29,037 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 22:57:29,038 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 22:57:29,039 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 22:57:29,040 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 22:57:29,044 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 22:57:29,045 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 10:57:29" (1/1) ... [2023-12-15 22:57:29,046 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c5ef5a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:57:29, skipping insertion in model container [2023-12-15 22:57:29,046 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 10:57:29" (1/1) ... [2023-12-15 22:57:29,086 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 22:57:29,234 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_product36.cil.c[2141,2154] [2023-12-15 22:57:29,371 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 22:57:29,389 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 22:57:29,398 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [49] [2023-12-15 22:57:29,399 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [87] [2023-12-15 22:57:29,399 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [96] [2023-12-15 22:57:29,400 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [287] [2023-12-15 22:57:29,400 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [653] [2023-12-15 22:57:29,400 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [725] [2023-12-15 22:57:29,400 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification5_spec.i","") [823] [2023-12-15 22:57:29,401 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [873] [2023-12-15 22:57:29,413 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_product36.cil.c[2141,2154] [2023-12-15 22:57:29,469 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 22:57:29,486 INFO L206 MainTranslator]: Completed translation [2023-12-15 22:57:29,487 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:57:29 WrapperNode [2023-12-15 22:57:29,487 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 22:57:29,488 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 22:57:29,488 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 22:57:29,488 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 22:57:29,494 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:29" (1/1) ... [2023-12-15 22:57:29,506 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:29" (1/1) ... [2023-12-15 22:57:29,531 INFO L138 Inliner]: procedures = 56, calls = 99, calls flagged for inlining = 25, calls inlined = 21, statements flattened = 185 [2023-12-15 22:57:29,531 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 22:57:29,532 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 22:57:29,532 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 22:57:29,532 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 22:57:29,546 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:29" (1/1) ... [2023-12-15 22:57:29,546 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:29" (1/1) ... [2023-12-15 22:57:29,549 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:29" (1/1) ... [2023-12-15 22:57:29,566 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:29,566 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:29" (1/1) ... [2023-12-15 22:57:29,567 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:29" (1/1) ... [2023-12-15 22:57:29,575 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:29" (1/1) ... [2023-12-15 22:57:29,588 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:29" (1/1) ... [2023-12-15 22:57:29,589 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:29" (1/1) ... [2023-12-15 22:57:29,590 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:29" (1/1) ... [2023-12-15 22:57:29,592 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 22:57:29,593 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 22:57:29,593 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 22:57:29,593 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 22:57:29,594 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:57:29" (1/1) ... [2023-12-15 22:57:29,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 22:57:29,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 22:57:29,625 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:29,629 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:29,651 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 22:57:29,652 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2023-12-15 22:57:29,652 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2023-12-15 22:57:29,652 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2023-12-15 22:57:29,652 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2023-12-15 22:57:29,652 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2023-12-15 22:57:29,652 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2023-12-15 22:57:29,652 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2023-12-15 22:57:29,652 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2023-12-15 22:57:29,653 INFO L130 BoogieDeclarations]: Found specification of procedure isPumpRunning [2023-12-15 22:57:29,653 INFO L138 BoogieDeclarations]: Found implementation of procedure isPumpRunning [2023-12-15 22:57:29,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 22:57:29,653 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2023-12-15 22:57:29,653 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2023-12-15 22:57:29,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 22:57:29,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 22:57:29,710 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 22:57:29,712 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 22:57:29,910 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 22:57:29,967 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 22:57:29,967 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-15 22:57:29,967 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 10:57:29 BoogieIcfgContainer [2023-12-15 22:57:29,968 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 22:57:29,970 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 22:57:29,970 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 22:57:29,990 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 22:57:29,990 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 10:57:29" (1/3) ... [2023-12-15 22:57:29,991 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a10b3c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 10:57:29, skipping insertion in model container [2023-12-15 22:57:29,991 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:57:29" (2/3) ... [2023-12-15 22:57:29,991 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a10b3c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 10:57:29, skipping insertion in model container [2023-12-15 22:57:29,991 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 10:57:29" (3/3) ... [2023-12-15 22:57:29,992 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec5_product36.cil.c [2023-12-15 22:57:30,004 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 22:57:30,005 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-15 22:57:30,043 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 22:57:30,051 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;@34d69858, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 22:57:30,051 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-15 22:57:30,055 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 46 states have (on average 1.5434782608695652) internal successors, (71), 52 states have internal predecessors, (71), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-15 22:57:30,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-15 22:57:30,068 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:57:30,069 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:30,070 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:57:30,076 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:57:30,076 INFO L85 PathProgramCache]: Analyzing trace with hash -836173104, now seen corresponding path program 1 times [2023-12-15 22:57:30,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:57:30,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479265472] [2023-12-15 22:57:30,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:57:30,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:57:30,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:57:30,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 22:57:30,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:57:30,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-15 22:57:30,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:57:30,248 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:30,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:57:30,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479265472] [2023-12-15 22:57:30,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479265472] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:57:30,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 22:57:30,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-15 22:57:30,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424694552] [2023-12-15 22:57:30,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:57:30,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-15 22:57:30,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:57:30,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-15 22:57:30,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 22:57:30,288 INFO L87 Difference]: Start difference. First operand has 64 states, 46 states have (on average 1.5434782608695652) internal successors, (71), 52 states have internal predecessors, (71), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) 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:30,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:57:30,352 INFO L93 Difference]: Finished difference Result 126 states and 183 transitions. [2023-12-15 22:57:30,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-15 22:57:30,355 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:30,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:57:30,361 INFO L225 Difference]: With dead ends: 126 [2023-12-15 22:57:30,362 INFO L226 Difference]: Without dead ends: 59 [2023-12-15 22:57:30,364 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:30,367 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 22:57:30,368 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 22:57:30,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-12-15 22:57:30,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2023-12-15 22:57:30,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 43 states have (on average 1.4186046511627908) internal successors, (61), 48 states have internal predecessors, (61), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-15 22:57:30,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 80 transitions. [2023-12-15 22:57:30,402 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 80 transitions. Word has length 22 [2023-12-15 22:57:30,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:57:30,403 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 80 transitions. [2023-12-15 22:57:30,403 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:30,403 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 80 transitions. [2023-12-15 22:57:30,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-15 22:57:30,405 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:57:30,405 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:30,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-15 22:57:30,406 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:57:30,406 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:57:30,406 INFO L85 PathProgramCache]: Analyzing trace with hash -362710974, now seen corresponding path program 1 times [2023-12-15 22:57:30,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:57:30,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959962748] [2023-12-15 22:57:30,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:57:30,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:57:30,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:57:30,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 22:57:30,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:57:30,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-15 22:57:30,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:57:30,509 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:30,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:57:30,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959962748] [2023-12-15 22:57:30,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959962748] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:57:30,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 22:57:30,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 22:57:30,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845935462] [2023-12-15 22:57:30,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:57:30,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 22:57:30,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:57:30,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 22:57:30,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 22:57:30,513 INFO L87 Difference]: Start difference. First operand 59 states and 80 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:30,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:57:30,556 INFO L93 Difference]: Finished difference Result 89 states and 120 transitions. [2023-12-15 22:57:30,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 22:57:30,559 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:30,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:57:30,560 INFO L225 Difference]: With dead ends: 89 [2023-12-15 22:57:30,560 INFO L226 Difference]: Without dead ends: 51 [2023-12-15 22:57:30,561 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:30,562 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 14 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 22:57:30,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 100 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 22:57:30,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-12-15 22:57:30,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2023-12-15 22:57:30,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 38 states have (on average 1.4473684210526316) internal successors, (55), 43 states have internal predecessors, (55), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2023-12-15 22:57:30,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 69 transitions. [2023-12-15 22:57:30,569 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 69 transitions. Word has length 23 [2023-12-15 22:57:30,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:57:30,569 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 69 transitions. [2023-12-15 22:57:30,570 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:30,570 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 69 transitions. [2023-12-15 22:57:30,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-15 22:57:30,571 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:57:30,571 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:30,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-15 22:57:30,571 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:57:30,571 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:57:30,572 INFO L85 PathProgramCache]: Analyzing trace with hash -882055583, now seen corresponding path program 1 times [2023-12-15 22:57:30,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:57:30,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134151445] [2023-12-15 22:57:30,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:57:30,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:57:30,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:57:30,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-15 22:57:30,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:57:30,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-15 22:57:30,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:57:30,655 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:30,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:57:30,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134151445] [2023-12-15 22:57:30,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134151445] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:57:30,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 22:57:30,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 22:57:30,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706879604] [2023-12-15 22:57:30,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:57:30,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 22:57:30,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:57:30,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 22:57:30,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 22:57:30,658 INFO L87 Difference]: Start difference. First operand 51 states and 69 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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:30,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:57:30,719 INFO L93 Difference]: Finished difference Result 149 states and 204 transitions. [2023-12-15 22:57:30,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 22:57:30,719 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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:30,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:57:30,721 INFO L225 Difference]: With dead ends: 149 [2023-12-15 22:57:30,721 INFO L226 Difference]: Without dead ends: 100 [2023-12-15 22:57:30,721 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:30,723 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 60 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 22:57:30,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 122 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 22:57:30,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-12-15 22:57:30,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 96. [2023-12-15 22:57:30,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 71 states have (on average 1.4507042253521127) internal successors, (103), 80 states have internal predecessors, (103), 14 states have call successors, (14), 10 states have call predecessors, (14), 10 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-15 22:57:30,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 131 transitions. [2023-12-15 22:57:30,739 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 131 transitions. Word has length 26 [2023-12-15 22:57:30,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:57:30,740 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 131 transitions. [2023-12-15 22:57:30,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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:30,740 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 131 transitions. [2023-12-15 22:57:30,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-15 22:57:30,741 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:57:30,742 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] [2023-12-15 22:57:30,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-15 22:57:30,742 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:57:30,742 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:57:30,742 INFO L85 PathProgramCache]: Analyzing trace with hash -2094500100, now seen corresponding path program 1 times [2023-12-15 22:57:30,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:57:30,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231061601] [2023-12-15 22:57:30,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:57:30,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:57:30,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:57:30,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 22:57:30,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:57:30,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-12-15 22:57:30,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:57:30,820 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:30,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:57:30,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231061601] [2023-12-15 22:57:30,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231061601] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:57:30,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 22:57:30,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 22:57:30,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407112667] [2023-12-15 22:57:30,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:57:30,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 22:57:30,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:57:30,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 22:57:30,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 22:57:30,823 INFO L87 Difference]: Start difference. First operand 96 states and 131 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-15 22:57:30,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:57:30,901 INFO L93 Difference]: Finished difference Result 265 states and 366 transitions. [2023-12-15 22:57:30,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 22:57:30,902 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2023-12-15 22:57:30,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:57:30,907 INFO L225 Difference]: With dead ends: 265 [2023-12-15 22:57:30,908 INFO L226 Difference]: Without dead ends: 171 [2023-12-15 22:57:30,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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:30,912 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 51 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 22:57:30,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 106 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 22:57:30,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2023-12-15 22:57:30,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 169. [2023-12-15 22:57:30,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 124 states have (on average 1.4112903225806452) internal successors, (175), 135 states have internal predecessors, (175), 24 states have call successors, (24), 20 states have call predecessors, (24), 20 states have return successors, (28), 24 states have call predecessors, (28), 24 states have call successors, (28) [2023-12-15 22:57:30,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 227 transitions. [2023-12-15 22:57:30,934 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 227 transitions. Word has length 29 [2023-12-15 22:57:30,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:57:30,934 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 227 transitions. [2023-12-15 22:57:30,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-15 22:57:30,934 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 227 transitions. [2023-12-15 22:57:30,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-15 22:57:30,935 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:57:30,936 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] [2023-12-15 22:57:30,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-15 22:57:30,936 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:57:30,936 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:57:30,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1183956022, now seen corresponding path program 1 times [2023-12-15 22:57:30,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:57:30,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987011377] [2023-12-15 22:57:30,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:57:30,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:57:30,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:57:31,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 22:57:31,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:57:31,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-12-15 22:57:31,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:57:31,069 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:31,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:57:31,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987011377] [2023-12-15 22:57:31,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987011377] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:57:31,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 22:57:31,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 22:57:31,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210887365] [2023-12-15 22:57:31,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:57:31,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 22:57:31,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:57:31,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 22:57:31,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-15 22:57:31,074 INFO L87 Difference]: Start difference. First operand 169 states and 227 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-15 22:57:31,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:57:31,208 INFO L93 Difference]: Finished difference Result 338 states and 456 transitions. [2023-12-15 22:57:31,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-15 22:57:31,209 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2023-12-15 22:57:31,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:57:31,211 INFO L225 Difference]: With dead ends: 338 [2023-12-15 22:57:31,211 INFO L226 Difference]: Without dead ends: 171 [2023-12-15 22:57:31,213 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-12-15 22:57:31,218 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 50 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 22:57:31,219 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 245 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 22:57:31,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2023-12-15 22:57:31,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 167. [2023-12-15 22:57:31,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 122 states have (on average 1.3852459016393444) internal successors, (169), 133 states have internal predecessors, (169), 24 states have call successors, (24), 20 states have call predecessors, (24), 20 states have return successors, (28), 24 states have call predecessors, (28), 24 states have call successors, (28) [2023-12-15 22:57:31,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 221 transitions. [2023-12-15 22:57:31,246 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 221 transitions. Word has length 29 [2023-12-15 22:57:31,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:57:31,246 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 221 transitions. [2023-12-15 22:57:31,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-15 22:57:31,246 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 221 transitions. [2023-12-15 22:57:31,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-15 22:57:31,248 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:57:31,248 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] [2023-12-15 22:57:31,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-15 22:57:31,248 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:57:31,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:57:31,249 INFO L85 PathProgramCache]: Analyzing trace with hash 507125290, now seen corresponding path program 1 times [2023-12-15 22:57:31,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:57:31,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248179898] [2023-12-15 22:57:31,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:57:31,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:57:31,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:57:31,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-15 22:57:31,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:57:31,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 22:57:31,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:57:31,343 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:31,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:57:31,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248179898] [2023-12-15 22:57:31,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248179898] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:57:31,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 22:57:31,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 22:57:31,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347318347] [2023-12-15 22:57:31,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:57:31,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 22:57:31,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:57:31,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 22:57:31,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-15 22:57:31,346 INFO L87 Difference]: Start difference. First operand 167 states and 221 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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:31,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:57:31,390 INFO L93 Difference]: Finished difference Result 336 states and 450 transitions. [2023-12-15 22:57:31,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-15 22:57:31,391 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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 33 [2023-12-15 22:57:31,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:57:31,394 INFO L225 Difference]: With dead ends: 336 [2023-12-15 22:57:31,394 INFO L226 Difference]: Without dead ends: 171 [2023-12-15 22:57:31,395 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-15 22:57:31,398 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 1 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 22:57:31,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 164 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 22:57:31,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2023-12-15 22:57:31,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2023-12-15 22:57:31,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 126 states have (on average 1.373015873015873) internal successors, (173), 137 states have internal predecessors, (173), 24 states have call successors, (24), 20 states have call predecessors, (24), 20 states have return successors, (28), 24 states have call predecessors, (28), 24 states have call successors, (28) [2023-12-15 22:57:31,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 225 transitions. [2023-12-15 22:57:31,433 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 225 transitions. Word has length 33 [2023-12-15 22:57:31,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:57:31,434 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 225 transitions. [2023-12-15 22:57:31,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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:31,434 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 225 transitions. [2023-12-15 22:57:31,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-15 22:57:31,439 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:57:31,440 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] [2023-12-15 22:57:31,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-15 22:57:31,440 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:57:31,440 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:57:31,440 INFO L85 PathProgramCache]: Analyzing trace with hash -79680724, now seen corresponding path program 1 times [2023-12-15 22:57:31,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:57:31,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289539741] [2023-12-15 22:57:31,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:57:31,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:57:31,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:57:31,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-15 22:57:31,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:57:31,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 22:57:31,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:57:31,546 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:31,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:57:31,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289539741] [2023-12-15 22:57:31,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289539741] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:57:31,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 22:57:31,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 22:57:31,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184584208] [2023-12-15 22:57:31,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:57:31,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 22:57:31,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:57:31,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 22:57:31,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-15 22:57:31,548 INFO L87 Difference]: Start difference. First operand 171 states and 225 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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:31,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:57:31,606 INFO L93 Difference]: Finished difference Result 366 states and 492 transitions. [2023-12-15 22:57:31,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-15 22:57:31,606 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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 33 [2023-12-15 22:57:31,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:57:31,611 INFO L225 Difference]: With dead ends: 366 [2023-12-15 22:57:31,612 INFO L226 Difference]: Without dead ends: 197 [2023-12-15 22:57:31,612 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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:31,615 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 12 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 22:57:31,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 181 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 22:57:31,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2023-12-15 22:57:31,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 175. [2023-12-15 22:57:31,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 130 states have (on average 1.3615384615384616) internal successors, (177), 141 states have internal predecessors, (177), 24 states have call successors, (24), 20 states have call predecessors, (24), 20 states have return successors, (28), 24 states have call predecessors, (28), 24 states have call successors, (28) [2023-12-15 22:57:31,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 229 transitions. [2023-12-15 22:57:31,636 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 229 transitions. Word has length 33 [2023-12-15 22:57:31,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:57:31,636 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 229 transitions. [2023-12-15 22:57:31,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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:31,637 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 229 transitions. [2023-12-15 22:57:31,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-15 22:57:31,640 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:57:31,641 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] [2023-12-15 22:57:31,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-15 22:57:31,641 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:57:31,642 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:57:31,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1359544402, now seen corresponding path program 1 times [2023-12-15 22:57:31,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:57:31,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267432062] [2023-12-15 22:57:31,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:57:31,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:57:31,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:57:31,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-15 22:57:31,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:57:31,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 22:57:31,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:57:31,703 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:31,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:57:31,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267432062] [2023-12-15 22:57:31,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267432062] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:57:31,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 22:57:31,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 22:57:31,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767130236] [2023-12-15 22:57:31,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:57:31,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 22:57:31,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:57:31,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 22:57:31,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 22:57:31,706 INFO L87 Difference]: Start difference. First operand 175 states and 229 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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:31,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:57:31,761 INFO L93 Difference]: Finished difference Result 501 states and 683 transitions. [2023-12-15 22:57:31,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 22:57:31,765 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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 33 [2023-12-15 22:57:31,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:57:31,768 INFO L225 Difference]: With dead ends: 501 [2023-12-15 22:57:31,768 INFO L226 Difference]: Without dead ends: 328 [2023-12-15 22:57:31,769 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:31,770 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 45 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 22:57:31,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 118 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 22:57:31,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2023-12-15 22:57:31,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 326. [2023-12-15 22:57:31,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 241 states have (on average 1.3485477178423237) internal successors, (325), 256 states have internal predecessors, (325), 48 states have call successors, (48), 40 states have call predecessors, (48), 36 states have return successors, (60), 44 states have call predecessors, (60), 48 states have call successors, (60) [2023-12-15 22:57:31,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 433 transitions. [2023-12-15 22:57:31,793 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 433 transitions. Word has length 33 [2023-12-15 22:57:31,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:57:31,794 INFO L495 AbstractCegarLoop]: Abstraction has 326 states and 433 transitions. [2023-12-15 22:57:31,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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:31,794 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 433 transitions. [2023-12-15 22:57:31,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-15 22:57:31,795 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:57:31,795 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] [2023-12-15 22:57:31,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-15 22:57:31,796 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:57:31,796 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:57:31,796 INFO L85 PathProgramCache]: Analyzing trace with hash -314299640, now seen corresponding path program 1 times [2023-12-15 22:57:31,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:57:31,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373380806] [2023-12-15 22:57:31,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:57:31,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:57:31,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:57:31,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-15 22:57:31,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:57:31,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-15 22:57:31,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:57:31,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-15 22:57:31,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:57:31,940 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:31,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:57:31,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373380806] [2023-12-15 22:57:31,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373380806] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:57:31,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 22:57:31,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 22:57:31,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272592740] [2023-12-15 22:57:31,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:57:31,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 22:57:31,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:57:31,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 22:57:31,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-15 22:57:31,942 INFO L87 Difference]: Start difference. First operand 326 states and 433 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-15 22:57:32,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:57:32,157 INFO L93 Difference]: Finished difference Result 862 states and 1185 transitions. [2023-12-15 22:57:32,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-15 22:57:32,158 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 37 [2023-12-15 22:57:32,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:57:32,161 INFO L225 Difference]: With dead ends: 862 [2023-12-15 22:57:32,161 INFO L226 Difference]: Without dead ends: 538 [2023-12-15 22:57:32,163 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2023-12-15 22:57:32,164 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 142 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 22:57:32,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 239 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 22:57:32,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2023-12-15 22:57:32,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 525. [2023-12-15 22:57:32,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 393 states have (on average 1.3104325699745547) internal successors, (515), 421 states have internal predecessors, (515), 72 states have call successors, (72), 55 states have call predecessors, (72), 59 states have return successors, (113), 68 states have call predecessors, (113), 72 states have call successors, (113) [2023-12-15 22:57:32,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 700 transitions. [2023-12-15 22:57:32,211 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 700 transitions. Word has length 37 [2023-12-15 22:57:32,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:57:32,211 INFO L495 AbstractCegarLoop]: Abstraction has 525 states and 700 transitions. [2023-12-15 22:57:32,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-15 22:57:32,211 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 700 transitions. [2023-12-15 22:57:32,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-15 22:57:32,213 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:57:32,213 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2023-12-15 22:57:32,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-15 22:57:32,213 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:57:32,214 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:57:32,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1321238074, now seen corresponding path program 1 times [2023-12-15 22:57:32,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:57:32,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267368667] [2023-12-15 22:57:32,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:57:32,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:57:32,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:57:32,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-15 22:57:32,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:57:32,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-15 22:57:32,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:57:32,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:57:32,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:57:32,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-12-15 22:57:32,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:57:32,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-12-15 22:57:32,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:57:32,275 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-15 22:57:32,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:57:32,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267368667] [2023-12-15 22:57:32,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267368667] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:57:32,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 22:57:32,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 22:57:32,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009343073] [2023-12-15 22:57:32,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:57:32,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 22:57:32,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:57:32,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 22:57:32,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-15 22:57:32,277 INFO L87 Difference]: Start difference. First operand 525 states and 700 transitions. Second operand has 6 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2023-12-15 22:57:32,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:57:32,483 INFO L93 Difference]: Finished difference Result 882 states and 1169 transitions. [2023-12-15 22:57:32,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-15 22:57:32,484 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 62 [2023-12-15 22:57:32,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:57:32,486 INFO L225 Difference]: With dead ends: 882 [2023-12-15 22:57:32,486 INFO L226 Difference]: Without dead ends: 359 [2023-12-15 22:57:32,487 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-12-15 22:57:32,488 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 136 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 22:57:32,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 222 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 22:57:32,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2023-12-15 22:57:32,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 351. [2023-12-15 22:57:32,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 261 states have (on average 1.2911877394636015) internal successors, (337), 280 states have internal predecessors, (337), 49 states have call successors, (49), 39 states have call predecessors, (49), 40 states have return successors, (69), 46 states have call predecessors, (69), 49 states have call successors, (69) [2023-12-15 22:57:32,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 455 transitions. [2023-12-15 22:57:32,538 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 455 transitions. Word has length 62 [2023-12-15 22:57:32,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:57:32,538 INFO L495 AbstractCegarLoop]: Abstraction has 351 states and 455 transitions. [2023-12-15 22:57:32,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2023-12-15 22:57:32,538 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 455 transitions. [2023-12-15 22:57:32,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-12-15 22:57:32,539 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:57:32,539 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2023-12-15 22:57:32,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-15 22:57:32,540 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:57:32,540 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:57:32,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1715900409, now seen corresponding path program 1 times [2023-12-15 22:57:32,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:57:32,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441345815] [2023-12-15 22:57:32,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:57:32,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:57:32,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:57:32,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-15 22:57:32,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:57:32,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 22:57:32,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:57:32,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:57:32,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:57:32,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 22:57:32,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:57:32,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 22:57:32,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:57:32,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 22:57:32,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:57:32,686 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-15 22:57:32,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:57:32,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441345815] [2023-12-15 22:57:32,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441345815] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 22:57:32,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1008303212] [2023-12-15 22:57:32,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:57:32,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 22:57:32,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 22:57:32,689 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:32,696 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:32,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:57:32,780 INFO L262 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-15 22:57:32,786 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 22:57:32,925 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 22:57:32,925 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 22:57:33,090 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-15 22:57:33,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1008303212] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 22:57:33,090 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 22:57:33,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 6] total 14 [2023-12-15 22:57:33,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974624641] [2023-12-15 22:57:33,091 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 22:57:33,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-15 22:57:33,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:57:33,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-15 22:57:33,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2023-12-15 22:57:33,093 INFO L87 Difference]: Start difference. First operand 351 states and 455 transitions. Second operand has 14 states, 10 states have (on average 7.6) internal successors, (76), 10 states have internal predecessors, (76), 6 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (13), 7 states have call predecessors, (13), 6 states have call successors, (13) [2023-12-15 22:57:33,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:57:33,704 INFO L93 Difference]: Finished difference Result 734 states and 969 transitions. [2023-12-15 22:57:33,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-12-15 22:57:33,704 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 10 states have (on average 7.6) internal successors, (76), 10 states have internal predecessors, (76), 6 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (13), 7 states have call predecessors, (13), 6 states have call successors, (13) Word has length 63 [2023-12-15 22:57:33,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:57:33,705 INFO L225 Difference]: With dead ends: 734 [2023-12-15 22:57:33,705 INFO L226 Difference]: Without dead ends: 0 [2023-12-15 22:57:33,707 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 137 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=256, Invalid=934, Unknown=0, NotChecked=0, Total=1190 [2023-12-15 22:57:33,708 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 253 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-15 22:57:33,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 467 Invalid, 611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-15 22:57:33,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-15 22:57:33,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-15 22:57:33,709 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:33,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-15 22:57:33,709 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 63 [2023-12-15 22:57:33,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:57:33,709 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-15 22:57:33,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 10 states have (on average 7.6) internal successors, (76), 10 states have internal predecessors, (76), 6 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (13), 7 states have call predecessors, (13), 6 states have call successors, (13) [2023-12-15 22:57:33,710 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-15 22:57:33,710 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-15 22:57:33,712 INFO L805 garLoopResultBuilder]: Registering result SAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-15 22:57:33,718 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:33,918 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,SelfDestructingSolverStorable10 [2023-12-15 22:57:33,919 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-15 22:57:35,310 INFO L899 garLoopResultBuilder]: For program point processEnvironment__wrappee__baseEXIT(lines 140 146) no Hoare annotation was computed. [2023-12-15 22:57:35,310 INFO L902 garLoopResultBuilder]: At program point processEnvironment__wrappee__baseFINAL(lines 140 146) the Hoare annotation is: true [2023-12-15 22:57:35,310 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 900 911) the Hoare annotation is: true [2023-12-15 22:57:35,310 INFO L899 garLoopResultBuilder]: For program point L904-1(lines 900 911) no Hoare annotation was computed. [2023-12-15 22:57:35,310 INFO L899 garLoopResultBuilder]: For program point changeMethaneLevelEXIT(lines 900 911) no Hoare annotation was computed. [2023-12-15 22:57:35,310 INFO L899 garLoopResultBuilder]: For program point cleanupEXIT(lines 727 756) no Hoare annotation was computed. [2023-12-15 22:57:35,311 INFO L902 garLoopResultBuilder]: At program point L737-2(lines 737 751) the Hoare annotation is: true [2023-12-15 22:57:35,311 INFO L902 garLoopResultBuilder]: At program point L733(line 733) the Hoare annotation is: true [2023-12-15 22:57:35,311 INFO L899 garLoopResultBuilder]: For program point L733-1(line 733) no Hoare annotation was computed. [2023-12-15 22:57:35,311 INFO L899 garLoopResultBuilder]: For program point L752(lines 727 756) no Hoare annotation was computed. [2023-12-15 22:57:35,311 INFO L899 garLoopResultBuilder]: For program point L748(line 748) no Hoare annotation was computed. [2023-12-15 22:57:35,311 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 727 756) the Hoare annotation is: true [2023-12-15 22:57:35,311 INFO L899 garLoopResultBuilder]: For program point L741(lines 741 745) no Hoare annotation was computed. [2023-12-15 22:57:35,311 INFO L902 garLoopResultBuilder]: At program point L741-1(lines 741 745) the Hoare annotation is: true [2023-12-15 22:57:35,311 INFO L899 garLoopResultBuilder]: For program point L254(lines 254 258) no Hoare annotation was computed. [2023-12-15 22:57:35,311 INFO L899 garLoopResultBuilder]: For program point L254-2(lines 254 258) no Hoare annotation was computed. [2023-12-15 22:57:35,311 INFO L899 garLoopResultBuilder]: For program point L857(lines 857 863) no Hoare annotation was computed. [2023-12-15 22:57:35,311 INFO L899 garLoopResultBuilder]: For program point isHighWaterSensorDry_returnLabel#1(lines 953 966) no Hoare annotation was computed. [2023-12-15 22:57:35,312 INFO L899 garLoopResultBuilder]: For program point L127-1(lines 127 133) no Hoare annotation was computed. [2023-12-15 22:57:35,312 INFO L899 garLoopResultBuilder]: For program point L957(lines 957 963) no Hoare annotation was computed. [2023-12-15 22:57:35,312 INFO L899 garLoopResultBuilder]: For program point L156(lines 156 164) no Hoare annotation was computed. [2023-12-15 22:57:35,312 INFO L899 garLoopResultBuilder]: For program point L152(lines 152 169) no Hoare annotation was computed. [2023-12-15 22:57:35,312 INFO L895 garLoopResultBuilder]: At program point L854(line 854) the Hoare annotation is: (let ((.cse2 (<= ~waterLevel~0 1)) (.cse0 (< |old(~switchedOnBeforeTS~0)| 1)) (.cse9 (not (= |old(~waterLevel~0)| 2))) (.cse3 (< |old(~pumpRunning~0)| 1)) (.cse8 (and (<= 1 ~pumpRunning~0) (<= ~waterLevel~0 2) (<= 1 ~switchedOnBeforeTS~0))) (.cse6 (not (= |old(~pumpRunning~0)| 0))) (.cse4 (= ~pumpRunning~0 0)) (.cse5 (= |old(~waterLevel~0)| ~waterLevel~0)) (.cse1 (not (= 1 ~systemActive~0))) (.cse7 (< 2 |old(~waterLevel~0)|))) (and (or (< 1 |old(~waterLevel~0)|) .cse0 .cse1 .cse2 .cse3) (or (and .cse4 .cse2 .cse5) .cse6 .cse7 (not (= 0 ~systemActive~0))) (or .cse0 .cse1 .cse3 .cse8 .cse7) (or .cse6 .cse1 .cse9) (or .cse1 .cse9 .cse3 .cse8) (or .cse6 (and .cse4 .cse5) .cse1 .cse7))) [2023-12-15 22:57:35,312 INFO L899 garLoopResultBuilder]: For program point L854-1(line 854) no Hoare annotation was computed. [2023-12-15 22:57:35,312 INFO L899 garLoopResultBuilder]: For program point L120(lines 120 126) no Hoare annotation was computed. [2023-12-15 22:57:35,313 INFO L899 garLoopResultBuilder]: For program point L120-2(lines 116 138) no Hoare annotation was computed. [2023-12-15 22:57:35,313 INFO L899 garLoopResultBuilder]: For program point L880(lines 880 884) no Hoare annotation was computed. [2023-12-15 22:57:35,313 INFO L899 garLoopResultBuilder]: For program point L880-2(lines 876 887) no Hoare annotation was computed. [2023-12-15 22:57:35,313 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 113 139) the Hoare annotation is: (let ((.cse3 (= ~switchedOnBeforeTS~0 |old(~switchedOnBeforeTS~0)|)) (.cse4 (= |old(~waterLevel~0)| ~waterLevel~0))) (let ((.cse0 (not (= 1 ~systemActive~0))) (.cse2 (= ~pumpRunning~0 |old(~pumpRunning~0)|)) (.cse1 (< |old(~pumpRunning~0)| 1)) (.cse5 (and (= ~pumpRunning~0 0) .cse3 .cse4)) (.cse6 (not (= |old(~pumpRunning~0)| 0))) (.cse7 (< 2 |old(~waterLevel~0)|))) (and (or (< 1 |old(~waterLevel~0)|) (< |old(~switchedOnBeforeTS~0)| 1) .cse0 .cse1 (and .cse2 .cse3 .cse4)) (or .cse5 .cse6 .cse0 .cse7) (or .cse0 (and .cse2 (= 2 ~waterLevel~0) .cse3) (not (= |old(~waterLevel~0)| 2)) .cse1) (or .cse5 .cse6 .cse7 (not (= 0 ~systemActive~0)))))) [2023-12-15 22:57:35,313 INFO L895 garLoopResultBuilder]: At program point L839(line 839) the Hoare annotation is: (let ((.cse3 (= ~switchedOnBeforeTS~0 |old(~switchedOnBeforeTS~0)|)) (.cse4 (= |old(~waterLevel~0)| ~waterLevel~0))) (let ((.cse0 (not (= 1 ~systemActive~0))) (.cse2 (= ~pumpRunning~0 |old(~pumpRunning~0)|)) (.cse1 (< |old(~pumpRunning~0)| 1)) (.cse5 (and (= ~pumpRunning~0 0) .cse3 .cse4)) (.cse6 (not (= |old(~pumpRunning~0)| 0))) (.cse7 (< 2 |old(~waterLevel~0)|))) (and (or (< 1 |old(~waterLevel~0)|) (< |old(~switchedOnBeforeTS~0)| 1) .cse0 .cse1 (and .cse2 .cse3 .cse4)) (or .cse5 .cse6 .cse0 .cse7) (or .cse0 (and .cse2 (= 2 ~waterLevel~0) .cse3) (not (= |old(~waterLevel~0)| 2)) .cse1) (or .cse5 .cse6 .cse7 (not (= 0 ~systemActive~0)))))) [2023-12-15 22:57:35,313 INFO L899 garLoopResultBuilder]: For program point L839-1(line 839) no Hoare annotation was computed. [2023-12-15 22:57:35,314 INFO L895 garLoopResultBuilder]: At program point L162(line 162) the Hoare annotation is: (let ((.cse1 (not (= 1 ~systemActive~0))) (.cse3 (< |old(~pumpRunning~0)| 1)) (.cse0 (not (= |old(~pumpRunning~0)| 0))) (.cse2 (< 2 |old(~waterLevel~0)|))) (and (or .cse0 .cse1 .cse2 (and (= |timeShift_processEnvironment_~tmp~0#1| 0) (= ~pumpRunning~0 0) (= |old(~waterLevel~0)| ~waterLevel~0))) (or .cse1 (not (= |old(~waterLevel~0)| 2)) .cse3) (or (< |old(~switchedOnBeforeTS~0)| 1) .cse1 .cse3 .cse2) (or .cse0 .cse2 (not (= 0 ~systemActive~0))))) [2023-12-15 22:57:35,314 INFO L899 garLoopResultBuilder]: For program point L92(line 92) no Hoare annotation was computed. [2023-12-15 22:57:35,314 INFO L899 garLoopResultBuilder]: For program point L856(lines 856 866) no Hoare annotation was computed. [2023-12-15 22:57:35,314 INFO L899 garLoopResultBuilder]: For program point L852(lines 852 869) no Hoare annotation was computed. [2023-12-15 22:57:35,314 INFO L899 garLoopResultBuilder]: For program point L852-1(lines 844 872) no Hoare annotation was computed. [2023-12-15 22:57:35,314 INFO L899 garLoopResultBuilder]: For program point timeShiftEXIT(lines 113 139) no Hoare annotation was computed. [2023-12-15 22:57:35,314 INFO L899 garLoopResultBuilder]: For program point timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION(line 92) no Hoare annotation was computed. [2023-12-15 22:57:35,315 INFO L895 garLoopResultBuilder]: At program point L167(line 167) the Hoare annotation is: (let ((.cse0 (< |old(~switchedOnBeforeTS~0)| 1)) (.cse1 (not (= 1 ~systemActive~0))) (.cse2 (< |old(~pumpRunning~0)| 1)) (.cse3 (and (<= 1 ~pumpRunning~0) (<= ~waterLevel~0 2) (<= 1 ~switchedOnBeforeTS~0))) (.cse5 (not (= |old(~pumpRunning~0)| 0))) (.cse4 (< 2 |old(~waterLevel~0)|))) (and (or (< 1 |old(~waterLevel~0)|) .cse0 .cse1 (<= ~waterLevel~0 1) .cse2) (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse5 .cse1 .cse4) (or .cse1 (not (= |old(~waterLevel~0)| 2)) .cse2 .cse3) (or .cse5 .cse4 (not (= 0 ~systemActive~0))))) [2023-12-15 22:57:35,315 INFO L899 garLoopResultBuilder]: For program point L167-1(lines 148 172) no Hoare annotation was computed. [2023-12-15 22:57:35,315 INFO L895 garLoopResultBuilder]: At program point L717(lines 666 718) the Hoare annotation is: false [2023-12-15 22:57:35,315 INFO L899 garLoopResultBuilder]: For program point L705(lines 705 711) no Hoare annotation was computed. [2023-12-15 22:57:35,315 INFO L895 garLoopResultBuilder]: At program point L705-2(lines 697 712) the Hoare annotation is: (let ((.cse0 (= ~pumpRunning~0 0)) (.cse4 (<= 1 ~pumpRunning~0)) (.cse3 (= 1 ~systemActive~0)) (.cse1 (= |ULTIMATE.start_test_~splverifierCounter~0#1| 0)) (.cse2 (<= ~waterLevel~0 2))) (or (and .cse0 .cse1 .cse2 (= 0 ~systemActive~0)) (and .cse0 .cse3 .cse1 .cse2) (and .cse4 (= 2 ~waterLevel~0) .cse3 .cse1) (and .cse4 .cse3 .cse1 .cse2 (<= 1 ~switchedOnBeforeTS~0)))) [2023-12-15 22:57:35,315 INFO L899 garLoopResultBuilder]: For program point L668(lines 667 716) no Hoare annotation was computed. [2023-12-15 22:57:35,315 INFO L899 garLoopResultBuilder]: For program point L697(lines 697 712) no Hoare annotation was computed. [2023-12-15 22:57:35,315 INFO L895 garLoopResultBuilder]: At program point L689(line 689) the Hoare annotation is: (let ((.cse0 (= ~pumpRunning~0 0)) (.cse4 (<= 1 ~pumpRunning~0)) (.cse3 (= 1 ~systemActive~0)) (.cse1 (= |ULTIMATE.start_test_~splverifierCounter~0#1| 0)) (.cse2 (<= ~waterLevel~0 2))) (or (and .cse0 .cse1 .cse2 (= 0 ~systemActive~0)) (and .cse0 .cse3 .cse1 .cse2) (and .cse4 (= 2 ~waterLevel~0) .cse3 .cse1) (and .cse4 .cse3 .cse1 .cse2 (<= 1 ~switchedOnBeforeTS~0)))) [2023-12-15 22:57:35,315 INFO L899 garLoopResultBuilder]: For program point L268(lines 268 274) no Hoare annotation was computed. [2023-12-15 22:57:35,316 INFO L899 garLoopResultBuilder]: For program point L268-2(lines 268 274) no Hoare annotation was computed. [2023-12-15 22:57:35,316 INFO L895 garLoopResultBuilder]: At program point L714(lines 667 716) the Hoare annotation is: (let ((.cse3 (= 2 ~waterLevel~0)) (.cse5 (<= 1 ~pumpRunning~0)) (.cse2 (<= ~waterLevel~0 2)) (.cse0 (= ~pumpRunning~0 0)) (.cse4 (= 1 ~systemActive~0)) (.cse1 (= |ULTIMATE.start_test_~splverifierCounter~0#1| 0))) (or (and .cse0 .cse1 .cse2 (= 0 ~systemActive~0)) (and .cse0 .cse3 .cse4 .cse1) (and .cse5 .cse3 .cse4 .cse1) (and .cse5 .cse4 .cse1 .cse2 (<= 1 ~switchedOnBeforeTS~0)) (and .cse0 (<= ~waterLevel~0 1) .cse4 .cse1))) [2023-12-15 22:57:35,316 INFO L899 garLoopResultBuilder]: For program point L677(lines 677 683) no Hoare annotation was computed. [2023-12-15 22:57:35,316 INFO L899 garLoopResultBuilder]: For program point L677-1(lines 677 683) no Hoare annotation was computed. [2023-12-15 22:57:35,316 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-15 22:57:35,316 INFO L899 garLoopResultBuilder]: For program point L810(lines 810 817) no Hoare annotation was computed. [2023-12-15 22:57:35,316 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-15 22:57:35,316 INFO L899 garLoopResultBuilder]: For program point L810-2(lines 810 817) no Hoare annotation was computed. [2023-12-15 22:57:35,316 INFO L899 garLoopResultBuilder]: For program point L720(lines 657 724) no Hoare annotation was computed. [2023-12-15 22:57:35,316 INFO L899 garLoopResultBuilder]: For program point L687(lines 687 693) no Hoare annotation was computed. [2023-12-15 22:57:35,317 INFO L899 garLoopResultBuilder]: For program point L687-1(lines 687 693) no Hoare annotation was computed. [2023-12-15 22:57:35,317 INFO L895 garLoopResultBuilder]: At program point L679(line 679) the Hoare annotation is: (let ((.cse3 (= 2 ~waterLevel~0)) (.cse5 (<= 1 ~pumpRunning~0)) (.cse2 (<= ~waterLevel~0 2)) (.cse0 (= ~pumpRunning~0 0)) (.cse4 (= 1 ~systemActive~0)) (.cse1 (= |ULTIMATE.start_test_~splverifierCounter~0#1| 0))) (or (and .cse0 .cse1 .cse2 (= 0 ~systemActive~0)) (and .cse0 .cse3 .cse4 .cse1) (and .cse5 .cse3 .cse4 .cse1) (and .cse5 .cse4 .cse1 .cse2 (<= 1 ~switchedOnBeforeTS~0)) (and .cse0 (<= ~waterLevel~0 1) .cse4 .cse1))) [2023-12-15 22:57:35,317 INFO L899 garLoopResultBuilder]: For program point waterRiseEXIT(lines 888 899) no Hoare annotation was computed. [2023-12-15 22:57:35,317 INFO L899 garLoopResultBuilder]: For program point L892-1(lines 888 899) no Hoare annotation was computed. [2023-12-15 22:57:35,317 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 888 899) the Hoare annotation is: (let ((.cse0 (< ~pumpRunning~0 1)) (.cse1 (not (= 1 ~systemActive~0))) (.cse2 (not (= ~pumpRunning~0 0))) (.cse3 (= |old(~waterLevel~0)| ~waterLevel~0)) (.cse4 (< 2 |old(~waterLevel~0)|))) (and (or .cse0 (= 2 ~waterLevel~0) .cse1 (not (= |old(~waterLevel~0)| 2))) (or .cse2 .cse1 .cse3 .cse4) (or (< 1 |old(~waterLevel~0)|) .cse0 .cse1 (< ~switchedOnBeforeTS~0 1) .cse3) (or .cse2 .cse3 .cse4 (not (= 0 ~systemActive~0))))) [2023-12-15 22:57:35,317 INFO L899 garLoopResultBuilder]: For program point isPumpRunningEXIT(lines 200 208) no Hoare annotation was computed. [2023-12-15 22:57:35,317 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 200 208) the Hoare annotation is: true [2023-12-15 22:57:35,319 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 22:57:35,321 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-15 22:57:35,332 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 10:57:35 BoogieIcfgContainer [2023-12-15 22:57:35,332 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-15 22:57:35,332 INFO L158 Benchmark]: Toolchain (without parser) took 6293.94ms. Allocated memory was 311.4MB in the beginning and 378.5MB in the end (delta: 67.1MB). Free memory was 259.9MB in the beginning and 233.8MB in the end (delta: 26.1MB). Peak memory consumption was 164.7MB. Max. memory is 8.0GB. [2023-12-15 22:57:35,333 INFO L158 Benchmark]: CDTParser took 0.56ms. Allocated memory is still 203.4MB. Free memory is still 153.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 22:57:35,333 INFO L158 Benchmark]: CACSL2BoogieTranslator took 447.62ms. Allocated memory is still 311.4MB. Free memory was 259.6MB in the beginning and 239.9MB in the end (delta: 19.7MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2023-12-15 22:57:35,333 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.82ms. Allocated memory is still 311.4MB. Free memory was 239.9MB in the beginning and 237.6MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-15 22:57:35,333 INFO L158 Benchmark]: Boogie Preprocessor took 60.06ms. Allocated memory is still 311.4MB. Free memory was 237.6MB in the beginning and 235.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-15 22:57:35,333 INFO L158 Benchmark]: RCFGBuilder took 374.76ms. Allocated memory is still 311.4MB. Free memory was 235.5MB in the beginning and 214.8MB in the end (delta: 20.7MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2023-12-15 22:57:35,334 INFO L158 Benchmark]: TraceAbstraction took 5362.39ms. Allocated memory was 311.4MB in the beginning and 378.5MB in the end (delta: 67.1MB). Free memory was 214.4MB in the beginning and 233.8MB in the end (delta: -19.4MB). Peak memory consumption was 119.6MB. Max. memory is 8.0GB. [2023-12-15 22:57:35,335 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.56ms. Allocated memory is still 203.4MB. Free memory is still 153.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 447.62ms. Allocated memory is still 311.4MB. Free memory was 259.6MB in the beginning and 239.9MB in the end (delta: 19.7MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 43.82ms. Allocated memory is still 311.4MB. Free memory was 239.9MB in the beginning and 237.6MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 60.06ms. Allocated memory is still 311.4MB. Free memory was 237.6MB in the beginning and 235.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 374.76ms. Allocated memory is still 311.4MB. Free memory was 235.5MB in the beginning and 214.8MB in the end (delta: 20.7MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 5362.39ms. Allocated memory was 311.4MB in the beginning and 378.5MB in the end (delta: 67.1MB). Free memory was 214.4MB in the beginning and 233.8MB in the end (delta: -19.4MB). Peak memory consumption was 119.6MB. 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,"featureselect.i","") [49] - GenericResultAtLocation [Line: 87]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [87] - GenericResultAtLocation [Line: 96]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [96] - GenericResultAtLocation [Line: 287]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [287] - GenericResultAtLocation [Line: 653]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [653] - GenericResultAtLocation [Line: 725]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [725] - GenericResultAtLocation [Line: 823]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification5_spec.i","") [823] - GenericResultAtLocation [Line: 873]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [873] * 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: 92]: 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 7 procedures, 64 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.3s, OverallIterations: 11, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 790 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 764 mSDsluCounter, 2035 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1283 mSDsCounter, 173 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1195 IncrementalHoareTripleChecker+Invalid, 1368 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 173 mSolverCounterUnsat, 752 mSDtfsCounter, 1195 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 278 GetRequests, 207 SyntacticMatches, 4 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=525occurred in iteration=9, InterpolantAutomatonStates: 75, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 55 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 18 LocationsWithAnnotation, 661 PreInvPairs, 738 NumberOfFragments, 770 HoareAnnotationTreeSize, 661 FormulaSimplifications, 1111 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 18 FormulaSimplificationsInter, 2727 FormulaSimplificationTreeSizeReductionInter, 1.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 453 NumberOfCodeBlocks, 453 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 503 ConstructedInterpolants, 0 QuantifiedInterpolants, 918 SizeOfPredicates, 3 NumberOfNonLiveVariables, 264 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 13 InterpolantComputations, 10 PerfectInterpolantSequences, 94/109 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: 666]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 667]: Loop Invariant Derived loop invariant: ((((((((pumpRunning == 0) && (splverifierCounter == 0)) && (waterLevel <= 2)) && (0 == systemActive)) || ((((pumpRunning == 0) && (2 == waterLevel)) && (1 == systemActive)) && (splverifierCounter == 0))) || ((((1 <= pumpRunning) && (2 == waterLevel)) && (1 == systemActive)) && (splverifierCounter == 0))) || (((((1 <= pumpRunning) && (1 == systemActive)) && (splverifierCounter == 0)) && (waterLevel <= 2)) && (1 <= switchedOnBeforeTS))) || ((((pumpRunning == 0) && (waterLevel <= 1)) && (1 == systemActive)) && (splverifierCounter == 0))) - InvariantResult [Line: 737]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2023-12-15 22:57:35,351 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...