./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec2_product35.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/minepump_spec2_product35.cil.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 34d4dbed37590326da938d00ced1aba27649a4f6be46ad5130f0beeedcfaf5dd --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:00:23,280 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:00:23,337 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 04:00:23,341 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:00:23,342 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:00:23,365 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:00:23,366 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:00:23,366 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:00:23,367 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:00:23,367 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:00:23,368 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:00:23,368 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:00:23,368 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:00:23,368 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:00:23,369 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:00:23,369 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:00:23,369 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:00:23,369 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:00:23,369 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:00:23,369 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:00:23,369 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:00:23,369 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:00:23,369 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:00:23,369 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:00:23,370 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:00:23,370 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:00:23,370 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:00:23,370 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:00:23,370 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:00:23,370 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:00:23,370 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:00:23,370 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:00:23,370 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:00:23,371 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:00:23,371 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:00:23,371 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:00:23,371 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:00:23,371 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:00:23,371 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:00:23,371 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:00:23,371 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:00:23,371 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:00:23,371 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:00:23,372 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:00:23,372 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:00:23,372 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:00:23,372 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:00:23,372 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:00:23,372 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> 34d4dbed37590326da938d00ced1aba27649a4f6be46ad5130f0beeedcfaf5dd [2025-01-09 04:00:23,595 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:00:23,605 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:00:23,607 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:00:23,609 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:00:23,609 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:00:23,610 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec2_product35.cil.c [2025-01-09 04:00:24,716 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/87ac70d87/0c36527b7a05431b8a0261edf0163fcf/FLAG728ecc109 [2025-01-09 04:00:24,966 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:00:24,967 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product35.cil.c [2025-01-09 04:00:24,974 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/87ac70d87/0c36527b7a05431b8a0261edf0163fcf/FLAG728ecc109 [2025-01-09 04:00:25,275 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/87ac70d87/0c36527b7a05431b8a0261edf0163fcf [2025-01-09 04:00:25,277 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:00:25,278 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:00:25,279 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:00:25,280 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:00:25,282 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:00:25,283 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:00:25" (1/1) ... [2025-01-09 04:00:25,283 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@263c013a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:00:25, skipping insertion in model container [2025-01-09 04:00:25,284 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:00:25" (1/1) ... [2025-01-09 04:00:25,308 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:00:25,494 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product35.cil.c[15769,15782] [2025-01-09 04:00:25,505 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:00:25,518 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:00:25,525 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [49] [2025-01-09 04:00:25,526 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [415] [2025-01-09 04:00:25,526 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [593] [2025-01-09 04:00:25,526 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [663] [2025-01-09 04:00:25,526 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [703] [2025-01-09 04:00:25,526 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [741] [2025-01-09 04:00:25,526 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [750] [2025-01-09 04:00:25,526 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [847] [2025-01-09 04:00:25,575 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product35.cil.c[15769,15782] [2025-01-09 04:00:25,582 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:00:25,604 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:00:25,606 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:00:25 WrapperNode [2025-01-09 04:00:25,606 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:00:25,607 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:00:25,607 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:00:25,607 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:00:25,611 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:00:25" (1/1) ... [2025-01-09 04:00:25,620 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:00:25" (1/1) ... [2025-01-09 04:00:25,633 INFO L138 Inliner]: procedures = 54, calls = 96, calls flagged for inlining = 22, calls inlined = 19, statements flattened = 176 [2025-01-09 04:00:25,634 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:00:25,634 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:00:25,634 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:00:25,634 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:00:25,640 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:00:25" (1/1) ... [2025-01-09 04:00:25,640 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:00:25" (1/1) ... [2025-01-09 04:00:25,642 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:00:25" (1/1) ... [2025-01-09 04:00:25,650 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]. [2025-01-09 04:00:25,650 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:00:25" (1/1) ... [2025-01-09 04:00:25,651 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:00:25" (1/1) ... [2025-01-09 04:00:25,653 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:00:25" (1/1) ... [2025-01-09 04:00:25,654 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:00:25" (1/1) ... [2025-01-09 04:00:25,656 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:00:25" (1/1) ... [2025-01-09 04:00:25,657 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:00:25" (1/1) ... [2025-01-09 04:00:25,657 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:00:25" (1/1) ... [2025-01-09 04:00:25,658 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:00:25,659 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:00:25,659 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:00:25,659 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:00:25,660 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:00:25" (1/1) ... [2025-01-09 04:00:25,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:00:25,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:00:25,684 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 04:00:25,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 04:00:25,701 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:00:25,701 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2025-01-09 04:00:25,701 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2025-01-09 04:00:25,701 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-01-09 04:00:25,701 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-01-09 04:00:25,701 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2025-01-09 04:00:25,701 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2025-01-09 04:00:25,701 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-01-09 04:00:25,701 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-01-09 04:00:25,701 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2025-01-09 04:00:25,701 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2025-01-09 04:00:25,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:00:25,701 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2025-01-09 04:00:25,701 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2025-01-09 04:00:25,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:00:25,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:00:25,753 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:00:25,754 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:00:25,919 INFO L? ?]: Removed 36 outVars from TransFormulas that were not future-live. [2025-01-09 04:00:25,919 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:00:25,930 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:00:25,930 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-09 04:00:25,931 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:00:25 BoogieIcfgContainer [2025-01-09 04:00:25,931 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:00:25,932 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:00:25,932 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:00:25,935 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:00:25,936 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:00:25" (1/3) ... [2025-01-09 04:00:25,936 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f8185cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:00:25, skipping insertion in model container [2025-01-09 04:00:25,937 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:00:25" (2/3) ... [2025-01-09 04:00:25,937 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f8185cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:00:25, skipping insertion in model container [2025-01-09 04:00:25,937 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:00:25" (3/3) ... [2025-01-09 04:00:25,938 INFO L128 eAbstractionObserver]: Analyzing ICFG minepump_spec2_product35.cil.c [2025-01-09 04:00:25,949 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:00:25,950 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG minepump_spec2_product35.cil.c that has 7 procedures, 78 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-01-09 04:00:25,999 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:00:26,008 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;@704e1127, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:00:26,008 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 04:00:26,012 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 61 states have (on average 1.3770491803278688) internal successors, (84), 67 states have internal predecessors, (84), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 04:00:26,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-09 04:00:26,018 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:00:26,018 INFO L218 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, 1, 1] [2025-01-09 04:00:26,018 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:00:26,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:00:26,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1045848286, now seen corresponding path program 1 times [2025-01-09 04:00:26,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:00:26,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657713795] [2025-01-09 04:00:26,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:00:26,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:00:26,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 04:00:26,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 04:00:26,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:00:26,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:00:26,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:00:26,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:00:26,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657713795] [2025-01-09 04:00:26,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657713795] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:00:26,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:00:26,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 04:00:26,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029998486] [2025-01-09 04:00:26,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:00:26,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 04:00:26,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:00:26,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 04:00:26,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 04:00:26,169 INFO L87 Difference]: Start difference. First operand has 78 states, 61 states have (on average 1.3770491803278688) internal successors, (84), 67 states have internal predecessors, (84), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 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) [2025-01-09 04:00:26,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:00:26,186 INFO L93 Difference]: Finished difference Result 147 states and 198 transitions. [2025-01-09 04:00:26,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 04:00:26,188 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 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 25 [2025-01-09 04:00:26,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:00:26,192 INFO L225 Difference]: With dead ends: 147 [2025-01-09 04:00:26,192 INFO L226 Difference]: Without dead ends: 69 [2025-01-09 04:00:26,194 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 04:00:26,196 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:00:26,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:00:26,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-01-09 04:00:26,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2025-01-09 04:00:26,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 54 states have (on average 1.3333333333333333) internal successors, (72), 59 states have internal predecessors, (72), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-09 04:00:26,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 89 transitions. [2025-01-09 04:00:26,223 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 89 transitions. Word has length 25 [2025-01-09 04:00:26,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:00:26,223 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 89 transitions. [2025-01-09 04:00:26,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 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) [2025-01-09 04:00:26,223 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 89 transitions. [2025-01-09 04:00:26,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-09 04:00:26,224 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:00:26,224 INFO L218 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, 1, 1] [2025-01-09 04:00:26,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:00:26,225 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:00:26,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:00:26,225 INFO L85 PathProgramCache]: Analyzing trace with hash 891376887, now seen corresponding path program 1 times [2025-01-09 04:00:26,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:00:26,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066765828] [2025-01-09 04:00:26,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:00:26,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:00:26,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 04:00:26,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 04:00:26,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:00:26,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:00:26,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:00:26,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:00:26,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066765828] [2025-01-09 04:00:26,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066765828] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:00:26,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:00:26,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:00:26,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017646306] [2025-01-09 04:00:26,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:00:26,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:00:26,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:00:26,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:00:26,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:00:26,309 INFO L87 Difference]: Start difference. First operand 69 states and 89 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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) [2025-01-09 04:00:26,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:00:26,317 INFO L93 Difference]: Finished difference Result 101 states and 130 transitions. [2025-01-09 04:00:26,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:00:26,318 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 25 [2025-01-09 04:00:26,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:00:26,318 INFO L225 Difference]: With dead ends: 101 [2025-01-09 04:00:26,318 INFO L226 Difference]: Without dead ends: 61 [2025-01-09 04:00:26,319 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:00:26,319 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 17 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:00:26,319 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 134 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:00:26,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-01-09 04:00:26,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2025-01-09 04:00:26,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 49 states have (on average 1.346938775510204) internal successors, (66), 54 states have internal predecessors, (66), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 04:00:26,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 78 transitions. [2025-01-09 04:00:26,324 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 78 transitions. Word has length 25 [2025-01-09 04:00:26,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:00:26,325 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 78 transitions. [2025-01-09 04:00:26,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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) [2025-01-09 04:00:26,325 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 78 transitions. [2025-01-09 04:00:26,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-01-09 04:00:26,326 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:00:26,326 INFO L218 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, 1, 1, 1, 1, 1, 1] [2025-01-09 04:00:26,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:00:26,326 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:00:26,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:00:26,326 INFO L85 PathProgramCache]: Analyzing trace with hash -439456375, now seen corresponding path program 1 times [2025-01-09 04:00:26,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:00:26,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656579050] [2025-01-09 04:00:26,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:00:26,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:00:26,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 04:00:26,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 04:00:26,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:00:26,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:00:26,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:00:26,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:00:26,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656579050] [2025-01-09 04:00:26,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656579050] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:00:26,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:00:26,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:00:26,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953152824] [2025-01-09 04:00:26,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:00:26,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:00:26,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:00:26,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:00:26,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:00:26,482 INFO L87 Difference]: Start difference. First operand 61 states and 78 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 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) [2025-01-09 04:00:26,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:00:26,605 INFO L93 Difference]: Finished difference Result 205 states and 271 transitions. [2025-01-09 04:00:26,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:00:26,605 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 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 29 [2025-01-09 04:00:26,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:00:26,606 INFO L225 Difference]: With dead ends: 205 [2025-01-09 04:00:26,606 INFO L226 Difference]: Without dead ends: 152 [2025-01-09 04:00:26,607 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:00:26,607 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 178 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:00:26,608 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 347 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:00:26,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2025-01-09 04:00:26,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 142. [2025-01-09 04:00:26,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 111 states have (on average 1.3873873873873874) internal successors, (154), 122 states have internal predecessors, (154), 16 states have call successors, (16), 14 states have call predecessors, (16), 14 states have return successors, (17), 14 states have call predecessors, (17), 16 states have call successors, (17) [2025-01-09 04:00:26,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 187 transitions. [2025-01-09 04:00:26,623 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 187 transitions. Word has length 29 [2025-01-09 04:00:26,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:00:26,623 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 187 transitions. [2025-01-09 04:00:26,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 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) [2025-01-09 04:00:26,623 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 187 transitions. [2025-01-09 04:00:26,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-01-09 04:00:26,624 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:00:26,624 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:00:26,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 04:00:26,624 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:00:26,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:00:26,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1779846514, now seen corresponding path program 1 times [2025-01-09 04:00:26,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:00:26,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769802068] [2025-01-09 04:00:26,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:00:26,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:00:26,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 04:00:26,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 04:00:26,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:00:26,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:00:26,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:00:26,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:00:26,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769802068] [2025-01-09 04:00:26,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769802068] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:00:26,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:00:26,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:00:26,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297982661] [2025-01-09 04:00:26,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:00:26,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:00:26,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:00:26,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:00:26,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:00:26,663 INFO L87 Difference]: Start difference. First operand 142 states and 187 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 04:00:26,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:00:26,695 INFO L93 Difference]: Finished difference Result 349 states and 469 transitions. [2025-01-09 04:00:26,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:00:26,695 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 34 [2025-01-09 04:00:26,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:00:26,696 INFO L225 Difference]: With dead ends: 349 [2025-01-09 04:00:26,696 INFO L226 Difference]: Without dead ends: 215 [2025-01-09 04:00:26,697 INFO L434 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 [2025-01-09 04:00:26,698 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 51 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:00:26,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 123 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:00:26,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2025-01-09 04:00:26,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2025-01-09 04:00:26,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 164 states have (on average 1.3597560975609757) internal successors, (223), 177 states have internal predecessors, (223), 24 states have call successors, (24), 24 states have call predecessors, (24), 24 states have return successors, (30), 24 states have call predecessors, (30), 24 states have call successors, (30) [2025-01-09 04:00:26,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 277 transitions. [2025-01-09 04:00:26,717 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 277 transitions. Word has length 34 [2025-01-09 04:00:26,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:00:26,717 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 277 transitions. [2025-01-09 04:00:26,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 04:00:26,717 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 277 transitions. [2025-01-09 04:00:26,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-01-09 04:00:26,717 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:00:26,718 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:00:26,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 04:00:26,718 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:00:26,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:00:26,718 INFO L85 PathProgramCache]: Analyzing trace with hash -346178828, now seen corresponding path program 1 times [2025-01-09 04:00:26,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:00:26,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447889950] [2025-01-09 04:00:26,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:00:26,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:00:26,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-09 04:00:26,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 04:00:26,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:00:26,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:00:26,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:00:26,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:00:26,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447889950] [2025-01-09 04:00:26,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447889950] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:00:26,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:00:26,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:00:26,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901838920] [2025-01-09 04:00:26,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:00:26,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:00:26,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:00:26,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:00:26,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:00:26,782 INFO L87 Difference]: Start difference. First operand 213 states and 277 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 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) [2025-01-09 04:00:26,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:00:26,828 INFO L93 Difference]: Finished difference Result 415 states and 546 transitions. [2025-01-09 04:00:26,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:00:26,828 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 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 33 [2025-01-09 04:00:26,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:00:26,830 INFO L225 Difference]: With dead ends: 415 [2025-01-09 04:00:26,830 INFO L226 Difference]: Without dead ends: 210 [2025-01-09 04:00:26,831 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:00:26,831 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 40 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:00:26,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 264 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:00:26,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2025-01-09 04:00:26,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2025-01-09 04:00:26,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 161 states have (on average 1.329192546583851) internal successors, (214), 174 states have internal predecessors, (214), 24 states have call successors, (24), 24 states have call predecessors, (24), 24 states have return successors, (30), 24 states have call predecessors, (30), 24 states have call successors, (30) [2025-01-09 04:00:26,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 268 transitions. [2025-01-09 04:00:26,850 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 268 transitions. Word has length 33 [2025-01-09 04:00:26,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:00:26,850 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 268 transitions. [2025-01-09 04:00:26,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 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) [2025-01-09 04:00:26,850 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 268 transitions. [2025-01-09 04:00:26,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-01-09 04:00:26,851 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:00:26,851 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:00:26,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 04:00:26,851 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:00:26,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:00:26,852 INFO L85 PathProgramCache]: Analyzing trace with hash 255879461, now seen corresponding path program 1 times [2025-01-09 04:00:26,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:00:26,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094576975] [2025-01-09 04:00:26,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:00:26,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:00:26,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-09 04:00:26,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-09 04:00:26,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:00:26,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:00:26,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:00:26,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:00:26,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094576975] [2025-01-09 04:00:26,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094576975] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:00:26,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:00:26,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:00:26,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949674791] [2025-01-09 04:00:26,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:00:26,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:00:26,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:00:26,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:00:26,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:00:26,919 INFO L87 Difference]: Start difference. First operand 210 states and 268 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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) [2025-01-09 04:00:26,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:00:26,948 INFO L93 Difference]: Finished difference Result 418 states and 541 transitions. [2025-01-09 04:00:26,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:00:26,948 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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 38 [2025-01-09 04:00:26,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:00:26,950 INFO L225 Difference]: With dead ends: 418 [2025-01-09 04:00:26,951 INFO L226 Difference]: Without dead ends: 216 [2025-01-09 04:00:26,952 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:00:26,952 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 0 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:00:26,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 293 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:00:26,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2025-01-09 04:00:26,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2025-01-09 04:00:26,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 167 states have (on average 1.3173652694610778) internal successors, (220), 180 states have internal predecessors, (220), 24 states have call successors, (24), 24 states have call predecessors, (24), 24 states have return successors, (30), 24 states have call predecessors, (30), 24 states have call successors, (30) [2025-01-09 04:00:26,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 274 transitions. [2025-01-09 04:00:26,974 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 274 transitions. Word has length 38 [2025-01-09 04:00:26,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:00:26,974 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 274 transitions. [2025-01-09 04:00:26,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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) [2025-01-09 04:00:26,974 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 274 transitions. [2025-01-09 04:00:26,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-01-09 04:00:26,975 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:00:26,975 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:00:26,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 04:00:26,976 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:00:26,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:00:26,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1332468441, now seen corresponding path program 1 times [2025-01-09 04:00:26,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:00:26,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952122266] [2025-01-09 04:00:26,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:00:26,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:00:26,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-09 04:00:26,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-09 04:00:27,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:00:27,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:00:27,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:00:27,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:00:27,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952122266] [2025-01-09 04:00:27,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952122266] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:00:27,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:00:27,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:00:27,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085995381] [2025-01-09 04:00:27,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:00:27,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:00:27,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:00:27,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:00:27,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:00:27,086 INFO L87 Difference]: Start difference. First operand 216 states and 274 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 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) [2025-01-09 04:00:27,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:00:27,124 INFO L93 Difference]: Finished difference Result 428 states and 556 transitions. [2025-01-09 04:00:27,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:00:27,128 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 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 38 [2025-01-09 04:00:27,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:00:27,130 INFO L225 Difference]: With dead ends: 428 [2025-01-09 04:00:27,133 INFO L226 Difference]: Without dead ends: 220 [2025-01-09 04:00:27,134 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:00:27,134 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 0 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:00:27,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 362 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:00:27,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2025-01-09 04:00:27,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2025-01-09 04:00:27,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 171 states have (on average 1.3099415204678362) internal successors, (224), 184 states have internal predecessors, (224), 24 states have call successors, (24), 24 states have call predecessors, (24), 24 states have return successors, (30), 24 states have call predecessors, (30), 24 states have call successors, (30) [2025-01-09 04:00:27,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 278 transitions. [2025-01-09 04:00:27,169 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 278 transitions. Word has length 38 [2025-01-09 04:00:27,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:00:27,169 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 278 transitions. [2025-01-09 04:00:27,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 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) [2025-01-09 04:00:27,169 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 278 transitions. [2025-01-09 04:00:27,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-01-09 04:00:27,170 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:00:27,170 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:00:27,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 04:00:27,170 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:00:27,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:00:27,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1273555113, now seen corresponding path program 1 times [2025-01-09 04:00:27,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:00:27,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64657785] [2025-01-09 04:00:27,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:00:27,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:00:27,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-09 04:00:27,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-09 04:00:27,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:00:27,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:00:27,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:00:27,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:00:27,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64657785] [2025-01-09 04:00:27,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64657785] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:00:27,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:00:27,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:00:27,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530404274] [2025-01-09 04:00:27,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:00:27,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:00:27,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:00:27,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:00:27,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:00:27,242 INFO L87 Difference]: Start difference. First operand 220 states and 278 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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) [2025-01-09 04:00:27,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:00:27,272 INFO L93 Difference]: Finished difference Result 544 states and 697 transitions. [2025-01-09 04:00:27,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:00:27,272 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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 38 [2025-01-09 04:00:27,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:00:27,274 INFO L225 Difference]: With dead ends: 544 [2025-01-09 04:00:27,274 INFO L226 Difference]: Without dead ends: 332 [2025-01-09 04:00:27,275 INFO L434 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 [2025-01-09 04:00:27,275 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 38 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:00:27,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 140 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:00:27,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2025-01-09 04:00:27,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332. [2025-01-09 04:00:27,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 258 states have (on average 1.2790697674418605) internal successors, (330), 274 states have internal predecessors, (330), 38 states have call successors, (38), 38 states have call predecessors, (38), 35 states have return successors, (45), 35 states have call predecessors, (45), 38 states have call successors, (45) [2025-01-09 04:00:27,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 413 transitions. [2025-01-09 04:00:27,310 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 413 transitions. Word has length 38 [2025-01-09 04:00:27,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:00:27,310 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 413 transitions. [2025-01-09 04:00:27,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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) [2025-01-09 04:00:27,311 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 413 transitions. [2025-01-09 04:00:27,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-01-09 04:00:27,314 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:00:27,314 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:00:27,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 04:00:27,314 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:00:27,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:00:27,315 INFO L85 PathProgramCache]: Analyzing trace with hash -112740913, now seen corresponding path program 1 times [2025-01-09 04:00:27,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:00:27,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133852711] [2025-01-09 04:00:27,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:00:27,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:00:27,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 04:00:27,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 04:00:27,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:00:27,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:00:27,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:00:27,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:00:27,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133852711] [2025-01-09 04:00:27,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133852711] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:00:27,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:00:27,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:00:27,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430110701] [2025-01-09 04:00:27,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:00:27,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:00:27,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:00:27,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:00:27,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:00:27,383 INFO L87 Difference]: Start difference. First operand 332 states and 413 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 04:00:27,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:00:27,414 INFO L93 Difference]: Finished difference Result 482 states and 610 transitions. [2025-01-09 04:00:27,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:00:27,415 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 42 [2025-01-09 04:00:27,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:00:27,419 INFO L225 Difference]: With dead ends: 482 [2025-01-09 04:00:27,419 INFO L226 Difference]: Without dead ends: 480 [2025-01-09 04:00:27,419 INFO L434 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 [2025-01-09 04:00:27,422 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 45 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:00:27,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 143 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:00:27,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2025-01-09 04:00:27,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 435. [2025-01-09 04:00:27,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 340 states have (on average 1.3) internal successors, (442), 362 states have internal predecessors, (442), 49 states have call successors, (49), 49 states have call predecessors, (49), 45 states have return successors, (68), 45 states have call predecessors, (68), 49 states have call successors, (68) [2025-01-09 04:00:27,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 559 transitions. [2025-01-09 04:00:27,450 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 559 transitions. Word has length 42 [2025-01-09 04:00:27,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:00:27,451 INFO L471 AbstractCegarLoop]: Abstraction has 435 states and 559 transitions. [2025-01-09 04:00:27,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 04:00:27,452 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 559 transitions. [2025-01-09 04:00:27,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-01-09 04:00:27,453 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:00:27,454 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:00:27,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 04:00:27,454 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:00:27,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:00:27,455 INFO L85 PathProgramCache]: Analyzing trace with hash 572946731, now seen corresponding path program 1 times [2025-01-09 04:00:27,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:00:27,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196901589] [2025-01-09 04:00:27,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:00:27,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:00:27,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-09 04:00:27,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-09 04:00:27,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:00:27,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:00:27,611 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 04:00:27,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:00:27,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196901589] [2025-01-09 04:00:27,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196901589] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:00:27,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [566526361] [2025-01-09 04:00:27,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:00:27,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:00:27,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:00:27,616 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:00:27,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 04:00:27,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-09 04:00:27,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-09 04:00:27,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:00:27,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:00:27,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-09 04:00:27,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:00:27,815 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-09 04:00:27,816 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:00:27,902 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 04:00:27,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [566526361] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 04:00:27,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 04:00:27,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 5] total 11 [2025-01-09 04:00:27,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623103600] [2025-01-09 04:00:27,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:00:27,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:00:27,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:00:27,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:00:27,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-01-09 04:00:27,904 INFO L87 Difference]: Start difference. First operand 435 states and 559 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:00:27,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:00:27,996 INFO L93 Difference]: Finished difference Result 1235 states and 1634 transitions. [2025-01-09 04:00:27,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 04:00:27,996 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 72 [2025-01-09 04:00:27,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:00:28,000 INFO L225 Difference]: With dead ends: 1235 [2025-01-09 04:00:28,001 INFO L226 Difference]: Without dead ends: 808 [2025-01-09 04:00:28,002 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 140 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-01-09 04:00:28,003 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 42 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:00:28,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 346 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:00:28,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2025-01-09 04:00:28,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 743. [2025-01-09 04:00:28,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 743 states, 573 states have (on average 1.268760907504363) internal successors, (727), 612 states have internal predecessors, (727), 87 states have call successors, (87), 87 states have call predecessors, (87), 82 states have return successors, (123), 80 states have call predecessors, (123), 87 states have call successors, (123) [2025-01-09 04:00:28,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 937 transitions. [2025-01-09 04:00:28,056 INFO L78 Accepts]: Start accepts. Automaton has 743 states and 937 transitions. Word has length 72 [2025-01-09 04:00:28,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:00:28,056 INFO L471 AbstractCegarLoop]: Abstraction has 743 states and 937 transitions. [2025-01-09 04:00:28,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:00:28,056 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 937 transitions. [2025-01-09 04:00:28,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-01-09 04:00:28,058 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:00:28,058 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:00:28,065 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 04:00:28,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-09 04:00:28,260 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:00:28,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:00:28,260 INFO L85 PathProgramCache]: Analyzing trace with hash 367224431, now seen corresponding path program 1 times [2025-01-09 04:00:28,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:00:28,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309084576] [2025-01-09 04:00:28,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:00:28,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:00:28,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-09 04:00:28,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-09 04:00:28,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:00:28,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 04:00:28,274 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 04:00:28,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-09 04:00:28,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-09 04:00:28,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:00:28,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 04:00:28,307 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 04:00:28,307 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 04:00:28,308 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 04:00:28,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 04:00:28,312 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:00:28,363 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 04:00:28,365 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 04:00:28 BoogieIcfgContainer [2025-01-09 04:00:28,365 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 04:00:28,366 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 04:00:28,366 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 04:00:28,366 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 04:00:28,366 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:00:25" (3/4) ... [2025-01-09 04:00:28,367 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-01-09 04:00:28,440 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 65. [2025-01-09 04:00:28,490 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 04:00:28,490 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 04:00:28,490 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 04:00:28,491 INFO L158 Benchmark]: Toolchain (without parser) took 3212.79ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 104.9MB in the beginning and 244.3MB in the end (delta: -139.5MB). Peak memory consumption was 77.6MB. Max. memory is 16.1GB. [2025-01-09 04:00:28,491 INFO L158 Benchmark]: CDTParser took 0.50ms. Allocated memory is still 201.3MB. Free memory is still 126.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 04:00:28,491 INFO L158 Benchmark]: CACSL2BoogieTranslator took 327.36ms. Allocated memory is still 142.6MB. Free memory was 104.9MB in the beginning and 86.7MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 04:00:28,491 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.73ms. Allocated memory is still 142.6MB. Free memory was 86.7MB in the beginning and 84.7MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 04:00:28,491 INFO L158 Benchmark]: Boogie Preprocessor took 24.18ms. Allocated memory is still 142.6MB. Free memory was 84.7MB in the beginning and 83.2MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 04:00:28,491 INFO L158 Benchmark]: RCFGBuilder took 271.81ms. Allocated memory is still 142.6MB. Free memory was 83.2MB in the beginning and 67.5MB in the end (delta: 15.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 04:00:28,492 INFO L158 Benchmark]: TraceAbstraction took 2433.02ms. Allocated memory is still 142.6MB. Free memory was 66.5MB in the beginning and 36.4MB in the end (delta: 30.1MB). Peak memory consumption was 27.2MB. Max. memory is 16.1GB. [2025-01-09 04:00:28,492 INFO L158 Benchmark]: Witness Printer took 124.33ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 36.4MB in the beginning and 244.3MB in the end (delta: -207.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 04:00:28,493 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.50ms. Allocated memory is still 201.3MB. Free memory is still 126.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 327.36ms. Allocated memory is still 142.6MB. Free memory was 104.9MB in the beginning and 86.7MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.73ms. Allocated memory is still 142.6MB. Free memory was 86.7MB in the beginning and 84.7MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 24.18ms. Allocated memory is still 142.6MB. Free memory was 84.7MB in the beginning and 83.2MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 271.81ms. Allocated memory is still 142.6MB. Free memory was 83.2MB in the beginning and 67.5MB in the end (delta: 15.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 2433.02ms. Allocated memory is still 142.6MB. Free memory was 66.5MB in the beginning and 36.4MB in the end (delta: 30.1MB). Peak memory consumption was 27.2MB. Max. memory is 16.1GB. * Witness Printer took 124.33ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 36.4MB in the beginning and 244.3MB in the end (delta: -207.9MB). 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,"libacc.i","") [49] - GenericResultAtLocation [Line: 415]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [415] - GenericResultAtLocation [Line: 593]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [593] - GenericResultAtLocation [Line: 663]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [663] - GenericResultAtLocation [Line: 703]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [703] - GenericResultAtLocation [Line: 741]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [741] - GenericResultAtLocation [Line: 750]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [750] - GenericResultAtLocation [Line: 847]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [847] * 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 - CounterExampleResult [Line: 746]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L219] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L426] int pumpRunning = 0; [L427] int systemActive = 1; [L665] int methAndRunningLastTime ; [L751] int cleanupTimeShifts = 4; [L849] int waterLevel = 1; [L850] int methaneLevelCritical = 0; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L825] int retValue_acc ; [L826] int tmp ; [L830] FCALL select_helpers() [L831] FCALL select_features() [L832] CALL, EXPR valid_product() [L733] int retValue_acc ; [L736] retValue_acc = 1 [L737] return (retValue_acc); VAL [\result=1, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L832] RET, EXPR valid_product() [L832] tmp = valid_product() [L834] COND TRUE \read(tmp) [L836] FCALL setup() [L837] CALL runTest() [L818] CALL __utac_acc__Specification2_spec__1() [L670] methAndRunningLastTime = 0 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L818] RET __utac_acc__Specification2_spec__1() [L819] CALL test() [L598] int splverifierCounter ; [L599] int tmp ; [L600] int tmp___0 ; [L601] int tmp___1 ; [L602] int tmp___2 ; [L605] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L609] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L615] tmp = __VERIFIER_nondet_int() [L617] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L619] CALL waterRise() VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L867] COND TRUE waterLevel < 2 [L868] waterLevel = waterLevel + 1 VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L619] RET waterRise() VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L625] tmp___0 = __VERIFIER_nondet_int() [L627] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L629] CALL changeMethaneLevel() VAL [\old(methaneLevelCritical)=0, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L879] COND FALSE !(\read(methaneLevelCritical)) [L882] methaneLevelCritical = 1 VAL [\old(methaneLevelCritical)=0, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L629] RET changeMethaneLevel() VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L635] tmp___2 = __VERIFIER_nondet_int() [L637] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L652] CALL timeShift() VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L434] COND FALSE !(\read(pumpRunning)) VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L441] COND TRUE \read(systemActive) [L443] CALL processEnvironment() [L463] int tmp ; VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L466] COND TRUE ! pumpRunning [L468] CALL, EXPR isHighWaterLevel() [L560] int retValue_acc ; [L561] int tmp ; [L562] int tmp___0 ; [L566] CALL, EXPR isHighWaterSensorDry() [L929] int retValue_acc ; VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L932] COND FALSE !(waterLevel < 2) [L936] retValue_acc = 0 [L937] return (retValue_acc); VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, \result=0, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L566] RET, EXPR isHighWaterSensorDry() [L566] tmp = isHighWaterSensorDry() [L568] COND FALSE !(\read(tmp)) [L571] tmp___0 = 1 VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, tmp___0=1, waterLevel=2] [L573] retValue_acc = tmp___0 [L574] return (retValue_acc); VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, \result=1, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L468] RET, EXPR isHighWaterLevel() [L468] tmp = isHighWaterLevel() [L470] COND TRUE \read(tmp) [L472] CALL activatePump() [L491] pumpRunning = 1 VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L472] RET activatePump() [L443] RET processEnvironment() [L449] CALL __utac_acc__Specification2_spec__2() [L675] int tmp ; [L676] int tmp___0 ; VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L680] CALL, EXPR isMethaneLevelCritical() VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L888] int retValue_acc ; [L891] retValue_acc = methaneLevelCritical [L892] return (retValue_acc); VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, \result=1, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L680] RET, EXPR isMethaneLevelCritical() VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L680] tmp = isMethaneLevelCritical() [L682] COND TRUE \read(tmp) [L684] CALL, EXPR isPumpRunning() [L515] int retValue_acc ; [L518] retValue_acc = pumpRunning [L519] return (retValue_acc); VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, \result=1, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L684] RET, EXPR isPumpRunning() [L684] tmp___0 = isPumpRunning() [L686] COND TRUE \read(tmp___0) VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L687] COND FALSE !(\read(methAndRunningLastTime)) [L692] methAndRunningLastTime = 1 VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L449] RET __utac_acc__Specification2_spec__2() [L652] RET timeShift() VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L609] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L615] tmp = __VERIFIER_nondet_int() [L617] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L625] tmp___0 = __VERIFIER_nondet_int() [L627] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L635] tmp___2 = __VERIFIER_nondet_int() [L637] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L652] CALL timeShift() VAL [\old(methAndRunningLastTime)=1, \old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L434] COND TRUE \read(pumpRunning) [L436] CALL lowerWaterLevel() [L855] COND TRUE waterLevel > 0 [L856] waterLevel = waterLevel - 1 VAL [\old(methAndRunningLastTime)=1, \old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L436] RET lowerWaterLevel() [L441] COND TRUE \read(systemActive) [L443] CALL processEnvironment() [L463] int tmp ; VAL [\old(methAndRunningLastTime)=1, \old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L466] COND FALSE !(! pumpRunning) VAL [\old(methAndRunningLastTime)=1, \old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L481] FCALL processEnvironment__wrappee__base() VAL [\old(methAndRunningLastTime)=1, \old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L443] RET processEnvironment() [L449] CALL __utac_acc__Specification2_spec__2() [L675] int tmp ; [L676] int tmp___0 ; VAL [\old(methAndRunningLastTime)=1, \old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L680] CALL, EXPR isMethaneLevelCritical() VAL [\old(methAndRunningLastTime)=1, \old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L888] int retValue_acc ; [L891] retValue_acc = methaneLevelCritical [L892] return (retValue_acc); VAL [\old(methAndRunningLastTime)=1, \old(pumpRunning)=1, \old(waterLevel)=2, \result=1, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L680] RET, EXPR isMethaneLevelCritical() VAL [\old(methAndRunningLastTime)=1, \old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L680] tmp = isMethaneLevelCritical() [L682] COND TRUE \read(tmp) [L684] CALL, EXPR isPumpRunning() [L515] int retValue_acc ; [L518] retValue_acc = pumpRunning [L519] return (retValue_acc); VAL [\old(methAndRunningLastTime)=1, \old(pumpRunning)=1, \old(waterLevel)=2, \result=1, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L684] RET, EXPR isPumpRunning() [L684] tmp___0 = isPumpRunning() [L686] COND TRUE \read(tmp___0) VAL [\old(methAndRunningLastTime)=1, \old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L687] COND TRUE \read(methAndRunningLastTime) [L689] CALL __automaton_fail() [L746] reach_error() VAL [\old(methAndRunningLastTime)=1, \old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 78 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.3s, OverallIterations: 11, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 415 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 411 mSDsluCounter, 2250 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1457 mSDsCounter, 32 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 183 IncrementalHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 32 mSolverCounterUnsat, 793 mSDtfsCounter, 183 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 197 GetRequests, 163 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=743occurred in iteration=10, InterpolantAutomatonStates: 43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 122 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 522 NumberOfCodeBlocks, 522 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 506 ConstructedInterpolants, 0 QuantifiedInterpolants, 1056 SizeOfPredicates, 1 NumberOfNonLiveVariables, 262 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 12 InterpolantComputations, 10 PerfectInterpolantSequences, 62/66 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, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-01-09 04:00:28,506 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE