./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product59.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product59.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5a0a9a5f1521df25ea0ff390c35c7186e45318cd30c225704d83030e156744fb --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 19:39:37,625 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 19:39:37,679 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 19:39:37,685 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 19:39:37,685 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 19:39:37,724 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 19:39:37,727 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 19:39:37,727 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 19:39:37,727 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 19:39:37,728 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 19:39:37,728 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 19:39:37,728 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 19:39:37,729 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 19:39:37,730 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 19:39:37,730 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 19:39:37,730 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 19:39:37,731 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 19:39:37,731 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 19:39:37,731 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 19:39:37,731 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 19:39:37,732 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 19:39:37,734 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 19:39:37,734 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 19:39:37,734 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 19:39:37,735 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 19:39:37,735 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 19:39:37,735 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 19:39:37,735 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 19:39:37,735 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 19:39:37,735 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 19:39:37,735 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 19:39:37,736 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 19:39:37,736 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 19:39:37,736 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 19:39:37,736 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 19:39:37,736 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 19:39:37,736 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 19:39:37,736 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 19:39:37,736 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 19:39:37,737 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 19:39:37,737 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 19:39:37,739 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 19:39:37,739 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: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5a0a9a5f1521df25ea0ff390c35c7186e45318cd30c225704d83030e156744fb [2024-10-12 19:39:37,980 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 19:39:38,002 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 19:39:38,004 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 19:39:38,005 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 19:39:38,005 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 19:39:38,006 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product59.cil.c [2024-10-12 19:39:39,272 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 19:39:39,484 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 19:39:39,484 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product59.cil.c [2024-10-12 19:39:39,499 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9700c3a96/adaa56a74cc540a39538c3733333b278/FLAGc8dab8cba [2024-10-12 19:39:39,519 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9700c3a96/adaa56a74cc540a39538c3733333b278 [2024-10-12 19:39:39,522 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 19:39:39,523 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 19:39:39,524 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 19:39:39,525 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 19:39:39,529 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 19:39:39,530 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 07:39:39" (1/1) ... [2024-10-12 19:39:39,531 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e8732bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:39:39, skipping insertion in model container [2024-10-12 19:39:39,531 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 07:39:39" (1/1) ... [2024-10-12 19:39:39,568 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 19:39:39,760 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product59.cil.c[3645,3658] [2024-10-12 19:39:39,858 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 19:39:39,869 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 19:39:39,878 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [49] [2024-10-12 19:39:39,880 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification1_spec.i","") [160] [2024-10-12 19:39:39,880 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [188] [2024-10-12 19:39:39,880 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [197] [2024-10-12 19:39:39,880 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [267] [2024-10-12 19:39:39,880 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [500] [2024-10-12 19:39:39,881 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [866] [2024-10-12 19:39:39,881 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [904] [2024-10-12 19:39:39,889 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product59.cil.c[3645,3658] [2024-10-12 19:39:39,920 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 19:39:39,943 INFO L204 MainTranslator]: Completed translation [2024-10-12 19:39:39,944 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:39:39 WrapperNode [2024-10-12 19:39:39,944 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 19:39:39,945 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 19:39:39,945 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 19:39:39,945 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 19:39:39,951 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:39:39" (1/1) ... [2024-10-12 19:39:39,967 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:39:39" (1/1) ... [2024-10-12 19:39:39,991 INFO L138 Inliner]: procedures = 57, calls = 102, calls flagged for inlining = 24, calls inlined = 21, statements flattened = 218 [2024-10-12 19:39:39,994 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 19:39:39,995 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 19:39:39,995 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 19:39:39,995 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 19:39:40,004 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:39:39" (1/1) ... [2024-10-12 19:39:40,005 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:39:39" (1/1) ... [2024-10-12 19:39:40,006 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:39:39" (1/1) ... [2024-10-12 19:39:40,025 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]. [2024-10-12 19:39:40,029 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:39:39" (1/1) ... [2024-10-12 19:39:40,030 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:39:39" (1/1) ... [2024-10-12 19:39:40,033 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:39:39" (1/1) ... [2024-10-12 19:39:40,037 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:39:39" (1/1) ... [2024-10-12 19:39:40,038 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:39:39" (1/1) ... [2024-10-12 19:39:40,040 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:39:39" (1/1) ... [2024-10-12 19:39:40,041 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 19:39:40,042 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 19:39:40,042 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 19:39:40,043 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 19:39:40,043 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:39:39" (1/1) ... [2024-10-12 19:39:40,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 19:39:40,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:39:40,076 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) [2024-10-12 19:39:40,079 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 [2024-10-12 19:39:40,136 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 19:39:40,140 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2024-10-12 19:39:40,140 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2024-10-12 19:39:40,140 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-10-12 19:39:40,141 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-10-12 19:39:40,141 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-10-12 19:39:40,141 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-10-12 19:39:40,141 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2024-10-12 19:39:40,141 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2024-10-12 19:39:40,141 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__highWaterSensor [2024-10-12 19:39:40,141 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__highWaterSensor [2024-10-12 19:39:40,141 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2024-10-12 19:39:40,141 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2024-10-12 19:39:40,141 INFO L130 BoogieDeclarations]: Found specification of procedure deactivatePump [2024-10-12 19:39:40,141 INFO L138 BoogieDeclarations]: Found implementation of procedure deactivatePump [2024-10-12 19:39:40,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 19:39:40,142 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2024-10-12 19:39:40,142 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2024-10-12 19:39:40,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 19:39:40,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 19:39:40,231 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 19:39:40,233 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 19:39:40,462 INFO L? ?]: Removed 49 outVars from TransFormulas that were not future-live. [2024-10-12 19:39:40,462 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 19:39:40,508 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 19:39:40,509 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-12 19:39:40,509 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:39:40 BoogieIcfgContainer [2024-10-12 19:39:40,509 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 19:39:40,511 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 19:39:40,511 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 19:39:40,515 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 19:39:40,515 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 07:39:39" (1/3) ... [2024-10-12 19:39:40,516 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d818188 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 07:39:40, skipping insertion in model container [2024-10-12 19:39:40,516 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:39:39" (2/3) ... [2024-10-12 19:39:40,517 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d818188 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 07:39:40, skipping insertion in model container [2024-10-12 19:39:40,517 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:39:40" (3/3) ... [2024-10-12 19:39:40,519 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec1_product59.cil.c [2024-10-12 19:39:40,534 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 19:39:40,534 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 19:39:40,585 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 19:39:40,590 INFO L333 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, 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;@3c3b555d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 19:39:40,591 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 19:39:40,598 INFO L276 IsEmpty]: Start isEmpty. Operand has 77 states, 53 states have (on average 1.528301886792453) internal successors, (81), 62 states have internal predecessors, (81), 14 states have call successors, (14), 8 states have call predecessors, (14), 8 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-12 19:39:40,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-12 19:39:40,605 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:39:40,606 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:39:40,606 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:39:40,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:39:40,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1169849773, now seen corresponding path program 1 times [2024-10-12 19:39:40,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:39:40,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62423040] [2024-10-12 19:39:40,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:39:40,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:39:40,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:40,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:39:40,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:40,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:39:40,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:39:40,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62423040] [2024-10-12 19:39:40,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62423040] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:39:40,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:39:40,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 19:39:40,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13097941] [2024-10-12 19:39:40,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:39:40,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 19:39:40,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:39:40,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 19:39:40,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 19:39:40,840 INFO L87 Difference]: Start difference. First operand has 77 states, 53 states have (on average 1.528301886792453) internal successors, (81), 62 states have internal predecessors, (81), 14 states have call successors, (14), 8 states have call predecessors, (14), 8 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-12 19:39:40,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:39:40,910 INFO L93 Difference]: Finished difference Result 152 states and 219 transitions. [2024-10-12 19:39:40,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 19:39:40,913 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-10-12 19:39:40,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:39:40,923 INFO L225 Difference]: With dead ends: 152 [2024-10-12 19:39:40,924 INFO L226 Difference]: Without dead ends: 72 [2024-10-12 19:39:40,928 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 19:39:40,933 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:39:40,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:39:40,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-10-12 19:39:40,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-10-12 19:39:40,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 50 states have (on average 1.42) internal successors, (71), 58 states have internal predecessors, (71), 14 states have call successors, (14), 8 states have call predecessors, (14), 7 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-12 19:39:40,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 98 transitions. [2024-10-12 19:39:40,973 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 98 transitions. Word has length 16 [2024-10-12 19:39:40,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:39:40,974 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 98 transitions. [2024-10-12 19:39:40,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-12 19:39:40,974 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 98 transitions. [2024-10-12 19:39:40,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-12 19:39:40,976 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:39:40,976 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:39:40,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 19:39:40,977 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:39:40,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:39:40,977 INFO L85 PathProgramCache]: Analyzing trace with hash -817813740, now seen corresponding path program 1 times [2024-10-12 19:39:40,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:39:40,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270046224] [2024-10-12 19:39:40,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:39:40,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:39:41,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:41,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 19:39:41,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:41,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:39:41,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:39:41,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270046224] [2024-10-12 19:39:41,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270046224] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:39:41,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:39:41,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 19:39:41,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651326374] [2024-10-12 19:39:41,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:39:41,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 19:39:41,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:39:41,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 19:39:41,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 19:39:41,076 INFO L87 Difference]: Start difference. First operand 72 states and 98 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-12 19:39:41,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:39:41,113 INFO L93 Difference]: Finished difference Result 114 states and 154 transitions. [2024-10-12 19:39:41,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 19:39:41,114 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-10-12 19:39:41,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:39:41,115 INFO L225 Difference]: With dead ends: 114 [2024-10-12 19:39:41,115 INFO L226 Difference]: Without dead ends: 64 [2024-10-12 19:39:41,116 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 19:39:41,117 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 14 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:39:41,117 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 131 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:39:41,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-12 19:39:41,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-10-12 19:39:41,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 45 states have (on average 1.4444444444444444) internal successors, (65), 53 states have internal predecessors, (65), 11 states have call successors, (11), 7 states have call predecessors, (11), 7 states have return successors, (11), 8 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-12 19:39:41,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 87 transitions. [2024-10-12 19:39:41,129 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 87 transitions. Word has length 17 [2024-10-12 19:39:41,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:39:41,129 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 87 transitions. [2024-10-12 19:39:41,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-12 19:39:41,129 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 87 transitions. [2024-10-12 19:39:41,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-12 19:39:41,130 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:39:41,130 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:39:41,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 19:39:41,131 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:39:41,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:39:41,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1026887263, now seen corresponding path program 1 times [2024-10-12 19:39:41,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:39:41,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302625881] [2024-10-12 19:39:41,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:39:41,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:39:41,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:41,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 19:39:41,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:41,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:39:41,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:39:41,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302625881] [2024-10-12 19:39:41,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302625881] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:39:41,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:39:41,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 19:39:41,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139187321] [2024-10-12 19:39:41,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:39:41,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 19:39:41,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:39:41,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 19:39:41,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 19:39:41,226 INFO L87 Difference]: Start difference. First operand 64 states and 87 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-12 19:39:41,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:39:41,353 INFO L93 Difference]: Finished difference Result 188 states and 258 transitions. [2024-10-12 19:39:41,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 19:39:41,354 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2024-10-12 19:39:41,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:39:41,356 INFO L225 Difference]: With dead ends: 188 [2024-10-12 19:39:41,358 INFO L226 Difference]: Without dead ends: 126 [2024-10-12 19:39:41,359 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 19:39:41,360 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 74 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:39:41,362 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 155 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:39:41,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-10-12 19:39:41,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 123. [2024-10-12 19:39:41,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 86 states have (on average 1.4534883720930232) internal successors, (125), 101 states have internal predecessors, (125), 22 states have call successors, (22), 14 states have call predecessors, (22), 14 states have return successors, (22), 15 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-12 19:39:41,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 169 transitions. [2024-10-12 19:39:41,381 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 169 transitions. Word has length 20 [2024-10-12 19:39:41,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:39:41,381 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 169 transitions. [2024-10-12 19:39:41,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-12 19:39:41,382 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 169 transitions. [2024-10-12 19:39:41,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-12 19:39:41,383 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:39:41,383 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:39:41,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 19:39:41,384 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:39:41,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:39:41,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1574540819, now seen corresponding path program 1 times [2024-10-12 19:39:41,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:39:41,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300511678] [2024-10-12 19:39:41,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:39:41,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:39:41,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:41,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 19:39:41,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:41,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:39:41,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:39:41,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300511678] [2024-10-12 19:39:41,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300511678] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:39:41,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:39:41,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 19:39:41,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352929634] [2024-10-12 19:39:41,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:39:41,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 19:39:41,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:39:41,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 19:39:41,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 19:39:41,471 INFO L87 Difference]: Start difference. First operand 123 states and 169 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-12 19:39:41,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:39:41,583 INFO L93 Difference]: Finished difference Result 320 states and 447 transitions. [2024-10-12 19:39:41,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 19:39:41,584 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2024-10-12 19:39:41,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:39:41,586 INFO L225 Difference]: With dead ends: 320 [2024-10-12 19:39:41,586 INFO L226 Difference]: Without dead ends: 199 [2024-10-12 19:39:41,587 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 19:39:41,588 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 61 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:39:41,588 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 190 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:39:41,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-10-12 19:39:41,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 198. [2024-10-12 19:39:41,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 141 states have (on average 1.3829787234042554) internal successors, (195), 158 states have internal predecessors, (195), 30 states have call successors, (30), 26 states have call predecessors, (30), 26 states have return successors, (38), 27 states have call predecessors, (38), 30 states have call successors, (38) [2024-10-12 19:39:41,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 263 transitions. [2024-10-12 19:39:41,622 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 263 transitions. Word has length 23 [2024-10-12 19:39:41,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:39:41,622 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 263 transitions. [2024-10-12 19:39:41,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-12 19:39:41,622 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 263 transitions. [2024-10-12 19:39:41,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-12 19:39:41,625 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:39:41,625 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:39:41,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 19:39:41,625 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:39:41,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:39:41,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1881546442, now seen corresponding path program 1 times [2024-10-12 19:39:41,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:39:41,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927069227] [2024-10-12 19:39:41,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:39:41,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:39:41,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:41,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 19:39:41,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:41,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 19:39:41,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:41,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 19:39:41,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:41,750 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 19:39:41,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:39:41,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927069227] [2024-10-12 19:39:41,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927069227] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:39:41,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:39:41,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 19:39:41,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570389927] [2024-10-12 19:39:41,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:39:41,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 19:39:41,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:39:41,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 19:39:41,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 19:39:41,753 INFO L87 Difference]: Start difference. First operand 198 states and 263 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 19:39:41,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:39:41,914 INFO L93 Difference]: Finished difference Result 436 states and 593 transitions. [2024-10-12 19:39:41,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 19:39:41,915 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 38 [2024-10-12 19:39:41,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:39:41,919 INFO L225 Difference]: With dead ends: 436 [2024-10-12 19:39:41,919 INFO L226 Difference]: Without dead ends: 240 [2024-10-12 19:39:41,920 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:39:41,921 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 48 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:39:41,921 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 184 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:39:41,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2024-10-12 19:39:41,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 238. [2024-10-12 19:39:41,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 171 states have (on average 1.3508771929824561) internal successors, (231), 188 states have internal predecessors, (231), 34 states have call successors, (34), 26 states have call predecessors, (34), 32 states have return successors, (48), 35 states have call predecessors, (48), 34 states have call successors, (48) [2024-10-12 19:39:41,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 313 transitions. [2024-10-12 19:39:41,944 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 313 transitions. Word has length 38 [2024-10-12 19:39:41,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:39:41,944 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 313 transitions. [2024-10-12 19:39:41,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 19:39:41,945 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 313 transitions. [2024-10-12 19:39:41,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-12 19:39:41,946 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:39:41,946 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:39:41,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 19:39:41,946 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:39:41,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:39:41,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1595772404, now seen corresponding path program 1 times [2024-10-12 19:39:41,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:39:41,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864828] [2024-10-12 19:39:41,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:39:41,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:39:41,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:42,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 19:39:42,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:42,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 19:39:42,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:42,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 19:39:42,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:42,046 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 19:39:42,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:39:42,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864828] [2024-10-12 19:39:42,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864828] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:39:42,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:39:42,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 19:39:42,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525760510] [2024-10-12 19:39:42,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:39:42,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 19:39:42,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:39:42,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 19:39:42,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 19:39:42,050 INFO L87 Difference]: Start difference. First operand 238 states and 313 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 19:39:42,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:39:42,205 INFO L93 Difference]: Finished difference Result 480 states and 647 transitions. [2024-10-12 19:39:42,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 19:39:42,206 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 38 [2024-10-12 19:39:42,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:39:42,208 INFO L225 Difference]: With dead ends: 480 [2024-10-12 19:39:42,208 INFO L226 Difference]: Without dead ends: 244 [2024-10-12 19:39:42,211 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:39:42,212 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 48 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:39:42,215 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 182 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:39:42,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2024-10-12 19:39:42,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 242. [2024-10-12 19:39:42,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 175 states have (on average 1.3428571428571427) internal successors, (235), 192 states have internal predecessors, (235), 34 states have call successors, (34), 26 states have call predecessors, (34), 32 states have return successors, (48), 35 states have call predecessors, (48), 34 states have call successors, (48) [2024-10-12 19:39:42,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 317 transitions. [2024-10-12 19:39:42,239 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 317 transitions. Word has length 38 [2024-10-12 19:39:42,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:39:42,240 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 317 transitions. [2024-10-12 19:39:42,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 19:39:42,240 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 317 transitions. [2024-10-12 19:39:42,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-12 19:39:42,244 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:39:42,244 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:39:42,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 19:39:42,245 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:39:42,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:39:42,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1814627122, now seen corresponding path program 1 times [2024-10-12 19:39:42,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:39:42,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037638809] [2024-10-12 19:39:42,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:39:42,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:39:42,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:42,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 19:39:42,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:42,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 19:39:42,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:42,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 19:39:42,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:42,324 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 19:39:42,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:39:42,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037638809] [2024-10-12 19:39:42,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037638809] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:39:42,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:39:42,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 19:39:42,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023530037] [2024-10-12 19:39:42,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:39:42,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 19:39:42,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:39:42,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 19:39:42,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 19:39:42,327 INFO L87 Difference]: Start difference. First operand 242 states and 317 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 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) [2024-10-12 19:39:42,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:39:42,598 INFO L93 Difference]: Finished difference Result 785 states and 1101 transitions. [2024-10-12 19:39:42,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:39:42,599 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 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 38 [2024-10-12 19:39:42,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:39:42,602 INFO L225 Difference]: With dead ends: 785 [2024-10-12 19:39:42,602 INFO L226 Difference]: Without dead ends: 545 [2024-10-12 19:39:42,605 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:39:42,606 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 183 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 19:39:42,606 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 268 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 19:39:42,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2024-10-12 19:39:42,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 537. [2024-10-12 19:39:42,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 386 states have (on average 1.33419689119171) internal successors, (515), 417 states have internal predecessors, (515), 80 states have call successors, (80), 71 states have call predecessors, (80), 70 states have return successors, (130), 74 states have call predecessors, (130), 80 states have call successors, (130) [2024-10-12 19:39:42,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 725 transitions. [2024-10-12 19:39:42,657 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 725 transitions. Word has length 38 [2024-10-12 19:39:42,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:39:42,659 INFO L471 AbstractCegarLoop]: Abstraction has 537 states and 725 transitions. [2024-10-12 19:39:42,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 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) [2024-10-12 19:39:42,659 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 725 transitions. [2024-10-12 19:39:42,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-12 19:39:42,660 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:39:42,661 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:39:42,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 19:39:42,661 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:39:42,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:39:42,664 INFO L85 PathProgramCache]: Analyzing trace with hash -410233768, now seen corresponding path program 1 times [2024-10-12 19:39:42,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:39:42,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208978890] [2024-10-12 19:39:42,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:39:42,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:39:42,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:42,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-12 19:39:42,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:42,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-12 19:39:42,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:42,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 19:39:42,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:42,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 19:39:42,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:42,798 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-12 19:39:42,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:39:42,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208978890] [2024-10-12 19:39:42,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208978890] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:39:42,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:39:42,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 19:39:42,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198212375] [2024-10-12 19:39:42,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:39:42,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 19:39:42,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:39:42,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 19:39:42,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-12 19:39:42,802 INFO L87 Difference]: Start difference. First operand 537 states and 725 transitions. Second operand has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-12 19:39:43,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:39:43,245 INFO L93 Difference]: Finished difference Result 1786 states and 2508 transitions. [2024-10-12 19:39:43,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-12 19:39:43,246 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 42 [2024-10-12 19:39:43,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:39:43,254 INFO L225 Difference]: With dead ends: 1786 [2024-10-12 19:39:43,254 INFO L226 Difference]: Without dead ends: 1251 [2024-10-12 19:39:43,257 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2024-10-12 19:39:43,259 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 268 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 19:39:43,260 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 261 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 19:39:43,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1251 states. [2024-10-12 19:39:43,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1251 to 1245. [2024-10-12 19:39:43,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1245 states, 888 states have (on average 1.28490990990991) internal successors, (1141), 965 states have internal predecessors, (1141), 196 states have call successors, (196), 142 states have call predecessors, (196), 160 states have return successors, (352), 188 states have call predecessors, (352), 196 states have call successors, (352) [2024-10-12 19:39:43,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1245 states to 1245 states and 1689 transitions. [2024-10-12 19:39:43,372 INFO L78 Accepts]: Start accepts. Automaton has 1245 states and 1689 transitions. Word has length 42 [2024-10-12 19:39:43,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:39:43,373 INFO L471 AbstractCegarLoop]: Abstraction has 1245 states and 1689 transitions. [2024-10-12 19:39:43,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-12 19:39:43,373 INFO L276 IsEmpty]: Start isEmpty. Operand 1245 states and 1689 transitions. [2024-10-12 19:39:43,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-12 19:39:43,375 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:39:43,375 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:39:43,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 19:39:43,376 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:39:43,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:39:43,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1069580100, now seen corresponding path program 1 times [2024-10-12 19:39:43,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:39:43,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027269114] [2024-10-12 19:39:43,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:39:43,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:39:43,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:43,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-12 19:39:43,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:43,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 19:39:43,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:43,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:39:43,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:43,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 19:39:43,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:43,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-12 19:39:43,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:43,510 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-12 19:39:43,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:39:43,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027269114] [2024-10-12 19:39:43,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027269114] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:39:43,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1547531510] [2024-10-12 19:39:43,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:39:43,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:39:43,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:39:43,512 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) [2024-10-12 19:39:43,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 19:39:43,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:43,570 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-12 19:39:43,574 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:39:43,671 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:39:43,671 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 19:39:43,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1547531510] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:39:43,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 19:39:43,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2024-10-12 19:39:43,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435231043] [2024-10-12 19:39:43,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:39:43,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:39:43,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:39:43,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:39:43,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-10-12 19:39:43,673 INFO L87 Difference]: Start difference. First operand 1245 states and 1689 transitions. Second operand has 6 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-12 19:39:43,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:39:43,827 INFO L93 Difference]: Finished difference Result 2436 states and 3316 transitions. [2024-10-12 19:39:43,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 19:39:43,828 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 46 [2024-10-12 19:39:43,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:39:43,855 INFO L225 Difference]: With dead ends: 2436 [2024-10-12 19:39:43,855 INFO L226 Difference]: Without dead ends: 1193 [2024-10-12 19:39:43,859 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-10-12 19:39:43,860 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 61 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:39:43,860 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 353 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:39:43,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2024-10-12 19:39:43,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 1193. [2024-10-12 19:39:43,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1193 states, 850 states have (on average 1.2694117647058825) internal successors, (1079), 925 states have internal predecessors, (1079), 190 states have call successors, (190), 138 states have call predecessors, (190), 152 states have return successors, (314), 178 states have call predecessors, (314), 190 states have call successors, (314) [2024-10-12 19:39:43,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 1193 states and 1583 transitions. [2024-10-12 19:39:43,951 INFO L78 Accepts]: Start accepts. Automaton has 1193 states and 1583 transitions. Word has length 46 [2024-10-12 19:39:43,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:39:43,952 INFO L471 AbstractCegarLoop]: Abstraction has 1193 states and 1583 transitions. [2024-10-12 19:39:43,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-12 19:39:43,952 INFO L276 IsEmpty]: Start isEmpty. Operand 1193 states and 1583 transitions. [2024-10-12 19:39:43,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-12 19:39:43,955 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:39:43,955 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:39:43,969 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-12 19:39:44,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:39:44,156 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:39:44,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:39:44,157 INFO L85 PathProgramCache]: Analyzing trace with hash -791575094, now seen corresponding path program 1 times [2024-10-12 19:39:44,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:39:44,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359508163] [2024-10-12 19:39:44,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:39:44,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:39:44,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:44,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-12 19:39:44,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:44,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 19:39:44,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:44,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 19:39:44,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:44,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 19:39:44,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:44,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:39:44,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:44,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-12 19:39:44,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:44,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-12 19:39:44,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:44,274 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-12 19:39:44,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:39:44,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359508163] [2024-10-12 19:39:44,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359508163] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:39:44,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:39:44,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 19:39:44,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775095238] [2024-10-12 19:39:44,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:39:44,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 19:39:44,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:39:44,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 19:39:44,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-12 19:39:44,275 INFO L87 Difference]: Start difference. First operand 1193 states and 1583 transitions. Second operand has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 4 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-12 19:39:44,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:39:44,694 INFO L93 Difference]: Finished difference Result 1390 states and 1829 transitions. [2024-10-12 19:39:44,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 19:39:44,695 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 4 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 69 [2024-10-12 19:39:44,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:39:44,698 INFO L225 Difference]: With dead ends: 1390 [2024-10-12 19:39:44,698 INFO L226 Difference]: Without dead ends: 576 [2024-10-12 19:39:44,699 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2024-10-12 19:39:44,700 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 257 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 19:39:44,700 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 160 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 19:39:44,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2024-10-12 19:39:44,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 574. [2024-10-12 19:39:44,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 410 states have (on average 1.221951219512195) internal successors, (501), 442 states have internal predecessors, (501), 89 states have call successors, (89), 68 states have call predecessors, (89), 74 states have return successors, (149), 85 states have call predecessors, (149), 89 states have call successors, (149) [2024-10-12 19:39:44,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 739 transitions. [2024-10-12 19:39:44,731 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 739 transitions. Word has length 69 [2024-10-12 19:39:44,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:39:44,731 INFO L471 AbstractCegarLoop]: Abstraction has 574 states and 739 transitions. [2024-10-12 19:39:44,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 4 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-12 19:39:44,732 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 739 transitions. [2024-10-12 19:39:44,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-12 19:39:44,734 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:39:44,734 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:39:44,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 19:39:44,734 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:39:44,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:39:44,735 INFO L85 PathProgramCache]: Analyzing trace with hash -393565629, now seen corresponding path program 1 times [2024-10-12 19:39:44,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:39:44,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025908034] [2024-10-12 19:39:44,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:39:44,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:39:44,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:44,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-12 19:39:44,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:44,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 19:39:44,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:44,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 19:39:44,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:44,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 19:39:44,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:44,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:39:44,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:44,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-12 19:39:44,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:44,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-12 19:39:44,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:44,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:39:44,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:44,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-12 19:39:44,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:44,901 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-12 19:39:44,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:39:44,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025908034] [2024-10-12 19:39:44,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025908034] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:39:44,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [51694605] [2024-10-12 19:39:44,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:39:44,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:39:44,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:39:44,904 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 19:39:44,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-12 19:39:44,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:44,970 INFO L255 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-12 19:39:44,972 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:39:45,036 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 19:39:45,036 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 19:39:45,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [51694605] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:39:45,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 19:39:45,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 9 [2024-10-12 19:39:45,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894727288] [2024-10-12 19:39:45,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:39:45,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 19:39:45,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:39:45,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 19:39:45,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-12 19:39:45,038 INFO L87 Difference]: Start difference. First operand 574 states and 739 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-12 19:39:45,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:39:45,185 INFO L93 Difference]: Finished difference Result 1462 states and 1934 transitions. [2024-10-12 19:39:45,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 19:39:45,186 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 79 [2024-10-12 19:39:45,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:39:45,192 INFO L225 Difference]: With dead ends: 1462 [2024-10-12 19:39:45,192 INFO L226 Difference]: Without dead ends: 890 [2024-10-12 19:39:45,194 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 95 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-10-12 19:39:45,195 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 91 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:39:45,195 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 296 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:39:45,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2024-10-12 19:39:45,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 830. [2024-10-12 19:39:45,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 830 states, 592 states have (on average 1.2162162162162162) internal successors, (720), 636 states have internal predecessors, (720), 129 states have call successors, (129), 104 states have call predecessors, (129), 108 states have return successors, (219), 117 states have call predecessors, (219), 129 states have call successors, (219) [2024-10-12 19:39:45,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1068 transitions. [2024-10-12 19:39:45,254 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1068 transitions. Word has length 79 [2024-10-12 19:39:45,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:39:45,255 INFO L471 AbstractCegarLoop]: Abstraction has 830 states and 1068 transitions. [2024-10-12 19:39:45,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-12 19:39:45,255 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1068 transitions. [2024-10-12 19:39:45,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-12 19:39:45,256 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:39:45,256 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:39:45,270 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-12 19:39:45,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-12 19:39:45,457 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:39:45,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:39:45,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1211214079, now seen corresponding path program 1 times [2024-10-12 19:39:45,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:39:45,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724261727] [2024-10-12 19:39:45,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:39:45,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:39:45,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:45,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-12 19:39:45,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:45,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 19:39:45,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:45,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 19:39:45,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:45,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 19:39:45,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:45,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:39:45,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:45,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-12 19:39:45,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:45,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-12 19:39:45,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:45,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:39:45,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:45,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-12 19:39:45,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:45,540 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-12 19:39:45,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:39:45,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724261727] [2024-10-12 19:39:45,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724261727] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:39:45,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1496252776] [2024-10-12 19:39:45,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:39:45,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:39:45,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:39:45,543 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 19:39:45,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-12 19:39:45,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:45,606 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 19:39:45,608 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:39:45,627 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-12 19:39:45,628 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 19:39:45,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1496252776] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:39:45,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 19:39:45,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2024-10-12 19:39:45,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209119329] [2024-10-12 19:39:45,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:39:45,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 19:39:45,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:39:45,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 19:39:45,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-12 19:39:45,629 INFO L87 Difference]: Start difference. First operand 830 states and 1068 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-12 19:39:45,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:39:45,675 INFO L93 Difference]: Finished difference Result 1169 states and 1485 transitions. [2024-10-12 19:39:45,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 19:39:45,675 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 79 [2024-10-12 19:39:45,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:39:45,677 INFO L225 Difference]: With dead ends: 1169 [2024-10-12 19:39:45,677 INFO L226 Difference]: Without dead ends: 0 [2024-10-12 19:39:45,679 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-12 19:39:45,680 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 0 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:39:45,680 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 168 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:39:45,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-12 19:39:45,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-12 19:39:45,681 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) [2024-10-12 19:39:45,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-12 19:39:45,682 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 79 [2024-10-12 19:39:45,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:39:45,682 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 19:39:45,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-12 19:39:45,682 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-12 19:39:45,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-12 19:39:45,684 INFO L782 garLoopResultBuilder]: Registering result SAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 19:39:45,698 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-12 19:39:45,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:39:45,887 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:39:45,889 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-12 19:39:49,055 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 19:39:49,069 WARN L155 FloydHoareUtils]: Requires clause for deactivatePump contained old-variable. Original clause: (and (= ~pumpRunning~0 |old(~pumpRunning~0)|) (let ((.cse2 (= ~methaneLevelCritical~0 0)) (.cse1 (= 1 ~systemActive~0)) (.cse0 (<= 1 ~methaneLevelCritical~0)) (.cse3 (<= 2 ~waterLevel~0)) (.cse4 (not (= 0 ~systemActive~0)))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse4) (and .cse2 .cse1) (and .cse0 .cse3 .cse4)))) Eliminated clause: (let ((.cse2 (= ~methaneLevelCritical~0 0)) (.cse1 (= 1 ~systemActive~0)) (.cse0 (<= 1 ~methaneLevelCritical~0)) (.cse3 (<= 2 ~waterLevel~0)) (.cse4 (not (= 0 ~systemActive~0)))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse4) (and .cse2 .cse1) (and .cse0 .cse3 .cse4))) [2024-10-12 19:39:49,077 WARN L155 FloydHoareUtils]: Requires clause for changeMethaneLevel contained old-variable. Original clause: (and (let ((.cse2 (= 0 ~systemActive~0)) (.cse1 (<= 1 |old(~methaneLevelCritical~0)|)) (.cse0 (= ~pumpRunning~0 0)) (.cse3 (= |old(~methaneLevelCritical~0)| 0)) (.cse4 (= 1 ~systemActive~0)) (.cse5 (<= 1 ~waterLevel~0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse2) (and .cse0 .cse1 .cse4 .cse5) (and .cse3 (<= 2 ~waterLevel~0) .cse4) (and .cse0 .cse3 .cse4 .cse5))) (= |old(~methaneLevelCritical~0)| ~methaneLevelCritical~0)) Eliminated clause: (let ((.cse4 (<= 1 ~methaneLevelCritical~0)) (.cse3 (= 0 ~systemActive~0)) (.cse2 (= ~pumpRunning~0 0)) (.cse0 (= ~methaneLevelCritical~0 0)) (.cse1 (= 1 ~systemActive~0)) (.cse5 (<= 1 ~waterLevel~0))) (or (and .cse0 (<= 2 ~waterLevel~0) .cse1) (and .cse2 .cse0 .cse3) (and .cse2 .cse4 .cse1 .cse5) (and .cse2 .cse4 .cse3) (and .cse2 .cse0 .cse1 .cse5))) [2024-10-12 19:39:49,086 WARN L155 FloydHoareUtils]: Requires clause for timeShift contained old-variable. Original clause: (and (= ~pumpRunning~0 |old(~pumpRunning~0)|) (= |old(~waterLevel~0)| ~waterLevel~0) (let ((.cse2 (= 0 ~systemActive~0)) (.cse1 (= |old(~pumpRunning~0)| 0)) (.cse4 (<= 1 |old(~waterLevel~0)|)) (.cse0 (<= 1 ~methaneLevelCritical~0)) (.cse5 (= ~methaneLevelCritical~0 0)) (.cse3 (= 1 ~systemActive~0)) (.cse6 (<= 2 |old(~waterLevel~0)|))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse1 .cse4) (and .cse5 .cse1 .cse2) (and .cse5 .cse3 .cse1 .cse4) (and .cse0 .cse3 .cse6) (and .cse5 .cse3 .cse6)))) Eliminated clause: (let ((.cse4 (= 0 ~systemActive~0)) (.cse5 (<= 1 ~methaneLevelCritical~0)) (.cse1 (<= 2 ~waterLevel~0)) (.cse3 (= ~pumpRunning~0 0)) (.cse0 (= ~methaneLevelCritical~0 0)) (.cse2 (= 1 ~systemActive~0)) (.cse6 (<= 1 ~waterLevel~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse0 .cse4) (and .cse3 .cse5 .cse2 .cse6) (and .cse3 .cse5 .cse4) (and .cse5 .cse1 .cse2) (and .cse3 .cse0 .cse2 .cse6))) [2024-10-12 19:39:49,101 WARN L155 FloydHoareUtils]: Requires clause for processEnvironment__wrappee__highWaterSensor contained old-variable. Original clause: (and (= ~pumpRunning~0 0) (let ((.cse0 (= 1 ~systemActive~0)) (.cse1 (= |old(~pumpRunning~0)| 0)) (.cse2 (<= 1 ~waterLevel~0))) (or (and (<= 1 ~methaneLevelCritical~0) .cse0 .cse1 .cse2) (and (= ~methaneLevelCritical~0 0) .cse0 .cse1 .cse2)))) Eliminated clause: (and (= ~pumpRunning~0 0) (let ((.cse0 (= 1 ~systemActive~0)) (.cse1 (<= 1 ~waterLevel~0))) (or (and (= ~methaneLevelCritical~0 0) .cse0 .cse1) (and (<= 1 ~methaneLevelCritical~0) .cse0 .cse1)))) [2024-10-12 19:39:49,110 WARN L155 FloydHoareUtils]: Requires clause for waterRise contained old-variable. Original clause: (and (= |old(~waterLevel~0)| ~waterLevel~0) (let ((.cse1 (<= 1 ~methaneLevelCritical~0)) (.cse5 (= 0 ~systemActive~0)) (.cse0 (= ~pumpRunning~0 0)) (.cse3 (<= 1 |old(~waterLevel~0)|)) (.cse4 (= ~methaneLevelCritical~0 0)) (.cse2 (= 1 ~systemActive~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse5) (and .cse0 .cse1 .cse5) (and .cse0 .cse4 .cse2 .cse3) (and .cse4 .cse2 (<= 2 |old(~waterLevel~0)|))))) Eliminated clause: (let ((.cse4 (<= 1 ~methaneLevelCritical~0)) (.cse3 (= 0 ~systemActive~0)) (.cse2 (= ~pumpRunning~0 0)) (.cse0 (= ~methaneLevelCritical~0 0)) (.cse1 (= 1 ~systemActive~0)) (.cse5 (<= 1 ~waterLevel~0))) (or (and .cse0 (<= 2 ~waterLevel~0) .cse1) (and .cse2 .cse0 .cse3) (and .cse2 .cse4 .cse1 .cse5) (and .cse2 .cse4 .cse3) (and .cse2 .cse0 .cse1 .cse5))) [2024-10-12 19:39:49,114 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 07:39:49 BoogieIcfgContainer [2024-10-12 19:39:49,115 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 19:39:49,115 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 19:39:49,115 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 19:39:49,115 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 19:39:49,116 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:39:40" (3/4) ... [2024-10-12 19:39:49,121 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-12 19:39:49,123 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure deactivatePump [2024-10-12 19:39:49,123 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__base [2024-10-12 19:39:49,123 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure changeMethaneLevel [2024-10-12 19:39:49,123 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure cleanup [2024-10-12 19:39:49,123 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure timeShift [2024-10-12 19:39:49,124 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure isMethaneLevelCritical [2024-10-12 19:39:49,125 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__highWaterSensor [2024-10-12 19:39:49,125 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure waterRise [2024-10-12 19:39:49,133 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 33 nodes and edges [2024-10-12 19:39:49,133 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2024-10-12 19:39:49,134 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-12 19:39:49,134 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-12 19:39:49,134 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-12 19:39:49,224 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-12 19:39:49,225 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-12 19:39:49,225 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 19:39:49,226 INFO L158 Benchmark]: Toolchain (without parser) took 9702.40ms. Allocated memory was 161.5MB in the beginning and 299.9MB in the end (delta: 138.4MB). Free memory was 132.6MB in the beginning and 156.8MB in the end (delta: -24.1MB). Peak memory consumption was 114.1MB. Max. memory is 16.1GB. [2024-10-12 19:39:49,226 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 161.5MB. Free memory is still 129.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 19:39:49,226 INFO L158 Benchmark]: CACSL2BoogieTranslator took 419.67ms. Allocated memory is still 161.5MB. Free memory was 131.9MB in the beginning and 110.8MB in the end (delta: 21.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-12 19:39:49,226 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.51ms. Allocated memory is still 161.5MB. Free memory was 110.8MB in the beginning and 108.9MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 19:39:49,226 INFO L158 Benchmark]: Boogie Preprocessor took 46.99ms. Allocated memory is still 161.5MB. Free memory was 108.3MB in the beginning and 106.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 19:39:49,227 INFO L158 Benchmark]: RCFGBuilder took 467.28ms. Allocated memory is still 161.5MB. Free memory was 106.2MB in the beginning and 110.0MB in the end (delta: -3.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-12 19:39:49,227 INFO L158 Benchmark]: TraceAbstraction took 8603.38ms. Allocated memory was 161.5MB in the beginning and 299.9MB in the end (delta: 138.4MB). Free memory was 110.0MB in the beginning and 165.2MB in the end (delta: -55.2MB). Peak memory consumption was 155.2MB. Max. memory is 16.1GB. [2024-10-12 19:39:49,227 INFO L158 Benchmark]: Witness Printer took 110.08ms. Allocated memory is still 299.9MB. Free memory was 165.2MB in the beginning and 156.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-12 19:39:49,228 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.15ms. Allocated memory is still 161.5MB. Free memory is still 129.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 419.67ms. Allocated memory is still 161.5MB. Free memory was 131.9MB in the beginning and 110.8MB in the end (delta: 21.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.51ms. Allocated memory is still 161.5MB. Free memory was 110.8MB in the beginning and 108.9MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.99ms. Allocated memory is still 161.5MB. Free memory was 108.3MB in the beginning and 106.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 467.28ms. Allocated memory is still 161.5MB. Free memory was 106.2MB in the beginning and 110.0MB in the end (delta: -3.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 8603.38ms. Allocated memory was 161.5MB in the beginning and 299.9MB in the end (delta: 138.4MB). Free memory was 110.0MB in the beginning and 165.2MB in the end (delta: -55.2MB). Peak memory consumption was 155.2MB. Max. memory is 16.1GB. * Witness Printer took 110.08ms. Allocated memory is still 299.9MB. Free memory was 165.2MB in the beginning and 156.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 49]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [49] - GenericResultAtLocation [Line: 160]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification1_spec.i","") [160] - GenericResultAtLocation [Line: 188]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [188] - GenericResultAtLocation [Line: 197]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [197] - GenericResultAtLocation [Line: 267]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [267] - GenericResultAtLocation [Line: 500]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [500] - GenericResultAtLocation [Line: 866]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [866] - GenericResultAtLocation [Line: 904]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [904] * 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: 193]: 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 9 procedures, 77 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.3s, OverallIterations: 12, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1140 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1105 mSDsluCounter, 2436 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1506 mSDsCounter, 299 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1585 IncrementalHoareTripleChecker+Invalid, 1884 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 299 mSolverCounterUnsat, 930 mSDtfsCounter, 1585 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 388 GetRequests, 304 SyntacticMatches, 2 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1245occurred in iteration=8, 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.5s AutomataMinimizationTime, 12 MinimizatonAttempts, 84 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 709 NumberOfCodeBlocks, 709 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 694 ConstructedInterpolants, 0 QuantifiedInterpolants, 1157 SizeOfPredicates, 2 NumberOfNonLiveVariables, 753 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 15 InterpolantComputations, 12 PerfectInterpolantSequences, 131/136 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: 210]: Location Invariant Derived location invariant: 0 - InvariantResult [Line: 211]: Loop Invariant Derived loop invariant: ((((((((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (splverifierCounter == 0)) && (0 == systemActive)) || (((((pumpRunning == 0) && (methaneLevelCritical == 0)) && (1 == systemActive)) && (splverifierCounter == 0)) && (1 <= waterLevel))) || ((((pumpRunning == 0) && (methaneLevelCritical == 0)) && (splverifierCounter == 0)) && (0 == systemActive))) || (((((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (1 == systemActive)) && (splverifierCounter == 0)) && (1 <= waterLevel))) || ((((methaneLevelCritical == 0) && (2 <= waterLevel)) && (1 == systemActive)) && (splverifierCounter == 0))) - InvariantResult [Line: 916]: Loop Invariant Derived loop invariant: 0 - ProcedureContractResult [Line: 383]: Procedure Contract for deactivatePump Derived contract for procedure deactivatePump. Requires: (((((1 <= methaneLevelCritical) && (1 == systemActive)) || (((methaneLevelCritical == 0) && (2 <= waterLevel)) && (0 != systemActive))) || ((methaneLevelCritical == 0) && (1 == systemActive))) || (((1 <= methaneLevelCritical) && (2 <= waterLevel)) && (0 != systemActive))) Ensures: ((pumpRunning == 0) && (((((1 <= methaneLevelCritical) && (1 == systemActive)) || (((methaneLevelCritical == 0) && (2 <= waterLevel)) && (0 != systemActive))) || ((methaneLevelCritical == 0) && (1 == systemActive))) || (((1 <= methaneLevelCritical) && (2 <= waterLevel)) && (0 != systemActive)))) - ProcedureContractResult [Line: 298]: Procedure Contract for processEnvironment__wrappee__base Derived contract for procedure processEnvironment__wrappee__base. Requires: (((((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (1 == systemActive)) && (1 <= waterLevel)) || ((((pumpRunning == 0) && (methaneLevelCritical == 0)) && (1 == systemActive)) && (1 <= waterLevel))) Ensures: (((((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (1 == systemActive)) && (1 <= waterLevel)) || ((((pumpRunning == 0) && (methaneLevelCritical == 0)) && (1 == systemActive)) && (1 <= waterLevel))) - ProcedureContractResult [Line: 84]: Procedure Contract for changeMethaneLevel Derived contract for procedure changeMethaneLevel. Requires: (((((((methaneLevelCritical == 0) && (2 <= waterLevel)) && (1 == systemActive)) || (((pumpRunning == 0) && (methaneLevelCritical == 0)) && (0 == systemActive))) || ((((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (1 == systemActive)) && (1 <= waterLevel))) || (((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (0 == systemActive))) || ((((pumpRunning == 0) && (methaneLevelCritical == 0)) && (1 == systemActive)) && (1 <= waterLevel))) Ensures: (((((((((pumpRunning == 0) && (1 <= \old(methaneLevelCritical))) && (0 == systemActive)) || (((pumpRunning == 0) && (\old(methaneLevelCritical) == 0)) && (0 == systemActive))) || ((((pumpRunning == 0) && (1 <= \old(methaneLevelCritical))) && (1 == systemActive)) && (1 <= waterLevel))) || (((\old(methaneLevelCritical) == 0) && (2 <= waterLevel)) && (1 == systemActive))) || ((((pumpRunning == 0) && (\old(methaneLevelCritical) == 0)) && (1 == systemActive)) && (1 <= waterLevel))) && ((\old(methaneLevelCritical) != 0) || (0 < methaneLevelCritical))) && ((methaneLevelCritical == 0) || (\old(methaneLevelCritical) < 1))) - ProcedureContractResult [Line: 906]: Procedure Contract for cleanup Derived contract for procedure cleanup. Requires: 0 Ensures: 0 - ProcedureContractResult [Line: 274]: Procedure Contract for timeShift Derived contract for procedure timeShift. Requires: ((((((((methaneLevelCritical == 0) && (2 <= waterLevel)) && (1 == systemActive)) || (((pumpRunning == 0) && (methaneLevelCritical == 0)) && (0 == systemActive))) || ((((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (1 == systemActive)) && (1 <= waterLevel))) || (((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (0 == systemActive))) || (((1 <= methaneLevelCritical) && (2 <= waterLevel)) && (1 == systemActive))) || ((((pumpRunning == 0) && (methaneLevelCritical == 0)) && (1 == systemActive)) && (1 <= waterLevel))) Ensures: ((((((pumpRunning == 0) || (0 != systemActive)) && (((0 == systemActive) || (methaneLevelCritical < 1)) || ((pumpRunning == 0) && (1 <= waterLevel)))) && (((1 < waterLevel) || ((pumpRunning == 0) && (waterLevel == 1))) || (0 == systemActive))) && ((((((((1 <= methaneLevelCritical) && (\old(pumpRunning) == 0)) && (0 == systemActive)) || (((methaneLevelCritical == 0) && (\old(pumpRunning) == 0)) && (0 == systemActive))) || (((1 <= methaneLevelCritical) && (1 == systemActive)) && (\old(pumpRunning) == 0))) || (((1 <= methaneLevelCritical) && (1 == systemActive)) && (2 <= \old(waterLevel)))) || (((methaneLevelCritical == 0) && (1 == systemActive)) && (2 <= \old(waterLevel)))) || (((methaneLevelCritical == 0) && (1 == systemActive)) && (\old(pumpRunning) == 0)))) && ((\old(pumpRunning) != 0) || (\old(waterLevel) == waterLevel))) - ProcedureContractResult [Line: 96]: Procedure Contract for isMethaneLevelCritical Derived contract for procedure isMethaneLevelCritical. Requires: (((((((methaneLevelCritical == 0) && (2 <= waterLevel)) && (1 == systemActive)) || (((pumpRunning == 0) && (methaneLevelCritical == 0)) && (0 == systemActive))) || ((((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (1 == systemActive)) && (1 <= waterLevel))) || (((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (0 == systemActive))) || ((((pumpRunning == 0) && (methaneLevelCritical == 0)) && (1 == systemActive)) && (1 <= waterLevel))) Ensures: ((\result == methaneLevelCritical) && (((((((methaneLevelCritical == 0) && (2 <= waterLevel)) && (1 == systemActive)) || (((pumpRunning == 0) && (methaneLevelCritical == 0)) && (0 == systemActive))) || ((((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (1 == systemActive)) && (1 <= waterLevel))) || (((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (0 == systemActive))) || ((((pumpRunning == 0) && (methaneLevelCritical == 0)) && (1 == systemActive)) && (1 <= waterLevel)))) - ProcedureContractResult [Line: 306]: Procedure Contract for processEnvironment__wrappee__highWaterSensor Derived contract for procedure processEnvironment__wrappee__highWaterSensor. Requires: ((pumpRunning == 0) && ((((methaneLevelCritical == 0) && (1 == systemActive)) && (1 <= waterLevel)) || (((1 <= methaneLevelCritical) && (1 == systemActive)) && (1 <= waterLevel)))) Ensures: ((((((pumpRunning == 0) && (1 == systemActive)) && (\old(pumpRunning) == 0)) || (methaneLevelCritical < 1)) && ((1 < waterLevel) || ((pumpRunning == 0) && (waterLevel == 1)))) && ((0 < methaneLevelCritical) || (((methaneLevelCritical == 0) && (1 == systemActive)) && (\old(pumpRunning) == 0)))) - ProcedureContractResult [Line: 72]: Procedure Contract for waterRise Derived contract for procedure waterRise. Requires: (((((((methaneLevelCritical == 0) && (2 <= waterLevel)) && (1 == systemActive)) || (((pumpRunning == 0) && (methaneLevelCritical == 0)) && (0 == systemActive))) || ((((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (1 == systemActive)) && (1 <= waterLevel))) || (((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (0 == systemActive))) || ((((pumpRunning == 0) && (methaneLevelCritical == 0)) && (1 == systemActive)) && (1 <= waterLevel))) Ensures: ((((((((((pumpRunning == 0) && (methaneLevelCritical == 0)) && (1 <= \old(waterLevel))) || (((pumpRunning == 0) && (methaneLevelCritical == 0)) && (0 == systemActive))) || ((1 <= methaneLevelCritical) && (1 <= \old(waterLevel)))) || ((1 <= methaneLevelCritical) && (0 == systemActive))) || (((methaneLevelCritical == 0) && (1 == systemActive)) && (2 <= \old(waterLevel)))) && ((\old(waterLevel) < 2) || (\old(waterLevel) == waterLevel))) && ((pumpRunning == 0) || (methaneLevelCritical < 1))) && (((2 <= waterLevel) && (1 == systemActive)) || (0 == systemActive))) RESULT: Ultimate proved your program to be correct! [2024-10-12 19:39:49,251 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... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE