./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec4_product44.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_product44.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 da786641c6f5791cd76909be3af2b92112e50156e91d6775689240586eed4e85 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 15:53:25,251 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 15:53:25,293 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:25,297 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 15:53:25,298 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 15:53:25,312 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 15:53:25,312 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 15:53:25,312 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 15:53:25,313 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 15:53:25,313 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 15:53:25,313 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 15:53:25,313 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 15:53:25,313 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 15:53:25,313 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 15:53:25,313 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 15:53:25,314 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 15:53:25,314 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 15:53:25,314 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 15:53:25,314 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 15:53:25,314 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 15:53:25,314 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 15:53:25,314 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 15:53:25,314 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 15:53:25,314 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 15:53:25,314 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 15:53:25,314 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 15:53:25,315 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 15:53:25,315 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 15:53:25,315 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 15:53:25,315 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 15:53:25,315 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 15:53:25,315 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 15:53:25,315 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:53:25,315 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 15:53:25,315 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 15:53:25,315 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 15:53:25,315 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 15:53:25,316 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 15:53:25,316 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 15:53:25,316 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 15:53:25,316 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 15:53:25,316 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 15:53:25,316 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 15:53:25,316 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 -> da786641c6f5791cd76909be3af2b92112e50156e91d6775689240586eed4e85 [2025-02-05 15:53:25,489 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 15:53:25,495 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 15:53:25,497 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 15:53:25,498 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 15:53:25,498 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 15:53:25,499 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec4_product44.cil.c [2025-02-05 15:53:26,687 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0ba95fce0/31303232db174b7da07854d7a17604f8/FLAG1d343f8c4 [2025-02-05 15:53:27,056 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 15:53:27,056 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product44.cil.c [2025-02-05 15:53:27,077 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0ba95fce0/31303232db174b7da07854d7a17604f8/FLAG1d343f8c4 [2025-02-05 15:53:27,103 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0ba95fce0/31303232db174b7da07854d7a17604f8 [2025-02-05 15:53:27,105 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 15:53:27,106 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 15:53:27,107 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 15:53:27,107 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 15:53:27,110 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 15:53:27,113 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:53:27" (1/1) ... [2025-02-05 15:53:27,113 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fa89389 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:53:27, skipping insertion in model container [2025-02-05 15:53:27,113 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:53:27" (1/1) ... [2025-02-05 15:53:27,142 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 15:53:27,353 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_product44.cil.c[15806,15819] [2025-02-05 15:53:27,364 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:53:27,375 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 15:53:27,382 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification4_spec.i","") [49] [2025-02-05 15:53:27,383 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [78] [2025-02-05 15:53:27,383 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [444] [2025-02-05 15:53:27,383 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [482] [2025-02-05 15:53:27,383 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [557] [2025-02-05 15:53:27,383 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [757] [2025-02-05 15:53:27,383 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [766] [2025-02-05 15:53:27,384 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [862] [2025-02-05 15:53:27,433 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_product44.cil.c[15806,15819] [2025-02-05 15:53:27,441 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:53:27,464 INFO L204 MainTranslator]: Completed translation [2025-02-05 15:53:27,466 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:53:27 WrapperNode [2025-02-05 15:53:27,467 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 15:53:27,467 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 15:53:27,468 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 15:53:27,468 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 15:53:27,472 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:27" (1/1) ... [2025-02-05 15:53:27,480 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:27" (1/1) ... [2025-02-05 15:53:27,493 INFO L138 Inliner]: procedures = 55, calls = 98, calls flagged for inlining = 26, calls inlined = 23, statements flattened = 200 [2025-02-05 15:53:27,493 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 15:53:27,494 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 15:53:27,494 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 15:53:27,494 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 15:53:27,499 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:27" (1/1) ... [2025-02-05 15:53:27,500 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:27" (1/1) ... [2025-02-05 15:53:27,506 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:27" (1/1) ... [2025-02-05 15:53:27,518 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:27,521 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:27" (1/1) ... [2025-02-05 15:53:27,522 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:27" (1/1) ... [2025-02-05 15:53:27,524 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:27" (1/1) ... [2025-02-05 15:53:27,529 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:27" (1/1) ... [2025-02-05 15:53:27,530 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:27" (1/1) ... [2025-02-05 15:53:27,532 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:27" (1/1) ... [2025-02-05 15:53:27,536 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 15:53:27,537 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 15:53:27,537 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 15:53:27,537 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 15:53:27,538 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:53:27" (1/1) ... [2025-02-05 15:53:27,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:53:27,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:53:27,562 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:27,570 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:27,585 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 15:53:27,585 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2025-02-05 15:53:27,585 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2025-02-05 15:53:27,585 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-02-05 15:53:27,585 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-02-05 15:53:27,586 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-02-05 15:53:27,586 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-02-05 15:53:27,586 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2025-02-05 15:53:27,586 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2025-02-05 15:53:27,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 15:53:27,586 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2025-02-05 15:53:27,586 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2025-02-05 15:53:27,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 15:53:27,586 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 15:53:27,643 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 15:53:27,644 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 15:53:27,690 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint cleanupFINAL: assume true; [2025-02-05 15:53:27,771 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L667-1: isMethaneAlarm_#res#1 := isMethaneAlarm_~retValue_acc~5#1; [2025-02-05 15:53:27,771 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L907-1: isMethaneLevelCritical_#res#1 := isMethaneLevelCritical_~retValue_acc~9#1; [2025-02-05 15:53:27,771 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L676-1: isPumpRunning_#res#1 := isPumpRunning_~retValue_acc~6#1; [2025-02-05 15:53:27,771 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L953-1: isHighWaterSensorDry_#res#1 := isHighWaterSensorDry_~retValue_acc~11#1; [2025-02-05 15:53:27,771 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L731-1: isHighWaterLevel_#res#1 := isHighWaterLevel_~retValue_acc~7#1; [2025-02-05 15:53:27,772 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L939-1: getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~10#1; [2025-02-05 15:53:27,840 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L479-1: valid_product_#res#1 := valid_product_~retValue_acc~4#1; [2025-02-05 15:53:27,840 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L859-1: main_#res#1 := main_~retValue_acc~8#1; [2025-02-05 15:53:27,863 INFO L? ?]: Removed 43 outVars from TransFormulas that were not future-live. [2025-02-05 15:53:27,863 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 15:53:27,870 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 15:53:27,870 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 15:53:27,870 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:53:27 BoogieIcfgContainer [2025-02-05 15:53:27,871 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 15:53:27,872 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 15:53:27,872 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 15:53:27,876 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 15:53:27,876 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 03:53:27" (1/3) ... [2025-02-05 15:53:27,876 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f9c6284 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:53:27, skipping insertion in model container [2025-02-05 15:53:27,876 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:53:27" (2/3) ... [2025-02-05 15:53:27,876 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f9c6284 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:53:27, skipping insertion in model container [2025-02-05 15:53:27,876 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:53:27" (3/3) ... [2025-02-05 15:53:27,877 INFO L128 eAbstractionObserver]: Analyzing ICFG minepump_spec4_product44.cil.c [2025-02-05 15:53:27,886 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 15:53:27,887 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG minepump_spec4_product44.cil.c that has 6 procedures, 78 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-02-05 15:53:27,921 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 15:53:27,928 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;@47792c10, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 15:53:27,929 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 15:53:27,932 INFO L276 IsEmpty]: Start isEmpty. Operand has 77 states, 62 states have (on average 1.3709677419354838) internal successors, (85), 68 states have internal predecessors, (85), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-05 15:53:27,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-05 15:53:27,936 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:53:27,937 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:27,937 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:53:27,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:53:27,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1710105924, now seen corresponding path program 1 times [2025-02-05 15:53:27,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:53:27,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306963092] [2025-02-05 15:53:27,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:53:27,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:53:28,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-05 15:53:28,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-05 15:53:28,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:53:28,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:53:28,083 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:28,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:53:28,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306963092] [2025-02-05 15:53:28,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306963092] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:53:28,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:53:28,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 15:53:28,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574711598] [2025-02-05 15:53:28,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:53:28,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 15:53:28,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:53:28,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 15:53:28,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 15:53:28,109 INFO L87 Difference]: Start difference. First operand has 77 states, 62 states have (on average 1.3709677419354838) internal successors, (85), 68 states have internal predecessors, (85), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) 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:28,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:53:28,132 INFO L93 Difference]: Finished difference Result 138 states and 187 transitions. [2025-02-05 15:53:28,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 15:53:28,134 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:28,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:53:28,141 INFO L225 Difference]: With dead ends: 138 [2025-02-05 15:53:28,141 INFO L226 Difference]: Without dead ends: 69 [2025-02-05 15:53:28,143 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:28,146 INFO L435 NwaCegarLoop]: 94 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, 94 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:28,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 94 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:28,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-02-05 15:53:28,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2025-02-05 15:53:28,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 56 states have (on average 1.3214285714285714) internal successors, (74), 61 states have internal predecessors, (74), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-05 15:53:28,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 89 transitions. [2025-02-05 15:53:28,181 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 89 transitions. Word has length 19 [2025-02-05 15:53:28,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:53:28,181 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 89 transitions. [2025-02-05 15:53:28,181 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:28,181 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 89 transitions. [2025-02-05 15:53:28,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-05 15:53:28,183 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:53:28,183 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:28,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 15:53:28,184 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:53:28,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:53:28,185 INFO L85 PathProgramCache]: Analyzing trace with hash 274796294, now seen corresponding path program 1 times [2025-02-05 15:53:28,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:53:28,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206581886] [2025-02-05 15:53:28,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:53:28,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:53:28,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-05 15:53:28,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-05 15:53:28,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:53:28,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:53:28,270 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:28,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:53:28,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206581886] [2025-02-05 15:53:28,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206581886] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:53:28,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:53:28,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:53:28,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119004414] [2025-02-05 15:53:28,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:53:28,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:53:28,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:53:28,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:53:28,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:53:28,272 INFO L87 Difference]: Start difference. First operand 69 states and 89 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:28,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:53:28,281 INFO L93 Difference]: Finished difference Result 100 states and 129 transitions. [2025-02-05 15:53:28,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:53:28,282 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:28,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:53:28,282 INFO L225 Difference]: With dead ends: 100 [2025-02-05 15:53:28,282 INFO L226 Difference]: Without dead ends: 60 [2025-02-05 15:53:28,283 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:28,283 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 17 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 131 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:28,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 131 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:28,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-02-05 15:53:28,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-02-05 15:53:28,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 50 states have (on average 1.34) internal successors, (67), 55 states have internal predecessors, (67), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-05 15:53:28,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 77 transitions. [2025-02-05 15:53:28,288 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 77 transitions. Word has length 20 [2025-02-05 15:53:28,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:53:28,290 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 77 transitions. [2025-02-05 15:53:28,290 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:28,290 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 77 transitions. [2025-02-05 15:53:28,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-05 15:53:28,291 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:53:28,291 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:53:28,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 15:53:28,291 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:53:28,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:53:28,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1648082895, now seen corresponding path program 1 times [2025-02-05 15:53:28,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:53:28,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359849661] [2025-02-05 15:53:28,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:53:28,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:53:28,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-05 15:53:28,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-05 15:53:28,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:53:28,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:53:28,420 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:28,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:53:28,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359849661] [2025-02-05 15:53:28,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359849661] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:53:28,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:53:28,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:53:28,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937661147] [2025-02-05 15:53:28,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:53:28,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:53:28,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:53:28,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:53:28,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:53:28,422 INFO L87 Difference]: Start difference. First operand 60 states and 77 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 15:53:28,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:53:28,521 INFO L93 Difference]: Finished difference Result 198 states and 263 transitions. [2025-02-05 15:53:28,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:53:28,521 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-02-05 15:53:28,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:53:28,522 INFO L225 Difference]: With dead ends: 198 [2025-02-05 15:53:28,524 INFO L226 Difference]: Without dead ends: 145 [2025-02-05 15:53:28,525 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:53:28,526 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 124 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:53:28,526 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 363 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:53:28,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-02-05 15:53:28,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 135. [2025-02-05 15:53:28,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 110 states have (on average 1.3818181818181818) internal successors, (152), 121 states have internal predecessors, (152), 13 states have call successors, (13), 11 states have call predecessors, (13), 11 states have return successors, (14), 11 states have call predecessors, (14), 13 states have call successors, (14) [2025-02-05 15:53:28,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 179 transitions. [2025-02-05 15:53:28,558 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 179 transitions. Word has length 24 [2025-02-05 15:53:28,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:53:28,558 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 179 transitions. [2025-02-05 15:53:28,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 15:53:28,559 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 179 transitions. [2025-02-05 15:53:28,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-05 15:53:28,560 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:53:28,560 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:53:28,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 15:53:28,561 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:53:28,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:53:28,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1397603436, now seen corresponding path program 1 times [2025-02-05 15:53:28,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:53:28,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501171652] [2025-02-05 15:53:28,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:53:28,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:53:28,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-05 15:53:28,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-05 15:53:28,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:53:28,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:53:28,677 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:28,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:53:28,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501171652] [2025-02-05 15:53:28,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501171652] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:53:28,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:53:28,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:53:28,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284936577] [2025-02-05 15:53:28,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:53:28,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:53:28,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:53:28,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:53:28,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:53:28,679 INFO L87 Difference]: Start difference. First operand 135 states and 179 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 15:53:28,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:53:28,757 INFO L93 Difference]: Finished difference Result 374 states and 518 transitions. [2025-02-05 15:53:28,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:53:28,757 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-02-05 15:53:28,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:53:28,762 INFO L225 Difference]: With dead ends: 374 [2025-02-05 15:53:28,762 INFO L226 Difference]: Without dead ends: 246 [2025-02-05 15:53:28,763 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:28,764 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 43 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:53:28,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 274 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:53:28,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2025-02-05 15:53:28,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2025-02-05 15:53:28,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 200 states have (on average 1.35) internal successors, (270), 218 states have internal predecessors, (270), 26 states have call successors, (26), 22 states have call predecessors, (26), 19 states have return successors, (32), 19 states have call predecessors, (32), 26 states have call successors, (32) [2025-02-05 15:53:28,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 328 transitions. [2025-02-05 15:53:28,782 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 328 transitions. Word has length 27 [2025-02-05 15:53:28,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:53:28,782 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 328 transitions. [2025-02-05 15:53:28,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 15:53:28,782 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 328 transitions. [2025-02-05 15:53:28,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-05 15:53:28,783 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:53:28,783 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:28,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 15:53:28,784 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:53:28,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:53:28,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1654947305, now seen corresponding path program 1 times [2025-02-05 15:53:28,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:53:28,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186138676] [2025-02-05 15:53:28,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:53:28,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:53:28,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-05 15:53:28,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-05 15:53:28,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:53:28,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:53:28,837 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:28,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:53:28,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186138676] [2025-02-05 15:53:28,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186138676] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:53:28,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:53:28,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 15:53:28,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631724082] [2025-02-05 15:53:28,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:53:28,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:53:28,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:53:28,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:53:28,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:53:28,839 INFO L87 Difference]: Start difference. First operand 246 states and 328 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 15:53:28,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:53:28,877 INFO L93 Difference]: Finished difference Result 598 states and 817 transitions. [2025-02-05 15:53:28,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:53:28,877 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-02-05 15:53:28,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:53:28,879 INFO L225 Difference]: With dead ends: 598 [2025-02-05 15:53:28,879 INFO L226 Difference]: Without dead ends: 359 [2025-02-05 15:53:28,880 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:28,881 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 49 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:53:28,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 117 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:53:28,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2025-02-05 15:53:28,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 357. [2025-02-05 15:53:28,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 289 states have (on average 1.314878892733564) internal successors, (380), 311 states have internal predecessors, (380), 36 states have call successors, (36), 36 states have call predecessors, (36), 31 states have return successors, (52), 31 states have call predecessors, (52), 36 states have call successors, (52) [2025-02-05 15:53:28,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 468 transitions. [2025-02-05 15:53:28,927 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 468 transitions. Word has length 29 [2025-02-05 15:53:28,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:53:28,927 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 468 transitions. [2025-02-05 15:53:28,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 15:53:28,927 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 468 transitions. [2025-02-05 15:53:28,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-05 15:53:28,928 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:53:28,928 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:53:28,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 15:53:28,928 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:53:28,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:53:28,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1200652598, now seen corresponding path program 1 times [2025-02-05 15:53:28,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:53:28,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400710849] [2025-02-05 15:53:28,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:53:28,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:53:28,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-05 15:53:28,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-05 15:53:28,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:53:28,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:53:29,036 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:29,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:53:29,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400710849] [2025-02-05 15:53:29,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400710849] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:53:29,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:53:29,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:53:29,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938582645] [2025-02-05 15:53:29,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:53:29,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:53:29,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:53:29,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:53:29,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:53:29,040 INFO L87 Difference]: Start difference. First operand 357 states and 468 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (2), 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:29,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:53:29,127 INFO L93 Difference]: Finished difference Result 359 states and 469 transitions. [2025-02-05 15:53:29,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:53:29,131 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (2), 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 31 [2025-02-05 15:53:29,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:53:29,134 INFO L225 Difference]: With dead ends: 359 [2025-02-05 15:53:29,136 INFO L226 Difference]: Without dead ends: 357 [2025-02-05 15:53:29,137 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:29,137 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 61 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:53:29,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 254 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:53:29,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2025-02-05 15:53:29,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 357. [2025-02-05 15:53:29,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 289 states have (on average 1.3044982698961938) internal successors, (377), 311 states have internal predecessors, (377), 36 states have call successors, (36), 36 states have call predecessors, (36), 31 states have return successors, (52), 31 states have call predecessors, (52), 36 states have call successors, (52) [2025-02-05 15:53:29,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 465 transitions. [2025-02-05 15:53:29,180 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 465 transitions. Word has length 31 [2025-02-05 15:53:29,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:53:29,181 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 465 transitions. [2025-02-05 15:53:29,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (2), 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:29,181 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 465 transitions. [2025-02-05 15:53:29,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-05 15:53:29,185 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:53:29,185 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:29,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 15:53:29,186 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:53:29,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:53:29,186 INFO L85 PathProgramCache]: Analyzing trace with hash -896512620, now seen corresponding path program 1 times [2025-02-05 15:53:29,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:53:29,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614222015] [2025-02-05 15:53:29,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:53:29,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:53:29,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-05 15:53:29,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-05 15:53:29,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:53:29,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:53:29,304 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:29,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:53:29,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614222015] [2025-02-05 15:53:29,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614222015] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:53:29,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:53:29,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:53:29,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834931282] [2025-02-05 15:53:29,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:53:29,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:53:29,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:53:29,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:53:29,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:53:29,306 INFO L87 Difference]: Start difference. First operand 357 states and 465 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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:29,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:53:29,347 INFO L93 Difference]: Finished difference Result 719 states and 963 transitions. [2025-02-05 15:53:29,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:53:29,347 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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 41 [2025-02-05 15:53:29,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:53:29,350 INFO L225 Difference]: With dead ends: 719 [2025-02-05 15:53:29,350 INFO L226 Difference]: Without dead ends: 369 [2025-02-05 15:53:29,352 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:29,352 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 0 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:53:29,352 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 289 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:53:29,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2025-02-05 15:53:29,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 369. [2025-02-05 15:53:29,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 301 states have (on average 1.2923588039867109) internal successors, (389), 323 states have internal predecessors, (389), 36 states have call successors, (36), 36 states have call predecessors, (36), 31 states have return successors, (52), 31 states have call predecessors, (52), 36 states have call successors, (52) [2025-02-05 15:53:29,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 477 transitions. [2025-02-05 15:53:29,383 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 477 transitions. Word has length 41 [2025-02-05 15:53:29,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:53:29,383 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 477 transitions. [2025-02-05 15:53:29,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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:29,383 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 477 transitions. [2025-02-05 15:53:29,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-05 15:53:29,386 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:53:29,386 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:29,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 15:53:29,387 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:53:29,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:53:29,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1407046797, now seen corresponding path program 1 times [2025-02-05 15:53:29,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:53:29,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831346218] [2025-02-05 15:53:29,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:53:29,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:53:29,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-05 15:53:29,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-05 15:53:29,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:53:29,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:53:29,479 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:29,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:53:29,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831346218] [2025-02-05 15:53:29,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831346218] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:53:29,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:53:29,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:53:29,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379362021] [2025-02-05 15:53:29,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:53:29,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:53:29,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:53:29,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:53:29,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:53:29,480 INFO L87 Difference]: Start difference. First operand 369 states and 477 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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:29,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:53:29,514 INFO L93 Difference]: Finished difference Result 666 states and 872 transitions. [2025-02-05 15:53:29,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:53:29,514 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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 41 [2025-02-05 15:53:29,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:53:29,516 INFO L225 Difference]: With dead ends: 666 [2025-02-05 15:53:29,516 INFO L226 Difference]: Without dead ends: 304 [2025-02-05 15:53:29,517 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:29,517 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 0 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 219 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:29,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 219 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:29,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2025-02-05 15:53:29,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2025-02-05 15:53:29,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 246 states have (on average 1.2804878048780488) internal successors, (315), 264 states have internal predecessors, (315), 30 states have call successors, (30), 30 states have call predecessors, (30), 27 states have return successors, (37), 27 states have call predecessors, (37), 30 states have call successors, (37) [2025-02-05 15:53:29,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 382 transitions. [2025-02-05 15:53:29,539 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 382 transitions. Word has length 41 [2025-02-05 15:53:29,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:53:29,539 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 382 transitions. [2025-02-05 15:53:29,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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:29,539 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 382 transitions. [2025-02-05 15:53:29,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-05 15:53:29,540 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:53:29,540 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:29,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 15:53:29,540 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:53:29,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:53:29,540 INFO L85 PathProgramCache]: Analyzing trace with hash 893775793, now seen corresponding path program 1 times [2025-02-05 15:53:29,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:53:29,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320624428] [2025-02-05 15:53:29,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:53:29,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:53:29,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-05 15:53:29,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-05 15:53:29,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:53:29,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:53:29,623 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:29,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:53:29,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320624428] [2025-02-05 15:53:29,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320624428] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:53:29,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:53:29,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:53:29,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88774478] [2025-02-05 15:53:29,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:53:29,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:53:29,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:53:29,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:53:29,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:53:29,625 INFO L87 Difference]: Start difference. First operand 304 states and 382 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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:29,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:53:29,689 INFO L93 Difference]: Finished difference Result 658 states and 885 transitions. [2025-02-05 15:53:29,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:53:29,689 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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 41 [2025-02-05 15:53:29,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:53:29,692 INFO L225 Difference]: With dead ends: 658 [2025-02-05 15:53:29,692 INFO L226 Difference]: Without dead ends: 456 [2025-02-05 15:53:29,693 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:29,694 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 44 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 411 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:29,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 411 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:29,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2025-02-05 15:53:29,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 456. [2025-02-05 15:53:29,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 364 states have (on average 1.2692307692307692) internal successors, (462), 390 states have internal predecessors, (462), 47 states have call successors, (47), 47 states have call predecessors, (47), 44 states have return successors, (76), 44 states have call predecessors, (76), 47 states have call successors, (76) [2025-02-05 15:53:29,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 585 transitions. [2025-02-05 15:53:29,734 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 585 transitions. Word has length 41 [2025-02-05 15:53:29,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:53:29,735 INFO L471 AbstractCegarLoop]: Abstraction has 456 states and 585 transitions. [2025-02-05 15:53:29,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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:29,735 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 585 transitions. [2025-02-05 15:53:29,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 15:53:29,736 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:53:29,737 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 15:53:29,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 15:53:29,738 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:53:29,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:53:29,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1880585896, now seen corresponding path program 1 times [2025-02-05 15:53:29,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:53:29,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948441947] [2025-02-05 15:53:29,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:53:29,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:53:29,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 15:53:29,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 15:53:29,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:53:29,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:53:29,948 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:53:29,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:53:29,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948441947] [2025-02-05 15:53:29,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948441947] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:53:29,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [905654850] [2025-02-05 15:53:29,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:53:29,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:53:29,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:53:29,956 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:29,957 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:30,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 15:53:30,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 15:53:30,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:53:30,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:53:30,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 15:53:30,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:53:30,185 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:53:30,185 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:53:30,279 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:53:30,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [905654850] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:53:30,280 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:53:30,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2025-02-05 15:53:30,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636695878] [2025-02-05 15:53:30,280 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:53:30,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:53:30,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:53:30,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:53:30,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:53:30,282 INFO L87 Difference]: Start difference. First operand 456 states and 585 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-05 15:53:30,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:53:30,386 INFO L93 Difference]: Finished difference Result 1060 states and 1438 transitions. [2025-02-05 15:53:30,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 15:53:30,387 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 65 [2025-02-05 15:53:30,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:53:30,390 INFO L225 Difference]: With dead ends: 1060 [2025-02-05 15:53:30,390 INFO L226 Difference]: Without dead ends: 706 [2025-02-05 15:53:30,391 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 126 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:30,391 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 85 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:53:30,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 422 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:53:30,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2025-02-05 15:53:30,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 624. [2025-02-05 15:53:30,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 624 states, 494 states have (on average 1.2753036437246963) internal successors, (630), 530 states have internal predecessors, (630), 66 states have call successors, (66), 66 states have call predecessors, (66), 63 states have return successors, (115), 58 states have call predecessors, (115), 66 states have call successors, (115) [2025-02-05 15:53:30,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 811 transitions. [2025-02-05 15:53:30,439 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 811 transitions. Word has length 65 [2025-02-05 15:53:30,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:53:30,440 INFO L471 AbstractCegarLoop]: Abstraction has 624 states and 811 transitions. [2025-02-05 15:53:30,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-05 15:53:30,440 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 811 transitions. [2025-02-05 15:53:30,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-02-05 15:53:30,445 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:53:30,445 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-05 15:53:30,453 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:30,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-05 15:53:30,646 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:53:30,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:53:30,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1106092545, now seen corresponding path program 2 times [2025-02-05 15:53:30,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:53:30,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410589529] [2025-02-05 15:53:30,648 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:53:30,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:53:30,659 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 89 statements into 2 equivalence classes. [2025-02-05 15:53:30,675 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 89 of 89 statements. [2025-02-05 15:53:30,678 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 15:53:30,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 15:53:30,679 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-05 15:53:30,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-05 15:53:30,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-05 15:53:30,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:53:30,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 15:53:30,743 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-05 15:53:30,743 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-05 15:53:30,744 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 15:53:30,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 15:53:30,748 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:53:30,803 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 15:53:30,805 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 03:53:30 BoogieIcfgContainer [2025-02-05 15:53:30,805 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 15:53:30,806 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 15:53:30,806 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 15:53:30,806 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 15:53:30,807 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:27" (3/4) ... [2025-02-05 15:53:30,807 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-05 15:53:30,877 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 87. [2025-02-05 15:53:30,978 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-05 15:53:30,979 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-05 15:53:30,979 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 15:53:30,979 INFO L158 Benchmark]: Toolchain (without parser) took 3873.42ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 105.4MB in the beginning and 233.1MB in the end (delta: -127.7MB). Peak memory consumption was 11.4MB. Max. memory is 16.1GB. [2025-02-05 15:53:30,980 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 127.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 15:53:30,980 INFO L158 Benchmark]: CACSL2BoogieTranslator took 359.81ms. Allocated memory is still 142.6MB. Free memory was 105.4MB in the beginning and 86.7MB in the end (delta: 18.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 15:53:30,980 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.89ms. Allocated memory is still 142.6MB. Free memory was 86.7MB in the beginning and 84.6MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 15:53:30,980 INFO L158 Benchmark]: Boogie Preprocessor took 42.85ms. Allocated memory is still 142.6MB. Free memory was 84.6MB in the beginning and 83.3MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 15:53:30,980 INFO L158 Benchmark]: IcfgBuilder took 333.66ms. Allocated memory is still 142.6MB. Free memory was 83.3MB in the beginning and 65.3MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 15:53:30,980 INFO L158 Benchmark]: TraceAbstraction took 2932.68ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 64.6MB in the beginning and 244.6MB in the end (delta: -179.9MB). Peak memory consumption was 45.0MB. Max. memory is 16.1GB. [2025-02-05 15:53:30,980 INFO L158 Benchmark]: Witness Printer took 173.27ms. Allocated memory is still 285.2MB. Free memory was 244.6MB in the beginning and 233.1MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 15:53:30,981 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.24ms. Allocated memory is still 201.3MB. Free memory is still 127.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 359.81ms. Allocated memory is still 142.6MB. Free memory was 105.4MB in the beginning and 86.7MB in the end (delta: 18.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.89ms. Allocated memory is still 142.6MB. Free memory was 86.7MB in the beginning and 84.6MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.85ms. Allocated memory is still 142.6MB. Free memory was 84.6MB in the beginning and 83.3MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 333.66ms. Allocated memory is still 142.6MB. Free memory was 83.3MB in the beginning and 65.3MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2932.68ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 64.6MB in the beginning and 244.6MB in the end (delta: -179.9MB). Peak memory consumption was 45.0MB. Max. memory is 16.1GB. * Witness Printer took 173.27ms. Allocated memory is still 285.2MB. Free memory was 244.6MB in the beginning and 233.1MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 49]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification4_spec.i","") [49] - GenericResultAtLocation [Line: 78]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [78] - GenericResultAtLocation [Line: 444]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [444] - GenericResultAtLocation [Line: 482]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [482] - GenericResultAtLocation [Line: 557]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [557] - GenericResultAtLocation [Line: 757]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [757] - GenericResultAtLocation [Line: 766]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [766] - GenericResultAtLocation [Line: 862]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [862] * 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: 762]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L248] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L565] int pumpRunning = 0; [L566] int systemActive = 1; [L767] int cleanupTimeShifts = 4; [L863] int waterLevel = 1; [L864] int methaneLevelCritical = 0; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L840] int retValue_acc ; [L841] int tmp ; [L845] FCALL select_helpers() [L846] FCALL select_features() [L847] CALL, EXPR valid_product() [L474] int retValue_acc ; [L477] retValue_acc = 1 [L478] return (retValue_acc); VAL [\result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L847] RET, EXPR valid_product() [L847] tmp = valid_product() [L849] COND TRUE \read(tmp) [L851] FCALL setup() [L852] CALL runTest() [L834] CALL test() [L490] int splverifierCounter ; [L491] int tmp ; [L492] int tmp___0 ; [L493] int tmp___1 ; [L494] int tmp___2 ; [L497] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L499] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L501] COND TRUE splverifierCounter < 4 [L507] tmp = __VERIFIER_nondet_int() [L509] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L511] CALL waterRise() VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L881] COND TRUE waterLevel < 2 [L882] waterLevel = waterLevel + 1 VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L511] RET waterRise() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L517] tmp___0 = __VERIFIER_nondet_int() [L519] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L527] tmp___2 = __VERIFIER_nondet_int() [L529] COND FALSE !(\read(tmp___2)) [L535] tmp___1 = __VERIFIER_nondet_int() [L537] COND FALSE !(\read(tmp___1)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L546] CALL timeShift() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L572] COND FALSE !(\read(pumpRunning)) VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L579] COND TRUE \read(systemActive) [L581] CALL processEnvironment() [L601] int tmp ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L604] COND TRUE ! pumpRunning [L606] CALL, EXPR isHighWaterLevel() [L716] int retValue_acc ; [L717] int tmp ; [L718] int tmp___0 ; [L722] CALL, EXPR isHighWaterSensorDry() [L943] int retValue_acc ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L946] COND FALSE !(waterLevel < 2) [L950] retValue_acc = 0 [L951] 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] [L722] RET, EXPR isHighWaterSensorDry() [L722] tmp = isHighWaterSensorDry() [L724] COND FALSE !(\read(tmp)) [L727] 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] [L729] retValue_acc = tmp___0 [L730] 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] [L606] RET, EXPR isHighWaterLevel() [L606] tmp = isHighWaterLevel() [L608] COND TRUE \read(tmp) [L610] CALL activatePump() [L635] int tmp ; [L639] CALL, EXPR isMethaneAlarm() [L660] int retValue_acc ; [L664] CALL, EXPR isMethaneLevelCritical() [L902] int retValue_acc ; [L905] retValue_acc = methaneLevelCritical [L906] 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] [L664] RET, EXPR isMethaneLevelCritical() [L664] retValue_acc = isMethaneLevelCritical() [L666] 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] [L639] RET, EXPR isMethaneAlarm() [L639] tmp = isMethaneAlarm() [L641] COND FALSE !(\read(tmp)) [L645] CALL activatePump__wrappee__highWaterSensor() [L629] pumpRunning = 1 VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L645] RET activatePump__wrappee__highWaterSensor() [L610] RET activatePump() [L581] RET processEnvironment() [L587] CALL __utac_acc__Specification4_spec__1() [L54] int tmp ; [L55] int tmp___0 ; [L59] CALL, EXPR getWaterLevel() [L934] int retValue_acc ; [L937] retValue_acc = waterLevel [L938] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L59] RET, EXPR getWaterLevel() [L59] tmp = getWaterLevel() [L61] COND FALSE !(tmp == 0) VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L587] RET __utac_acc__Specification4_spec__1() [L546] RET timeShift() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L499] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L501] COND TRUE splverifierCounter < 4 [L507] tmp = __VERIFIER_nondet_int() [L509] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L517] tmp___0 = __VERIFIER_nondet_int() [L519] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L527] tmp___2 = __VERIFIER_nondet_int() [L529] COND FALSE !(\read(tmp___2)) [L535] tmp___1 = __VERIFIER_nondet_int() [L537] COND FALSE !(\read(tmp___1)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L546] CALL timeShift() VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L572] COND TRUE \read(pumpRunning) [L574] CALL lowerWaterLevel() [L869] COND TRUE waterLevel > 0 [L870] waterLevel = waterLevel - 1 VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L574] RET lowerWaterLevel() [L579] COND TRUE \read(systemActive) [L581] CALL processEnvironment() [L601] int tmp ; VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L604] COND FALSE !(! pumpRunning) VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L619] FCALL processEnvironment__wrappee__base() VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L581] RET processEnvironment() [L587] CALL __utac_acc__Specification4_spec__1() [L54] int tmp ; [L55] int tmp___0 ; [L59] CALL, EXPR getWaterLevel() [L934] int retValue_acc ; [L937] retValue_acc = waterLevel [L938] return (retValue_acc); VAL [\old(pumpRunning)=1, \old(waterLevel)=2, \result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L59] RET, EXPR getWaterLevel() [L59] tmp = getWaterLevel() [L61] COND FALSE !(tmp == 0) VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L587] RET __utac_acc__Specification4_spec__1() [L546] RET timeShift() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=1] [L499] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=1] [L501] COND TRUE splverifierCounter < 4 [L507] tmp = __VERIFIER_nondet_int() [L509] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=1] [L517] tmp___0 = __VERIFIER_nondet_int() [L519] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=1] [L527] tmp___2 = __VERIFIER_nondet_int() [L529] COND FALSE !(\read(tmp___2)) [L535] tmp___1 = __VERIFIER_nondet_int() [L537] COND FALSE !(\read(tmp___1)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=1] [L546] CALL timeShift() VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L572] COND TRUE \read(pumpRunning) [L574] CALL lowerWaterLevel() [L869] COND TRUE waterLevel > 0 [L870] waterLevel = waterLevel - 1 VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L574] RET lowerWaterLevel() [L579] COND TRUE \read(systemActive) [L581] CALL processEnvironment() [L601] int tmp ; VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L604] COND FALSE !(! pumpRunning) VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L619] FCALL processEnvironment__wrappee__base() VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L581] RET processEnvironment() [L587] CALL __utac_acc__Specification4_spec__1() [L54] int tmp ; [L55] int tmp___0 ; [L59] CALL, EXPR getWaterLevel() [L934] int retValue_acc ; [L937] retValue_acc = waterLevel [L938] return (retValue_acc); VAL [\old(pumpRunning)=1, \old(waterLevel)=1, \result=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L59] RET, EXPR getWaterLevel() [L59] tmp = getWaterLevel() [L61] COND TRUE tmp == 0 [L63] CALL, EXPR isPumpRunning() [L671] int retValue_acc ; [L674] retValue_acc = pumpRunning [L675] return (retValue_acc); VAL [\old(pumpRunning)=1, \old(waterLevel)=1, \result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L63] RET, EXPR isPumpRunning() [L63] tmp___0 = isPumpRunning() [L65] COND TRUE \read(tmp___0) [L67] CALL __automaton_fail() [L762] 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 6 procedures, 78 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.8s, OverallIterations: 11, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 426 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 423 mSDsluCounter, 2574 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1727 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 229 IncrementalHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 847 mSDtfsCounter, 229 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 184 GetRequests, 143 SyntacticMatches, 5 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=624occurred in iteration=10, InterpolantAutomatonStates: 46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 94 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 492 NumberOfCodeBlocks, 492 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 456 ConstructedInterpolants, 0 QuantifiedInterpolants, 860 SizeOfPredicates, 2 NumberOfNonLiveVariables, 252 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 12 InterpolantComputations, 9 PerfectInterpolantSequences, 36/48 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:31,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE