./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec3_product41.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_spec3_product41.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 0cfed743c16ce3c8683c42b92f2e032d4ce7b489a9d3a5e140ec6101c472b3cb --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 15:52:37,004 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 15:52:37,066 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:52:37,070 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 15:52:37,070 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 15:52:37,085 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 15:52:37,086 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 15:52:37,086 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 15:52:37,086 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 15:52:37,086 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 15:52:37,086 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 15:52:37,086 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 15:52:37,087 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 15:52:37,087 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 15:52:37,087 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 15:52:37,087 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 15:52:37,087 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 15:52:37,087 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 15:52:37,087 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 15:52:37,087 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 15:52:37,087 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 15:52:37,088 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 15:52:37,088 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 15:52:37,088 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 15:52:37,088 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 15:52:37,088 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 15:52:37,088 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 15:52:37,088 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 15:52:37,088 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 15:52:37,088 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 15:52:37,088 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 15:52:37,089 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 15:52:37,089 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:52:37,089 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 15:52:37,089 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 15:52:37,089 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 15:52:37,089 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 15:52:37,089 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 15:52:37,089 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 15:52:37,089 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 15:52:37,089 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 15:52:37,089 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 15:52:37,089 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 15:52:37,090 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 -> 0cfed743c16ce3c8683c42b92f2e032d4ce7b489a9d3a5e140ec6101c472b3cb [2025-02-05 15:52:37,324 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 15:52:37,342 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 15:52:37,345 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 15:52:37,346 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 15:52:37,346 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 15:52:37,347 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec3_product41.cil.c [2025-02-05 15:52:38,589 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/405758566/5bda6b0f00b644f588f04accef5086c6/FLAGfc024fd3f [2025-02-05 15:52:38,868 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 15:52:38,869 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec3_product41.cil.c [2025-02-05 15:52:38,876 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/405758566/5bda6b0f00b644f588f04accef5086c6/FLAGfc024fd3f [2025-02-05 15:52:38,886 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/405758566/5bda6b0f00b644f588f04accef5086c6 [2025-02-05 15:52:38,887 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 15:52:38,888 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 15:52:38,889 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 15:52:38,889 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 15:52:38,892 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 15:52:38,892 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:52:38" (1/1) ... [2025-02-05 15:52:38,893 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@191d48b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:52:38, skipping insertion in model container [2025-02-05 15:52:38,893 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:52:38" (1/1) ... [2025-02-05 15:52:38,913 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 15:52:39,116 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_spec3_product41.cil.c[17978,17991] [2025-02-05 15:52:39,119 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:52:39,130 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 15:52:39,136 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [49] [2025-02-05 15:52:39,138 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [87] [2025-02-05 15:52:39,138 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [267] [2025-02-05 15:52:39,138 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification3_spec.i","") [335] [2025-02-05 15:52:39,138 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [371] [2025-02-05 15:52:39,138 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [465] [2025-02-05 15:52:39,138 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [561] [2025-02-05 15:52:39,139 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [927] [2025-02-05 15:52:39,205 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_spec3_product41.cil.c[17978,17991] [2025-02-05 15:52:39,205 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:52:39,220 INFO L204 MainTranslator]: Completed translation [2025-02-05 15:52:39,222 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:52:39 WrapperNode [2025-02-05 15:52:39,222 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 15:52:39,223 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 15:52:39,224 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 15:52:39,224 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 15:52:39,229 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:52:39" (1/1) ... [2025-02-05 15:52:39,243 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:52:39" (1/1) ... [2025-02-05 15:52:39,261 INFO L138 Inliner]: procedures = 53, calls = 96, calls flagged for inlining = 22, calls inlined = 19, statements flattened = 190 [2025-02-05 15:52:39,264 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 15:52:39,265 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 15:52:39,265 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 15:52:39,265 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 15:52:39,270 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:52:39" (1/1) ... [2025-02-05 15:52:39,271 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:52:39" (1/1) ... [2025-02-05 15:52:39,272 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:52:39" (1/1) ... [2025-02-05 15:52:39,292 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:52:39,295 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:52:39" (1/1) ... [2025-02-05 15:52:39,296 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:52:39" (1/1) ... [2025-02-05 15:52:39,299 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:52:39" (1/1) ... [2025-02-05 15:52:39,303 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:52:39" (1/1) ... [2025-02-05 15:52:39,304 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:52:39" (1/1) ... [2025-02-05 15:52:39,305 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:52:39" (1/1) ... [2025-02-05 15:52:39,306 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 15:52:39,309 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 15:52:39,309 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 15:52:39,309 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 15:52:39,310 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:52:39" (1/1) ... [2025-02-05 15:52:39,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:52:39,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:52:39,345 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:52:39,348 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:52:39,366 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 15:52:39,367 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2025-02-05 15:52:39,367 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2025-02-05 15:52:39,367 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-02-05 15:52:39,367 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-02-05 15:52:39,367 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2025-02-05 15:52:39,367 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2025-02-05 15:52:39,367 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-02-05 15:52:39,367 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-02-05 15:52:39,367 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2025-02-05 15:52:39,367 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2025-02-05 15:52:39,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 15:52:39,368 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2025-02-05 15:52:39,368 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2025-02-05 15:52:39,368 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 15:52:39,368 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 15:52:39,413 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 15:52:39,414 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 15:52:39,456 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint cleanupFINAL: assume true; [2025-02-05 15:52:39,459 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L416: #res := ~retValue_acc~5; [2025-02-05 15:52:39,516 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L448-1: getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~6#1; [2025-02-05 15:52:39,516 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L209-1: isPumpRunning_#res#1 := isPumpRunning_~retValue_acc~3#1; [2025-02-05 15:52:39,516 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L462-1: isHighWaterSensorDry_#res#1 := isHighWaterSensorDry_~retValue_acc~7#1; [2025-02-05 15:52:39,516 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L264-1: isHighWaterLevel_#res#1 := isHighWaterLevel_~retValue_acc~4#1; [2025-02-05 15:52:39,516 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L200-1: isMethaneAlarm_#res#1 := isMethaneAlarm_~retValue_acc~2#1; [2025-02-05 15:52:39,577 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-1: main_#res#1 := main_~retValue_acc~8#1; [2025-02-05 15:52:39,577 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L84-1: valid_product_#res#1 := valid_product_~retValue_acc~1#1; [2025-02-05 15:52:39,601 INFO L? ?]: Removed 44 outVars from TransFormulas that were not future-live. [2025-02-05 15:52:39,601 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 15:52:39,613 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 15:52:39,613 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 15:52:39,613 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:52:39 BoogieIcfgContainer [2025-02-05 15:52:39,613 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 15:52:39,616 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 15:52:39,616 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 15:52:39,619 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 15:52:39,619 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 03:52:38" (1/3) ... [2025-02-05 15:52:39,620 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44deb083 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:52:39, skipping insertion in model container [2025-02-05 15:52:39,621 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:52:39" (2/3) ... [2025-02-05 15:52:39,621 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44deb083 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:52:39, skipping insertion in model container [2025-02-05 15:52:39,622 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:52:39" (3/3) ... [2025-02-05 15:52:39,622 INFO L128 eAbstractionObserver]: Analyzing ICFG minepump_spec3_product41.cil.c [2025-02-05 15:52:39,635 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 15:52:39,636 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG minepump_spec3_product41.cil.c that has 7 procedures, 80 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-02-05 15:52:39,682 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 15:52:39,691 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;@6da561ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 15:52:39,692 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 15:52:39,695 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 61 states have (on average 1.3770491803278688) internal successors, (84), 67 states have internal predecessors, (84), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-05 15:52:39,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-05 15:52:39,701 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:52:39,702 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:52:39,702 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:52:39,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:52:39,706 INFO L85 PathProgramCache]: Analyzing trace with hash -536434690, now seen corresponding path program 1 times [2025-02-05 15:52:39,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:52:39,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252958922] [2025-02-05 15:52:39,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:52:39,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:52:39,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-05 15:52:39,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-05 15:52:39,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:52:39,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:52:39,865 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:52:39,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:52:39,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252958922] [2025-02-05 15:52:39,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252958922] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:52:39,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:52:39,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 15:52:39,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005689740] [2025-02-05 15:52:39,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:52:39,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 15:52:39,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:52:39,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 15:52:39,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 15:52:39,892 INFO L87 Difference]: Start difference. First operand has 79 states, 61 states have (on average 1.3770491803278688) internal successors, (84), 67 states have internal predecessors, (84), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 15:52:39,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:52:39,916 INFO L93 Difference]: Finished difference Result 142 states and 193 transitions. [2025-02-05 15:52:39,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 15:52:39,918 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:52:39,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:52:39,924 INFO L225 Difference]: With dead ends: 142 [2025-02-05 15:52:39,925 INFO L226 Difference]: Without dead ends: 71 [2025-02-05 15:52:39,928 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:52:39,931 INFO L435 NwaCegarLoop]: 97 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, 97 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:52:39,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:52:39,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-02-05 15:52:39,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2025-02-05 15:52:39,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 55 states have (on average 1.3272727272727274) internal successors, (73), 60 states have internal predecessors, (73), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-05 15:52:39,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 92 transitions. [2025-02-05 15:52:39,964 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 92 transitions. Word has length 25 [2025-02-05 15:52:39,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:52:39,964 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 92 transitions. [2025-02-05 15:52:39,964 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:52:39,965 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 92 transitions. [2025-02-05 15:52:39,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-05 15:52:39,966 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:52:39,966 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:52:39,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 15:52:39,966 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:52:39,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:52:39,967 INFO L85 PathProgramCache]: Analyzing trace with hash 133852100, now seen corresponding path program 1 times [2025-02-05 15:52:39,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:52:39,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053227223] [2025-02-05 15:52:39,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:52:39,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:52:39,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-05 15:52:39,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-05 15:52:39,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:52:39,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:52:40,038 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:52:40,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:52:40,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053227223] [2025-02-05 15:52:40,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053227223] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:52:40,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:52:40,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:52:40,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551140629] [2025-02-05 15:52:40,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:52:40,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:52:40,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:52:40,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:52:40,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:52:40,041 INFO L87 Difference]: Start difference. First operand 71 states and 92 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:52:40,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:52:40,051 INFO L93 Difference]: Finished difference Result 109 states and 141 transitions. [2025-02-05 15:52:40,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:52:40,051 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:52:40,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:52:40,052 INFO L225 Difference]: With dead ends: 109 [2025-02-05 15:52:40,052 INFO L226 Difference]: Without dead ends: 62 [2025-02-05 15:52:40,053 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:52:40,053 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 11 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 143 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:52:40,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 143 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:52:40,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-02-05 15:52:40,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-02-05 15:52:40,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 49 states have (on average 1.346938775510204) internal successors, (66), 54 states have internal predecessors, (66), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-05 15:52:40,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 80 transitions. [2025-02-05 15:52:40,062 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 80 transitions. Word has length 26 [2025-02-05 15:52:40,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:52:40,062 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 80 transitions. [2025-02-05 15:52:40,062 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:52:40,062 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 80 transitions. [2025-02-05 15:52:40,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-05 15:52:40,063 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:52:40,063 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:52:40,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 15:52:40,063 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:52:40,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:52:40,065 INFO L85 PathProgramCache]: Analyzing trace with hash 2052527567, now seen corresponding path program 1 times [2025-02-05 15:52:40,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:52:40,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702235250] [2025-02-05 15:52:40,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:52:40,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:52:40,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-05 15:52:40,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-05 15:52:40,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:52:40,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:52:40,172 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:52:40,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:52:40,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702235250] [2025-02-05 15:52:40,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702235250] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:52:40,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:52:40,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:52:40,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805559311] [2025-02-05 15:52:40,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:52:40,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:52:40,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:52:40,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:52:40,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:52:40,173 INFO L87 Difference]: Start difference. First operand 62 states and 80 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 15:52:40,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:52:40,184 INFO L93 Difference]: Finished difference Result 117 states and 154 transitions. [2025-02-05 15:52:40,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:52:40,186 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2025-02-05 15:52:40,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:52:40,187 INFO L225 Difference]: With dead ends: 117 [2025-02-05 15:52:40,187 INFO L226 Difference]: Without dead ends: 62 [2025-02-05 15:52:40,188 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:52:40,188 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 63 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 78 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:52:40,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 78 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:52:40,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-02-05 15:52:40,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-02-05 15:52:40,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 49 states have (on average 1.3265306122448979) internal successors, (65), 54 states have internal predecessors, (65), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-05 15:52:40,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 79 transitions. [2025-02-05 15:52:40,199 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 79 transitions. Word has length 29 [2025-02-05 15:52:40,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:52:40,201 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 79 transitions. [2025-02-05 15:52:40,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 15:52:40,201 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 79 transitions. [2025-02-05 15:52:40,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-02-05 15:52:40,202 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:52:40,202 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:52:40,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 15:52:40,202 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:52:40,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:52:40,203 INFO L85 PathProgramCache]: Analyzing trace with hash 215441778, now seen corresponding path program 1 times [2025-02-05 15:52:40,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:52:40,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199185333] [2025-02-05 15:52:40,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:52:40,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:52:40,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-05 15:52:40,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-05 15:52:40,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:52:40,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:52:40,266 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:52:40,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:52:40,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199185333] [2025-02-05 15:52:40,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199185333] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:52:40,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:52:40,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:52:40,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610667511] [2025-02-05 15:52:40,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:52:40,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:52:40,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:52:40,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:52:40,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:52:40,268 INFO L87 Difference]: Start difference. First operand 62 states and 79 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 15:52:40,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:52:40,302 INFO L93 Difference]: Finished difference Result 157 states and 204 transitions. [2025-02-05 15:52:40,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:52:40,302 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 34 [2025-02-05 15:52:40,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:52:40,303 INFO L225 Difference]: With dead ends: 157 [2025-02-05 15:52:40,303 INFO L226 Difference]: Without dead ends: 102 [2025-02-05 15:52:40,303 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:52:40,304 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 68 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:52:40,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 140 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:52:40,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-02-05 15:52:40,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2025-02-05 15:52:40,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 78 states have (on average 1.3205128205128205) internal successors, (103), 85 states have internal predecessors, (103), 11 states have call successors, (11), 10 states have call predecessors, (11), 10 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2025-02-05 15:52:40,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 127 transitions. [2025-02-05 15:52:40,323 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 127 transitions. Word has length 34 [2025-02-05 15:52:40,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:52:40,323 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 127 transitions. [2025-02-05 15:52:40,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 15:52:40,324 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 127 transitions. [2025-02-05 15:52:40,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-02-05 15:52:40,324 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:52:40,324 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] [2025-02-05 15:52:40,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 15:52:40,325 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:52:40,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:52:40,325 INFO L85 PathProgramCache]: Analyzing trace with hash -702888754, now seen corresponding path program 1 times [2025-02-05 15:52:40,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:52:40,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177553452] [2025-02-05 15:52:40,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:52:40,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:52:40,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-05 15:52:40,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-05 15:52:40,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:52:40,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:52:40,541 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:52:40,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:52:40,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177553452] [2025-02-05 15:52:40,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177553452] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:52:40,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:52:40,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:52:40,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920975049] [2025-02-05 15:52:40,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:52:40,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:52:40,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:52:40,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:52:40,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:52:40,545 INFO L87 Difference]: Start difference. First operand 100 states and 127 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 15:52:40,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:52:40,626 INFO L93 Difference]: Finished difference Result 270 states and 359 transitions. [2025-02-05 15:52:40,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:52:40,632 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 40 [2025-02-05 15:52:40,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:52:40,635 INFO L225 Difference]: With dead ends: 270 [2025-02-05 15:52:40,635 INFO L226 Difference]: Without dead ends: 177 [2025-02-05 15:52:40,636 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:52:40,637 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 34 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:52:40,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 282 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:52:40,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2025-02-05 15:52:40,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2025-02-05 15:52:40,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 138 states have (on average 1.2971014492753623) internal successors, (179), 148 states have internal predecessors, (179), 21 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (27), 19 states have call predecessors, (27), 21 states have call successors, (27) [2025-02-05 15:52:40,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 227 transitions. [2025-02-05 15:52:40,651 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 227 transitions. Word has length 40 [2025-02-05 15:52:40,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:52:40,652 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 227 transitions. [2025-02-05 15:52:40,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 15:52:40,652 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 227 transitions. [2025-02-05 15:52:40,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-05 15:52:40,653 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:52:40,653 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:52:40,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 15:52:40,653 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:52:40,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:52:40,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1924566764, now seen corresponding path program 1 times [2025-02-05 15:52:40,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:52:40,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446733308] [2025-02-05 15:52:40,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:52:40,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:52:40,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-05 15:52:40,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-05 15:52:40,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:52:40,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:52:40,783 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:52:40,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:52:40,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446733308] [2025-02-05 15:52:40,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446733308] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:52:40,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:52:40,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:52:40,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078560332] [2025-02-05 15:52:40,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:52:40,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:52:40,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:52:40,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:52:40,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:52:40,785 INFO L87 Difference]: Start difference. First operand 177 states and 227 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 15:52:40,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:52:40,874 INFO L93 Difference]: Finished difference Result 353 states and 474 transitions. [2025-02-05 15:52:40,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:52:40,874 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 44 [2025-02-05 15:52:40,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:52:40,878 INFO L225 Difference]: With dead ends: 353 [2025-02-05 15:52:40,879 INFO L226 Difference]: Without dead ends: 260 [2025-02-05 15:52:40,880 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:52:40,880 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 57 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:52:40,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 278 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:52:40,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2025-02-05 15:52:40,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 256. [2025-02-05 15:52:40,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 200 states have (on average 1.295) internal successors, (259), 214 states have internal predecessors, (259), 30 states have call successors, (30), 27 states have call predecessors, (30), 25 states have return successors, (42), 28 states have call predecessors, (42), 30 states have call successors, (42) [2025-02-05 15:52:40,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 331 transitions. [2025-02-05 15:52:40,915 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 331 transitions. Word has length 44 [2025-02-05 15:52:40,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:52:40,915 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 331 transitions. [2025-02-05 15:52:40,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 15:52:40,915 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 331 transitions. [2025-02-05 15:52:40,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-05 15:52:40,918 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:52:40,918 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:52:40,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 15:52:40,919 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:52:40,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:52:40,919 INFO L85 PathProgramCache]: Analyzing trace with hash 2143421482, now seen corresponding path program 1 times [2025-02-05 15:52:40,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:52:40,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629036658] [2025-02-05 15:52:40,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:52:40,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:52:40,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-05 15:52:40,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-05 15:52:40,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:52:40,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:52:40,958 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:52:40,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:52:40,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629036658] [2025-02-05 15:52:40,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629036658] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:52:40,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:52:40,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:52:40,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177706414] [2025-02-05 15:52:40,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:52:40,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:52:40,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:52:40,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:52:40,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:52:40,963 INFO L87 Difference]: Start difference. First operand 256 states and 331 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 15:52:40,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:52:41,001 INFO L93 Difference]: Finished difference Result 432 states and 565 transitions. [2025-02-05 15:52:41,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:52:41,002 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 44 [2025-02-05 15:52:41,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:52:41,005 INFO L225 Difference]: With dead ends: 432 [2025-02-05 15:52:41,007 INFO L226 Difference]: Without dead ends: 256 [2025-02-05 15:52:41,008 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:52:41,008 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 0 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:52:41,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 228 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:52:41,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2025-02-05 15:52:41,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2025-02-05 15:52:41,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 200 states have (on average 1.29) internal successors, (258), 214 states have internal predecessors, (258), 30 states have call successors, (30), 27 states have call predecessors, (30), 25 states have return successors, (42), 28 states have call predecessors, (42), 30 states have call successors, (42) [2025-02-05 15:52:41,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 330 transitions. [2025-02-05 15:52:41,044 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 330 transitions. Word has length 44 [2025-02-05 15:52:41,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:52:41,044 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 330 transitions. [2025-02-05 15:52:41,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 15:52:41,045 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 330 transitions. [2025-02-05 15:52:41,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-05 15:52:41,046 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:52:41,046 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:52:41,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 15:52:41,046 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:52:41,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:52:41,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1734597257, now seen corresponding path program 1 times [2025-02-05 15:52:41,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:52:41,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087453324] [2025-02-05 15:52:41,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:52:41,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:52:41,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-05 15:52:41,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-05 15:52:41,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:52:41,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:52:41,151 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:52:41,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:52:41,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087453324] [2025-02-05 15:52:41,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087453324] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:52:41,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:52:41,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:52:41,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174776225] [2025-02-05 15:52:41,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:52:41,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:52:41,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:52:41,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:52:41,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:52:41,156 INFO L87 Difference]: Start difference. First operand 256 states and 330 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 15:52:41,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:52:41,197 INFO L93 Difference]: Finished difference Result 508 states and 667 transitions. [2025-02-05 15:52:41,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:52:41,198 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 44 [2025-02-05 15:52:41,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:52:41,200 INFO L225 Difference]: With dead ends: 508 [2025-02-05 15:52:41,200 INFO L226 Difference]: Without dead ends: 259 [2025-02-05 15:52:41,200 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:52:41,201 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 0 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:52:41,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 303 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:52:41,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2025-02-05 15:52:41,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2025-02-05 15:52:41,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 205 states have (on average 1.278048780487805) internal successors, (262), 218 states have internal predecessors, (262), 29 states have call successors, (29), 26 states have call predecessors, (29), 24 states have return successors, (41), 27 states have call predecessors, (41), 29 states have call successors, (41) [2025-02-05 15:52:41,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 332 transitions. [2025-02-05 15:52:41,226 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 332 transitions. Word has length 44 [2025-02-05 15:52:41,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:52:41,226 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 332 transitions. [2025-02-05 15:52:41,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 15:52:41,226 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 332 transitions. [2025-02-05 15:52:41,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-05 15:52:41,228 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:52:41,228 INFO L218 NwaCegarLoop]: trace histogram [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:52:41,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 15:52:41,228 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:52:41,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:52:41,229 INFO L85 PathProgramCache]: Analyzing trace with hash 610220485, now seen corresponding path program 1 times [2025-02-05 15:52:41,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:52:41,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818345198] [2025-02-05 15:52:41,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:52:41,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:52:41,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-05 15:52:41,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-05 15:52:41,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:52:41,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:52:41,349 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 15:52:41,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:52:41,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818345198] [2025-02-05 15:52:41,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818345198] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:52:41,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:52:41,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 15:52:41,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349744598] [2025-02-05 15:52:41,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:52:41,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 15:52:41,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:52:41,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 15:52:41,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:52:41,351 INFO L87 Difference]: Start difference. First operand 259 states and 332 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 15:52:41,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:52:41,506 INFO L93 Difference]: Finished difference Result 701 states and 947 transitions. [2025-02-05 15:52:41,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 15:52:41,507 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 49 [2025-02-05 15:52:41,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:52:41,509 INFO L225 Difference]: With dead ends: 701 [2025-02-05 15:52:41,509 INFO L226 Difference]: Without dead ends: 449 [2025-02-05 15:52:41,510 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-02-05 15:52:41,511 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 55 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 870 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:52:41,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 870 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:52:41,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2025-02-05 15:52:41,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 449. [2025-02-05 15:52:41,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 349 states have (on average 1.2521489971346704) internal successors, (437), 368 states have internal predecessors, (437), 54 states have call successors, (54), 49 states have call predecessors, (54), 45 states have return successors, (86), 50 states have call predecessors, (86), 54 states have call successors, (86) [2025-02-05 15:52:41,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 577 transitions. [2025-02-05 15:52:41,534 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 577 transitions. Word has length 49 [2025-02-05 15:52:41,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:52:41,538 INFO L471 AbstractCegarLoop]: Abstraction has 449 states and 577 transitions. [2025-02-05 15:52:41,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 15:52:41,538 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 577 transitions. [2025-02-05 15:52:41,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-05 15:52:41,539 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:52:41,539 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 15:52:41,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 15:52:41,540 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:52:41,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:52:41,540 INFO L85 PathProgramCache]: Analyzing trace with hash -50980880, now seen corresponding path program 1 times [2025-02-05 15:52:41,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:52:41,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179747932] [2025-02-05 15:52:41,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:52:41,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:52:41,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-05 15:52:41,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-05 15:52:41,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:52:41,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:52:41,616 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 15:52:41,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:52:41,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179747932] [2025-02-05 15:52:41,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179747932] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:52:41,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:52:41,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:52:41,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275078018] [2025-02-05 15:52:41,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:52:41,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:52:41,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:52:41,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:52:41,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:52:41,617 INFO L87 Difference]: Start difference. First operand 449 states and 577 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 15:52:41,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:52:41,705 INFO L93 Difference]: Finished difference Result 889 states and 1150 transitions. [2025-02-05 15:52:41,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:52:41,706 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 50 [2025-02-05 15:52:41,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:52:41,707 INFO L225 Difference]: With dead ends: 889 [2025-02-05 15:52:41,707 INFO L226 Difference]: Without dead ends: 0 [2025-02-05 15:52:41,709 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:52:41,709 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 100 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:52:41,710 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 361 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:52:41,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-05 15:52:41,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-05 15:52:41,710 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:52:41,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-05 15:52:41,711 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 50 [2025-02-05 15:52:41,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:52:41,711 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-05 15:52:41,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 15:52:41,711 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-05 15:52:41,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-05 15:52:41,713 INFO L782 garLoopResultBuilder]: Registering result SAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 15:52:41,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 15:52:41,716 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:52:41,717 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-05 15:52:43,229 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 15:52:43,239 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 03:52:43 BoogieIcfgContainer [2025-02-05 15:52:43,239 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 15:52:43,239 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 15:52:43,239 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 15:52:43,240 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 15:52:43,240 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:52:39" (3/4) ... [2025-02-05 15:52:43,246 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-05 15:52:43,254 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__base [2025-02-05 15:52:43,254 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure changeMethaneLevel [2025-02-05 15:52:43,254 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure cleanup [2025-02-05 15:52:43,254 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure isMethaneLevelCritical [2025-02-05 15:52:43,255 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure timeShift [2025-02-05 15:52:43,255 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure waterRise [2025-02-05 15:52:43,262 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2025-02-05 15:52:43,267 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-02-05 15:52:43,267 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-05 15:52:43,267 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-05 15:52:43,268 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-05 15:52:43,372 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-05 15:52:43,376 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-05 15:52:43,376 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 15:52:43,376 INFO L158 Benchmark]: Toolchain (without parser) took 4488.24ms. Allocated memory is still 142.6MB. Free memory was 111.7MB in the beginning and 98.9MB in the end (delta: 12.9MB). Peak memory consumption was 10.4MB. Max. memory is 16.1GB. [2025-02-05 15:52:43,377 INFO L158 Benchmark]: CDTParser took 1.02ms. Allocated memory is still 201.3MB. Free memory is still 124.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 15:52:43,377 INFO L158 Benchmark]: CACSL2BoogieTranslator took 333.63ms. Allocated memory is still 142.6MB. Free memory was 111.7MB in the beginning and 93.6MB in the end (delta: 18.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 15:52:43,377 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.11ms. Allocated memory is still 142.6MB. Free memory was 93.1MB in the beginning and 91.3MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 15:52:43,377 INFO L158 Benchmark]: Boogie Preprocessor took 43.39ms. Allocated memory is still 142.6MB. Free memory was 91.3MB in the beginning and 90.1MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 15:52:43,377 INFO L158 Benchmark]: IcfgBuilder took 304.77ms. Allocated memory is still 142.6MB. Free memory was 90.1MB in the beginning and 72.4MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 15:52:43,382 INFO L158 Benchmark]: TraceAbstraction took 3623.18ms. Allocated memory is still 142.6MB. Free memory was 71.9MB in the beginning and 106.5MB in the end (delta: -34.5MB). Peak memory consumption was 36.2MB. Max. memory is 16.1GB. [2025-02-05 15:52:43,382 INFO L158 Benchmark]: Witness Printer took 136.43ms. Allocated memory is still 142.6MB. Free memory was 106.5MB in the beginning and 98.9MB in the end (delta: 7.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 15:52:43,383 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.02ms. Allocated memory is still 201.3MB. Free memory is still 124.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 333.63ms. Allocated memory is still 142.6MB. Free memory was 111.7MB in the beginning and 93.6MB in the end (delta: 18.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.11ms. Allocated memory is still 142.6MB. Free memory was 93.1MB in the beginning and 91.3MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 43.39ms. Allocated memory is still 142.6MB. Free memory was 91.3MB in the beginning and 90.1MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 304.77ms. Allocated memory is still 142.6MB. Free memory was 90.1MB in the beginning and 72.4MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3623.18ms. Allocated memory is still 142.6MB. Free memory was 71.9MB in the beginning and 106.5MB in the end (delta: -34.5MB). Peak memory consumption was 36.2MB. Max. memory is 16.1GB. * Witness Printer took 136.43ms. Allocated memory is still 142.6MB. Free memory was 106.5MB in the beginning and 98.9MB in the end (delta: 7.6MB). 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,"featureselect.i","") [49] - GenericResultAtLocation [Line: 87]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [87] - GenericResultAtLocation [Line: 267]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [267] - GenericResultAtLocation [Line: 335]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification3_spec.i","") [335] - GenericResultAtLocation [Line: 371]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [371] - GenericResultAtLocation [Line: 465]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [465] - GenericResultAtLocation [Line: 561]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [561] - GenericResultAtLocation [Line: 927]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [927] * 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: 932]: 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 7 procedures, 80 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.0s, OverallIterations: 10, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 394 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 388 mSDsluCounter, 2780 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1903 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 304 IncrementalHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 877 mSDtfsCounter, 304 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 62 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=449occurred in iteration=9, InterpolantAutomatonStates: 49, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 6 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 385 NumberOfCodeBlocks, 385 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 375 ConstructedInterpolants, 0 QuantifiedInterpolants, 612 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 6/6 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: 281]: Location Invariant Derived location invariant: (((((waterLevel <= 1) && (1 == systemActive)) && (splverifierCounter == 0)) || (((1 == systemActive) && (methaneLevelCritical != 0)) && (splverifierCounter == 0))) || (((pumpRunning != 0) && (1 == systemActive)) && (splverifierCounter == 0))) - InvariantResult [Line: 477]: Location Invariant Derived location invariant: 0 RESULT: Ultimate proved your program to be correct! [2025-02-05 15:52:43,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE