./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec4_product37.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_spec4_product37.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 e3509f37a4190025a6bf9c4e7a81c42e49e3316a9582aab003e20039c8a6c594 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 15:53:21,380 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 15:53:21,434 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:53:21,438 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 15:53:21,438 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 15:53:21,452 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 15:53:21,453 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 15:53:21,453 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 15:53:21,453 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 15:53:21,454 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 15:53:21,454 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 15:53:21,454 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 15:53:21,454 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 15:53:21,454 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 15:53:21,454 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 15:53:21,454 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 15:53:21,454 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 15:53:21,455 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 15:53:21,455 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 15:53:21,455 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 15:53:21,455 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 15:53:21,455 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 15:53:21,455 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 15:53:21,455 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 15:53:21,455 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 15:53:21,456 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 15:53:21,456 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 15:53:21,456 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 15:53:21,456 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 15:53:21,456 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 15:53:21,456 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 15:53:21,456 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 15:53:21,456 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:53:21,457 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 15:53:21,457 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 15:53:21,457 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 15:53:21,457 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 15:53:21,457 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 15:53:21,457 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 15:53:21,457 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 15:53:21,457 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 15:53:21,457 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 15:53:21,458 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 15:53:21,458 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 -> e3509f37a4190025a6bf9c4e7a81c42e49e3316a9582aab003e20039c8a6c594 [2025-02-05 15:53:21,682 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 15:53:21,687 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 15:53:21,689 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 15:53:21,689 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 15:53:21,690 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 15:53:21,690 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec4_product37.cil.c [2025-02-05 15:53:22,967 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/78d710b62/39f52149554c40038e4b76baf4c99928/FLAG47b230713 [2025-02-05 15:53:23,264 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 15:53:23,264 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product37.cil.c [2025-02-05 15:53:23,273 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/78d710b62/39f52149554c40038e4b76baf4c99928/FLAG47b230713 [2025-02-05 15:53:23,560 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/78d710b62/39f52149554c40038e4b76baf4c99928 [2025-02-05 15:53:23,562 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 15:53:23,563 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 15:53:23,566 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 15:53:23,567 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 15:53:23,571 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 15:53:23,572 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:53:23" (1/1) ... [2025-02-05 15:53:23,573 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4db9aec2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:53:23, skipping insertion in model container [2025-02-05 15:53:23,574 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:53:23" (1/1) ... [2025-02-05 15:53:23,607 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 15:53:23,784 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product37.cil.c[6698,6711] [2025-02-05 15:53:23,854 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:53:23,871 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 15:53:23,877 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [49] [2025-02-05 15:53:23,878 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [87] [2025-02-05 15:53:23,878 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [156] [2025-02-05 15:53:23,878 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [343] [2025-02-05 15:53:23,878 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [439] [2025-02-05 15:53:23,878 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [448] [2025-02-05 15:53:23,878 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [543] [2025-02-05 15:53:23,878 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification4_spec.i","") [909] [2025-02-05 15:53:23,898 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product37.cil.c[6698,6711] [2025-02-05 15:53:23,930 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:53:23,948 INFO L204 MainTranslator]: Completed translation [2025-02-05 15:53:23,949 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:53:23 WrapperNode [2025-02-05 15:53:23,949 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 15:53:23,952 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 15:53:23,952 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 15:53:23,952 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 15:53:23,957 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:53:23" (1/1) ... [2025-02-05 15:53:23,970 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:53:23" (1/1) ... [2025-02-05 15:53:23,990 INFO L138 Inliner]: procedures = 53, calls = 97, calls flagged for inlining = 23, calls inlined = 20, statements flattened = 195 [2025-02-05 15:53:23,992 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 15:53:23,993 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 15:53:23,993 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 15:53:23,993 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 15:53:23,999 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:53:23" (1/1) ... [2025-02-05 15:53:23,999 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:53:23" (1/1) ... [2025-02-05 15:53:24,002 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:53:23" (1/1) ... [2025-02-05 15:53:24,011 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:53:24,012 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:53:23" (1/1) ... [2025-02-05 15:53:24,012 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:53:23" (1/1) ... [2025-02-05 15:53:24,016 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:53:23" (1/1) ... [2025-02-05 15:53:24,020 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:53:23" (1/1) ... [2025-02-05 15:53:24,021 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:53:23" (1/1) ... [2025-02-05 15:53:24,021 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:53:23" (1/1) ... [2025-02-05 15:53:24,022 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 15:53:24,027 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 15:53:24,027 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 15:53:24,027 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 15:53:24,027 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:53:23" (1/1) ... [2025-02-05 15:53:24,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:53:24,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:53:24,060 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:53:24,068 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:53:24,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 15:53:24,090 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2025-02-05 15:53:24,090 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2025-02-05 15:53:24,090 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-02-05 15:53:24,090 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-02-05 15:53:24,090 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-02-05 15:53:24,090 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-02-05 15:53:24,090 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__highWaterSensor [2025-02-05 15:53:24,090 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__highWaterSensor [2025-02-05 15:53:24,091 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2025-02-05 15:53:24,091 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2025-02-05 15:53:24,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 15:53:24,091 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2025-02-05 15:53:24,091 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2025-02-05 15:53:24,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 15:53:24,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 15:53:24,138 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 15:53:24,139 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 15:53:24,209 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint cleanupFINAL: assume true; [2025-02-05 15:53:24,281 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L285-1: isPumpRunning_#res#1 := isPumpRunning_~retValue_acc~3#1; [2025-02-05 15:53:24,281 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L494-1: isMethaneLevelCritical_#res#1 := isMethaneLevelCritical_~retValue_acc~6#1; [2025-02-05 15:53:24,281 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L276-1: isMethaneAlarm_#res#1 := isMethaneAlarm_~retValue_acc~2#1; [2025-02-05 15:53:24,281 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L526-1: getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~7#1; [2025-02-05 15:53:24,345 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L436-1: main_#res#1 := main_~retValue_acc~5#1; [2025-02-05 15:53:24,345 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L84-1: valid_product_#res#1 := valid_product_~retValue_acc~1#1; [2025-02-05 15:53:24,377 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L540-1: isHighWaterSensorDry_#res#1 := isHighWaterSensorDry_~retValue_acc~8#1; [2025-02-05 15:53:24,377 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L340-1: isHighWaterLevel_#res#1 := isHighWaterLevel_~retValue_acc~4#1; [2025-02-05 15:53:24,399 INFO L? ?]: Removed 43 outVars from TransFormulas that were not future-live. [2025-02-05 15:53:24,399 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 15:53:24,409 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 15:53:24,410 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 15:53:24,411 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:53:24 BoogieIcfgContainer [2025-02-05 15:53:24,411 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 15:53:24,414 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 15:53:24,414 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 15:53:24,417 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 15:53:24,417 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 03:53:23" (1/3) ... [2025-02-05 15:53:24,418 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bbf2d04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:53:24, skipping insertion in model container [2025-02-05 15:53:24,418 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:53:23" (2/3) ... [2025-02-05 15:53:24,419 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bbf2d04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:53:24, skipping insertion in model container [2025-02-05 15:53:24,419 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:53:24" (3/3) ... [2025-02-05 15:53:24,420 INFO L128 eAbstractionObserver]: Analyzing ICFG minepump_spec4_product37.cil.c [2025-02-05 15:53:24,430 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 15:53:24,433 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG minepump_spec4_product37.cil.c that has 7 procedures, 79 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-02-05 15:53:24,472 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 15:53:24,479 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;@3fcae446, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 15:53:24,480 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 15:53:24,482 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 60 states have (on average 1.3833333333333333) internal successors, (83), 68 states have internal predecessors, (83), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-05 15:53:24,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-05 15:53:24,487 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:53:24,488 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:53:24,488 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:53:24,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:53:24,492 INFO L85 PathProgramCache]: Analyzing trace with hash -407971010, now seen corresponding path program 1 times [2025-02-05 15:53:24,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:53:24,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168504521] [2025-02-05 15:53:24,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:53:24,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:53:24,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-05 15:53:24,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-05 15:53:24,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:53:24,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:53:24,646 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:53:24,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:53:24,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168504521] [2025-02-05 15:53:24,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168504521] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:53:24,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:53:24,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 15:53:24,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486454578] [2025-02-05 15:53:24,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:53:24,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 15:53:24,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:53:24,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 15:53:24,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 15:53:24,672 INFO L87 Difference]: Start difference. First operand has 78 states, 60 states have (on average 1.3833333333333333) internal successors, (83), 68 states have internal predecessors, (83), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 15:53:24,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:53:24,703 INFO L93 Difference]: Finished difference Result 140 states and 191 transitions. [2025-02-05 15:53:24,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 15:53:24,712 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-02-05 15:53:24,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:53:24,717 INFO L225 Difference]: With dead ends: 140 [2025-02-05 15:53:24,721 INFO L226 Difference]: Without dead ends: 70 [2025-02-05 15:53:24,724 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:53:24,729 INFO L435 NwaCegarLoop]: 96 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, 96 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:53:24,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:53:24,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-02-05 15:53:24,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2025-02-05 15:53:24,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 54 states have (on average 1.3333333333333333) internal successors, (72), 61 states have internal predecessors, (72), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-05 15:53:24,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 91 transitions. [2025-02-05 15:53:24,763 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 91 transitions. Word has length 19 [2025-02-05 15:53:24,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:53:24,764 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 91 transitions. [2025-02-05 15:53:24,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 15:53:24,764 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 91 transitions. [2025-02-05 15:53:24,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-05 15:53:24,769 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:53:24,769 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] [2025-02-05 15:53:24,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 15:53:24,770 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:53:24,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:53:24,770 INFO L85 PathProgramCache]: Analyzing trace with hash 605038843, now seen corresponding path program 1 times [2025-02-05 15:53:24,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:53:24,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566132716] [2025-02-05 15:53:24,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:53:24,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:53:24,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-05 15:53:24,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-05 15:53:24,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:53:24,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:53:24,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:53:24,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:53:24,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566132716] [2025-02-05 15:53:24,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566132716] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:53:24,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:53:24,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:53:24,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962113851] [2025-02-05 15:53:24,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:53:24,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:53:24,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:53:24,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:53:24,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:53:24,888 INFO L87 Difference]: Start difference. First operand 70 states and 91 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 15:53:24,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:53:24,902 INFO L93 Difference]: Finished difference Result 107 states and 139 transitions. [2025-02-05 15:53:24,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:53:24,902 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-02-05 15:53:24,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:53:24,903 INFO L225 Difference]: With dead ends: 107 [2025-02-05 15:53:24,903 INFO L226 Difference]: Without dead ends: 61 [2025-02-05 15:53:24,903 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:53:24,904 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 11 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 141 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:53:24,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 141 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:53:24,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-02-05 15:53:24,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2025-02-05 15:53:24,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 55 states have internal predecessors, (65), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-05 15:53:24,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 79 transitions. [2025-02-05 15:53:24,909 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 79 transitions. Word has length 20 [2025-02-05 15:53:24,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:53:24,910 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 79 transitions. [2025-02-05 15:53:24,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 15:53:24,910 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 79 transitions. [2025-02-05 15:53:24,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-05 15:53:24,910 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:53:24,911 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:53:24,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 15:53:24,911 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:53:24,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:53:24,911 INFO L85 PathProgramCache]: Analyzing trace with hash -741571922, now seen corresponding path program 1 times [2025-02-05 15:53:24,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:53:24,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488637160] [2025-02-05 15:53:24,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:53:24,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:53:24,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-05 15:53:24,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-05 15:53:24,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:53:24,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:53:25,006 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:53:25,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:53:25,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488637160] [2025-02-05 15:53:25,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488637160] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:53:25,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:53:25,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 15:53:25,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648032624] [2025-02-05 15:53:25,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:53:25,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:53:25,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:53:25,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:53:25,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:53:25,008 INFO L87 Difference]: Start difference. First operand 61 states and 79 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 15:53:25,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:53:25,016 INFO L93 Difference]: Finished difference Result 115 states and 152 transitions. [2025-02-05 15:53:25,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:53:25,016 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-02-05 15:53:25,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:53:25,017 INFO L225 Difference]: With dead ends: 115 [2025-02-05 15:53:25,017 INFO L226 Difference]: Without dead ends: 61 [2025-02-05 15:53:25,017 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:53:25,018 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 62 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 77 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:53:25,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 77 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:53:25,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-02-05 15:53:25,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2025-02-05 15:53:25,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 55 states have internal predecessors, (64), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-05 15:53:25,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 78 transitions. [2025-02-05 15:53:25,024 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 78 transitions. Word has length 23 [2025-02-05 15:53:25,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:53:25,024 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 78 transitions. [2025-02-05 15:53:25,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 15:53:25,024 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 78 transitions. [2025-02-05 15:53:25,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-05 15:53:25,025 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:53:25,025 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:53:25,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 15:53:25,025 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:53:25,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:53:25,026 INFO L85 PathProgramCache]: Analyzing trace with hash -959844220, now seen corresponding path program 1 times [2025-02-05 15:53:25,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:53:25,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372130691] [2025-02-05 15:53:25,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:53:25,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:53:25,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-05 15:53:25,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-05 15:53:25,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:53:25,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:53:25,077 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:53:25,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:53:25,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372130691] [2025-02-05 15:53:25,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372130691] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:53:25,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:53:25,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:53:25,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382666873] [2025-02-05 15:53:25,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:53:25,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:53:25,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:53:25,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:53:25,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:53:25,081 INFO L87 Difference]: Start difference. First operand 61 states and 78 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 15:53:25,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:53:25,121 INFO L93 Difference]: Finished difference Result 152 states and 201 transitions. [2025-02-05 15:53:25,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:53:25,122 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-02-05 15:53:25,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:53:25,123 INFO L225 Difference]: With dead ends: 152 [2025-02-05 15:53:25,123 INFO L226 Difference]: Without dead ends: 98 [2025-02-05 15:53:25,124 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:53:25,124 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 61 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:53:25,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 139 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:53:25,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-02-05 15:53:25,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2025-02-05 15:53:25,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 75 states have (on average 1.32) internal successors, (99), 82 states have internal predecessors, (99), 10 states have call successors, (10), 10 states have call predecessors, (10), 10 states have return successors, (14), 10 states have call predecessors, (14), 10 states have call successors, (14) [2025-02-05 15:53:25,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 123 transitions. [2025-02-05 15:53:25,140 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 123 transitions. Word has length 29 [2025-02-05 15:53:25,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:53:25,140 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 123 transitions. [2025-02-05 15:53:25,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 15:53:25,140 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 123 transitions. [2025-02-05 15:53:25,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-05 15:53:25,141 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:53:25,141 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] [2025-02-05 15:53:25,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 15:53:25,142 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:53:25,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:53:25,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1809261753, now seen corresponding path program 1 times [2025-02-05 15:53:25,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:53:25,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31631869] [2025-02-05 15:53:25,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:53:25,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:53:25,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-05 15:53:25,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-05 15:53:25,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:53:25,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:53:25,209 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:53:25,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:53:25,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31631869] [2025-02-05 15:53:25,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31631869] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:53:25,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:53:25,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:53:25,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187144602] [2025-02-05 15:53:25,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:53:25,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:53:25,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:53:25,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:53:25,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:53:25,212 INFO L87 Difference]: Start difference. First operand 96 states and 123 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 15:53:25,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:53:25,247 INFO L93 Difference]: Finished difference Result 188 states and 247 transitions. [2025-02-05 15:53:25,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:53:25,247 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2025-02-05 15:53:25,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:53:25,248 INFO L225 Difference]: With dead ends: 188 [2025-02-05 15:53:25,248 INFO L226 Difference]: Without dead ends: 99 [2025-02-05 15:53:25,249 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:53:25,249 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 0 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:53:25,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 294 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:53:25,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-02-05 15:53:25,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-02-05 15:53:25,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 78 states have (on average 1.3076923076923077) internal successors, (102), 85 states have internal predecessors, (102), 10 states have call successors, (10), 10 states have call predecessors, (10), 10 states have return successors, (14), 10 states have call predecessors, (14), 10 states have call successors, (14) [2025-02-05 15:53:25,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 126 transitions. [2025-02-05 15:53:25,258 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 126 transitions. Word has length 37 [2025-02-05 15:53:25,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:53:25,258 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 126 transitions. [2025-02-05 15:53:25,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 15:53:25,258 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 126 transitions. [2025-02-05 15:53:25,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-05 15:53:25,259 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:53:25,259 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] [2025-02-05 15:53:25,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 15:53:25,260 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:53:25,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:53:25,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1980146918, now seen corresponding path program 1 times [2025-02-05 15:53:25,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:53:25,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107710774] [2025-02-05 15:53:25,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:53:25,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:53:25,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-05 15:53:25,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-05 15:53:25,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:53:25,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:53:25,358 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:53:25,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:53:25,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107710774] [2025-02-05 15:53:25,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107710774] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:53:25,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:53:25,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:53:25,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509689121] [2025-02-05 15:53:25,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:53:25,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:53:25,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:53:25,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:53:25,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:53:25,360 INFO L87 Difference]: Start difference. First operand 99 states and 126 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 15:53:25,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:53:25,383 INFO L93 Difference]: Finished difference Result 193 states and 256 transitions. [2025-02-05 15:53:25,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:53:25,383 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2025-02-05 15:53:25,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:53:25,385 INFO L225 Difference]: With dead ends: 193 [2025-02-05 15:53:25,385 INFO L226 Difference]: Without dead ends: 101 [2025-02-05 15:53:25,385 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:53:25,387 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:53:25,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 222 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:53:25,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-02-05 15:53:25,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-02-05 15:53:25,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 80 states have (on average 1.3) internal successors, (104), 87 states have internal predecessors, (104), 10 states have call successors, (10), 10 states have call predecessors, (10), 10 states have return successors, (14), 10 states have call predecessors, (14), 10 states have call successors, (14) [2025-02-05 15:53:25,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 128 transitions. [2025-02-05 15:53:25,396 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 128 transitions. Word has length 37 [2025-02-05 15:53:25,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:53:25,396 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 128 transitions. [2025-02-05 15:53:25,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 15:53:25,396 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 128 transitions. [2025-02-05 15:53:25,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-05 15:53:25,397 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:53:25,397 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] [2025-02-05 15:53:25,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 15:53:25,397 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:53:25,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:53:25,398 INFO L85 PathProgramCache]: Analyzing trace with hash 959078564, now seen corresponding path program 1 times [2025-02-05 15:53:25,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:53:25,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962821292] [2025-02-05 15:53:25,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:53:25,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:53:25,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-05 15:53:25,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-05 15:53:25,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:53:25,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:53:25,478 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:53:25,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:53:25,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962821292] [2025-02-05 15:53:25,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962821292] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:53:25,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:53:25,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:53:25,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616309986] [2025-02-05 15:53:25,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:53:25,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:53:25,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:53:25,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:53:25,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:53:25,480 INFO L87 Difference]: Start difference. First operand 101 states and 128 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 15:53:25,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:53:25,591 INFO L93 Difference]: Finished difference Result 326 states and 431 transitions. [2025-02-05 15:53:25,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:53:25,592 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2025-02-05 15:53:25,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:53:25,594 INFO L225 Difference]: With dead ends: 326 [2025-02-05 15:53:25,594 INFO L226 Difference]: Without dead ends: 232 [2025-02-05 15:53:25,595 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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:53:25,595 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 103 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:53:25,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 253 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:53:25,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-02-05 15:53:25,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 223. [2025-02-05 15:53:25,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 175 states have (on average 1.2857142857142858) internal successors, (225), 188 states have internal predecessors, (225), 23 states have call successors, (23), 23 states have call predecessors, (23), 24 states have return successors, (41), 24 states have call predecessors, (41), 23 states have call successors, (41) [2025-02-05 15:53:25,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 289 transitions. [2025-02-05 15:53:25,620 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 289 transitions. Word has length 37 [2025-02-05 15:53:25,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:53:25,620 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 289 transitions. [2025-02-05 15:53:25,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 15:53:25,621 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 289 transitions. [2025-02-05 15:53:25,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-05 15:53:25,622 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:53:25,622 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] [2025-02-05 15:53:25,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 15:53:25,622 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:53:25,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:53:25,623 INFO L85 PathProgramCache]: Analyzing trace with hash -946986361, now seen corresponding path program 1 times [2025-02-05 15:53:25,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:53:25,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159337697] [2025-02-05 15:53:25,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:53:25,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:53:25,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-05 15:53:25,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-05 15:53:25,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:53:25,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:53:25,690 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:53:25,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:53:25,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159337697] [2025-02-05 15:53:25,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159337697] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:53:25,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:53:25,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:53:25,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887786338] [2025-02-05 15:53:25,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:53:25,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:53:25,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:53:25,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:53:25,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:53:25,693 INFO L87 Difference]: Start difference. First operand 223 states and 289 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 15:53:25,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:53:25,737 INFO L93 Difference]: Finished difference Result 437 states and 569 transitions. [2025-02-05 15:53:25,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:53:25,738 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 39 [2025-02-05 15:53:25,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:53:25,739 INFO L225 Difference]: With dead ends: 437 [2025-02-05 15:53:25,740 INFO L226 Difference]: Without dead ends: 221 [2025-02-05 15:53:25,740 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:53:25,741 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 30 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:53:25,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 281 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:53:25,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2025-02-05 15:53:25,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2025-02-05 15:53:25,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 173 states have (on average 1.277456647398844) internal successors, (221), 186 states have internal predecessors, (221), 23 states have call successors, (23), 23 states have call predecessors, (23), 24 states have return successors, (41), 24 states have call predecessors, (41), 23 states have call successors, (41) [2025-02-05 15:53:25,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 285 transitions. [2025-02-05 15:53:25,756 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 285 transitions. Word has length 39 [2025-02-05 15:53:25,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:53:25,756 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 285 transitions. [2025-02-05 15:53:25,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 15:53:25,756 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 285 transitions. [2025-02-05 15:53:25,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-05 15:53:25,757 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:53:25,757 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] [2025-02-05 15:53:25,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 15:53:25,758 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:53:25,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:53:25,758 INFO L85 PathProgramCache]: Analyzing trace with hash 185920646, now seen corresponding path program 1 times [2025-02-05 15:53:25,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:53:25,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195380060] [2025-02-05 15:53:25,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:53:25,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:53:25,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-05 15:53:25,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-05 15:53:25,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:53:25,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:53:25,824 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:53:25,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:53:25,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195380060] [2025-02-05 15:53:25,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195380060] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:53:25,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:53:25,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:53:25,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688502289] [2025-02-05 15:53:25,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:53:25,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:53:25,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:53:25,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:53:25,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:53:25,825 INFO L87 Difference]: Start difference. First operand 221 states and 285 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 15:53:25,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:53:25,875 INFO L93 Difference]: Finished difference Result 461 states and 628 transitions. [2025-02-05 15:53:25,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:53:25,876 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 41 [2025-02-05 15:53:25,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:53:25,877 INFO L225 Difference]: With dead ends: 461 [2025-02-05 15:53:25,877 INFO L226 Difference]: Without dead ends: 286 [2025-02-05 15:53:25,878 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:53:25,878 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 42 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:53:25,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 423 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:53:25,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2025-02-05 15:53:25,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 286. [2025-02-05 15:53:25,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 222 states have (on average 1.2657657657657657) internal successors, (281), 237 states have internal predecessors, (281), 31 states have call successors, (31), 31 states have call predecessors, (31), 32 states have return successors, (62), 32 states have call predecessors, (62), 31 states have call successors, (62) [2025-02-05 15:53:25,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 374 transitions. [2025-02-05 15:53:25,935 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 374 transitions. Word has length 41 [2025-02-05 15:53:25,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:53:25,935 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 374 transitions. [2025-02-05 15:53:25,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 15:53:25,935 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 374 transitions. [2025-02-05 15:53:25,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-05 15:53:25,940 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:53:25,940 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] [2025-02-05 15:53:25,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 15:53:25,940 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:53:25,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:53:25,941 INFO L85 PathProgramCache]: Analyzing trace with hash -922403351, now seen corresponding path program 1 times [2025-02-05 15:53:25,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:53:25,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040590630] [2025-02-05 15:53:25,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:53:25,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:53:25,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-05 15:53:25,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-05 15:53:25,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:53:25,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:53:26,028 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:53:26,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:53:26,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040590630] [2025-02-05 15:53:26,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040590630] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:53:26,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:53:26,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:53:26,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978273542] [2025-02-05 15:53:26,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:53:26,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:53:26,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:53:26,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:53:26,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:53:26,030 INFO L87 Difference]: Start difference. First operand 286 states and 374 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 15:53:26,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:53:26,169 INFO L93 Difference]: Finished difference Result 306 states and 400 transitions. [2025-02-05 15:53:26,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 15:53:26,170 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 43 [2025-02-05 15:53:26,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:53:26,172 INFO L225 Difference]: With dead ends: 306 [2025-02-05 15:53:26,172 INFO L226 Difference]: Without dead ends: 304 [2025-02-05 15:53:26,172 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:53:26,172 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 103 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:53:26,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 239 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:53:26,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2025-02-05 15:53:26,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2025-02-05 15:53:26,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 238 states have (on average 1.2478991596638656) internal successors, (297), 253 states have internal predecessors, (297), 31 states have call successors, (31), 31 states have call predecessors, (31), 34 states have return successors, (67), 32 states have call predecessors, (67), 31 states have call successors, (67) [2025-02-05 15:53:26,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 395 transitions. [2025-02-05 15:53:26,190 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 395 transitions. Word has length 43 [2025-02-05 15:53:26,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:53:26,190 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 395 transitions. [2025-02-05 15:53:26,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 15:53:26,190 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 395 transitions. [2025-02-05 15:53:26,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-02-05 15:53:26,191 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:53:26,192 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:53:26,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 15:53:26,192 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:53:26,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:53:26,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1841882621, now seen corresponding path program 1 times [2025-02-05 15:53:26,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:53:26,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76979042] [2025-02-05 15:53:26,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:53:26,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:53:26,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-05 15:53:26,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-05 15:53:26,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:53:26,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:53:26,277 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 15:53:26,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:53:26,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76979042] [2025-02-05 15:53:26,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76979042] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:53:26,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [459685826] [2025-02-05 15:53:26,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:53:26,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:53:26,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:53:26,280 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:53:26,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 15:53:26,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-05 15:53:26,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-05 15:53:26,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:53:26,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:53:26,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 15:53:26,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:53:26,416 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:53:26,416 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:53:26,507 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 15:53:26,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [459685826] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:53:26,508 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:53:26,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2025-02-05 15:53:26,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570917784] [2025-02-05 15:53:26,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:53:26,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:53:26,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:53:26,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:53:26,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:53:26,509 INFO L87 Difference]: Start difference. First operand 304 states and 395 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 15:53:26,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:53:26,644 INFO L93 Difference]: Finished difference Result 695 states and 957 transitions. [2025-02-05 15:53:26,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 15:53:26,645 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 72 [2025-02-05 15:53:26,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:53:26,647 INFO L225 Difference]: With dead ends: 695 [2025-02-05 15:53:26,648 INFO L226 Difference]: Without dead ends: 439 [2025-02-05 15:53:26,649 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 140 SyntacticMatches, 5 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:53:26,650 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 75 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:53:26,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 443 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:53:26,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2025-02-05 15:53:26,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 393. [2025-02-05 15:53:26,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 306 states have (on average 1.2483660130718954) internal successors, (382), 326 states have internal predecessors, (382), 41 states have call successors, (41), 41 states have call predecessors, (41), 45 states have return successors, (91), 39 states have call predecessors, (91), 41 states have call successors, (91) [2025-02-05 15:53:26,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 514 transitions. [2025-02-05 15:53:26,678 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 514 transitions. Word has length 72 [2025-02-05 15:53:26,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:53:26,678 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 514 transitions. [2025-02-05 15:53:26,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 15:53:26,679 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 514 transitions. [2025-02-05 15:53:26,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-05 15:53:26,680 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:53:26,680 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 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:53:26,688 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 15:53:26,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-05 15:53:26,884 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:53:26,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:53:26,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1583448858, now seen corresponding path program 2 times [2025-02-05 15:53:26,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:53:26,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504159106] [2025-02-05 15:53:26,887 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:53:26,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:53:26,896 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 103 statements into 2 equivalence classes. [2025-02-05 15:53:26,906 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 103 of 103 statements. [2025-02-05 15:53:26,907 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 15:53:26,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 15:53:26,907 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-05 15:53:26,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-05 15:53:26,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-05 15:53:26,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:53:26,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 15:53:26,937 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-05 15:53:26,937 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-05 15:53:26,938 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 15:53:26,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 15:53:26,941 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:53:26,982 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 15:53:26,984 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 03:53:26 BoogieIcfgContainer [2025-02-05 15:53:26,984 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 15:53:26,985 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 15:53:26,985 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 15:53:26,985 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 15:53:26,985 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:53:24" (3/4) ... [2025-02-05 15:53:26,986 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-05 15:53:27,041 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 96. [2025-02-05 15:53:27,098 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-05 15:53:27,098 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-05 15:53:27,098 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 15:53:27,099 INFO L158 Benchmark]: Toolchain (without parser) took 3536.20ms. Allocated memory is still 201.3MB. Free memory was 158.0MB in the beginning and 114.6MB in the end (delta: 43.4MB). Peak memory consumption was 41.6MB. Max. memory is 16.1GB. [2025-02-05 15:53:27,099 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 209.7MB. Free memory is still 125.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 15:53:27,099 INFO L158 Benchmark]: CACSL2BoogieTranslator took 384.79ms. Allocated memory is still 201.3MB. Free memory was 158.0MB in the beginning and 139.6MB in the end (delta: 18.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 15:53:27,099 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.66ms. Allocated memory is still 201.3MB. Free memory was 139.6MB in the beginning and 137.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 15:53:27,100 INFO L158 Benchmark]: Boogie Preprocessor took 33.24ms. Allocated memory is still 201.3MB. Free memory was 137.7MB in the beginning and 136.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 15:53:27,100 INFO L158 Benchmark]: IcfgBuilder took 384.53ms. Allocated memory is still 201.3MB. Free memory was 136.1MB in the beginning and 118.2MB in the end (delta: 17.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-05 15:53:27,100 INFO L158 Benchmark]: TraceAbstraction took 2570.36ms. Allocated memory is still 201.3MB. Free memory was 117.6MB in the beginning and 128.1MB in the end (delta: -10.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 15:53:27,100 INFO L158 Benchmark]: Witness Printer took 113.96ms. Allocated memory is still 201.3MB. Free memory was 128.1MB in the beginning and 114.6MB in the end (delta: 13.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 15:53:27,101 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 209.7MB. Free memory is still 125.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 384.79ms. Allocated memory is still 201.3MB. Free memory was 158.0MB in the beginning and 139.6MB in the end (delta: 18.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.66ms. Allocated memory is still 201.3MB. Free memory was 139.6MB in the beginning and 137.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.24ms. Allocated memory is still 201.3MB. Free memory was 137.7MB in the beginning and 136.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 384.53ms. Allocated memory is still 201.3MB. Free memory was 136.1MB in the beginning and 118.2MB in the end (delta: 17.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 2570.36ms. Allocated memory is still 201.3MB. Free memory was 117.6MB in the beginning and 128.1MB in the end (delta: -10.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 113.96ms. Allocated memory is still 201.3MB. Free memory was 128.1MB in the beginning and 114.6MB in the end (delta: 13.5MB). Peak memory consumption was 16.8MB. 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,"scenario.i","") [87] - GenericResultAtLocation [Line: 156]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [156] - GenericResultAtLocation [Line: 343]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [343] - GenericResultAtLocation [Line: 439]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [439] - GenericResultAtLocation [Line: 448]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [448] - GenericResultAtLocation [Line: 543]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [543] - GenericResultAtLocation [Line: 909]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification4_spec.i","") [909] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 444]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L165] int pumpRunning = 0; [L166] int systemActive = 1; [L344] int cleanupTimeShifts = 4; [L450] int waterLevel = 1; [L451] int methaneLevelCritical = 0; [L713] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L417] int retValue_acc ; [L418] int tmp ; [L422] FCALL select_helpers() [L423] FCALL select_features() [L424] CALL, EXPR valid_product() [L79] int retValue_acc ; [L82] retValue_acc = 1 [L83] return (retValue_acc); VAL [\result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L424] RET, EXPR valid_product() [L424] tmp = valid_product() [L426] COND TRUE \read(tmp) [L428] FCALL setup() [L429] CALL runTest() [L411] CALL test() [L93] int splverifierCounter ; [L94] int tmp ; [L95] int tmp___0 ; [L96] int tmp___1 ; [L97] int tmp___2 ; [L100] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L102] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L104] COND TRUE splverifierCounter < 4 [L110] tmp = __VERIFIER_nondet_int() [L112] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L114] CALL waterRise() VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L468] COND TRUE waterLevel < 2 [L469] waterLevel = waterLevel + 1 VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L114] RET waterRise() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L120] tmp___0 = __VERIFIER_nondet_int() [L122] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L130] tmp___2 = __VERIFIER_nondet_int() [L132] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L145] CALL timeShift() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L173] COND FALSE !(\read(pumpRunning)) VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L180] COND TRUE \read(systemActive) [L182] CALL processEnvironment() [L228] int tmp ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L231] COND FALSE !(\read(pumpRunning)) VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L246] CALL processEnvironment__wrappee__highWaterSensor() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L202] int tmp ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L205] COND TRUE ! pumpRunning [L207] CALL, EXPR isHighWaterLevel() [L325] int retValue_acc ; [L326] int tmp ; [L327] int tmp___0 ; [L331] CALL, EXPR isHighWaterSensorDry() [L530] int retValue_acc ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L533] COND FALSE !(waterLevel < 2) [L537] retValue_acc = 0 [L538] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L331] RET, EXPR isHighWaterSensorDry() [L331] tmp = isHighWaterSensorDry() [L333] COND FALSE !(\read(tmp)) [L336] tmp___0 = 1 VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, tmp___0=1, waterLevel=2] [L338] retValue_acc = tmp___0 [L339] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L207] RET, EXPR isHighWaterLevel() [L207] tmp = isHighWaterLevel() [L209] COND TRUE \read(tmp) [L211] CALL activatePump() [L256] pumpRunning = 1 VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L211] RET activatePump() [L246] RET processEnvironment__wrappee__highWaterSensor() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L182] RET processEnvironment() [L188] CALL __utac_acc__Specification4_spec__1() [L911] int tmp ; [L912] int tmp___0 ; [L916] CALL, EXPR getWaterLevel() [L521] int retValue_acc ; [L524] retValue_acc = waterLevel [L525] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L916] RET, EXPR getWaterLevel() [L916] tmp = getWaterLevel() [L918] COND FALSE !(tmp == 0) VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L188] RET __utac_acc__Specification4_spec__1() [L145] RET timeShift() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L102] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L104] COND TRUE splverifierCounter < 4 [L110] tmp = __VERIFIER_nondet_int() [L112] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L120] tmp___0 = __VERIFIER_nondet_int() [L122] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L130] tmp___2 = __VERIFIER_nondet_int() [L132] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L145] CALL timeShift() VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L173] COND TRUE \read(pumpRunning) [L175] CALL lowerWaterLevel() [L456] COND TRUE waterLevel > 0 [L457] waterLevel = waterLevel - 1 VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L175] RET lowerWaterLevel() [L180] COND TRUE \read(systemActive) [L182] CALL processEnvironment() [L228] int tmp ; VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L231] COND TRUE \read(pumpRunning) [L233] CALL, EXPR isMethaneAlarm() [L269] int retValue_acc ; [L273] CALL, EXPR isMethaneLevelCritical() [L489] int retValue_acc ; [L492] retValue_acc = methaneLevelCritical [L493] return (retValue_acc); VAL [\old(pumpRunning)=1, \old(waterLevel)=2, \result=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L273] RET, EXPR isMethaneLevelCritical() [L273] retValue_acc = isMethaneLevelCritical() [L275] return (retValue_acc); VAL [\old(pumpRunning)=1, \old(waterLevel)=2, \result=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L233] RET, EXPR isMethaneAlarm() [L233] tmp = isMethaneAlarm() [L235] COND FALSE !(\read(tmp)) VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L241] CALL processEnvironment__wrappee__highWaterSensor() VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L202] int tmp ; VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L205] COND FALSE !(! pumpRunning) VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L220] FCALL processEnvironment__wrappee__base() VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L241] RET processEnvironment__wrappee__highWaterSensor() VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L182] RET processEnvironment() [L188] CALL __utac_acc__Specification4_spec__1() [L911] int tmp ; [L912] int tmp___0 ; [L916] CALL, EXPR getWaterLevel() [L521] int retValue_acc ; [L524] retValue_acc = waterLevel [L525] return (retValue_acc); VAL [\old(pumpRunning)=1, \old(waterLevel)=2, \result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L916] RET, EXPR getWaterLevel() [L916] tmp = getWaterLevel() [L918] COND FALSE !(tmp == 0) VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L188] RET __utac_acc__Specification4_spec__1() [L145] RET timeShift() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=1] [L102] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=1] [L104] COND TRUE splverifierCounter < 4 [L110] tmp = __VERIFIER_nondet_int() [L112] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=1] [L120] tmp___0 = __VERIFIER_nondet_int() [L122] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=1] [L130] tmp___2 = __VERIFIER_nondet_int() [L132] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=1] [L145] CALL timeShift() VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L173] COND TRUE \read(pumpRunning) [L175] CALL lowerWaterLevel() [L456] COND TRUE waterLevel > 0 [L457] waterLevel = waterLevel - 1 VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L175] RET lowerWaterLevel() [L180] COND TRUE \read(systemActive) [L182] CALL processEnvironment() [L228] int tmp ; VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L231] COND TRUE \read(pumpRunning) [L233] CALL, EXPR isMethaneAlarm() [L269] int retValue_acc ; [L273] CALL, EXPR isMethaneLevelCritical() [L489] int retValue_acc ; [L492] retValue_acc = methaneLevelCritical [L493] return (retValue_acc); VAL [\old(pumpRunning)=1, \old(waterLevel)=1, \result=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L273] RET, EXPR isMethaneLevelCritical() [L273] retValue_acc = isMethaneLevelCritical() [L275] return (retValue_acc); VAL [\old(pumpRunning)=1, \old(waterLevel)=1, \result=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L233] RET, EXPR isMethaneAlarm() [L233] tmp = isMethaneAlarm() [L235] COND FALSE !(\read(tmp)) VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L241] CALL processEnvironment__wrappee__highWaterSensor() VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L202] int tmp ; VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L205] COND FALSE !(! pumpRunning) VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L220] FCALL processEnvironment__wrappee__base() VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L241] RET processEnvironment__wrappee__highWaterSensor() VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L182] RET processEnvironment() [L188] CALL __utac_acc__Specification4_spec__1() [L911] int tmp ; [L912] int tmp___0 ; [L916] CALL, EXPR getWaterLevel() [L521] int retValue_acc ; [L524] retValue_acc = waterLevel [L525] return (retValue_acc); VAL [\old(pumpRunning)=1, \old(waterLevel)=1, \result=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L916] RET, EXPR getWaterLevel() [L916] tmp = getWaterLevel() [L918] COND TRUE tmp == 0 [L920] CALL, EXPR isPumpRunning() [L280] int retValue_acc ; [L283] retValue_acc = pumpRunning [L284] return (retValue_acc); VAL [\old(pumpRunning)=1, \old(waterLevel)=1, \result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L920] RET, EXPR isPumpRunning() [L920] tmp___0 = isPumpRunning() [L922] COND TRUE \read(tmp___0) [L924] CALL __automaton_fail() [L444] reach_error() VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 79 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.5s, OverallIterations: 12, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 493 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 487 mSDsluCounter, 2608 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1626 mSDsCounter, 41 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 309 IncrementalHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 41 mSolverCounterUnsat, 982 mSDtfsCounter, 309 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 206 GetRequests, 164 SyntacticMatches, 5 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=393occurred in iteration=11, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 57 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 572 NumberOfCodeBlocks, 572 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 528 ConstructedInterpolants, 0 QuantifiedInterpolants, 976 SizeOfPredicates, 2 NumberOfNonLiveVariables, 260 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 13 InterpolantComputations, 10 PerfectInterpolantSequences, 39/57 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-02-05 15:53:27,117 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE