./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec2_product52.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_spec2_product52.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 4583285deb29d8014ded34089a46614a743cea13eee9bbb990cdfd770bfce36e --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 15:51:51,560 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 15:51:51,629 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:51:51,636 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 15:51:51,636 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 15:51:51,668 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 15:51:51,669 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 15:51:51,669 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 15:51:51,670 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 15:51:51,670 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 15:51:51,670 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 15:51:51,670 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 15:51:51,671 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 15:51:51,671 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 15:51:51,671 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 15:51:51,671 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 15:51:51,671 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 15:51:51,671 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 15:51:51,671 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 15:51:51,671 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 15:51:51,671 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 15:51:51,671 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 15:51:51,673 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 15:51:51,673 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 15:51:51,673 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 15:51:51,673 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 15:51:51,673 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 15:51:51,673 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 15:51:51,673 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 15:51:51,674 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 15:51:51,674 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 15:51:51,674 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 15:51:51,674 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:51:51,674 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 15:51:51,674 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 15:51:51,674 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 15:51:51,674 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 15:51:51,674 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 15:51:51,674 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 15:51:51,674 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 15:51:51,674 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 15:51:51,674 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 15:51:51,674 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 15:51:51,674 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 -> 4583285deb29d8014ded34089a46614a743cea13eee9bbb990cdfd770bfce36e [2025-02-05 15:51:51,953 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 15:51:51,964 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 15:51:51,966 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 15:51:51,968 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 15:51:51,968 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 15:51:51,969 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec2_product52.cil.c [2025-02-05 15:51:53,294 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/63cffef70/89344be09a0842d28ddfd8d411eb164e/FLAG3f85e8ae5 [2025-02-05 15:51:53,637 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 15:51:53,638 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product52.cil.c [2025-02-05 15:51:53,657 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/63cffef70/89344be09a0842d28ddfd8d411eb164e/FLAG3f85e8ae5 [2025-02-05 15:51:53,677 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/63cffef70/89344be09a0842d28ddfd8d411eb164e [2025-02-05 15:51:53,680 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 15:51:53,682 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 15:51:53,683 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 15:51:53,683 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 15:51:53,687 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 15:51:53,688 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:51:53" (1/1) ... [2025-02-05 15:51:53,690 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68b86731 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:51:53, skipping insertion in model container [2025-02-05 15:51:53,690 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:51:53" (1/1) ... [2025-02-05 15:51:53,725 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 15:51:53,992 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product52.cil.c[19177,19190] [2025-02-05 15:51:53,995 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:51:54,006 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 15:51:54,014 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [49] [2025-02-05 15:51:54,016 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [124] [2025-02-05 15:51:54,016 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [354] [2025-02-05 15:51:54,016 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [455] [2025-02-05 15:51:54,016 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [495] [2025-02-05 15:51:54,017 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [530] [2025-02-05 15:51:54,017 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [634] [2025-02-05 15:51:54,017 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1000] [2025-02-05 15:51:54,101 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product52.cil.c[19177,19190] [2025-02-05 15:51:54,101 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:51:54,121 INFO L204 MainTranslator]: Completed translation [2025-02-05 15:51:54,122 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:51:54 WrapperNode [2025-02-05 15:51:54,122 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 15:51:54,124 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 15:51:54,124 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 15:51:54,124 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 15:51:54,130 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:51:54" (1/1) ... [2025-02-05 15:51:54,143 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:51:54" (1/1) ... [2025-02-05 15:51:54,163 INFO L138 Inliner]: procedures = 58, calls = 102, calls flagged for inlining = 24, calls inlined = 21, statements flattened = 209 [2025-02-05 15:51:54,163 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 15:51:54,164 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 15:51:54,164 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 15:51:54,164 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 15:51:54,171 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:51:54" (1/1) ... [2025-02-05 15:51:54,172 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:51:54" (1/1) ... [2025-02-05 15:51:54,174 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:51:54" (1/1) ... [2025-02-05 15:51:54,187 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:51:54,187 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:51:54" (1/1) ... [2025-02-05 15:51:54,187 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:51:54" (1/1) ... [2025-02-05 15:51:54,192 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:51:54" (1/1) ... [2025-02-05 15:51:54,193 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:51:54" (1/1) ... [2025-02-05 15:51:54,194 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:51:54" (1/1) ... [2025-02-05 15:51:54,195 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:51:54" (1/1) ... [2025-02-05 15:51:54,196 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 15:51:54,197 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 15:51:54,197 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 15:51:54,197 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 15:51:54,198 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:51:54" (1/1) ... [2025-02-05 15:51:54,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:51:54,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:51:54,227 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:51:54,232 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:51:54,255 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 15:51:54,255 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2025-02-05 15:51:54,256 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2025-02-05 15:51:54,256 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2025-02-05 15:51:54,256 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2025-02-05 15:51:54,256 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-02-05 15:51:54,256 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-02-05 15:51:54,256 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-02-05 15:51:54,256 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-02-05 15:51:54,256 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__highWaterSensor [2025-02-05 15:51:54,256 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__highWaterSensor [2025-02-05 15:51:54,257 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2025-02-05 15:51:54,257 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2025-02-05 15:51:54,257 INFO L130 BoogieDeclarations]: Found specification of procedure deactivatePump [2025-02-05 15:51:54,257 INFO L138 BoogieDeclarations]: Found implementation of procedure deactivatePump [2025-02-05 15:51:54,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 15:51:54,257 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2025-02-05 15:51:54,257 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2025-02-05 15:51:54,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 15:51:54,257 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 15:51:54,334 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 15:51:54,336 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 15:51:54,388 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L576: #res := ~retValue_acc~7; [2025-02-05 15:51:54,420 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint cleanupFINAL: assume true; [2025-02-05 15:51:54,492 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L254-1: isPumpRunning_#res#1 := isPumpRunning_~retValue_acc~1#1; [2025-02-05 15:51:54,492 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L631-1: isLowWaterSensorDry_#res#1 := isLowWaterSensorDry_~retValue_acc~10#1; [2025-02-05 15:51:54,493 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L328-1: isLowWaterLevel_#res#1 := isLowWaterLevel_~retValue_acc~3#1; [2025-02-05 15:51:54,588 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L527-1: valid_product_#res#1 := valid_product_~retValue_acc~6#1; [2025-02-05 15:51:54,588 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L452-1: main_#res#1 := main_~retValue_acc~4#1; [2025-02-05 15:51:54,623 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L309-1: isHighWaterLevel_#res#1 := isHighWaterLevel_~retValue_acc~2#1; [2025-02-05 15:51:54,624 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L622-1: isHighWaterSensorDry_#res#1 := isHighWaterSensorDry_~retValue_acc~9#1; [2025-02-05 15:51:54,647 INFO L? ?]: Removed 45 outVars from TransFormulas that were not future-live. [2025-02-05 15:51:54,651 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 15:51:54,664 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 15:51:54,664 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 15:51:54,665 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:51:54 BoogieIcfgContainer [2025-02-05 15:51:54,665 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 15:51:54,667 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 15:51:54,668 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 15:51:54,672 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 15:51:54,672 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 03:51:53" (1/3) ... [2025-02-05 15:51:54,673 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@430ffa70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:51:54, skipping insertion in model container [2025-02-05 15:51:54,673 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:51:54" (2/3) ... [2025-02-05 15:51:54,673 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@430ffa70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:51:54, skipping insertion in model container [2025-02-05 15:51:54,673 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:51:54" (3/3) ... [2025-02-05 15:51:54,674 INFO L128 eAbstractionObserver]: Analyzing ICFG minepump_spec2_product52.cil.c [2025-02-05 15:51:54,689 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 15:51:54,690 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG minepump_spec2_product52.cil.c that has 9 procedures, 95 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-02-05 15:51:54,753 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 15:51:54,767 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;@70821449, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 15:51:54,767 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 15:51:54,772 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 71 states have (on average 1.3661971830985915) internal successors, (97), 80 states have internal predecessors, (97), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (12), 9 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-05 15:51:54,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-05 15:51:54,781 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:51:54,781 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:51:54,782 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:51:54,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:51:54,788 INFO L85 PathProgramCache]: Analyzing trace with hash 558534064, now seen corresponding path program 1 times [2025-02-05 15:51:54,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:51:54,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633249839] [2025-02-05 15:51:54,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:51:54,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:51:54,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-05 15:51:54,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-05 15:51:54,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:51:54,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:51:54,975 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:51:54,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:51:54,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633249839] [2025-02-05 15:51:54,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633249839] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:51:54,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:51:54,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 15:51:54,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066534891] [2025-02-05 15:51:54,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:51:54,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 15:51:54,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:51:54,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 15:51:55,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 15:51:55,003 INFO L87 Difference]: Start difference. First operand has 94 states, 71 states have (on average 1.3661971830985915) internal successors, (97), 80 states have internal predecessors, (97), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (12), 9 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 15:51:55,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:51:55,036 INFO L93 Difference]: Finished difference Result 171 states and 230 transitions. [2025-02-05 15:51:55,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 15:51:55,038 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2025-02-05 15:51:55,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:51:55,045 INFO L225 Difference]: With dead ends: 171 [2025-02-05 15:51:55,046 INFO L226 Difference]: Without dead ends: 86 [2025-02-05 15:51:55,050 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:51:55,052 INFO L435 NwaCegarLoop]: 116 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, 116 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:51:55,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:51:55,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-02-05 15:51:55,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2025-02-05 15:51:55,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 65 states have (on average 1.323076923076923) internal successors, (86), 73 states have internal predecessors, (86), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (12), 9 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-05 15:51:55,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 111 transitions. [2025-02-05 15:51:55,101 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 111 transitions. Word has length 25 [2025-02-05 15:51:55,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:51:55,102 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 111 transitions. [2025-02-05 15:51:55,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 15:51:55,103 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 111 transitions. [2025-02-05 15:51:55,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-05 15:51:55,105 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:51:55,105 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] [2025-02-05 15:51:55,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 15:51:55,106 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:51:55,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:51:55,107 INFO L85 PathProgramCache]: Analyzing trace with hash 280667864, now seen corresponding path program 1 times [2025-02-05 15:51:55,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:51:55,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3568977] [2025-02-05 15:51:55,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:51:55,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:51:55,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-05 15:51:55,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-05 15:51:55,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:51:55,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:51:55,242 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:51:55,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:51:55,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3568977] [2025-02-05 15:51:55,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3568977] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:51:55,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:51:55,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:51:55,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559121095] [2025-02-05 15:51:55,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:51:55,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:51:55,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:51:55,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:51:55,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:51:55,245 INFO L87 Difference]: Start difference. First operand 86 states and 111 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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:51:55,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:51:55,262 INFO L93 Difference]: Finished difference Result 133 states and 171 transitions. [2025-02-05 15:51:55,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:51:55,263 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 26 [2025-02-05 15:51:55,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:51:55,264 INFO L225 Difference]: With dead ends: 133 [2025-02-05 15:51:55,264 INFO L226 Difference]: Without dead ends: 77 [2025-02-05 15:51: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:51:55,265 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 16 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:51:55,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 175 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:51:55,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-02-05 15:51:55,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-02-05 15:51:55,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 59 states have (on average 1.3389830508474576) internal successors, (79), 67 states have internal predecessors, (79), 10 states have call successors, (10), 7 states have call predecessors, (10), 7 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-05 15:51:55,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 99 transitions. [2025-02-05 15:51:55,290 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 99 transitions. Word has length 26 [2025-02-05 15:51:55,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:51:55,290 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 99 transitions. [2025-02-05 15:51:55,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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:51:55,290 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 99 transitions. [2025-02-05 15:51:55,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-05 15:51:55,294 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:51:55,294 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] [2025-02-05 15:51:55,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 15:51:55,294 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:51:55,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:51:55,295 INFO L85 PathProgramCache]: Analyzing trace with hash -57290059, now seen corresponding path program 1 times [2025-02-05 15:51:55,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:51:55,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993330647] [2025-02-05 15:51:55,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:51:55,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:51:55,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-05 15:51:55,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-05 15:51:55,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:51:55,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:51:55,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:51:55,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:51:55,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993330647] [2025-02-05 15:51:55,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993330647] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:51:55,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:51:55,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:51:55,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431532344] [2025-02-05 15:51:55,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:51:55,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:51:55,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:51:55,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:51:55,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:51:55,383 INFO L87 Difference]: Start difference. First operand 77 states and 99 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (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:51:55,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:51:55,431 INFO L93 Difference]: Finished difference Result 213 states and 280 transitions. [2025-02-05 15:51:55,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:51:55,432 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (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 30 [2025-02-05 15:51:55,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:51:55,434 INFO L225 Difference]: With dead ends: 213 [2025-02-05 15:51:55,434 INFO L226 Difference]: Without dead ends: 144 [2025-02-05 15:51:55,434 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:51:55,435 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 91 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:51:55,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 202 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:51:55,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-02-05 15:51:55,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 141. [2025-02-05 15:51:55,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 106 states have (on average 1.3679245283018868) internal successors, (145), 121 states have internal predecessors, (145), 20 states have call successors, (20), 14 states have call predecessors, (20), 14 states have return successors, (20), 13 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-05 15:51:55,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 185 transitions. [2025-02-05 15:51:55,464 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 185 transitions. Word has length 30 [2025-02-05 15:51:55,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:51:55,464 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 185 transitions. [2025-02-05 15:51:55,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (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:51:55,465 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 185 transitions. [2025-02-05 15:51:55,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-02-05 15:51:55,466 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:51:55,466 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:51:55,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 15:51:55,466 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:51:55,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:51:55,467 INFO L85 PathProgramCache]: Analyzing trace with hash -2109589879, now seen corresponding path program 1 times [2025-02-05 15:51:55,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:51:55,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043530730] [2025-02-05 15:51:55,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:51:55,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:51:55,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-05 15:51:55,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-05 15:51:55,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:51:55,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:51:55,635 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:51:55,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:51:55,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043530730] [2025-02-05 15:51:55,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043530730] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:51:55,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:51:55,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:51:55,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354206250] [2025-02-05 15:51:55,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:51:55,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:51:55,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:51:55,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:51:55,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:51:55,639 INFO L87 Difference]: Start difference. First operand 141 states and 185 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 15:51:55,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:51:55,746 INFO L93 Difference]: Finished difference Result 355 states and 478 transitions. [2025-02-05 15:51:55,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:51:55,747 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2025-02-05 15:51:55,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:51:55,749 INFO L225 Difference]: With dead ends: 355 [2025-02-05 15:51:55,752 INFO L226 Difference]: Without dead ends: 222 [2025-02-05 15:51:55,753 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:51:55,754 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 49 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 349 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.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:51:55,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 349 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:51:55,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2025-02-05 15:51:55,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 221. [2025-02-05 15:51:55,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 166 states have (on average 1.3253012048192772) internal successors, (220), 181 states have internal predecessors, (220), 28 states have call successors, (28), 26 states have call predecessors, (28), 26 states have return successors, (36), 25 states have call predecessors, (36), 28 states have call successors, (36) [2025-02-05 15:51:55,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 284 transitions. [2025-02-05 15:51:55,784 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 284 transitions. Word has length 33 [2025-02-05 15:51:55,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:51:55,785 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 284 transitions. [2025-02-05 15:51:55,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 15:51:55,785 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 284 transitions. [2025-02-05 15:51:55,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-05 15:51:55,786 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:51:55,787 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] [2025-02-05 15:51:55,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 15:51:55,787 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:51:55,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:51:55,787 INFO L85 PathProgramCache]: Analyzing trace with hash 2069231134, now seen corresponding path program 1 times [2025-02-05 15:51:55,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:51:55,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720761517] [2025-02-05 15:51:55,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:51:55,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:51:55,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-05 15:51:55,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-05 15:51:55,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:51:55,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:51:55,891 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:51:55,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:51:55,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720761517] [2025-02-05 15:51:55,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720761517] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:51:55,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:51:55,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:51:55,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378598268] [2025-02-05 15:51:55,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:51:55,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:51:55,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:51:55,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:51:55,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:51:55,895 INFO L87 Difference]: Start difference. First operand 221 states and 284 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 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:51:55,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:51:55,939 INFO L93 Difference]: Finished difference Result 440 states and 576 transitions. [2025-02-05 15:51:55,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:51:55,941 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 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 44 [2025-02-05 15:51:55,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:51:55,943 INFO L225 Difference]: With dead ends: 440 [2025-02-05 15:51:55,945 INFO L226 Difference]: Without dead ends: 227 [2025-02-05 15:51:55,946 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:51:55,947 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 0 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:51:55,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 378 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:51:55,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2025-02-05 15:51:55,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2025-02-05 15:51:55,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 172 states have (on average 1.313953488372093) internal successors, (226), 187 states have internal predecessors, (226), 28 states have call successors, (28), 26 states have call predecessors, (28), 26 states have return successors, (36), 25 states have call predecessors, (36), 28 states have call successors, (36) [2025-02-05 15:51:55,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 290 transitions. [2025-02-05 15:51:55,980 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 290 transitions. Word has length 44 [2025-02-05 15:51:55,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:51:55,981 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 290 transitions. [2025-02-05 15:51:55,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 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:51:55,981 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 290 transitions. [2025-02-05 15:51:55,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-05 15:51:55,982 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:51:55,982 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] [2025-02-05 15:51:55,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 15:51:55,983 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:51:55,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:51:55,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1224759263, now seen corresponding path program 1 times [2025-02-05 15:51:55,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:51:55,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935541003] [2025-02-05 15:51:55,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:51:55,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:51:55,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-05 15:51:56,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-05 15:51:56,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:51:56,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:51:56,101 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:51:56,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:51:56,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935541003] [2025-02-05 15:51:56,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935541003] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:51:56,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:51:56,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:51:56,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128946117] [2025-02-05 15:51:56,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:51:56,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:51:56,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:51:56,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:51:56,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:51:56,105 INFO L87 Difference]: Start difference. First operand 227 states and 290 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 3 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:51:56,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:51:56,167 INFO L93 Difference]: Finished difference Result 454 states and 597 transitions. [2025-02-05 15:51:56,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 15:51:56,169 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 3 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 44 [2025-02-05 15:51:56,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:51:56,171 INFO L225 Difference]: With dead ends: 454 [2025-02-05 15:51:56,171 INFO L226 Difference]: Without dead ends: 235 [2025-02-05 15:51:56,172 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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:51:56,177 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 93 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:51:56,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 405 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:51:56,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2025-02-05 15:51:56,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 231. [2025-02-05 15:51:56,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 176 states have (on average 1.3068181818181819) internal successors, (230), 191 states have internal predecessors, (230), 28 states have call successors, (28), 26 states have call predecessors, (28), 26 states have return successors, (36), 25 states have call predecessors, (36), 28 states have call successors, (36) [2025-02-05 15:51:56,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 294 transitions. [2025-02-05 15:51:56,196 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 294 transitions. Word has length 44 [2025-02-05 15:51:56,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:51:56,196 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 294 transitions. [2025-02-05 15:51:56,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 3 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:51:56,196 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 294 transitions. [2025-02-05 15:51:56,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-05 15:51:56,198 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:51:56,198 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] [2025-02-05 15:51:56,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 15:51:56,198 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:51:56,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:51:56,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1647461089, now seen corresponding path program 1 times [2025-02-05 15:51:56,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:51:56,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227062830] [2025-02-05 15:51:56,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:51:56,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:51:56,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-05 15:51:56,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-05 15:51:56,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:51:56,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:51:56,319 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:51:56,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:51:56,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227062830] [2025-02-05 15:51:56,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227062830] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:51:56,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:51:56,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:51:56,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090354445] [2025-02-05 15:51:56,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:51:56,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:51:56,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:51:56,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:51:56,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:51:56,321 INFO L87 Difference]: Start difference. First operand 231 states and 294 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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:51:56,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:51:56,463 INFO L93 Difference]: Finished difference Result 759 states and 997 transitions. [2025-02-05 15:51:56,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:51:56,463 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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 44 [2025-02-05 15:51:56,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:51:56,467 INFO L225 Difference]: With dead ends: 759 [2025-02-05 15:51:56,469 INFO L226 Difference]: Without dead ends: 536 [2025-02-05 15:51:56,470 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:51:56,472 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 129 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:51:56,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 322 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:51:56,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2025-02-05 15:51:56,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 524. [2025-02-05 15:51:56,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 397 states have (on average 1.279596977329975) internal successors, (508), 426 states have internal predecessors, (508), 64 states have call successors, (64), 60 states have call predecessors, (64), 62 states have return successors, (100), 60 states have call predecessors, (100), 64 states have call successors, (100) [2025-02-05 15:51:56,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 672 transitions. [2025-02-05 15:51:56,519 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 672 transitions. Word has length 44 [2025-02-05 15:51:56,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:51:56,519 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 672 transitions. [2025-02-05 15:51:56,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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:51:56,520 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 672 transitions. [2025-02-05 15:51:56,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-05 15:51:56,521 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:51:56,521 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] [2025-02-05 15:51:56,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 15:51:56,521 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:51:56,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:51:56,522 INFO L85 PathProgramCache]: Analyzing trace with hash 376568131, now seen corresponding path program 1 times [2025-02-05 15:51:56,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:51:56,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706010176] [2025-02-05 15:51:56,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:51:56,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:51:56,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-05 15:51:56,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-05 15:51:56,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:51:56,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:51:56,611 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:51:56,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:51:56,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706010176] [2025-02-05 15:51:56,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706010176] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:51:56,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:51:56,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:51:56,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434142057] [2025-02-05 15:51:56,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:51:56,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:51:56,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:51:56,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:51:56,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:51:56,614 INFO L87 Difference]: Start difference. First operand 524 states and 672 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 15:51:56,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:51:56,677 INFO L93 Difference]: Finished difference Result 866 states and 1146 transitions. [2025-02-05 15:51:56,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:51:56,678 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 48 [2025-02-05 15:51:56,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:51:56,686 INFO L225 Difference]: With dead ends: 866 [2025-02-05 15:51:56,686 INFO L226 Difference]: Without dead ends: 864 [2025-02-05 15:51:56,686 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:51:56,687 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 71 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:51:56,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 185 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:51:56,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2025-02-05 15:51:56,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 824. [2025-02-05 15:51:56,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 824 states, 621 states have (on average 1.288244766505636) internal successors, (800), 672 states have internal predecessors, (800), 104 states have call successors, (104), 96 states have call predecessors, (104), 98 states have return successors, (193), 90 states have call predecessors, (193), 104 states have call successors, (193) [2025-02-05 15:51:56,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 824 states and 1097 transitions. [2025-02-05 15:51:56,777 INFO L78 Accepts]: Start accepts. Automaton has 824 states and 1097 transitions. Word has length 48 [2025-02-05 15:51:56,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:51:56,777 INFO L471 AbstractCegarLoop]: Abstraction has 824 states and 1097 transitions. [2025-02-05 15:51:56,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 15:51:56,777 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 1097 transitions. [2025-02-05 15:51:56,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-05 15:51:56,785 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:51:56,785 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:51:56,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 15:51:56,786 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:51:56,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:51:56,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1439809400, now seen corresponding path program 1 times [2025-02-05 15:51:56,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:51:56,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968499416] [2025-02-05 15:51:56,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:51:56,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:51:56,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-05 15:51:56,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-05 15:51:56,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:51:56,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:51:56,843 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 15:51:56,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:51:56,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968499416] [2025-02-05 15:51:56,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968499416] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:51:56,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:51:56,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:51:56,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644227582] [2025-02-05 15:51:56,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:51:56,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:51:56,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:51:56,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:51:56,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:51:56,846 INFO L87 Difference]: Start difference. First operand 824 states and 1097 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2025-02-05 15:51:56,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:51:56,948 INFO L93 Difference]: Finished difference Result 1342 states and 1785 transitions. [2025-02-05 15:51:56,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:51:56,949 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) Word has length 77 [2025-02-05 15:51:56,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:51:56,954 INFO L225 Difference]: With dead ends: 1342 [2025-02-05 15:51:56,954 INFO L226 Difference]: Without dead ends: 526 [2025-02-05 15:51:56,957 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:51:56,958 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 119 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:51:56,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 239 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:51:56,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2025-02-05 15:51:57,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 498. [2025-02-05 15:51:57,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 381 states have (on average 1.2677165354330708) internal successors, (483), 408 states have internal predecessors, (483), 58 states have call successors, (58), 56 states have call predecessors, (58), 58 states have return successors, (101), 56 states have call predecessors, (101), 58 states have call successors, (101) [2025-02-05 15:51:57,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 642 transitions. [2025-02-05 15:51:57,027 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 642 transitions. Word has length 77 [2025-02-05 15:51:57,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:51:57,027 INFO L471 AbstractCegarLoop]: Abstraction has 498 states and 642 transitions. [2025-02-05 15:51:57,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2025-02-05 15:51:57,027 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 642 transitions. [2025-02-05 15:51:57,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-02-05 15:51:57,030 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:51:57,030 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:51:57,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 15:51:57,032 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:51:57,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:51:57,034 INFO L85 PathProgramCache]: Analyzing trace with hash -686570426, now seen corresponding path program 1 times [2025-02-05 15:51:57,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:51:57,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409241408] [2025-02-05 15:51:57,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:51:57,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:51:57,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-05 15:51:57,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-05 15:51:57,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:51:57,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:51:57,166 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 19 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-05 15:51:57,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:51:57,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409241408] [2025-02-05 15:51:57,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409241408] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:51:57,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1990782419] [2025-02-05 15:51:57,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:51:57,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:51:57,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:51:57,171 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:51:57,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 15:51:57,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-05 15:51:57,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-05 15:51:57,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:51:57,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:51:57,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 15:51:57,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:51:57,369 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:51:57,371 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:51:57,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1990782419] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:51:57,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:51:57,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2025-02-05 15:51:57,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150438353] [2025-02-05 15:51:57,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:51:57,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:51:57,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:51:57,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:51:57,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:51:57,373 INFO L87 Difference]: Start difference. First operand 498 states and 642 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-05 15:51:57,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:51:57,431 INFO L93 Difference]: Finished difference Result 872 states and 1157 transitions. [2025-02-05 15:51:57,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:51:57,432 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 86 [2025-02-05 15:51:57,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:51:57,435 INFO L225 Difference]: With dead ends: 872 [2025-02-05 15:51:57,438 INFO L226 Difference]: Without dead ends: 460 [2025-02-05 15:51:57,440 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:51:57,441 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 42 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:51:57,441 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 205 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:51:57,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2025-02-05 15:51:57,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 346. [2025-02-05 15:51:57,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 264 states have (on average 1.231060606060606) internal successors, (325), 282 states have internal predecessors, (325), 40 states have call successors, (40), 39 states have call predecessors, (40), 41 states have return successors, (53), 37 states have call predecessors, (53), 40 states have call successors, (53) [2025-02-05 15:51:57,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 418 transitions. [2025-02-05 15:51:57,493 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 418 transitions. Word has length 86 [2025-02-05 15:51:57,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:51:57,495 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 418 transitions. [2025-02-05 15:51:57,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-05 15:51:57,495 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 418 transitions. [2025-02-05 15:51:57,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-02-05 15:51:57,497 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:51:57,497 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:51:57,506 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 15:51:57,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-05 15:51:57,698 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:51:57,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:51:57,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1630540268, now seen corresponding path program 1 times [2025-02-05 15:51:57,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:51:57,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647228090] [2025-02-05 15:51:57,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:51:57,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:51:57,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-05 15:51:57,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-05 15:51:57,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:51:57,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:51:57,912 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-05 15:51:57,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:51:57,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647228090] [2025-02-05 15:51:57,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647228090] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:51:57,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [283673653] [2025-02-05 15:51:57,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:51:57,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:51:57,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:51:57,932 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:51:57,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 15:51:57,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-05 15:51:58,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-05 15:51:58,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:51:58,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:51:58,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-05 15:51:58,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:51:58,195 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-02-05 15:51:58,196 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:51:58,362 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-05 15:51:58,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [283673653] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-05 15:51:58,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-05 15:51:58,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 5] total 11 [2025-02-05 15:51:58,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537936813] [2025-02-05 15:51:58,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:51:58,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:51:58,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:51:58,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:51:58,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:51:58,365 INFO L87 Difference]: Start difference. First operand 346 states and 418 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 15:51:58,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:51:58,514 INFO L93 Difference]: Finished difference Result 983 states and 1213 transitions. [2025-02-05 15:51:58,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 15:51:58,515 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 89 [2025-02-05 15:51:58,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:51:58,521 INFO L225 Difference]: With dead ends: 983 [2025-02-05 15:51:58,522 INFO L226 Difference]: Without dead ends: 645 [2025-02-05 15:51:58,523 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 174 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-02-05 15:51:58,524 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 57 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:51:58,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 443 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:51:58,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2025-02-05 15:51:58,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 613. [2025-02-05 15:51:58,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 613 states, 463 states have (on average 1.2095032397408207) internal successors, (560), 496 states have internal predecessors, (560), 74 states have call successors, (74), 72 states have call predecessors, (74), 75 states have return successors, (101), 67 states have call predecessors, (101), 74 states have call successors, (101) [2025-02-05 15:51:58,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 735 transitions. [2025-02-05 15:51:58,588 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 735 transitions. Word has length 89 [2025-02-05 15:51:58,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:51:58,589 INFO L471 AbstractCegarLoop]: Abstraction has 613 states and 735 transitions. [2025-02-05 15:51:58,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 15:51:58,589 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 735 transitions. [2025-02-05 15:51:58,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-02-05 15:51:58,595 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:51:58,595 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:51:58,605 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 15:51:58,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:51:58,800 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:51:58,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:51:58,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1975257835, now seen corresponding path program 1 times [2025-02-05 15:51:58,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:51:58,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554418219] [2025-02-05 15:51:58,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:51:58,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:51:58,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-05 15:51:58,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-05 15:51:58,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:51:58,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:51:58,972 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-05 15:51:58,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:51:58,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554418219] [2025-02-05 15:51:58,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554418219] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:51:58,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [20075243] [2025-02-05 15:51:58,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:51:58,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:51:58,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:51:58,975 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:51:58,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 15:51:59,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-05 15:51:59,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-05 15:51:59,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:51:59,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:51:59,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-05 15:51:59,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:51:59,168 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:51:59,169 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:51:59,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [20075243] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:51:59,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:51:59,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 7 [2025-02-05 15:51:59,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804400110] [2025-02-05 15:51:59,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:51:59,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:51:59,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:51:59,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:51:59,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:51:59,171 INFO L87 Difference]: Start difference. First operand 613 states and 735 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-05 15:51:59,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:51:59,337 INFO L93 Difference]: Finished difference Result 1649 states and 2066 transitions. [2025-02-05 15:51:59,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:51:59,338 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 93 [2025-02-05 15:51:59,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:51:59,345 INFO L225 Difference]: With dead ends: 1649 [2025-02-05 15:51:59,346 INFO L226 Difference]: Without dead ends: 1196 [2025-02-05 15:51:59,348 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:51:59,349 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 128 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:51:59,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 581 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:51:59,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2025-02-05 15:51:59,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 1157. [2025-02-05 15:51:59,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1157 states, 867 states have (on average 1.2064590542099192) internal successors, (1046), 927 states have internal predecessors, (1046), 146 states have call successors, (146), 142 states have call predecessors, (146), 143 states have return successors, (214), 133 states have call predecessors, (214), 146 states have call successors, (214) [2025-02-05 15:51:59,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1406 transitions. [2025-02-05 15:51:59,431 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1406 transitions. Word has length 93 [2025-02-05 15:51:59,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:51:59,431 INFO L471 AbstractCegarLoop]: Abstraction has 1157 states and 1406 transitions. [2025-02-05 15:51:59,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-05 15:51:59,432 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1406 transitions. [2025-02-05 15:51:59,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-02-05 15:51:59,434 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:51:59,434 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:51:59,442 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-05 15:51:59,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:51:59,636 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:51:59,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:51:59,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1908251082, now seen corresponding path program 1 times [2025-02-05 15:51:59,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:51:59,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092920044] [2025-02-05 15:51:59,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:51:59,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:51:59,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-05 15:51:59,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-05 15:51:59,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:51:59,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:51:59,730 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-02-05 15:51:59,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:51:59,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092920044] [2025-02-05 15:51:59,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092920044] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:51:59,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:51:59,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:51:59,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567677253] [2025-02-05 15:51:59,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:51:59,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:51:59,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:51:59,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:51:59,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:51:59,733 INFO L87 Difference]: Start difference. First operand 1157 states and 1406 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-05 15:51:59,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:51:59,788 INFO L93 Difference]: Finished difference Result 1621 states and 1965 transitions. [2025-02-05 15:51:59,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:51:59,789 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 93 [2025-02-05 15:51:59,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:51:59,791 INFO L225 Difference]: With dead ends: 1621 [2025-02-05 15:51:59,791 INFO L226 Difference]: Without dead ends: 0 [2025-02-05 15:51:59,795 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:51:59,796 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 0 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:51:59,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 339 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:51:59,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-05 15:51:59,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-05 15:51:59,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 15:51:59,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-05 15:51:59,798 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 93 [2025-02-05 15:51:59,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:51:59,798 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-05 15:51:59,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-05 15:51:59,799 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-05 15:51:59,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-05 15:51:59,802 INFO L782 garLoopResultBuilder]: Registering result SAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 15:51:59,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 15:51:59,804 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:51:59,806 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-05 15:52:03,918 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 15:52:03,930 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 03:52:03 BoogieIcfgContainer [2025-02-05 15:52:03,930 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 15:52:03,931 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 15:52:03,931 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 15:52:03,931 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 15:52:03,932 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:51:54" (3/4) ... [2025-02-05 15:52:03,934 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-05 15:52:03,939 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure deactivatePump [2025-02-05 15:52:03,939 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__base [2025-02-05 15:52:03,939 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure changeMethaneLevel [2025-02-05 15:52:03,939 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure isMethaneLevelCritical [2025-02-05 15:52:03,940 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure cleanup [2025-02-05 15:52:03,940 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure timeShift [2025-02-05 15:52:03,940 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__highWaterSensor [2025-02-05 15:52:03,940 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure waterRise [2025-02-05 15:52:03,945 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2025-02-05 15:52:03,945 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-02-05 15:52:03,945 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-05 15:52:03,946 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-05 15:52:03,946 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-05 15:52:04,024 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-05 15:52:04,024 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-05 15:52:04,024 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 15:52:04,025 INFO L158 Benchmark]: Toolchain (without parser) took 10343.19ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 104.6MB in the beginning and 204.1MB in the end (delta: -99.5MB). Peak memory consumption was 86.0MB. Max. memory is 16.1GB. [2025-02-05 15:52:04,025 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 125.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 15:52:04,025 INFO L158 Benchmark]: CACSL2BoogieTranslator took 440.22ms. Allocated memory is still 142.6MB. Free memory was 104.6MB in the beginning and 86.2MB in the end (delta: 18.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 15:52:04,025 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.69ms. Allocated memory is still 142.6MB. Free memory was 86.2MB in the beginning and 84.1MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 15:52:04,025 INFO L158 Benchmark]: Boogie Preprocessor took 32.29ms. Allocated memory is still 142.6MB. Free memory was 84.1MB in the beginning and 82.9MB in the end (delta: 1.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 15:52:04,025 INFO L158 Benchmark]: IcfgBuilder took 468.08ms. Allocated memory is still 142.6MB. Free memory was 82.9MB in the beginning and 64.1MB in the end (delta: 18.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 15:52:04,026 INFO L158 Benchmark]: TraceAbstraction took 9262.67ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 63.1MB in the beginning and 212.4MB in the end (delta: -149.3MB). Peak memory consumption was 146.1MB. Max. memory is 16.1GB. [2025-02-05 15:52:04,026 INFO L158 Benchmark]: Witness Printer took 93.14ms. Allocated memory is still 327.2MB. Free memory was 212.4MB in the beginning and 204.1MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 15:52:04,027 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.19ms. Allocated memory is still 201.3MB. Free memory is still 125.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 440.22ms. Allocated memory is still 142.6MB. Free memory was 104.6MB in the beginning and 86.2MB in the end (delta: 18.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.69ms. Allocated memory is still 142.6MB. Free memory was 86.2MB in the beginning and 84.1MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 32.29ms. Allocated memory is still 142.6MB. Free memory was 84.1MB in the beginning and 82.9MB in the end (delta: 1.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 468.08ms. Allocated memory is still 142.6MB. Free memory was 82.9MB in the beginning and 64.1MB in the end (delta: 18.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 9262.67ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 63.1MB in the beginning and 212.4MB in the end (delta: -149.3MB). Peak memory consumption was 146.1MB. Max. memory is 16.1GB. * Witness Printer took 93.14ms. Allocated memory is still 327.2MB. Free memory was 212.4MB in the beginning and 204.1MB in the end (delta: 8.2MB). 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,"scenario.i","") [49] - GenericResultAtLocation [Line: 124]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [124] - GenericResultAtLocation [Line: 354]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [354] - GenericResultAtLocation [Line: 455]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [455] - GenericResultAtLocation [Line: 495]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [495] - GenericResultAtLocation [Line: 530]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [530] - GenericResultAtLocation [Line: 634]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [634] - GenericResultAtLocation [Line: 1000]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1000] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 1005]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 95 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.1s, OverallIterations: 13, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 800 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 795 mSDsluCounter, 3939 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2443 mSDsCounter, 46 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 296 IncrementalHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 46 mSolverCounterUnsat, 1496 mSDtfsCounter, 296 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 428 GetRequests, 380 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1157occurred in iteration=12, InterpolantAutomatonStates: 57, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 13 MinimizatonAttempts, 273 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 1000 NumberOfCodeBlocks, 1000 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1072 ConstructedInterpolants, 0 QuantifiedInterpolants, 1993 SizeOfPredicates, 4 NumberOfNonLiveVariables, 938 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 17 InterpolantComputations, 13 PerfectInterpolantSequences, 242/253 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 66]: Location Invariant Derived location invariant: ((((((1 <= pumpRunning) && (2 <= waterLevel)) && (1 == systemActive)) && (splverifierCounter == 0)) || (((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 == systemActive)) && (splverifierCounter == 0)) && (1 <= waterLevel))) || (((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (splverifierCounter == 0)) && (1 <= waterLevel)) && (0 == systemActive))) - InvariantResult [Line: 366]: Location Invariant Derived location invariant: 0 RESULT: Ultimate proved your program to be correct! [2025-02-05 15:52:04,045 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE