./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec4_product48.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_spec4_product48.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 3a211ea3558de7a91964968ab789e94c34171c05a0686de6a2a53ff72a198e9d --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:02:16,476 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:02:16,540 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:02:16,545 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:02:16,548 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:02:16,572 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:02:16,574 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:02:16,574 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:02:16,574 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:02:16,575 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:02:16,575 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:02:16,575 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:02:16,575 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:02:16,576 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:02:16,576 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:02:16,576 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:02:16,576 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:02:16,576 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:02:16,577 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:02:16,577 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:02:16,577 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:02:16,577 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:02:16,577 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:02:16,577 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:02:16,577 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:02:16,577 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:02:16,577 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:02:16,577 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:02:16,577 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:02:16,577 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:02:16,578 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:02:16,578 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:02:16,578 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:02:16,578 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:02:16,578 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:02:16,578 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:02:16,578 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:02:16,578 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:02:16,578 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:02:16,579 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:02:16,579 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:02:16,579 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:02:16,579 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:02:16,579 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:02:16,579 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:02:16,579 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:02:16,579 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:02:16,579 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:02:16,580 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 -> 3a211ea3558de7a91964968ab789e94c34171c05a0686de6a2a53ff72a198e9d [2025-01-09 04:02:16,792 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:02:16,800 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:02:16,803 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:02:16,804 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:02:16,804 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:02:16,806 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec4_product48.cil.c [2025-01-09 04:02:18,034 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0936ea47c/7aede72cdcf54da6870d0676ed278a05/FLAG0e0067716 [2025-01-09 04:02:18,290 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:02:18,294 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product48.cil.c [2025-01-09 04:02:18,309 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0936ea47c/7aede72cdcf54da6870d0676ed278a05/FLAG0e0067716 [2025-01-09 04:02:18,329 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0936ea47c/7aede72cdcf54da6870d0676ed278a05 [2025-01-09 04:02:18,330 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:02:18,333 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:02:18,336 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:02:18,337 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:02:18,340 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:02:18,342 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:02:18" (1/1) ... [2025-01-09 04:02:18,342 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5627fa73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:02:18, skipping insertion in model container [2025-01-09 04:02:18,343 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:02:18" (1/1) ... [2025-01-09 04:02:18,370 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:02:18,560 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_spec4_product48.cil.c[11718,11731] [2025-01-09 04:02:18,603 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:02:18,612 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:02:18,619 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification4_spec.i","") [49] [2025-01-09 04:02:18,620 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [78] [2025-01-09 04:02:18,620 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [444] [2025-01-09 04:02:18,620 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [453] [2025-01-09 04:02:18,620 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [557] [2025-01-09 04:02:18,620 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [783] [2025-01-09 04:02:18,620 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [877] [2025-01-09 04:02:18,620 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [946] [2025-01-09 04:02:18,659 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_spec4_product48.cil.c[11718,11731] [2025-01-09 04:02:18,678 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:02:18,698 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:02:18,700 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:02:18 WrapperNode [2025-01-09 04:02:18,700 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:02:18,701 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:02:18,701 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:02:18,701 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:02:18,707 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:02:18" (1/1) ... [2025-01-09 04:02:18,720 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:02:18" (1/1) ... [2025-01-09 04:02:18,740 INFO L138 Inliner]: procedures = 56, calls = 102, calls flagged for inlining = 24, calls inlined = 21, statements flattened = 209 [2025-01-09 04:02:18,742 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:02:18,743 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:02:18,743 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:02:18,743 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:02:18,749 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:02:18" (1/1) ... [2025-01-09 04:02:18,750 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:02:18" (1/1) ... [2025-01-09 04:02:18,751 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:02:18" (1/1) ... [2025-01-09 04:02:18,766 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:02:18,773 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:02:18" (1/1) ... [2025-01-09 04:02:18,773 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:02:18" (1/1) ... [2025-01-09 04:02:18,776 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:02:18" (1/1) ... [2025-01-09 04:02:18,781 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:02:18" (1/1) ... [2025-01-09 04:02:18,784 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:02:18" (1/1) ... [2025-01-09 04:02:18,788 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:02:18" (1/1) ... [2025-01-09 04:02:18,789 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:02:18" (1/1) ... [2025-01-09 04:02:18,790 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:02:18,794 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:02:18,794 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:02:18,795 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:02:18,795 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:02:18" (1/1) ... [2025-01-09 04:02:18,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:02:18,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:02:18,827 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:02:18,833 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:02:18,851 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:02:18,851 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2025-01-09 04:02:18,851 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2025-01-09 04:02:18,851 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-01-09 04:02:18,852 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-01-09 04:02:18,852 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-01-09 04:02:18,852 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-01-09 04:02:18,852 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2025-01-09 04:02:18,852 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2025-01-09 04:02:18,852 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__methaneQuery [2025-01-09 04:02:18,852 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__methaneQuery [2025-01-09 04:02:18,852 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneAlarm [2025-01-09 04:02:18,853 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneAlarm [2025-01-09 04:02:18,853 INFO L130 BoogieDeclarations]: Found specification of procedure deactivatePump [2025-01-09 04:02:18,853 INFO L138 BoogieDeclarations]: Found implementation of procedure deactivatePump [2025-01-09 04:02:18,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:02:18,853 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2025-01-09 04:02:18,853 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2025-01-09 04:02:18,853 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:02:18,854 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:02:18,909 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:02:18,910 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:02:19,139 INFO L? ?]: Removed 44 outVars from TransFormulas that were not future-live. [2025-01-09 04:02:19,139 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:02:19,153 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:02:19,153 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-09 04:02:19,153 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:02:19 BoogieIcfgContainer [2025-01-09 04:02:19,153 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:02:19,156 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:02:19,156 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:02:19,159 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:02:19,159 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:02:18" (1/3) ... [2025-01-09 04:02:19,160 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8c773f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:02:19, skipping insertion in model container [2025-01-09 04:02:19,160 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:02:18" (2/3) ... [2025-01-09 04:02:19,161 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8c773f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:02:19, skipping insertion in model container [2025-01-09 04:02:19,161 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:02:19" (3/3) ... [2025-01-09 04:02:19,162 INFO L128 eAbstractionObserver]: Analyzing ICFG minepump_spec4_product48.cil.c [2025-01-09 04:02:19,173 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:02:19,176 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG minepump_spec4_product48.cil.c that has 9 procedures, 94 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-01-09 04:02:19,227 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:02:19,240 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;@104bc2b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:02:19,240 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 04:02:19,244 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 70 states have (on average 1.3571428571428572) internal successors, (95), 79 states have internal predecessors, (95), 14 states have call successors, (14), 8 states have call predecessors, (14), 8 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 04:02:19,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-01-09 04:02:19,250 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:02:19,251 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:02:19,251 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:02:19,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:02:19,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1086134978, now seen corresponding path program 1 times [2025-01-09 04:02:19,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:02:19,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138788142] [2025-01-09 04:02:19,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:02:19,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:02:19,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-09 04:02:19,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-09 04:02:19,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:02:19,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:02:19,413 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:02:19,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:02:19,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138788142] [2025-01-09 04:02:19,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138788142] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:02:19,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:02:19,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 04:02:19,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845601954] [2025-01-09 04:02:19,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:02:19,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 04:02:19,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:02:19,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 04:02:19,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 04:02:19,437 INFO L87 Difference]: Start difference. First operand has 94 states, 70 states have (on average 1.3571428571428572) internal successors, (95), 79 states have internal predecessors, (95), 14 states have call successors, (14), 8 states have call predecessors, (14), 8 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:02:19,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:02:19,461 INFO L93 Difference]: Finished difference Result 180 states and 241 transitions. [2025-01-09 04:02:19,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 04:02:19,463 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-01-09 04:02:19,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:02:19,467 INFO L225 Difference]: With dead ends: 180 [2025-01-09 04:02:19,467 INFO L226 Difference]: Without dead ends: 85 [2025-01-09 04:02:19,471 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:02:19,472 INFO L435 NwaCegarLoop]: 119 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, 119 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:02:19,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:02:19,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-01-09 04:02:19,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2025-01-09 04:02:19,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 63 states have (on average 1.3174603174603174) internal successors, (83), 71 states have internal predecessors, (83), 14 states have call successors, (14), 8 states have call predecessors, (14), 7 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-09 04:02:19,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 110 transitions. [2025-01-09 04:02:19,507 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 110 transitions. Word has length 19 [2025-01-09 04:02:19,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:02:19,507 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 110 transitions. [2025-01-09 04:02:19,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:02:19,510 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 110 transitions. [2025-01-09 04:02:19,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-01-09 04:02:19,511 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:02:19,511 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:02:19,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:02:19,512 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:02:19,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:02:19,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1824159978, now seen corresponding path program 1 times [2025-01-09 04:02:19,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:02:19,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991771838] [2025-01-09 04:02:19,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:02:19,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:02:19,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-09 04:02:19,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-09 04:02:19,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:02:19,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:02:19,597 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:02:19,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:02:19,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991771838] [2025-01-09 04:02:19,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991771838] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:02:19,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:02:19,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:02:19,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054508821] [2025-01-09 04:02:19,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:02:19,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:02:19,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:02:19,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:02:19,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:02:19,599 INFO L87 Difference]: Start difference. First operand 85 states and 110 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:02:19,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:02:19,615 INFO L93 Difference]: Finished difference Result 133 states and 171 transitions. [2025-01-09 04:02:19,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:02:19,617 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-01-09 04:02:19,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:02:19,618 INFO L225 Difference]: With dead ends: 133 [2025-01-09 04:02:19,619 INFO L226 Difference]: Without dead ends: 77 [2025-01-09 04:02:19,619 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:02:19,620 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 17 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 175 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:02:19,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 175 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:02:19,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-01-09 04:02:19,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-01-09 04:02:19,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 58 states have (on average 1.3275862068965518) internal successors, (77), 66 states have internal predecessors, (77), 11 states have call successors, (11), 7 states have call predecessors, (11), 7 states have return successors, (11), 8 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 04:02:19,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 99 transitions. [2025-01-09 04:02:19,627 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 99 transitions. Word has length 19 [2025-01-09 04:02:19,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:02:19,627 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 99 transitions. [2025-01-09 04:02:19,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:02:19,627 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 99 transitions. [2025-01-09 04:02:19,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-09 04:02:19,628 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:02:19,628 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] [2025-01-09 04:02:19,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:02:19,628 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:02:19,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:02:19,628 INFO L85 PathProgramCache]: Analyzing trace with hash 200395945, now seen corresponding path program 1 times [2025-01-09 04:02:19,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:02:19,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494988142] [2025-01-09 04:02:19,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:02:19,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:02:19,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 04:02:19,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 04:02:19,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:02:19,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:02:19,704 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:02:19,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:02:19,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494988142] [2025-01-09 04:02:19,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494988142] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:02:19,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:02:19,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:02:19,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863534554] [2025-01-09 04:02:19,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:02:19,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:02:19,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:02:19,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:02:19,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:02:19,707 INFO L87 Difference]: Start difference. First operand 77 states and 99 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:02:19,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:02:19,739 INFO L93 Difference]: Finished difference Result 215 states and 282 transitions. [2025-01-09 04:02:19,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:02:19,743 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-01-09 04:02:19,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:02:19,745 INFO L225 Difference]: With dead ends: 215 [2025-01-09 04:02:19,745 INFO L226 Difference]: Without dead ends: 145 [2025-01-09 04:02:19,745 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:02:19,745 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 91 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:02:19,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 197 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:02:19,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-01-09 04:02:19,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 142. [2025-01-09 04:02:19,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 105 states have (on average 1.3523809523809525) internal successors, (142), 120 states have internal predecessors, (142), 22 states have call successors, (22), 14 states have call predecessors, (22), 14 states have return successors, (22), 15 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 04:02:19,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 186 transitions. [2025-01-09 04:02:19,764 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 186 transitions. Word has length 24 [2025-01-09 04:02:19,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:02:19,764 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 186 transitions. [2025-01-09 04:02:19,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:02:19,764 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 186 transitions. [2025-01-09 04:02:19,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-09 04:02:19,765 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:02:19,765 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] [2025-01-09 04:02:19,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 04:02:19,765 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:02:19,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:02:19,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1706974220, now seen corresponding path program 1 times [2025-01-09 04:02:19,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:02:19,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499824750] [2025-01-09 04:02:19,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:02:19,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:02:19,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 04:02:19,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 04:02:19,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:02:19,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:02:19,883 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:02:19,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:02:19,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499824750] [2025-01-09 04:02:19,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499824750] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:02:19,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:02:19,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:02:19,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368485451] [2025-01-09 04:02:19,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:02:19,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:02:19,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:02:19,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:02:19,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:02:19,884 INFO L87 Difference]: Start difference. First operand 142 states and 186 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:02:19,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:02:19,965 INFO L93 Difference]: Finished difference Result 400 states and 543 transitions. [2025-01-09 04:02:19,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:02:19,967 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-01-09 04:02:19,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:02:19,969 INFO L225 Difference]: With dead ends: 400 [2025-01-09 04:02:19,969 INFO L226 Difference]: Without dead ends: 265 [2025-01-09 04:02:19,969 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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:02:19,970 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 65 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:02:19,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 362 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:02:19,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2025-01-09 04:02:19,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265. [2025-01-09 04:02:19,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 194 states have (on average 1.3298969072164948) internal successors, (258), 221 states have internal predecessors, (258), 44 states have call successors, (44), 28 states have call predecessors, (44), 26 states have return successors, (46), 28 states have call predecessors, (46), 44 states have call successors, (46) [2025-01-09 04:02:19,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 348 transitions. [2025-01-09 04:02:19,991 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 348 transitions. Word has length 27 [2025-01-09 04:02:19,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:02:19,991 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 348 transitions. [2025-01-09 04:02:19,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:02:19,991 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 348 transitions. [2025-01-09 04:02:19,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-01-09 04:02:19,992 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:02:19,993 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:02:19,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 04:02:19,993 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:02:19,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:02:19,993 INFO L85 PathProgramCache]: Analyzing trace with hash 993999249, now seen corresponding path program 1 times [2025-01-09 04:02:19,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:02:19,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195494514] [2025-01-09 04:02:19,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:02:19,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:02:20,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 04:02:20,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 04:02:20,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:02:20,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:02:20,050 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:02:20,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:02:20,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195494514] [2025-01-09 04:02:20,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195494514] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:02:20,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:02:20,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 04:02:20,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745679985] [2025-01-09 04:02:20,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:02:20,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:02:20,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:02:20,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:02:20,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:02:20,051 INFO L87 Difference]: Start difference. First operand 265 states and 348 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:02:20,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:02:20,107 INFO L93 Difference]: Finished difference Result 651 states and 871 transitions. [2025-01-09 04:02:20,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:02:20,110 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-01-09 04:02:20,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:02:20,113 INFO L225 Difference]: With dead ends: 651 [2025-01-09 04:02:20,113 INFO L226 Difference]: Without dead ends: 393 [2025-01-09 04:02:20,116 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:02:20,118 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 61 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:02:20,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 155 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:02:20,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2025-01-09 04:02:20,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 384. [2025-01-09 04:02:20,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 293 states have (on average 1.286689419795222) internal successors, (377), 317 states have internal predecessors, (377), 47 states have call successors, (47), 45 states have call predecessors, (47), 43 states have return successors, (65), 42 states have call predecessors, (65), 47 states have call successors, (65) [2025-01-09 04:02:20,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 489 transitions. [2025-01-09 04:02:20,148 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 489 transitions. Word has length 29 [2025-01-09 04:02:20,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:02:20,148 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 489 transitions. [2025-01-09 04:02:20,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:02:20,148 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 489 transitions. [2025-01-09 04:02:20,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-01-09 04:02:20,150 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:02:20,150 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] [2025-01-09 04:02:20,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 04:02:20,152 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:02:20,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:02:20,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1036147570, now seen corresponding path program 1 times [2025-01-09 04:02:20,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:02:20,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162512080] [2025-01-09 04:02:20,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:02:20,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:02:20,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 04:02:20,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 04:02:20,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:02:20,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:02:20,250 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:02:20,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:02:20,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162512080] [2025-01-09 04:02:20,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162512080] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:02:20,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:02:20,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:02:20,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228334162] [2025-01-09 04:02:20,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:02:20,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:02:20,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:02:20,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:02:20,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:02:20,251 INFO L87 Difference]: Start difference. First operand 384 states and 489 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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:02:20,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:02:20,317 INFO L93 Difference]: Finished difference Result 386 states and 490 transitions. [2025-01-09 04:02:20,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:02:20,317 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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 31 [2025-01-09 04:02:20,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:02:20,321 INFO L225 Difference]: With dead ends: 386 [2025-01-09 04:02:20,321 INFO L226 Difference]: Without dead ends: 384 [2025-01-09 04:02:20,321 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:02:20,322 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 54 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:02:20,323 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 336 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:02:20,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2025-01-09 04:02:20,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 384. [2025-01-09 04:02:20,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 293 states have (on average 1.2798634812286689) internal successors, (375), 317 states have internal predecessors, (375), 47 states have call successors, (47), 45 states have call predecessors, (47), 43 states have return successors, (65), 42 states have call predecessors, (65), 47 states have call successors, (65) [2025-01-09 04:02:20,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 487 transitions. [2025-01-09 04:02:20,353 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 487 transitions. Word has length 31 [2025-01-09 04:02:20,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:02:20,354 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 487 transitions. [2025-01-09 04:02:20,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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:02:20,355 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 487 transitions. [2025-01-09 04:02:20,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-01-09 04:02:20,357 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:02:20,357 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:02:20,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 04:02:20,357 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:02:20,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:02:20,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1544709122, now seen corresponding path program 1 times [2025-01-09 04:02:20,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:02:20,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788460490] [2025-01-09 04:02:20,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:02:20,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:02:20,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 04:02:20,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 04:02:20,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:02:20,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:02:20,427 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:02:20,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:02:20,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788460490] [2025-01-09 04:02:20,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788460490] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:02:20,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:02:20,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:02:20,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439833558] [2025-01-09 04:02:20,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:02:20,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:02:20,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:02:20,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:02:20,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:02:20,428 INFO L87 Difference]: Start difference. First operand 384 states and 487 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 04:02:20,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:02:20,467 INFO L93 Difference]: Finished difference Result 773 states and 1015 transitions. [2025-01-09 04:02:20,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:02:20,468 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 50 [2025-01-09 04:02:20,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:02:20,470 INFO L225 Difference]: With dead ends: 773 [2025-01-09 04:02:20,471 INFO L226 Difference]: Without dead ends: 396 [2025-01-09 04:02:20,472 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:02:20,473 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 0 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:02:20,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 378 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:02:20,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2025-01-09 04:02:20,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 396. [2025-01-09 04:02:20,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 305 states have (on average 1.2688524590163934) internal successors, (387), 329 states have internal predecessors, (387), 47 states have call successors, (47), 45 states have call predecessors, (47), 43 states have return successors, (65), 42 states have call predecessors, (65), 47 states have call successors, (65) [2025-01-09 04:02:20,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 499 transitions. [2025-01-09 04:02:20,496 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 499 transitions. Word has length 50 [2025-01-09 04:02:20,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:02:20,496 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 499 transitions. [2025-01-09 04:02:20,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 04:02:20,497 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 499 transitions. [2025-01-09 04:02:20,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-01-09 04:02:20,499 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:02:20,499 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:02:20,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 04:02:20,500 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:02:20,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:02:20,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1763563840, now seen corresponding path program 1 times [2025-01-09 04:02:20,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:02:20,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835876366] [2025-01-09 04:02:20,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:02:20,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:02:20,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 04:02:20,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 04:02:20,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:02:20,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:02:20,575 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:02:20,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:02:20,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835876366] [2025-01-09 04:02:20,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835876366] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:02:20,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:02:20,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:02:20,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287915523] [2025-01-09 04:02:20,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:02:20,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:02:20,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:02:20,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:02:20,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:02:20,577 INFO L87 Difference]: Start difference. First operand 396 states and 499 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 04:02:20,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:02:20,601 INFO L93 Difference]: Finished difference Result 705 states and 910 transitions. [2025-01-09 04:02:20,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:02:20,602 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 50 [2025-01-09 04:02:20,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:02:20,603 INFO L225 Difference]: With dead ends: 705 [2025-01-09 04:02:20,603 INFO L226 Difference]: Without dead ends: 316 [2025-01-09 04:02:20,604 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:02:20,605 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 0 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:02:20,605 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 285 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:02:20,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2025-01-09 04:02:20,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 316. [2025-01-09 04:02:20,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 243 states have (on average 1.2592592592592593) internal successors, (306), 262 states have internal predecessors, (306), 38 states have call successors, (38), 36 states have call predecessors, (38), 34 states have return successors, (46), 33 states have call predecessors, (46), 38 states have call successors, (46) [2025-01-09 04:02:20,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 390 transitions. [2025-01-09 04:02:20,620 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 390 transitions. Word has length 50 [2025-01-09 04:02:20,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:02:20,620 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 390 transitions. [2025-01-09 04:02:20,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 04:02:20,621 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 390 transitions. [2025-01-09 04:02:20,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-01-09 04:02:20,621 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:02:20,621 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:02:20,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 04:02:20,622 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:02:20,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:02:20,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1629550334, now seen corresponding path program 1 times [2025-01-09 04:02:20,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:02:20,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750865591] [2025-01-09 04:02:20,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:02:20,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:02:20,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 04:02:20,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 04:02:20,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:02:20,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:02:20,724 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:02:20,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:02:20,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750865591] [2025-01-09 04:02:20,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750865591] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:02:20,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:02:20,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:02:20,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985952220] [2025-01-09 04:02:20,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:02:20,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:02:20,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:02:20,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:02:20,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:02:20,727 INFO L87 Difference]: Start difference. First operand 316 states and 390 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 04:02:20,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:02:20,792 INFO L93 Difference]: Finished difference Result 692 states and 910 transitions. [2025-01-09 04:02:20,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:02:20,794 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 50 [2025-01-09 04:02:20,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:02:20,796 INFO L225 Difference]: With dead ends: 692 [2025-01-09 04:02:20,796 INFO L226 Difference]: Without dead ends: 465 [2025-01-09 04:02:20,797 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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:02:20,797 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 55 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:02:20,797 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 522 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:02:20,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2025-01-09 04:02:20,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 460. [2025-01-09 04:02:20,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 351 states have (on average 1.2478632478632479) internal successors, (438), 377 states have internal predecessors, (438), 55 states have call successors, (55), 53 states have call predecessors, (55), 53 states have return successors, (89), 52 states have call predecessors, (89), 55 states have call successors, (89) [2025-01-09 04:02:20,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 582 transitions. [2025-01-09 04:02:20,823 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 582 transitions. Word has length 50 [2025-01-09 04:02:20,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:02:20,823 INFO L471 AbstractCegarLoop]: Abstraction has 460 states and 582 transitions. [2025-01-09 04:02:20,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 04:02:20,823 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 582 transitions. [2025-01-09 04:02:20,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-01-09 04:02:20,824 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:02:20,825 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:02:20,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 04:02:20,826 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:02:20,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:02:20,827 INFO L85 PathProgramCache]: Analyzing trace with hash -481449495, now seen corresponding path program 1 times [2025-01-09 04:02:20,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:02:20,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950912011] [2025-01-09 04:02:20,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:02:20,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:02:20,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-09 04:02:20,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-09 04:02:20,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:02:20,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:02:20,872 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:02:20,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:02:20,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950912011] [2025-01-09 04:02:20,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950912011] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:02:20,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:02:20,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:02:20,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718761876] [2025-01-09 04:02:20,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:02:20,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:02:20,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:02:20,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:02:20,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:02:20,874 INFO L87 Difference]: Start difference. First operand 460 states and 582 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-09 04:02:20,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:02:20,959 INFO L93 Difference]: Finished difference Result 778 states and 987 transitions. [2025-01-09 04:02:20,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:02:20,960 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 72 [2025-01-09 04:02:20,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:02:20,962 INFO L225 Difference]: With dead ends: 778 [2025-01-09 04:02:20,962 INFO L226 Difference]: Without dead ends: 325 [2025-01-09 04:02:20,963 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:02:20,963 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 119 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:02:20,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 231 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:02:20,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2025-01-09 04:02:20,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 319. [2025-01-09 04:02:20,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 246 states have (on average 1.2398373983739837) internal successors, (305), 265 states have internal predecessors, (305), 37 states have call successors, (37), 36 states have call predecessors, (37), 35 states have return successors, (55), 35 states have call predecessors, (55), 37 states have call successors, (55) [2025-01-09 04:02:20,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 397 transitions. [2025-01-09 04:02:20,983 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 397 transitions. Word has length 72 [2025-01-09 04:02:20,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:02:20,983 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 397 transitions. [2025-01-09 04:02:20,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-09 04:02:20,984 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 397 transitions. [2025-01-09 04:02:20,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-01-09 04:02:20,985 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:02:20,985 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:02:20,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 04:02:20,985 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:02:20,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:02:20,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1497233537, now seen corresponding path program 1 times [2025-01-09 04:02:20,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:02:20,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131872013] [2025-01-09 04:02:20,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:02:20,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:02:20,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-09 04:02:21,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-09 04:02:21,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:02:21,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:02:21,105 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 04:02:21,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:02:21,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131872013] [2025-01-09 04:02:21,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131872013] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:02:21,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1991594302] [2025-01-09 04:02:21,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:02:21,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:02:21,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:02:21,109 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:02:21,111 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:02:21,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-09 04:02:21,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-09 04:02:21,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:02:21,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:02:21,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 04:02:21,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:02:21,275 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:02:21,275 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:02:21,398 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 04:02:21,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1991594302] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:02:21,399 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:02:21,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2025-01-09 04:02:21,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586753225] [2025-01-09 04:02:21,399 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:02:21,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:02:21,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:02:21,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:02:21,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:02:21,400 INFO L87 Difference]: Start difference. First operand 319 states and 397 transitions. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-01-09 04:02:21,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:02:21,533 INFO L93 Difference]: Finished difference Result 748 states and 979 transitions. [2025-01-09 04:02:21,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 04:02:21,534 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 86 [2025-01-09 04:02:21,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:02:21,537 INFO L225 Difference]: With dead ends: 748 [2025-01-09 04:02:21,537 INFO L226 Difference]: Without dead ends: 502 [2025-01-09 04:02:21,538 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 168 SyntacticMatches, 5 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-09 04:02:21,539 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 102 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:02:21,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 541 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:02:21,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2025-01-09 04:02:21,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 440. [2025-01-09 04:02:21,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 336 states have (on average 1.2470238095238095) internal successors, (419), 363 states have internal predecessors, (419), 53 states have call successors, (53), 51 states have call predecessors, (53), 50 states have return successors, (85), 47 states have call predecessors, (85), 53 states have call successors, (85) [2025-01-09 04:02:21,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 557 transitions. [2025-01-09 04:02:21,571 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 557 transitions. Word has length 86 [2025-01-09 04:02:21,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:02:21,571 INFO L471 AbstractCegarLoop]: Abstraction has 440 states and 557 transitions. [2025-01-09 04:02:21,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-01-09 04:02:21,571 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 557 transitions. [2025-01-09 04:02:21,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-09 04:02:21,573 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:02:21,574 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 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] [2025-01-09 04:02:21,581 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:02:21,778 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,SelfDestructingSolverStorable10 [2025-01-09 04:02:21,778 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:02:21,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:02:21,779 INFO L85 PathProgramCache]: Analyzing trace with hash -40913788, now seen corresponding path program 2 times [2025-01-09 04:02:21,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:02:21,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648539772] [2025-01-09 04:02:21,779 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 04:02:21,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:02:21,790 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 122 statements into 2 equivalence classes. [2025-01-09 04:02:21,806 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 04:02:21,806 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 04:02:21,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 04:02:21,807 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 04:02:21,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 04:02:21,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 04:02:21,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:02:21,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 04:02:21,849 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 04:02:21,849 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 04:02:21,850 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 04:02:21,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 04:02:21,854 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:02:21,927 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 04:02:21,929 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 04:02:21 BoogieIcfgContainer [2025-01-09 04:02:21,930 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 04:02:21,930 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 04:02:21,930 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 04:02:21,931 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 04:02:21,931 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:02:19" (3/4) ... [2025-01-09 04:02:21,932 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-01-09 04:02:22,020 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 106. [2025-01-09 04:02:22,106 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 04:02:22,106 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 04:02:22,106 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 04:02:22,107 INFO L158 Benchmark]: Toolchain (without parser) took 3773.97ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 105.7MB in the beginning and 218.8MB in the end (delta: -113.1MB). Peak memory consumption was 60.9MB. Max. memory is 16.1GB. [2025-01-09 04:02:22,108 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 04:02:22,108 INFO L158 Benchmark]: CACSL2BoogieTranslator took 364.57ms. Allocated memory is still 142.6MB. Free memory was 105.7MB in the beginning and 87.0MB in the end (delta: 18.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 04:02:22,108 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.29ms. Allocated memory is still 142.6MB. Free memory was 87.0MB in the beginning and 85.1MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 04:02:22,108 INFO L158 Benchmark]: Boogie Preprocessor took 50.73ms. Allocated memory is still 142.6MB. Free memory was 85.1MB in the beginning and 83.2MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 04:02:22,109 INFO L158 Benchmark]: RCFGBuilder took 359.09ms. Allocated memory is still 142.6MB. Free memory was 83.2MB in the beginning and 66.5MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 04:02:22,109 INFO L158 Benchmark]: TraceAbstraction took 2774.16ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 65.6MB in the beginning and 232.6MB in the end (delta: -167.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2025-01-09 04:02:22,110 INFO L158 Benchmark]: Witness Printer took 176.22ms. Allocated memory is still 318.8MB. Free memory was 232.6MB in the beginning and 218.8MB in the end (delta: 13.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 04:02:22,111 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.28ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 364.57ms. Allocated memory is still 142.6MB. Free memory was 105.7MB in the beginning and 87.0MB in the end (delta: 18.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.29ms. Allocated memory is still 142.6MB. Free memory was 87.0MB in the beginning and 85.1MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 50.73ms. Allocated memory is still 142.6MB. Free memory was 85.1MB in the beginning and 83.2MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 359.09ms. Allocated memory is still 142.6MB. Free memory was 83.2MB in the beginning and 66.5MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2774.16ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 65.6MB in the beginning and 232.6MB in the end (delta: -167.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Witness Printer took 176.22ms. Allocated memory is still 318.8MB. Free memory was 232.6MB in the beginning and 218.8MB in the end (delta: 13.8MB). 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,"Specification4_spec.i","") [49] - GenericResultAtLocation [Line: 78]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [78] - GenericResultAtLocation [Line: 444]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [444] - GenericResultAtLocation [Line: 453]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [453] - GenericResultAtLocation [Line: 557]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [557] - GenericResultAtLocation [Line: 783]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [783] - GenericResultAtLocation [Line: 877]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [877] - GenericResultAtLocation [Line: 946]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [946] * 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: 449]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L248] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L454] int cleanupTimeShifts = 4; [L566] int pumpRunning = 0; [L567] int systemActive = 1; [L784] int waterLevel = 1; [L785] int methaneLevelCritical = 0; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L535] int retValue_acc ; [L536] int tmp ; [L540] FCALL select_helpers() [L541] FCALL select_features() [L542] CALL, EXPR valid_product() [L973] int retValue_acc ; [L976] retValue_acc = 1 [L977] return (retValue_acc); VAL [\result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L542] RET, EXPR valid_product() [L542] tmp = valid_product() [L544] COND TRUE \read(tmp) [L546] FCALL setup() [L547] CALL runTest() [L526] CALL test() [L879] int splverifierCounter ; [L880] int tmp ; [L881] int tmp___0 ; [L882] int tmp___1 ; [L883] int tmp___2 ; [L886] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L890] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L896] tmp = __VERIFIER_nondet_int() [L898] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L900] CALL waterRise() VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L802] COND TRUE waterLevel < 2 [L803] waterLevel = waterLevel + 1 VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L900] RET waterRise() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L906] tmp___0 = __VERIFIER_nondet_int() [L908] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L916] tmp___2 = __VERIFIER_nondet_int() [L918] COND TRUE \read(tmp___2) [L920] CALL startSystem() [L779] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L920] RET startSystem() [L935] CALL timeShift() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L573] COND FALSE !(\read(pumpRunning)) VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L580] COND TRUE \read(systemActive) [L582] CALL processEnvironment() [L628] int tmp ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L631] COND FALSE !(\read(pumpRunning)) VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L646] CALL processEnvironment__wrappee__methaneQuery() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L602] int tmp ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L605] COND TRUE ! pumpRunning [L607] CALL, EXPR isHighWaterLevel() [L742] int retValue_acc ; [L743] int tmp ; [L744] int tmp___0 ; [L748] CALL, EXPR isHighWaterSensorDry() [L864] int retValue_acc ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L867] COND FALSE !(waterLevel < 2) [L871] retValue_acc = 0 [L872] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L748] RET, EXPR isHighWaterSensorDry() [L748] tmp = isHighWaterSensorDry() [L750] COND FALSE !(\read(tmp)) [L753] tmp___0 = 1 VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, tmp___0=1, waterLevel=2] [L755] retValue_acc = tmp___0 [L756] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L607] RET, EXPR isHighWaterLevel() [L607] tmp = isHighWaterLevel() [L609] COND TRUE \read(tmp) [L611] CALL activatePump() [L661] int tmp ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L665] CALL, EXPR isMethaneAlarm() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L686] int retValue_acc ; [L690] CALL, EXPR isMethaneLevelCritical() [L823] int retValue_acc ; [L826] retValue_acc = methaneLevelCritical [L827] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L690] RET, EXPR isMethaneLevelCritical() [L690] retValue_acc = isMethaneLevelCritical() [L692] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L665] RET, EXPR isMethaneAlarm() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L665] tmp = isMethaneAlarm() [L667] COND FALSE !(\read(tmp)) [L671] CALL activatePump__wrappee__highWaterSensor() [L656] pumpRunning = 1 VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L671] RET activatePump__wrappee__highWaterSensor() [L611] RET activatePump() [L646] RET processEnvironment__wrappee__methaneQuery() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L582] RET processEnvironment() [L588] CALL __utac_acc__Specification4_spec__1() [L54] int tmp ; [L55] int tmp___0 ; [L59] CALL, EXPR getWaterLevel() [L855] int retValue_acc ; [L858] retValue_acc = waterLevel [L859] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L59] RET, EXPR getWaterLevel() [L59] tmp = getWaterLevel() [L61] COND FALSE !(tmp == 0) VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L588] RET __utac_acc__Specification4_spec__1() [L935] RET timeShift() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L890] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L896] tmp = __VERIFIER_nondet_int() [L898] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L906] tmp___0 = __VERIFIER_nondet_int() [L908] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L916] tmp___2 = __VERIFIER_nondet_int() [L918] COND TRUE \read(tmp___2) [L920] CALL startSystem() [L779] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L920] RET startSystem() [L935] CALL timeShift() VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L573] COND TRUE \read(pumpRunning) [L575] CALL lowerWaterLevel() [L790] COND TRUE waterLevel > 0 [L791] waterLevel = waterLevel - 1 VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L575] RET lowerWaterLevel() [L580] COND TRUE \read(systemActive) [L582] CALL processEnvironment() [L628] int tmp ; VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L631] COND TRUE \read(pumpRunning) VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L633] CALL, EXPR isMethaneAlarm() VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L686] int retValue_acc ; [L690] CALL, EXPR isMethaneLevelCritical() [L823] int retValue_acc ; [L826] retValue_acc = methaneLevelCritical [L827] return (retValue_acc); VAL [\old(pumpRunning)=1, \old(waterLevel)=2, \result=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L690] RET, EXPR isMethaneLevelCritical() [L690] retValue_acc = isMethaneLevelCritical() [L692] return (retValue_acc); VAL [\old(pumpRunning)=1, \old(waterLevel)=2, \result=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L633] RET, EXPR isMethaneAlarm() VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L633] tmp = isMethaneAlarm() [L635] COND FALSE !(\read(tmp)) VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L641] CALL processEnvironment__wrappee__methaneQuery() VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L602] int tmp ; VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L605] COND FALSE !(! pumpRunning) VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L620] FCALL processEnvironment__wrappee__base() VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L641] RET processEnvironment__wrappee__methaneQuery() VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L582] RET processEnvironment() [L588] CALL __utac_acc__Specification4_spec__1() [L54] int tmp ; [L55] int tmp___0 ; [L59] CALL, EXPR getWaterLevel() [L855] int retValue_acc ; [L858] retValue_acc = waterLevel [L859] return (retValue_acc); VAL [\old(pumpRunning)=1, \old(waterLevel)=2, \result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L59] RET, EXPR getWaterLevel() [L59] tmp = getWaterLevel() [L61] COND FALSE !(tmp == 0) VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L588] RET __utac_acc__Specification4_spec__1() [L935] RET timeShift() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=1] [L890] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=1] [L896] tmp = __VERIFIER_nondet_int() [L898] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=1] [L906] tmp___0 = __VERIFIER_nondet_int() [L908] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=1] [L916] tmp___2 = __VERIFIER_nondet_int() [L918] COND TRUE \read(tmp___2) [L920] CALL startSystem() [L779] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L920] RET startSystem() [L935] CALL timeShift() VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L573] COND TRUE \read(pumpRunning) [L575] CALL lowerWaterLevel() [L790] COND TRUE waterLevel > 0 [L791] waterLevel = waterLevel - 1 VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L575] RET lowerWaterLevel() [L580] COND TRUE \read(systemActive) [L582] CALL processEnvironment() [L628] int tmp ; VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L631] COND TRUE \read(pumpRunning) VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L633] CALL, EXPR isMethaneAlarm() VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L686] int retValue_acc ; [L690] CALL, EXPR isMethaneLevelCritical() [L823] int retValue_acc ; [L826] retValue_acc = methaneLevelCritical [L827] return (retValue_acc); VAL [\old(pumpRunning)=1, \old(waterLevel)=1, \result=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L690] RET, EXPR isMethaneLevelCritical() [L690] retValue_acc = isMethaneLevelCritical() [L692] return (retValue_acc); VAL [\old(pumpRunning)=1, \old(waterLevel)=1, \result=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L633] RET, EXPR isMethaneAlarm() VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L633] tmp = isMethaneAlarm() [L635] COND FALSE !(\read(tmp)) VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L641] CALL processEnvironment__wrappee__methaneQuery() VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L602] int tmp ; VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L605] COND FALSE !(! pumpRunning) VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L620] FCALL processEnvironment__wrappee__base() VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L641] RET processEnvironment__wrappee__methaneQuery() VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L582] RET processEnvironment() [L588] CALL __utac_acc__Specification4_spec__1() [L54] int tmp ; [L55] int tmp___0 ; [L59] CALL, EXPR getWaterLevel() [L855] int retValue_acc ; [L858] retValue_acc = waterLevel [L859] return (retValue_acc); VAL [\old(pumpRunning)=1, \old(waterLevel)=1, \result=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L59] RET, EXPR getWaterLevel() [L59] tmp = getWaterLevel() [L61] COND TRUE tmp == 0 [L63] CALL, EXPR isPumpRunning() [L697] int retValue_acc ; [L700] retValue_acc = pumpRunning [L701] return (retValue_acc); VAL [\old(pumpRunning)=1, \old(waterLevel)=1, \result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L63] RET, EXPR isPumpRunning() [L63] tmp___0 = isPumpRunning() [L65] COND TRUE \read(tmp___0) [L67] CALL __automaton_fail() [L449] reach_error() VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 94 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.6s, OverallIterations: 12, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 568 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 564 mSDsluCounter, 3301 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2081 mSDsCounter, 39 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 233 IncrementalHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 39 mSolverCounterUnsat, 1220 mSDtfsCounter, 233 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 227 GetRequests, 189 SyntacticMatches, 5 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=460occurred in iteration=9, InterpolantAutomatonStates: 47, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 85 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 665 NumberOfCodeBlocks, 665 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 616 ConstructedInterpolants, 0 QuantifiedInterpolants, 1111 SizeOfPredicates, 2 NumberOfNonLiveVariables, 293 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 13 InterpolantComputations, 10 PerfectInterpolantSequences, 64/86 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:02:22,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE