./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec1_product40.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc 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_spec1_product40.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 e58738f03c291d912b42eb65343509a99f93ac40ab295d49133dc12600f622b8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 15:50:52,103 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 15:50:52,156 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 15:50:52,166 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 15:50:52,167 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 15:50:52,189 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 15:50:52,191 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 15:50:52,191 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 15:50:52,192 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 15:50:52,192 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 15:50:52,192 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 15:50:52,193 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 15:50:52,193 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 15:50:52,193 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 15:50:52,193 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 15:50:52,194 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 15:50:52,194 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 15:50:52,194 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 15:50:52,194 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 15:50:52,194 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 15:50:52,194 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 15:50:52,194 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 15:50:52,194 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 15:50:52,194 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 15:50:52,194 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 15:50:52,194 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 15:50:52,195 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 15:50:52,195 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 15:50:52,195 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 15:50:52,195 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 15:50:52,195 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 15:50:52,195 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 15:50:52,195 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:50:52,195 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 15:50:52,196 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 15:50:52,196 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 15:50:52,196 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 15:50:52,196 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 15:50:52,196 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 15:50:52,196 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 15:50:52,196 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 15:50:52,196 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 15:50:52,196 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 15:50:52,196 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 -> e58738f03c291d912b42eb65343509a99f93ac40ab295d49133dc12600f622b8 [2025-02-05 15:50:52,429 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 15:50:52,439 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 15:50:52,441 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 15:50:52,442 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 15:50:52,442 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 15:50:52,443 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec1_product40.cil.c [2025-02-05 15:50:53,581 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8c6c0ea66/391e41a20f11435a919ea700c699435c/FLAG0e2770454 [2025-02-05 15:50:53,863 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 15:50:53,864 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product40.cil.c [2025-02-05 15:50:53,871 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8c6c0ea66/391e41a20f11435a919ea700c699435c/FLAG0e2770454 [2025-02-05 15:50:54,152 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8c6c0ea66/391e41a20f11435a919ea700c699435c [2025-02-05 15:50:54,154 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 15:50:54,155 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 15:50:54,156 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 15:50:54,156 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 15:50:54,159 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 15:50:54,159 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:50:54" (1/1) ... [2025-02-05 15:50:54,160 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ee025a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:50:54, skipping insertion in model container [2025-02-05 15:50:54,160 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:50:54" (1/1) ... [2025-02-05 15:50:54,188 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 15:50:54,338 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_spec1_product40.cil.c[7390,7403] [2025-02-05 15:50:54,369 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:50:54,381 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 15:50:54,387 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [49] [2025-02-05 15:50:54,388 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [262] [2025-02-05 15:50:54,388 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification1_spec.i","") [334] [2025-02-05 15:50:54,388 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [361] [2025-02-05 15:50:54,388 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [460] [2025-02-05 15:50:54,388 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [495] [2025-02-05 15:50:54,388 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [504] [2025-02-05 15:50:54,388 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [870] [2025-02-05 15:50:54,400 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_spec1_product40.cil.c[7390,7403] [2025-02-05 15:50:54,422 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:50:54,439 INFO L204 MainTranslator]: Completed translation [2025-02-05 15:50:54,440 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:50:54 WrapperNode [2025-02-05 15:50:54,440 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 15:50:54,441 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 15:50:54,441 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 15:50:54,441 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 15:50:54,445 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:50:54" (1/1) ... [2025-02-05 15:50:54,452 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:50:54" (1/1) ... [2025-02-05 15:50:54,466 INFO L138 Inliner]: procedures = 55, calls = 100, calls flagged for inlining = 22, calls inlined = 19, statements flattened = 189 [2025-02-05 15:50:54,466 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 15:50:54,467 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 15:50:54,467 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 15:50:54,467 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 15:50:54,473 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:50:54" (1/1) ... [2025-02-05 15:50:54,473 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:50:54" (1/1) ... [2025-02-05 15:50:54,474 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:50:54" (1/1) ... [2025-02-05 15:50:54,483 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-02-05 15:50:54,484 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:50:54" (1/1) ... [2025-02-05 15:50:54,484 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:50:54" (1/1) ... [2025-02-05 15:50:54,487 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:50:54" (1/1) ... [2025-02-05 15:50:54,487 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:50:54" (1/1) ... [2025-02-05 15:50:54,488 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:50:54" (1/1) ... [2025-02-05 15:50:54,489 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:50:54" (1/1) ... [2025-02-05 15:50:54,490 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 15:50:54,491 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 15:50:54,491 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 15:50:54,491 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 15:50:54,492 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:50:54" (1/1) ... [2025-02-05 15:50:54,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:50:54,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:50:54,518 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-02-05 15:50:54,526 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-02-05 15:50:54,545 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 15:50:54,545 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2025-02-05 15:50:54,546 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2025-02-05 15:50:54,546 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-02-05 15:50:54,546 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-02-05 15:50:54,546 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2025-02-05 15:50:54,546 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2025-02-05 15:50:54,546 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-02-05 15:50:54,546 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-02-05 15:50:54,546 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__highWaterSensor [2025-02-05 15:50:54,546 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__highWaterSensor [2025-02-05 15:50:54,546 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2025-02-05 15:50:54,546 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2025-02-05 15:50:54,546 INFO L130 BoogieDeclarations]: Found specification of procedure deactivatePump [2025-02-05 15:50:54,546 INFO L138 BoogieDeclarations]: Found implementation of procedure deactivatePump [2025-02-05 15:50:54,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 15:50:54,546 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2025-02-05 15:50:54,546 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2025-02-05 15:50:54,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 15:50:54,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 15:50:54,605 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 15:50:54,607 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 15:50:54,673 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint cleanupFINAL: assume true; [2025-02-05 15:50:54,679 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L916: #res := ~retValue_acc~9; [2025-02-05 15:50:54,738 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L172-1: isMethaneAlarm_#res#1 := isMethaneAlarm_~retValue_acc~0#1; [2025-02-05 15:50:54,738 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L181-1: isPumpRunning_#res#1 := isPumpRunning_~retValue_acc~1#1; [2025-02-05 15:50:54,811 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L492-1: valid_product_#res#1 := valid_product_~retValue_acc~5#1; [2025-02-05 15:50:54,812 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L457-1: main_#res#1 := main_~retValue_acc~3#1; [2025-02-05 15:50:54,843 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L962-1: isHighWaterSensorDry_#res#1 := isHighWaterSensorDry_~retValue_acc~11#1; [2025-02-05 15:50:54,843 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L236-1: isHighWaterLevel_#res#1 := isHighWaterLevel_~retValue_acc~2#1; [2025-02-05 15:50:54,866 INFO L? ?]: Removed 40 outVars from TransFormulas that were not future-live. [2025-02-05 15:50:54,866 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 15:50:54,874 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 15:50:54,875 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 15:50:54,875 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:50:54 BoogieIcfgContainer [2025-02-05 15:50:54,875 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 15:50:54,877 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 15:50:54,877 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 15:50:54,880 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 15:50:54,881 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 03:50:54" (1/3) ... [2025-02-05 15:50:54,881 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54f94ce9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:50:54, skipping insertion in model container [2025-02-05 15:50:54,882 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:50:54" (2/3) ... [2025-02-05 15:50:54,882 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54f94ce9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:50:54, skipping insertion in model container [2025-02-05 15:50:54,882 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:50:54" (3/3) ... [2025-02-05 15:50:54,883 INFO L128 eAbstractionObserver]: Analyzing ICFG minepump_spec1_product40.cil.c [2025-02-05 15:50:54,896 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 15:50:54,897 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG minepump_spec1_product40.cil.c that has 9 procedures, 92 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-02-05 15:50:54,944 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 15:50:54,952 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;@3248a12e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 15:50:54,952 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 15:50:54,955 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 67 states have (on average 1.3582089552238805) internal successors, (91), 76 states have internal predecessors, (91), 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-02-05 15:50:54,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-05 15:50:54,960 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:50:54,960 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] [2025-02-05 15:50:54,961 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:50:54,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:50:54,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1188379956, now seen corresponding path program 1 times [2025-02-05 15:50:54,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:50:54,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071569995] [2025-02-05 15:50:54,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:50:54,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:50:55,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-05 15:50:55,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-05 15:50:55,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:50:55,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:50:55,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:50:55,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:50:55,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071569995] [2025-02-05 15:50:55,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071569995] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:50:55,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:50:55,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 15:50:55,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549355368] [2025-02-05 15:50:55,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:50:55,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 15:50:55,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:50:55,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 15:50:55,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 15:50:55,090 INFO L87 Difference]: Start difference. First operand has 91 states, 67 states have (on average 1.3582089552238805) internal successors, (91), 76 states have internal predecessors, (91), 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) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 15:50:55,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:50:55,110 INFO L93 Difference]: Finished difference Result 166 states and 223 transitions. [2025-02-05 15:50:55,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 15:50:55,112 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2025-02-05 15:50:55,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:50:55,118 INFO L225 Difference]: With dead ends: 166 [2025-02-05 15:50:55,119 INFO L226 Difference]: Without dead ends: 83 [2025-02-05 15:50:55,123 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-02-05 15:50:55,125 INFO L435 NwaCegarLoop]: 112 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, 112 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-02-05 15:50:55,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:50:55,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-02-05 15:50:55,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2025-02-05 15:50:55,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 61 states have (on average 1.3114754098360655) internal successors, (80), 69 states have internal predecessors, (80), 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-02-05 15:50:55,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 107 transitions. [2025-02-05 15:50:55,157 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 107 transitions. Word has length 23 [2025-02-05 15:50:55,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:50:55,157 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 107 transitions. [2025-02-05 15:50:55,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 15:50:55,158 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 107 transitions. [2025-02-05 15:50:55,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-05 15:50:55,159 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:50:55,159 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-02-05 15:50:55,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 15:50:55,159 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:50:55,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:50:55,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1841570967, now seen corresponding path program 1 times [2025-02-05 15:50:55,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:50:55,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280352773] [2025-02-05 15:50:55,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:50:55,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:50:55,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-05 15:50:55,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-05 15:50:55,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:50:55,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:50:55,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:50:55,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:50:55,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280352773] [2025-02-05 15:50:55,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280352773] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:50:55,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:50:55,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:50:55,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775133560] [2025-02-05 15:50:55,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:50:55,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:50:55,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:50:55,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:50:55,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:50:55,242 INFO L87 Difference]: Start difference. First operand 83 states and 107 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 15:50:55,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:50:55,263 INFO L93 Difference]: Finished difference Result 128 states and 164 transitions. [2025-02-05 15:50:55,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:50:55,264 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2025-02-05 15:50:55,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:50:55,264 INFO L225 Difference]: With dead ends: 128 [2025-02-05 15:50:55,264 INFO L226 Difference]: Without dead ends: 74 [2025-02-05 15:50:55,265 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-02-05 15:50:55,265 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 16 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 167 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-02-05 15:50:55,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 167 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:50:55,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-02-05 15:50:55,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2025-02-05 15:50:55,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 55 states have (on average 1.3272727272727274) internal successors, (73), 63 states have internal predecessors, (73), 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-02-05 15:50:55,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 95 transitions. [2025-02-05 15:50:55,272 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 95 transitions. Word has length 24 [2025-02-05 15:50:55,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:50:55,272 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 95 transitions. [2025-02-05 15:50:55,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 15:50:55,272 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 95 transitions. [2025-02-05 15:50:55,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-05 15:50:55,273 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:50:55,273 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] [2025-02-05 15:50:55,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 15:50:55,273 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:50:55,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:50:55,274 INFO L85 PathProgramCache]: Analyzing trace with hash -538444879, now seen corresponding path program 1 times [2025-02-05 15:50:55,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:50:55,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453317734] [2025-02-05 15:50:55,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:50:55,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:50:55,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-05 15:50:55,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-05 15:50:55,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:50:55,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:50:55,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:50:55,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:50:55,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453317734] [2025-02-05 15:50:55,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453317734] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:50:55,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:50:55,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:50:55,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801847731] [2025-02-05 15:50:55,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:50:55,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:50:55,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:50:55,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:50:55,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:50:55,372 INFO L87 Difference]: Start difference. First operand 74 states and 95 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 15:50:55,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:50:55,573 INFO L93 Difference]: Finished difference Result 247 states and 324 transitions. [2025-02-05 15:50:55,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:50:55,573 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2025-02-05 15:50:55,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:50:55,575 INFO L225 Difference]: With dead ends: 247 [2025-02-05 15:50:55,575 INFO L226 Difference]: Without dead ends: 180 [2025-02-05 15:50:55,575 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:50:55,576 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 160 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:50:55,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 416 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:50:55,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-02-05 15:50:55,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 174. [2025-02-05 15:50:55,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 127 states have (on average 1.3622047244094488) internal successors, (173), 145 states have internal predecessors, (173), 27 states have call successors, (27), 19 states have call predecessors, (27), 19 states have return successors, (28), 19 states have call predecessors, (28), 27 states have call successors, (28) [2025-02-05 15:50:55,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 228 transitions. [2025-02-05 15:50:55,614 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 228 transitions. Word has length 28 [2025-02-05 15:50:55,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:50:55,614 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 228 transitions. [2025-02-05 15:50:55,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 15:50:55,615 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 228 transitions. [2025-02-05 15:50:55,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-05 15:50:55,616 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:50:55,617 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-02-05 15:50:55,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 15:50:55,617 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:50:55,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:50:55,617 INFO L85 PathProgramCache]: Analyzing trace with hash -2008860095, now seen corresponding path program 1 times [2025-02-05 15:50:55,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:50:55,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131861904] [2025-02-05 15:50:55,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:50:55,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:50:55,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-05 15:50:55,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-05 15:50:55,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:50:55,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:50:55,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:50:55,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:50:55,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131861904] [2025-02-05 15:50:55,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131861904] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:50:55,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:50:55,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:50:55,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560230008] [2025-02-05 15:50:55,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:50:55,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:50:55,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:50:55,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:50:55,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:50:55,815 INFO L87 Difference]: Start difference. First operand 174 states and 228 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-02-05 15:50:55,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:50:55,899 INFO L93 Difference]: Finished difference Result 416 states and 560 transitions. [2025-02-05 15:50:55,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:50:55,900 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-02-05 15:50:55,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:50:55,902 INFO L225 Difference]: With dead ends: 416 [2025-02-05 15:50:55,905 INFO L226 Difference]: Without dead ends: 249 [2025-02-05 15:50:55,906 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-02-05 15:50:55,909 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 49 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:50:55,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 333 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:50:55,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2025-02-05 15:50:55,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 247. [2025-02-05 15:50:55,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 182 states have (on average 1.3076923076923077) internal successors, (238), 199 states have internal predecessors, (238), 34 states have call successors, (34), 30 states have call predecessors, (34), 30 states have return successors, (44), 31 states have call predecessors, (44), 34 states have call successors, (44) [2025-02-05 15:50:55,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 316 transitions. [2025-02-05 15:50:55,951 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 316 transitions. Word has length 31 [2025-02-05 15:50:55,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:50:55,952 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 316 transitions. [2025-02-05 15:50:55,952 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-02-05 15:50:55,952 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 316 transitions. [2025-02-05 15:50:55,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-02-05 15:50:55,956 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:50:55,956 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:50:55,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 15:50:55,956 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:50:55,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:50:55,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1413516301, now seen corresponding path program 1 times [2025-02-05 15:50:55,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:50:55,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229859467] [2025-02-05 15:50:55,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:50:55,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:50:55,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-05 15:50:55,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-05 15:50:55,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:50:55,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:50:56,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:50:56,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:50:56,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229859467] [2025-02-05 15:50:56,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229859467] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:50:56,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:50:56,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:50:56,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294388950] [2025-02-05 15:50:56,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:50:56,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:50:56,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:50:56,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:50:56,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:50:56,068 INFO L87 Difference]: Start difference. First operand 247 states and 316 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 15:50:56,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:50:56,103 INFO L93 Difference]: Finished difference Result 493 states and 642 transitions. [2025-02-05 15:50:56,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:50:56,104 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 42 [2025-02-05 15:50:56,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:50:56,106 INFO L225 Difference]: With dead ends: 493 [2025-02-05 15:50:56,106 INFO L226 Difference]: Without dead ends: 253 [2025-02-05 15:50:56,107 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-02-05 15:50:56,107 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 0 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 362 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-02-05 15:50:56,109 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 362 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:50:56,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2025-02-05 15:50:56,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2025-02-05 15:50:56,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 188 states have (on average 1.297872340425532) internal successors, (244), 205 states have internal predecessors, (244), 34 states have call successors, (34), 30 states have call predecessors, (34), 30 states have return successors, (44), 31 states have call predecessors, (44), 34 states have call successors, (44) [2025-02-05 15:50:56,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 322 transitions. [2025-02-05 15:50:56,148 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 322 transitions. Word has length 42 [2025-02-05 15:50:56,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:50:56,148 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 322 transitions. [2025-02-05 15:50:56,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 15:50:56,151 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 322 transitions. [2025-02-05 15:50:56,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-02-05 15:50:56,152 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:50:56,152 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:50:56,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 15:50:56,152 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:50:56,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:50:56,152 INFO L85 PathProgramCache]: Analyzing trace with hash 416443948, now seen corresponding path program 1 times [2025-02-05 15:50:56,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:50:56,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230652080] [2025-02-05 15:50:56,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:50:56,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:50:56,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-05 15:50:56,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-05 15:50:56,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:50:56,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:50:56,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:50:56,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:50:56,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230652080] [2025-02-05 15:50:56,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230652080] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:50:56,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:50:56,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:50:56,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325679283] [2025-02-05 15:50:56,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:50:56,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:50:56,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:50:56,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:50:56,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:50:56,224 INFO L87 Difference]: Start difference. First operand 253 states and 322 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 15:50:56,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:50:56,257 INFO L93 Difference]: Finished difference Result 503 states and 661 transitions. [2025-02-05 15:50:56,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:50:56,259 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 42 [2025-02-05 15:50:56,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:50:56,263 INFO L225 Difference]: With dead ends: 503 [2025-02-05 15:50:56,263 INFO L226 Difference]: Without dead ends: 257 [2025-02-05 15:50:56,264 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-02-05 15:50:56,264 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 0 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 273 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-02-05 15:50:56,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 273 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:50:56,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2025-02-05 15:50:56,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 257. [2025-02-05 15:50:56,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 192 states have (on average 1.2916666666666667) internal successors, (248), 209 states have internal predecessors, (248), 34 states have call successors, (34), 30 states have call predecessors, (34), 30 states have return successors, (44), 31 states have call predecessors, (44), 34 states have call successors, (44) [2025-02-05 15:50:56,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 326 transitions. [2025-02-05 15:50:56,290 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 326 transitions. Word has length 42 [2025-02-05 15:50:56,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:50:56,291 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 326 transitions. [2025-02-05 15:50:56,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 15:50:56,291 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 326 transitions. [2025-02-05 15:50:56,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-02-05 15:50:56,292 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:50:56,292 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:50:56,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 15:50:56,293 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:50:56,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:50:56,293 INFO L85 PathProgramCache]: Analyzing trace with hash -401204502, now seen corresponding path program 1 times [2025-02-05 15:50:56,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:50:56,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898373914] [2025-02-05 15:50:56,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:50:56,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:50:56,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-05 15:50:56,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-05 15:50:56,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:50:56,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:50:56,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:50:56,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:50:56,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898373914] [2025-02-05 15:50:56,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898373914] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:50:56,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:50:56,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:50:56,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194856084] [2025-02-05 15:50:56,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:50:56,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:50:56,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:50:56,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:50:56,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:50:56,365 INFO L87 Difference]: Start difference. First operand 257 states and 326 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 15:50:56,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:50:56,522 INFO L93 Difference]: Finished difference Result 868 states and 1139 transitions. [2025-02-05 15:50:56,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:50:56,523 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 42 [2025-02-05 15:50:56,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:50:56,525 INFO L225 Difference]: With dead ends: 868 [2025-02-05 15:50:56,525 INFO L226 Difference]: Without dead ends: 618 [2025-02-05 15:50:56,526 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-02-05 15:50:56,527 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 126 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:50:56,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 311 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:50:56,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2025-02-05 15:50:56,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 604. [2025-02-05 15:50:56,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 451 states have (on average 1.2660753880266076) internal successors, (571), 485 states have internal predecessors, (571), 79 states have call successors, (79), 71 states have call predecessors, (79), 73 states have return successors, (122), 75 states have call predecessors, (122), 79 states have call successors, (122) [2025-02-05 15:50:56,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 772 transitions. [2025-02-05 15:50:56,567 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 772 transitions. Word has length 42 [2025-02-05 15:50:56,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:50:56,568 INFO L471 AbstractCegarLoop]: Abstraction has 604 states and 772 transitions. [2025-02-05 15:50:56,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 15:50:56,568 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 772 transitions. [2025-02-05 15:50:56,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-05 15:50:56,569 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:50:56,569 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] [2025-02-05 15:50:56,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 15:50:56,569 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:50:56,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:50:56,570 INFO L85 PathProgramCache]: Analyzing trace with hash -560295608, now seen corresponding path program 1 times [2025-02-05 15:50:56,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:50:56,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172424517] [2025-02-05 15:50:56,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:50:56,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:50:56,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-05 15:50:56,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-05 15:50:56,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:50:56,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:50:56,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:50:56,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:50:56,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172424517] [2025-02-05 15:50:56,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172424517] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:50:56,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:50:56,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:50:56,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076853736] [2025-02-05 15:50:56,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:50:56,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:50:56,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:50:56,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:50:56,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:50:56,676 INFO L87 Difference]: Start difference. First operand 604 states and 772 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 15:50:56,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:50:56,801 INFO L93 Difference]: Finished difference Result 1770 states and 2334 transitions. [2025-02-05 15:50:56,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 15:50:56,802 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 46 [2025-02-05 15:50:56,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:50:56,811 INFO L225 Difference]: With dead ends: 1770 [2025-02-05 15:50:56,811 INFO L226 Difference]: Without dead ends: 1173 [2025-02-05 15:50:56,816 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:50:56,817 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 63 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:50:56,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 424 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:50:56,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2025-02-05 15:50:56,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 1173. [2025-02-05 15:50:56,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1173 states, 868 states have (on average 1.2419354838709677) internal successors, (1078), 935 states have internal predecessors, (1078), 158 states have call successors, (158), 142 states have call predecessors, (158), 146 states have return successors, (257), 150 states have call predecessors, (257), 158 states have call successors, (257) [2025-02-05 15:50:56,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1173 states to 1173 states and 1493 transitions. [2025-02-05 15:50:56,942 INFO L78 Accepts]: Start accepts. Automaton has 1173 states and 1493 transitions. Word has length 46 [2025-02-05 15:50:56,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:50:56,942 INFO L471 AbstractCegarLoop]: Abstraction has 1173 states and 1493 transitions. [2025-02-05 15:50:56,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 15:50:56,943 INFO L276 IsEmpty]: Start isEmpty. Operand 1173 states and 1493 transitions. [2025-02-05 15:50:56,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-05 15:50:56,944 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:50:56,944 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-02-05 15:50:56,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 15:50:56,944 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:50:56,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:50:56,950 INFO L85 PathProgramCache]: Analyzing trace with hash -410544921, now seen corresponding path program 1 times [2025-02-05 15:50:56,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:50:56,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022701184] [2025-02-05 15:50:56,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:50:56,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:50:56,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-05 15:50:56,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-05 15:50:56,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:50:56,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 15:50:56,979 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-05 15:50:56,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-05 15:50:56,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-05 15:50:56,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:50:56,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 15:50:57,029 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-05 15:50:57,034 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-05 15:50:57,036 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 15:50:57,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 15:50:57,038 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:50:57,095 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 15:50:57,099 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 03:50:57 BoogieIcfgContainer [2025-02-05 15:50:57,099 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 15:50:57,100 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 15:50:57,100 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 15:50:57,100 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 15:50:57,101 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:50:54" (3/4) ... [2025-02-05 15:50:57,101 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-05 15:50:57,163 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 44. [2025-02-05 15:50:57,211 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-05 15:50:57,211 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-05 15:50:57,211 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 15:50:57,212 INFO L158 Benchmark]: Toolchain (without parser) took 3056.87ms. Allocated memory is still 201.3MB. Free memory was 158.5MB in the beginning and 141.0MB in the end (delta: 17.6MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. [2025-02-05 15:50:57,212 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 218.1MB. Free memory is still 134.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 15:50:57,212 INFO L158 Benchmark]: CACSL2BoogieTranslator took 284.29ms. Allocated memory is still 201.3MB. Free memory was 158.1MB in the beginning and 139.7MB in the end (delta: 18.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 15:50:57,212 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.71ms. Allocated memory is still 201.3MB. Free memory was 139.7MB in the beginning and 138.0MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 15:50:57,213 INFO L158 Benchmark]: Boogie Preprocessor took 23.21ms. Allocated memory is still 201.3MB. Free memory was 138.0MB in the beginning and 136.3MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 15:50:57,213 INFO L158 Benchmark]: IcfgBuilder took 384.12ms. Allocated memory is still 201.3MB. Free memory was 136.3MB in the beginning and 118.3MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 15:50:57,213 INFO L158 Benchmark]: TraceAbstraction took 2222.58ms. Allocated memory is still 201.3MB. Free memory was 117.9MB in the beginning and 149.8MB in the end (delta: -32.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 15:50:57,213 INFO L158 Benchmark]: Witness Printer took 111.50ms. Allocated memory is still 201.3MB. Free memory was 149.8MB in the beginning and 141.0MB in the end (delta: 8.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 15:50:57,214 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.20ms. Allocated memory is still 218.1MB. Free memory is still 134.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 284.29ms. Allocated memory is still 201.3MB. Free memory was 158.1MB in the beginning and 139.7MB in the end (delta: 18.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.71ms. Allocated memory is still 201.3MB. Free memory was 139.7MB in the beginning and 138.0MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 23.21ms. Allocated memory is still 201.3MB. Free memory was 138.0MB in the beginning and 136.3MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 384.12ms. Allocated memory is still 201.3MB. Free memory was 136.3MB in the beginning and 118.3MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2222.58ms. Allocated memory is still 201.3MB. Free memory was 117.9MB in the beginning and 149.8MB in the end (delta: -32.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 111.50ms. Allocated memory is still 201.3MB. Free memory was 149.8MB in the beginning and 141.0MB in the end (delta: 8.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,"MinePump.i","") [49] - GenericResultAtLocation [Line: 262]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [262] - GenericResultAtLocation [Line: 334]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification1_spec.i","") [334] - GenericResultAtLocation [Line: 361]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [361] - GenericResultAtLocation [Line: 460]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [460] - GenericResultAtLocation [Line: 495]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [495] - GenericResultAtLocation [Line: 504]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [504] - GenericResultAtLocation [Line: 870]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [870] * 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: 500]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L61] int pumpRunning = 0; [L62] int systemActive = 1; [L362] int cleanupTimeShifts = 4; [L674] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L872] int waterLevel = 1; [L873] int methaneLevelCritical = 0; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L438] int retValue_acc ; [L439] int tmp ; [L443] FCALL select_helpers() [L444] FCALL select_features() [L445] CALL, EXPR valid_product() [L487] int retValue_acc ; [L490] retValue_acc = 1 [L491] return (retValue_acc); VAL [\result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L445] RET, EXPR valid_product() [L445] tmp = valid_product() [L447] COND TRUE \read(tmp) [L449] FCALL setup() [L450] CALL runTest() [L429] CALL test() [L267] int splverifierCounter ; [L268] int tmp ; [L269] int tmp___0 ; [L270] int tmp___1 ; [L271] int tmp___2 ; [L274] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L276] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L278] COND TRUE splverifierCounter < 4 [L284] tmp = __VERIFIER_nondet_int() [L286] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L288] CALL waterRise() VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L890] COND TRUE waterLevel < 2 [L891] waterLevel = waterLevel + 1 VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L288] RET waterRise() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L294] tmp___0 = __VERIFIER_nondet_int() [L296] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L298] CALL changeMethaneLevel() VAL [\old(methaneLevelCritical)=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L902] COND FALSE !(\read(methaneLevelCritical)) [L905] methaneLevelCritical = 1 VAL [\old(methaneLevelCritical)=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L298] RET changeMethaneLevel() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L304] tmp___2 = __VERIFIER_nondet_int() [L306] COND FALSE !(\read(tmp___2)) [L312] tmp___1 = __VERIFIER_nondet_int() [L314] COND FALSE !(\read(tmp___1)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L323] CALL timeShift() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L69] COND FALSE !(\read(pumpRunning)) VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L76] COND TRUE \read(systemActive) [L78] CALL processEnvironment() [L124] int tmp ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L127] COND FALSE !(\read(pumpRunning)) VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L142] CALL processEnvironment__wrappee__highWaterSensor() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L98] int tmp ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L101] COND TRUE ! pumpRunning [L103] CALL, EXPR isHighWaterLevel() [L221] int retValue_acc ; [L222] int tmp ; [L223] int tmp___0 ; [L227] CALL, EXPR isHighWaterSensorDry() [L952] int retValue_acc ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L955] COND FALSE !(waterLevel < 2) [L959] retValue_acc = 0 [L960] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L227] RET, EXPR isHighWaterSensorDry() [L227] tmp = isHighWaterSensorDry() [L229] COND FALSE !(\read(tmp)) [L232] tmp___0 = 1 VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, tmp___0=1, waterLevel=2] [L234] retValue_acc = tmp___0 [L235] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L103] RET, EXPR isHighWaterLevel() [L103] tmp = isHighWaterLevel() [L105] COND TRUE \read(tmp) [L107] CALL activatePump() [L152] pumpRunning = 1 VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L107] RET activatePump() [L142] RET processEnvironment__wrappee__highWaterSensor() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L78] RET processEnvironment() [L84] CALL __utac_acc__Specification1_spec__1() [L337] int tmp ; [L338] int tmp___0 ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L342] CALL, EXPR isMethaneLevelCritical() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L911] int retValue_acc ; [L914] retValue_acc = methaneLevelCritical [L915] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L342] RET, EXPR isMethaneLevelCritical() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L342] tmp = isMethaneLevelCritical() [L344] COND TRUE \read(tmp) [L346] CALL, EXPR isPumpRunning() [L176] int retValue_acc ; [L179] retValue_acc = pumpRunning [L180] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L346] RET, EXPR isPumpRunning() [L346] tmp___0 = isPumpRunning() [L348] COND TRUE \read(tmp___0) [L350] CALL __automaton_fail() [L500] reach_error() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 92 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.1s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 420 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 414 mSDsluCounter, 2398 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1556 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 253 IncrementalHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 842 mSDtfsCounter, 253 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1173occurred in iteration=8, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 22 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 328 NumberOfCodeBlocks, 328 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 270 ConstructedInterpolants, 0 QuantifiedInterpolants, 498 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 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-02-05 15:50:57,229 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