./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec3_product46.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/minepump_spec3_product46.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 458689bcd0930e2b07a61b7490d83be8ce4e59412b26a60581bf78c492ee412e --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:01:27,180 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:01:27,235 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 04:01:27,240 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:01:27,240 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:01:27,258 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:01:27,259 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:01:27,259 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:01:27,259 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:01:27,260 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:01:27,260 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:01:27,260 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:01:27,260 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:01:27,260 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:01:27,261 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:01:27,261 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:01:27,261 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:01:27,261 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:01:27,261 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:01:27,261 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:01:27,261 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:01:27,262 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:01:27,262 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:01:27,262 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:01:27,262 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:01:27,262 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:01:27,262 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:01:27,262 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:01:27,263 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:01:27,263 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:01:27,263 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:01:27,263 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:01:27,263 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:01:27,263 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:01:27,263 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:01:27,263 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:01:27,264 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:01:27,264 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:01:27,264 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:01:27,264 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:01:27,264 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:01:27,264 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:01:27,264 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:01:27,264 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:01:27,264 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:01:27,264 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:01:27,264 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:01:27,265 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:01:27,265 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 -> 458689bcd0930e2b07a61b7490d83be8ce4e59412b26a60581bf78c492ee412e [2025-01-09 04:01:27,484 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:01:27,492 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:01:27,495 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:01:27,496 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:01:27,496 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:01:27,497 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec3_product46.cil.c [2025-01-09 04:01:28,605 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a83c4c828/08efb09c29b1416d96e47e3526c7f765/FLAGc79e00a85 [2025-01-09 04:01:28,867 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:01:28,869 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec3_product46.cil.c [2025-01-09 04:01:28,882 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a83c4c828/08efb09c29b1416d96e47e3526c7f765/FLAGc79e00a85 [2025-01-09 04:01:29,176 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a83c4c828/08efb09c29b1416d96e47e3526c7f765 [2025-01-09 04:01:29,178 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:01:29,179 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:01:29,184 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:01:29,184 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:01:29,187 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:01:29,187 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:01:29" (1/1) ... [2025-01-09 04:01:29,188 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e5d57fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:29, skipping insertion in model container [2025-01-09 04:01:29,188 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:01:29" (1/1) ... [2025-01-09 04:01:29,207 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:01:29,419 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec3_product46.cil.c[18431,18444] [2025-01-09 04:01:29,421 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:01:29,431 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:01:29,437 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification3_spec.i","") [49] [2025-01-09 04:01:29,438 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [87] [2025-01-09 04:01:29,439 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [125] [2025-01-09 04:01:29,439 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [491] [2025-01-09 04:01:29,439 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [592] [2025-01-09 04:01:29,439 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [689] [2025-01-09 04:01:29,439 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [895] [2025-01-09 04:01:29,439 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [962] [2025-01-09 04:01:29,483 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec3_product46.cil.c[18431,18444] [2025-01-09 04:01:29,484 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:01:29,503 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:01:29,508 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:29 WrapperNode [2025-01-09 04:01:29,508 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:01:29,509 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:01:29,509 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:01:29,509 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:01:29,513 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:29" (1/1) ... [2025-01-09 04:01:29,526 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:29" (1/1) ... [2025-01-09 04:01:29,551 INFO L138 Inliner]: procedures = 55, calls = 101, calls flagged for inlining = 23, calls inlined = 20, statements flattened = 197 [2025-01-09 04:01:29,552 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:01:29,552 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:01:29,552 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:01:29,553 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:01:29,558 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:29" (1/1) ... [2025-01-09 04:01:29,559 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:29" (1/1) ... [2025-01-09 04:01:29,560 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:29" (1/1) ... [2025-01-09 04:01:29,578 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-01-09 04:01:29,579 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:29" (1/1) ... [2025-01-09 04:01:29,579 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:29" (1/1) ... [2025-01-09 04:01:29,581 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:29" (1/1) ... [2025-01-09 04:01:29,582 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:29" (1/1) ... [2025-01-09 04:01:29,584 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:29" (1/1) ... [2025-01-09 04:01:29,585 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:29" (1/1) ... [2025-01-09 04:01:29,586 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:29" (1/1) ... [2025-01-09 04:01:29,587 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:01:29,588 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:01:29,588 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:01:29,588 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:01:29,589 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:29" (1/1) ... [2025-01-09 04:01:29,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:01:29,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:01:29,618 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-01-09 04:01:29,621 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-01-09 04:01:29,636 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:01:29,636 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2025-01-09 04:01:29,636 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2025-01-09 04:01:29,636 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-01-09 04:01:29,636 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-01-09 04:01:29,636 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-01-09 04:01:29,636 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-01-09 04:01:29,636 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2025-01-09 04:01:29,636 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2025-01-09 04:01:29,636 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2025-01-09 04:01:29,636 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2025-01-09 04:01:29,636 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__methaneQuery [2025-01-09 04:01:29,636 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__methaneQuery [2025-01-09 04:01:29,636 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneAlarm [2025-01-09 04:01:29,636 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneAlarm [2025-01-09 04:01:29,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:01:29,637 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2025-01-09 04:01:29,637 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2025-01-09 04:01:29,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:01:29,637 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:01:29,702 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:01:29,703 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:01:29,904 INFO L? ?]: Removed 45 outVars from TransFormulas that were not future-live. [2025-01-09 04:01:29,904 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:01:29,913 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:01:29,913 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-09 04:01:29,914 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:01:29 BoogieIcfgContainer [2025-01-09 04:01:29,914 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:01:29,915 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:01:29,915 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:01:29,919 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:01:29,919 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:01:29" (1/3) ... [2025-01-09 04:01:29,919 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ee66513 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:01:29, skipping insertion in model container [2025-01-09 04:01:29,919 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:29" (2/3) ... [2025-01-09 04:01:29,919 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ee66513 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:01:29, skipping insertion in model container [2025-01-09 04:01:29,919 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:01:29" (3/3) ... [2025-01-09 04:01:29,920 INFO L128 eAbstractionObserver]: Analyzing ICFG minepump_spec3_product46.cil.c [2025-01-09 04:01:29,930 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:01:29,931 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG minepump_spec3_product46.cil.c that has 9 procedures, 94 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-01-09 04:01:29,976 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:01:29,985 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;@2cc749e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:01:29,986 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 04:01:29,989 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 70 states have (on average 1.3571428571428572) internal successors, (95), 78 states have internal predecessors, (95), 14 states have call successors, (14), 8 states have call predecessors, (14), 8 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 04:01:29,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-09 04:01:29,995 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:01:29,996 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:01:29,996 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:01:30,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:01:30,001 INFO L85 PathProgramCache]: Analyzing trace with hash 25513697, now seen corresponding path program 1 times [2025-01-09 04:01:30,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:01:30,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471556663] [2025-01-09 04:01:30,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:01:30,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:01:30,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 04:01:30,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 04:01:30,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:01:30,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:01:30,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:01:30,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:01:30,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471556663] [2025-01-09 04:01:30,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471556663] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:01:30,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:01:30,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:01:30,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474086553] [2025-01-09 04:01:30,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:01:30,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:01:30,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:01:30,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:01:30,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:01:30,186 INFO L87 Difference]: Start difference. First operand has 94 states, 70 states have (on average 1.3571428571428572) internal successors, (95), 78 states have internal predecessors, (95), 14 states have call successors, (14), 8 states have call predecessors, (14), 8 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 04:01:30,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:01:30,211 INFO L93 Difference]: Finished difference Result 168 states and 222 transitions. [2025-01-09 04:01:30,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:01:30,215 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2025-01-09 04:01:30,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:01:30,220 INFO L225 Difference]: With dead ends: 168 [2025-01-09 04:01:30,221 INFO L226 Difference]: Without dead ends: 77 [2025-01-09 04:01:30,224 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-01-09 04:01:30,226 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 13 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 188 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-01-09 04:01:30,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 188 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:01:30,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-01-09 04:01:30,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-01-09 04:01:30,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 58 states have (on average 1.3275862068965518) internal successors, (77), 65 states have internal predecessors, (77), 11 states have call successors, (11), 7 states have call predecessors, (11), 7 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 04:01:30,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 99 transitions. [2025-01-09 04:01:30,254 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 99 transitions. Word has length 25 [2025-01-09 04:01:30,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:01:30,254 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 99 transitions. [2025-01-09 04:01:30,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 04:01:30,255 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 99 transitions. [2025-01-09 04:01:30,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-09 04:01:30,256 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:01:30,256 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:01:30,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:01:30,257 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:01:30,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:01:30,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1080311392, now seen corresponding path program 1 times [2025-01-09 04:01:30,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:01:30,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365072765] [2025-01-09 04:01:30,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:01:30,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:01:30,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 04:01:30,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 04:01:30,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:01:30,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:01:30,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:01:30,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:01:30,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365072765] [2025-01-09 04:01:30,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365072765] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:01:30,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:01:30,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:01:30,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182567486] [2025-01-09 04:01:30,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:01:30,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:01:30,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:01:30,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:01:30,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:01:30,376 INFO L87 Difference]: Start difference. First operand 77 states and 99 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 04:01:30,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:01:30,400 INFO L93 Difference]: Finished difference Result 147 states and 192 transitions. [2025-01-09 04:01:30,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:01:30,402 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2025-01-09 04:01:30,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:01:30,403 INFO L225 Difference]: With dead ends: 147 [2025-01-09 04:01:30,403 INFO L226 Difference]: Without dead ends: 77 [2025-01-09 04:01:30,404 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-01-09 04:01:30,404 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 93 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:01:30,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 97 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:01:30,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-01-09 04:01:30,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-01-09 04:01:30,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 58 states have (on average 1.3103448275862069) internal successors, (76), 65 states have internal predecessors, (76), 11 states have call successors, (11), 7 states have call predecessors, (11), 7 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 04:01:30,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 98 transitions. [2025-01-09 04:01:30,422 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 98 transitions. Word has length 30 [2025-01-09 04:01:30,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:01:30,422 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 98 transitions. [2025-01-09 04:01:30,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 04:01:30,422 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 98 transitions. [2025-01-09 04:01:30,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-01-09 04:01:30,423 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:01:30,423 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:01:30,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:01:30,423 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:01:30,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:01:30,424 INFO L85 PathProgramCache]: Analyzing trace with hash 2068329308, now seen corresponding path program 1 times [2025-01-09 04:01:30,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:01:30,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090147989] [2025-01-09 04:01:30,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:01:30,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:01:30,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 04:01:30,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 04:01:30,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:01:30,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:01:30,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:01:30,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:01:30,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090147989] [2025-01-09 04:01:30,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090147989] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:01:30,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:01:30,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:01:30,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51880428] [2025-01-09 04:01:30,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:01:30,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:01:30,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:01:30,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:01:30,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:01:30,526 INFO L87 Difference]: Start difference. First operand 77 states and 98 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 04:01:30,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:01:30,760 INFO L93 Difference]: Finished difference Result 230 states and 292 transitions. [2025-01-09 04:01:30,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 04:01:30,760 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 40 [2025-01-09 04:01:30,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:01:30,761 INFO L225 Difference]: With dead ends: 230 [2025-01-09 04:01:30,761 INFO L226 Difference]: Without dead ends: 160 [2025-01-09 04:01:30,762 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:01:30,763 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 202 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:01:30,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 285 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:01:30,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-01-09 04:01:30,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 154. [2025-01-09 04:01:30,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 117 states have (on average 1.264957264957265) internal successors, (148), 125 states have internal predecessors, (148), 18 states have call successors, (18), 15 states have call predecessors, (18), 18 states have return successors, (23), 19 states have call predecessors, (23), 18 states have call successors, (23) [2025-01-09 04:01:30,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 189 transitions. [2025-01-09 04:01:30,784 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 189 transitions. Word has length 40 [2025-01-09 04:01:30,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:01:30,784 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 189 transitions. [2025-01-09 04:01:30,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 04:01:30,785 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 189 transitions. [2025-01-09 04:01:30,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-01-09 04:01:30,785 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:01:30,785 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:01:30,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 04:01:30,786 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:01:30,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:01:30,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1644404684, now seen corresponding path program 1 times [2025-01-09 04:01:30,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:01:30,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476072824] [2025-01-09 04:01:30,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:01:30,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:01:30,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 04:01:30,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 04:01:30,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:01:30,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:01:30,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:01:30,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:01:30,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476072824] [2025-01-09 04:01:30,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476072824] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:01:30,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:01:30,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:01:30,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718394815] [2025-01-09 04:01:30,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:01:30,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:01:30,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:01:30,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:01:30,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:01:30,900 INFO L87 Difference]: Start difference. First operand 154 states and 189 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 04:01:30,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:01:30,960 INFO L93 Difference]: Finished difference Result 391 states and 500 transitions. [2025-01-09 04:01:30,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:01:30,960 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 46 [2025-01-09 04:01:30,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:01:30,962 INFO L225 Difference]: With dead ends: 391 [2025-01-09 04:01:30,962 INFO L226 Difference]: Without dead ends: 244 [2025-01-09 04:01:30,963 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:01:30,963 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 49 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:01:30,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 358 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:01:30,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2025-01-09 04:01:30,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2025-01-09 04:01:30,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 185 states have (on average 1.2540540540540541) internal successors, (232), 196 states have internal predecessors, (232), 30 states have call successors, (30), 26 states have call predecessors, (30), 28 states have return successors, (40), 30 states have call predecessors, (40), 30 states have call successors, (40) [2025-01-09 04:01:30,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 302 transitions. [2025-01-09 04:01:30,996 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 302 transitions. Word has length 46 [2025-01-09 04:01:30,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:01:30,996 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 302 transitions. [2025-01-09 04:01:30,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 04:01:30,996 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 302 transitions. [2025-01-09 04:01:30,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-01-09 04:01:30,997 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:01:30,997 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:01:30,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 04:01:30,998 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:01:30,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:01:30,998 INFO L85 PathProgramCache]: Analyzing trace with hash -119522674, now seen corresponding path program 1 times [2025-01-09 04:01:30,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:01:30,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043519136] [2025-01-09 04:01:30,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:01:30,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:01:31,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 04:01:31,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 04:01:31,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:01:31,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:01:31,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:01:31,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:01:31,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043519136] [2025-01-09 04:01:31,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043519136] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:01:31,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:01:31,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:01:31,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686750667] [2025-01-09 04:01:31,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:01:31,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:01:31,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:01:31,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:01:31,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:01:31,109 INFO L87 Difference]: Start difference. First operand 244 states and 302 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 04:01:31,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:01:31,195 INFO L93 Difference]: Finished difference Result 528 states and 677 transitions. [2025-01-09 04:01:31,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:01:31,197 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 50 [2025-01-09 04:01:31,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:01:31,199 INFO L225 Difference]: With dead ends: 528 [2025-01-09 04:01:31,199 INFO L226 Difference]: Without dead ends: 381 [2025-01-09 04:01:31,200 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:01:31,200 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 78 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:01:31,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 397 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:01:31,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2025-01-09 04:01:31,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 380. [2025-01-09 04:01:31,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 285 states have (on average 1.2421052631578948) internal successors, (354), 303 states have internal predecessors, (354), 48 states have call successors, (48), 41 states have call predecessors, (48), 46 states have return successors, (75), 49 states have call predecessors, (75), 48 states have call successors, (75) [2025-01-09 04:01:31,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 477 transitions. [2025-01-09 04:01:31,234 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 477 transitions. Word has length 50 [2025-01-09 04:01:31,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:01:31,234 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 477 transitions. [2025-01-09 04:01:31,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 04:01:31,235 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 477 transitions. [2025-01-09 04:01:31,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-01-09 04:01:31,236 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:01:31,236 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:01:31,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 04:01:31,236 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:01:31,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:01:31,236 INFO L85 PathProgramCache]: Analyzing trace with hash -253536180, now seen corresponding path program 1 times [2025-01-09 04:01:31,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:01:31,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913974816] [2025-01-09 04:01:31,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:01:31,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:01:31,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 04:01:31,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 04:01:31,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:01:31,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:01:31,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:01:31,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:01:31,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913974816] [2025-01-09 04:01:31,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913974816] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:01:31,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:01:31,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:01:31,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503477702] [2025-01-09 04:01:31,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:01:31,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:01:31,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:01:31,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:01:31,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:01:31,303 INFO L87 Difference]: Start difference. First operand 380 states and 477 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 04:01:31,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:01:31,343 INFO L93 Difference]: Finished difference Result 665 states and 849 transitions. [2025-01-09 04:01:31,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:01:31,344 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 50 [2025-01-09 04:01:31,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:01:31,347 INFO L225 Difference]: With dead ends: 665 [2025-01-09 04:01:31,349 INFO L226 Difference]: Without dead ends: 382 [2025-01-09 04:01:31,351 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-01-09 04:01:31,351 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 0 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:01:31,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 285 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:01:31,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2025-01-09 04:01:31,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2025-01-09 04:01:31,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 287 states have (on average 1.2369337979094077) internal successors, (355), 305 states have internal predecessors, (355), 48 states have call successors, (48), 41 states have call predecessors, (48), 46 states have return successors, (75), 49 states have call predecessors, (75), 48 states have call successors, (75) [2025-01-09 04:01:31,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 478 transitions. [2025-01-09 04:01:31,384 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 478 transitions. Word has length 50 [2025-01-09 04:01:31,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:01:31,386 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 478 transitions. [2025-01-09 04:01:31,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 04:01:31,386 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 478 transitions. [2025-01-09 04:01:31,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-01-09 04:01:31,389 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:01:31,389 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:01:31,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 04:01:31,390 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:01:31,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:01:31,390 INFO L85 PathProgramCache]: Analyzing trace with hash -34681462, now seen corresponding path program 1 times [2025-01-09 04:01:31,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:01:31,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140816378] [2025-01-09 04:01:31,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:01:31,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:01:31,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 04:01:31,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 04:01:31,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:01:31,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:01:31,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:01:31,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:01:31,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140816378] [2025-01-09 04:01:31,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140816378] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:01:31,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:01:31,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:01:31,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218436910] [2025-01-09 04:01:31,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:01:31,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:01:31,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:01:31,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:01:31,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:01:31,461 INFO L87 Difference]: Start difference. First operand 382 states and 478 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 04:01:31,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:01:31,503 INFO L93 Difference]: Finished difference Result 760 states and 966 transitions. [2025-01-09 04:01:31,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:01:31,504 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 50 [2025-01-09 04:01:31,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:01:31,506 INFO L225 Difference]: With dead ends: 760 [2025-01-09 04:01:31,507 INFO L226 Difference]: Without dead ends: 385 [2025-01-09 04:01:31,509 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-01-09 04:01:31,510 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 0 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:01:31,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 380 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:01:31,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2025-01-09 04:01:31,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 385. [2025-01-09 04:01:31,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 292 states have (on average 1.2294520547945205) internal successors, (359), 309 states have internal predecessors, (359), 47 states have call successors, (47), 40 states have call predecessors, (47), 45 states have return successors, (74), 48 states have call predecessors, (74), 47 states have call successors, (74) [2025-01-09 04:01:31,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 480 transitions. [2025-01-09 04:01:31,543 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 480 transitions. Word has length 50 [2025-01-09 04:01:31,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:01:31,544 INFO L471 AbstractCegarLoop]: Abstraction has 385 states and 480 transitions. [2025-01-09 04:01:31,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 04:01:31,544 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 480 transitions. [2025-01-09 04:01:31,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-01-09 04:01:31,545 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:01:31,545 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:01:31,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 04:01:31,545 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:01:31,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:01:31,546 INFO L85 PathProgramCache]: Analyzing trace with hash -2104471998, now seen corresponding path program 1 times [2025-01-09 04:01:31,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:01:31,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747268568] [2025-01-09 04:01:31,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:01:31,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:01:31,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-01-09 04:01:31,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-01-09 04:01:31,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:01:31,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:01:31,712 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 04:01:31,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:01:31,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747268568] [2025-01-09 04:01:31,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747268568] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:01:31,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:01:31,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 04:01:31,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196296028] [2025-01-09 04:01:31,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:01:31,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 04:01:31,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:01:31,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 04:01:31,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 04:01:31,720 INFO L87 Difference]: Start difference. First operand 385 states and 480 transitions. Second operand has 10 states, 10 states have (on average 4.6) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:01:31,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:01:31,974 INFO L93 Difference]: Finished difference Result 1040 states and 1360 transitions. [2025-01-09 04:01:31,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 04:01:31,974 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 2 states have call successors, (5) Word has length 59 [2025-01-09 04:01:31,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:01:31,979 INFO L225 Difference]: With dead ends: 1040 [2025-01-09 04:01:31,979 INFO L226 Difference]: Without dead ends: 662 [2025-01-09 04:01:31,981 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2025-01-09 04:01:31,981 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 70 mSDsluCounter, 1082 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 1249 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:01:31,981 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 1249 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:01:31,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2025-01-09 04:01:32,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 662. [2025-01-09 04:01:32,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 494 states have (on average 1.2064777327935223) internal successors, (596), 521 states have internal predecessors, (596), 88 states have call successors, (88), 75 states have call predecessors, (88), 79 states have return successors, (145), 87 states have call predecessors, (145), 88 states have call successors, (145) [2025-01-09 04:01:32,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 829 transitions. [2025-01-09 04:01:32,028 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 829 transitions. Word has length 59 [2025-01-09 04:01:32,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:01:32,028 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 829 transitions. [2025-01-09 04:01:32,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:01:32,028 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 829 transitions. [2025-01-09 04:01:32,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-01-09 04:01:32,030 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:01:32,031 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:01:32,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 04:01:32,031 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:01:32,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:01:32,031 INFO L85 PathProgramCache]: Analyzing trace with hash -2011296680, now seen corresponding path program 1 times [2025-01-09 04:01:32,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:01:32,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671838361] [2025-01-09 04:01:32,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:01:32,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:01:32,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-09 04:01:32,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-09 04:01:32,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:01:32,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:01:32,114 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 04:01:32,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:01:32,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671838361] [2025-01-09 04:01:32,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671838361] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:01:32,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:01:32,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:01:32,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763084821] [2025-01-09 04:01:32,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:01:32,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:01:32,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:01:32,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:01:32,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:01:32,117 INFO L87 Difference]: Start difference. First operand 662 states and 829 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:01:32,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:01:32,179 INFO L93 Difference]: Finished difference Result 1317 states and 1651 transitions. [2025-01-09 04:01:32,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:01:32,180 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 60 [2025-01-09 04:01:32,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:01:32,183 INFO L225 Difference]: With dead ends: 1317 [2025-01-09 04:01:32,184 INFO L226 Difference]: Without dead ends: 662 [2025-01-09 04:01:32,185 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-01-09 04:01:32,186 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 57 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:01:32,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 472 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:01:32,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2025-01-09 04:01:32,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 631. [2025-01-09 04:01:32,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 471 states have (on average 1.1804670912951167) internal successors, (556), 496 states have internal predecessors, (556), 83 states have call successors, (83), 70 states have call predecessors, (83), 76 states have return successors, (117), 82 states have call predecessors, (117), 83 states have call successors, (117) [2025-01-09 04:01:32,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 756 transitions. [2025-01-09 04:01:32,230 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 756 transitions. Word has length 60 [2025-01-09 04:01:32,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:01:32,231 INFO L471 AbstractCegarLoop]: Abstraction has 631 states and 756 transitions. [2025-01-09 04:01:32,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:01:32,231 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 756 transitions. [2025-01-09 04:01:32,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-09 04:01:32,233 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:01:32,233 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:01:32,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 04:01:32,233 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:01:32,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:01:32,233 INFO L85 PathProgramCache]: Analyzing trace with hash 2026294335, now seen corresponding path program 1 times [2025-01-09 04:01:32,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:01:32,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395371858] [2025-01-09 04:01:32,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:01:32,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:01:32,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 04:01:32,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 04:01:32,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:01:32,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:01:32,294 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-01-09 04:01:32,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:01:32,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395371858] [2025-01-09 04:01:32,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395371858] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:01:32,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:01:32,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:01:32,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559577390] [2025-01-09 04:01:32,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:01:32,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:01:32,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:01:32,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:01:32,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:01:32,296 INFO L87 Difference]: Start difference. First operand 631 states and 756 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 04:01:32,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:01:32,359 INFO L93 Difference]: Finished difference Result 1255 states and 1523 transitions. [2025-01-09 04:01:32,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:01:32,359 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 97 [2025-01-09 04:01:32,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:01:32,362 INFO L225 Difference]: With dead ends: 1255 [2025-01-09 04:01:32,362 INFO L226 Difference]: Without dead ends: 631 [2025-01-09 04:01:32,364 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-01-09 04:01:32,364 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 0 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:01:32,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 374 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:01:32,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2025-01-09 04:01:32,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 631. [2025-01-09 04:01:32,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 471 states have (on average 1.1719745222929936) internal successors, (552), 496 states have internal predecessors, (552), 83 states have call successors, (83), 70 states have call predecessors, (83), 76 states have return successors, (117), 82 states have call predecessors, (117), 83 states have call successors, (117) [2025-01-09 04:01:32,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 752 transitions. [2025-01-09 04:01:32,400 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 752 transitions. Word has length 97 [2025-01-09 04:01:32,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:01:32,401 INFO L471 AbstractCegarLoop]: Abstraction has 631 states and 752 transitions. [2025-01-09 04:01:32,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 04:01:32,401 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 752 transitions. [2025-01-09 04:01:32,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-01-09 04:01:32,403 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:01:32,403 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:01:32,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 04:01:32,403 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:01:32,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:01:32,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1919410981, now seen corresponding path program 1 times [2025-01-09 04:01:32,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:01:32,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639460253] [2025-01-09 04:01:32,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:01:32,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:01:32,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 04:01:32,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 04:01:32,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:01:32,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:01:32,454 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-01-09 04:01:32,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:01:32,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639460253] [2025-01-09 04:01:32,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639460253] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:01:32,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:01:32,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:01:32,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956979689] [2025-01-09 04:01:32,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:01:32,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:01:32,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:01:32,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:01:32,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:01:32,455 INFO L87 Difference]: Start difference. First operand 631 states and 752 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 04:01:32,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:01:32,497 INFO L93 Difference]: Finished difference Result 1188 states and 1426 transitions. [2025-01-09 04:01:32,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:01:32,497 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 93 [2025-01-09 04:01:32,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:01:32,500 INFO L225 Difference]: With dead ends: 1188 [2025-01-09 04:01:32,500 INFO L226 Difference]: Without dead ends: 564 [2025-01-09 04:01:32,501 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-01-09 04:01:32,502 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 0 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 282 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-01-09 04:01:32,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 282 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:01:32,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2025-01-09 04:01:32,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 549. [2025-01-09 04:01:32,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 409 states have (on average 1.1613691931540342) internal successors, (475), 431 states have internal predecessors, (475), 73 states have call successors, (73), 62 states have call predecessors, (73), 66 states have return successors, (93), 71 states have call predecessors, (93), 73 states have call successors, (93) [2025-01-09 04:01:32,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 641 transitions. [2025-01-09 04:01:32,543 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 641 transitions. Word has length 93 [2025-01-09 04:01:32,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:01:32,543 INFO L471 AbstractCegarLoop]: Abstraction has 549 states and 641 transitions. [2025-01-09 04:01:32,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 04:01:32,543 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 641 transitions. [2025-01-09 04:01:32,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-09 04:01:32,545 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:01:32,545 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:01:32,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 04:01:32,546 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:01:32,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:01:32,546 INFO L85 PathProgramCache]: Analyzing trace with hash 566317507, now seen corresponding path program 1 times [2025-01-09 04:01:32,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:01:32,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50121564] [2025-01-09 04:01:32,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:01:32,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:01:32,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 04:01:32,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 04:01:32,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:01:32,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:01:32,693 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 17 proven. 11 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 04:01:32,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:01:32,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50121564] [2025-01-09 04:01:32,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50121564] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:01:32,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174889919] [2025-01-09 04:01:32,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:01:32,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:01:32,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:01:32,696 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-01-09 04:01:32,699 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-01-09 04:01:32,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 04:01:32,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 04:01:32,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:01:32,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:01:32,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-09 04:01:32,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:01:32,966 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 17 proven. 11 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 04:01:32,966 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:01:33,283 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-01-09 04:01:33,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [174889919] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:01:33,283 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:01:33,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 9] total 19 [2025-01-09 04:01:33,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557785823] [2025-01-09 04:01:33,284 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:01:33,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-09 04:01:33,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:01:33,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-09 04:01:33,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2025-01-09 04:01:33,285 INFO L87 Difference]: Start difference. First operand 549 states and 641 transitions. Second operand has 19 states, 19 states have (on average 7.2105263157894735) internal successors, (137), 15 states have internal predecessors, (137), 7 states have call successors, (23), 7 states have call predecessors, (23), 10 states have return successors, (23), 10 states have call predecessors, (23), 7 states have call successors, (23) [2025-01-09 04:01:34,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:01:34,144 INFO L93 Difference]: Finished difference Result 1119 states and 1360 transitions. [2025-01-09 04:01:34,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-01-09 04:01:34,145 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 7.2105263157894735) internal successors, (137), 15 states have internal predecessors, (137), 7 states have call successors, (23), 7 states have call predecessors, (23), 10 states have return successors, (23), 10 states have call predecessors, (23), 7 states have call successors, (23) Word has length 97 [2025-01-09 04:01:34,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:01:34,146 INFO L225 Difference]: With dead ends: 1119 [2025-01-09 04:01:34,146 INFO L226 Difference]: Without dead ends: 0 [2025-01-09 04:01:34,149 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 185 SyntacticMatches, 7 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 428 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=479, Invalid=1873, Unknown=0, NotChecked=0, Total=2352 [2025-01-09 04:01:34,149 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 479 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 771 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 04:01:34,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [481 Valid, 553 Invalid, 978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 771 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 04:01:34,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-09 04:01:34,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-09 04:01:34,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:01:34,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-09 04:01:34,151 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 97 [2025-01-09 04:01:34,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:01:34,151 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-09 04:01:34,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 7.2105263157894735) internal successors, (137), 15 states have internal predecessors, (137), 7 states have call successors, (23), 7 states have call predecessors, (23), 10 states have return successors, (23), 10 states have call predecessors, (23), 7 states have call successors, (23) [2025-01-09 04:01:34,151 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-09 04:01:34,151 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-09 04:01:34,153 INFO L782 garLoopResultBuilder]: Registering result SAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 04:01:34,160 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-01-09 04:01:34,354 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,SelfDestructingSolverStorable11 [2025-01-09 04:01:34,357 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:01:34,358 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-09 04:01:37,076 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 04:01:37,085 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 04:01:37 BoogieIcfgContainer [2025-01-09 04:01:37,086 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 04:01:37,086 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 04:01:37,086 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 04:01:37,086 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 04:01:37,087 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:01:29" (3/4) ... [2025-01-09 04:01:37,088 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 04:01:37,092 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__base [2025-01-09 04:01:37,093 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure changeMethaneLevel [2025-01-09 04:01:37,093 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure timeShift [2025-01-09 04:01:37,093 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure cleanup [2025-01-09 04:01:37,093 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure isMethaneLevelCritical [2025-01-09 04:01:37,093 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure waterRise [2025-01-09 04:01:37,093 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__methaneQuery [2025-01-09 04:01:37,093 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure isMethaneAlarm [2025-01-09 04:01:37,100 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2025-01-09 04:01:37,100 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-01-09 04:01:37,100 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-09 04:01:37,101 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 04:01:37,101 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 04:01:37,175 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 04:01:37,175 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 04:01:37,175 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 04:01:37,176 INFO L158 Benchmark]: Toolchain (without parser) took 7997.11ms. Allocated memory was 167.8MB in the beginning and 218.1MB in the end (delta: 50.3MB). Free memory was 129.2MB in the beginning and 89.2MB in the end (delta: 40.1MB). Peak memory consumption was 92.4MB. Max. memory is 16.1GB. [2025-01-09 04:01:37,176 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 201.3MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 04:01:37,177 INFO L158 Benchmark]: CACSL2BoogieTranslator took 324.78ms. Allocated memory is still 167.8MB. Free memory was 128.8MB in the beginning and 110.4MB in the end (delta: 18.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 04:01:37,177 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.23ms. Allocated memory is still 167.8MB. Free memory was 110.4MB in the beginning and 108.6MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 04:01:37,178 INFO L158 Benchmark]: Boogie Preprocessor took 34.85ms. Allocated memory is still 167.8MB. Free memory was 108.6MB in the beginning and 106.5MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 04:01:37,178 INFO L158 Benchmark]: RCFGBuilder took 325.99ms. Allocated memory is still 167.8MB. Free memory was 106.5MB in the beginning and 89.2MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 04:01:37,178 INFO L158 Benchmark]: TraceAbstraction took 7170.57ms. Allocated memory was 167.8MB in the beginning and 218.1MB in the end (delta: 50.3MB). Free memory was 88.8MB in the beginning and 97.6MB in the end (delta: -8.8MB). Peak memory consumption was 76.3MB. Max. memory is 16.1GB. [2025-01-09 04:01:37,179 INFO L158 Benchmark]: Witness Printer took 89.11ms. Allocated memory is still 218.1MB. Free memory was 97.6MB in the beginning and 89.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 04:01:37,180 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.26ms. Allocated memory is still 201.3MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 324.78ms. Allocated memory is still 167.8MB. Free memory was 128.8MB in the beginning and 110.4MB in the end (delta: 18.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.23ms. Allocated memory is still 167.8MB. Free memory was 110.4MB in the beginning and 108.6MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 34.85ms. Allocated memory is still 167.8MB. Free memory was 108.6MB in the beginning and 106.5MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 325.99ms. Allocated memory is still 167.8MB. Free memory was 106.5MB in the beginning and 89.2MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 7170.57ms. Allocated memory was 167.8MB in the beginning and 218.1MB in the end (delta: 50.3MB). Free memory was 88.8MB in the beginning and 97.6MB in the end (delta: -8.8MB). Peak memory consumption was 76.3MB. Max. memory is 16.1GB. * Witness Printer took 89.11ms. Allocated memory is still 218.1MB. Free memory was 97.6MB in the beginning and 89.2MB in the end (delta: 8.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,"Specification3_spec.i","") [49] - GenericResultAtLocation [Line: 87]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [87] - GenericResultAtLocation [Line: 125]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [125] - GenericResultAtLocation [Line: 491]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [491] - GenericResultAtLocation [Line: 592]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [592] - GenericResultAtLocation [Line: 689]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [689] - GenericResultAtLocation [Line: 895]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [895] - GenericResultAtLocation [Line: 962]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [962] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 967]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 94 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.4s, OverallIterations: 12, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1052 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1041 mSDsluCounter, 4920 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3675 mSDsCounter, 275 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1307 IncrementalHoareTripleChecker+Invalid, 1582 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 275 mSolverCounterUnsat, 1245 mSDtfsCounter, 1307 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 314 GetRequests, 212 SyntacticMatches, 7 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 455 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=662occurred in iteration=8, InterpolantAutomatonStates: 95, 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, 12 MinimizatonAttempts, 53 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 794 NumberOfCodeBlocks, 794 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 877 ConstructedInterpolants, 0 QuantifiedInterpolants, 1437 SizeOfPredicates, 2 NumberOfNonLiveVariables, 320 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 14 InterpolantComputations, 11 PerfectInterpolantSequences, 181/206 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 906]: Loop Invariant Derived loop invariant: ((((((((methaneLevelCritical == 0) && (1 == systemActive)) && (splverifierCounter == 0)) && (waterLevel <= 2)) && (pumpRunning == 1)) || (((((pumpRunning == 0) && (1 == systemActive)) && (methaneLevelCritical != 0)) && (splverifierCounter == 0)) && (waterLevel <= 2))) || ((((pumpRunning == 0) && (waterLevel <= 1)) && (1 == systemActive)) && (splverifierCounter == 0))) || ((((waterLevel <= 1) && (1 == systemActive)) && (splverifierCounter == 0)) && (pumpRunning == 1))) - InvariantResult [Line: 954]: Location Invariant Derived location invariant: 0 - InvariantResult [Line: 504]: Loop Invariant Derived loop invariant: 0 RESULT: Ultimate proved your program to be correct! [2025-01-09 04:01:37,199 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE