./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec1_product42.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/minepump_spec1_product42.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 f8aef606697b9aeff574acbbe43b28a142b9105524bb5bbab5e1458056090146 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 05:38:44,199 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:38:44,261 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 05:38:44,269 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:38:44,270 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:38:44,310 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:38:44,310 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:38:44,311 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:38:44,311 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:38:44,311 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:38:44,311 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:38:44,311 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:38:44,311 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:38:44,311 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:38:44,312 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:38:44,312 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:38:44,312 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:38:44,312 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:38:44,312 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:38:44,312 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:38:44,312 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:38:44,312 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:38:44,312 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:38:44,312 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:38:44,312 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:38:44,313 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:38:44,313 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:38:44,313 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:38:44,313 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:38:44,313 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:38:44,313 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:38:44,313 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:38:44,313 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:38:44,313 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:38:44,313 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:38:44,313 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:38:44,314 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:38:44,314 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:38:44,314 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:38:44,314 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:38:44,314 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:38:44,314 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:38:44,314 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:38:44,314 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/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 -> f8aef606697b9aeff574acbbe43b28a142b9105524bb5bbab5e1458056090146 [2025-03-08 05:38:44,576 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:38:44,582 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:38:44,584 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:38:44,585 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:38:44,585 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:38:44,586 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec1_product42.cil.c [2025-03-08 05:38:45,745 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c825d259f/48719d440a11413da5398d9baff399a6/FLAG2f767fd73 [2025-03-08 05:38:46,026 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:38:46,028 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product42.cil.c [2025-03-08 05:38:46,042 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c825d259f/48719d440a11413da5398d9baff399a6/FLAG2f767fd73 [2025-03-08 05:38:46,316 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c825d259f/48719d440a11413da5398d9baff399a6 [2025-03-08 05:38:46,318 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:38:46,320 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:38:46,321 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:38:46,321 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:38:46,325 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:38:46,326 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:38:46" (1/1) ... [2025-03-08 05:38:46,326 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@122c5c91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:46, skipping insertion in model container [2025-03-08 05:38:46,327 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:38:46" (1/1) ... [2025-03-08 05:38:46,355 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:38:46,568 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product42.cil.c[15994,16007] [2025-03-08 05:38:46,581 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:38:46,589 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:38:46,595 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [49] [2025-03-08 05:38:46,596 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [415] [2025-03-08 05:38:46,596 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [516] [2025-03-08 05:38:46,596 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [586] [2025-03-08 05:38:46,596 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [769] [2025-03-08 05:38:46,597 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification1_spec.i","") [778] [2025-03-08 05:38:46,597 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [804] [2025-03-08 05:38:46,597 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [842] [2025-03-08 05:38:46,656 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product42.cil.c[15994,16007] [2025-03-08 05:38:46,662 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:38:46,673 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:38:46,674 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:46 WrapperNode [2025-03-08 05:38:46,674 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:38:46,674 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:38:46,674 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:38:46,674 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:38:46,679 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:46" (1/1) ... [2025-03-08 05:38:46,688 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:46" (1/1) ... [2025-03-08 05:38:46,700 INFO L138 Inliner]: procedures = 54, calls = 96, calls flagged for inlining = 22, calls inlined = 19, statements flattened = 181 [2025-03-08 05:38:46,701 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:38:46,701 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:38:46,701 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:38:46,701 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:38:46,715 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:46" (1/1) ... [2025-03-08 05:38:46,715 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:46" (1/1) ... [2025-03-08 05:38:46,716 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:46" (1/1) ... [2025-03-08 05:38:46,729 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-03-08 05:38:46,729 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:46" (1/1) ... [2025-03-08 05:38:46,729 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:46" (1/1) ... [2025-03-08 05:38:46,733 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:46" (1/1) ... [2025-03-08 05:38:46,733 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:46" (1/1) ... [2025-03-08 05:38:46,734 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:46" (1/1) ... [2025-03-08 05:38:46,735 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:46" (1/1) ... [2025-03-08 05:38:46,736 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:38:46,736 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:38:46,736 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:38:46,736 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:38:46,737 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:46" (1/1) ... [2025-03-08 05:38:46,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:38:46,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:38:46,784 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 05:38:46,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 05:38:46,809 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:38:46,809 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2025-03-08 05:38:46,809 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2025-03-08 05:38:46,809 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-03-08 05:38:46,809 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-03-08 05:38:46,809 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-03-08 05:38:46,809 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-03-08 05:38:46,810 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2025-03-08 05:38:46,810 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2025-03-08 05:38:46,810 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2025-03-08 05:38:46,810 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2025-03-08 05:38:46,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:38:46,810 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2025-03-08 05:38:46,810 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2025-03-08 05:38:46,810 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:38:46,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:38:46,864 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:38:46,867 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:38:46,994 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L758-1: isHighWaterLevel_#res#1 := isHighWaterLevel_~retValue_acc~8#1; [2025-03-08 05:38:46,995 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L694-1: isMethaneAlarm_#res#1 := isMethaneAlarm_~retValue_acc~6#1; [2025-03-08 05:38:46,995 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L513-1: isHighWaterSensorDry_#res#1 := isHighWaterSensorDry_~retValue_acc~5#1; [2025-03-08 05:38:46,995 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L703-1: isPumpRunning_#res#1 := isPumpRunning_~retValue_acc~7#1; [2025-03-08 05:38:46,999 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L467: #res := ~retValue_acc~3; [2025-03-08 05:38:47,069 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L839-1: valid_product_#res#1 := valid_product_~retValue_acc~10#1; [2025-03-08 05:38:47,070 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L935-1: main_#res#1 := main_~retValue_acc~11#1; [2025-03-08 05:38:47,087 INFO L? ?]: Removed 40 outVars from TransFormulas that were not future-live. [2025-03-08 05:38:47,087 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:38:47,093 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:38:47,094 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:38:47,094 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:38:47 BoogieIcfgContainer [2025-03-08 05:38:47,094 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:38:47,099 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:38:47,099 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:38:47,102 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:38:47,102 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:38:46" (1/3) ... [2025-03-08 05:38:47,103 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fb7de8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:38:47, skipping insertion in model container [2025-03-08 05:38:47,104 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:46" (2/3) ... [2025-03-08 05:38:47,104 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fb7de8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:38:47, skipping insertion in model container [2025-03-08 05:38:47,104 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:38:47" (3/3) ... [2025-03-08 05:38:47,105 INFO L128 eAbstractionObserver]: Analyzing ICFG minepump_spec1_product42.cil.c [2025-03-08 05:38:47,115 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:38:47,116 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG minepump_spec1_product42.cil.c that has 7 procedures, 77 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-08 05:38:47,150 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:38:47,157 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;@593f4df0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:38:47,157 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:38:47,160 INFO L276 IsEmpty]: Start isEmpty. Operand has 77 states, 59 states have (on average 1.3728813559322033) internal successors, (81), 65 states have internal predecessors, (81), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-08 05:38:47,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-08 05:38:47,166 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:38:47,166 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:38:47,166 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:38:47,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:38:47,171 INFO L85 PathProgramCache]: Analyzing trace with hash 435241305, now seen corresponding path program 1 times [2025-03-08 05:38:47,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:38:47,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348447152] [2025-03-08 05:38:47,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:38:47,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:38:47,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 05:38:47,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 05:38:47,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:38:47,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:38:47,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:38:47,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:38:47,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348447152] [2025-03-08 05:38:47,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348447152] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:38:47,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:38:47,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:38:47,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255996812] [2025-03-08 05:38:47,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:38:47,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:38:47,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:38:47,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:38:47,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:38:47,376 INFO L87 Difference]: Start difference. First operand has 77 states, 59 states have (on average 1.3728813559322033) internal successors, (81), 65 states have internal predecessors, (81), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-03-08 05:38:47,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:38:47,399 INFO L93 Difference]: Finished difference Result 134 states and 178 transitions. [2025-03-08 05:38:47,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:38:47,401 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 23 [2025-03-08 05:38:47,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:38:47,406 INFO L225 Difference]: With dead ends: 134 [2025-03-08 05:38:47,406 INFO L226 Difference]: Without dead ends: 60 [2025-03-08 05:38:47,409 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-03-08 05:38:47,411 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 12 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 145 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-03-08 05:38:47,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 145 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:38:47,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-03-08 05:38:47,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-03-08 05:38:47,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 52 states have internal predecessors, (63), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-08 05:38:47,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 77 transitions. [2025-03-08 05:38:47,438 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 77 transitions. Word has length 23 [2025-03-08 05:38:47,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:38:47,439 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 77 transitions. [2025-03-08 05:38:47,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-03-08 05:38:47,439 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 77 transitions. [2025-03-08 05:38:47,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-08 05:38:47,440 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:38:47,440 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:38:47,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 05:38:47,441 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:38:47,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:38:47,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1541418930, now seen corresponding path program 1 times [2025-03-08 05:38:47,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:38:47,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123935876] [2025-03-08 05:38:47,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:38:47,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:38:47,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 05:38:47,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 05:38:47,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:38:47,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:38:47,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:38:47,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:38:47,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123935876] [2025-03-08 05:38:47,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123935876] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:38:47,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:38:47,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:38:47,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350291741] [2025-03-08 05:38:47,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:38:47,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:38:47,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:38:47,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:38:47,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:38:47,564 INFO L87 Difference]: Start difference. First operand 60 states and 77 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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-03-08 05:38:47,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:38:47,607 INFO L93 Difference]: Finished difference Result 113 states and 148 transitions. [2025-03-08 05:38:47,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:38:47,608 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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 27 [2025-03-08 05:38:47,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:38:47,609 INFO L225 Difference]: With dead ends: 113 [2025-03-08 05:38:47,609 INFO L226 Difference]: Without dead ends: 60 [2025-03-08 05:38:47,609 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-03-08 05:38:47,610 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 71 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:38:47,610 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 217 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:38:47,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-03-08 05:38:47,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-03-08 05:38:47,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 47 states have (on average 1.3191489361702127) internal successors, (62), 52 states have internal predecessors, (62), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-08 05:38:47,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 76 transitions. [2025-03-08 05:38:47,617 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 76 transitions. Word has length 27 [2025-03-08 05:38:47,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:38:47,617 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 76 transitions. [2025-03-08 05:38:47,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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-03-08 05:38:47,617 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 76 transitions. [2025-03-08 05:38:47,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-08 05:38:47,618 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:38:47,618 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] [2025-03-08 05:38:47,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 05:38:47,618 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:38:47,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:38:47,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1151789037, now seen corresponding path program 1 times [2025-03-08 05:38:47,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:38:47,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327054027] [2025-03-08 05:38:47,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:38:47,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:38:47,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-08 05:38:47,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-08 05:38:47,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:38:47,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:38:47,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:38:47,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:38:47,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327054027] [2025-03-08 05:38:47,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327054027] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:38:47,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:38:47,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:38:47,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554471439] [2025-03-08 05:38:47,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:38:47,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:38:47,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:38:47,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:38:47,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:38:47,665 INFO L87 Difference]: Start difference. First operand 60 states and 76 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, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 05:38:47,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:38:47,708 INFO L93 Difference]: Finished difference Result 151 states and 195 transitions. [2025-03-08 05:38:47,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:38:47,709 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, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2025-03-08 05:38:47,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:38:47,710 INFO L225 Difference]: With dead ends: 151 [2025-03-08 05:38:47,710 INFO L226 Difference]: Without dead ends: 98 [2025-03-08 05:38:47,710 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-03-08 05:38:47,711 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 65 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:38:47,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 131 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:38:47,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-08 05:38:47,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2025-03-08 05:38:47,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 74 states have (on average 1.3108108108108107) internal successors, (97), 81 states have internal predecessors, (97), 11 states have call successors, (11), 10 states have call predecessors, (11), 10 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2025-03-08 05:38:47,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 121 transitions. [2025-03-08 05:38:47,743 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 121 transitions. Word has length 32 [2025-03-08 05:38:47,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:38:47,744 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 121 transitions. [2025-03-08 05:38:47,744 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, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 05:38:47,744 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 121 transitions. [2025-03-08 05:38:47,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-08 05:38:47,744 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:38:47,747 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] [2025-03-08 05:38:47,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 05:38:47,747 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:38:47,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:38:47,748 INFO L85 PathProgramCache]: Analyzing trace with hash 797523567, now seen corresponding path program 1 times [2025-03-08 05:38:47,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:38:47,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314473649] [2025-03-08 05:38:47,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:38:47,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:38:47,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-08 05:38:47,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-08 05:38:47,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:38:47,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:38:47,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:38:47,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:38:47,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314473649] [2025-03-08 05:38:47,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314473649] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:38:47,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:38:47,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:38:47,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544106181] [2025-03-08 05:38:47,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:38:47,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:38:47,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:38:47,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:38:47,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:38:47,887 INFO L87 Difference]: Start difference. First operand 96 states and 121 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 05:38:47,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:38:47,957 INFO L93 Difference]: Finished difference Result 98 states and 122 transitions. [2025-03-08 05:38:47,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:38:47,958 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), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 38 [2025-03-08 05:38:47,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:38:47,959 INFO L225 Difference]: With dead ends: 98 [2025-03-08 05:38:47,959 INFO L226 Difference]: Without dead ends: 96 [2025-03-08 05:38:47,960 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-03-08 05:38:47,962 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 51 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:38:47,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 279 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:38:47,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-03-08 05:38:47,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-03-08 05:38:47,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 74 states have (on average 1.2972972972972974) internal successors, (96), 81 states have internal predecessors, (96), 11 states have call successors, (11), 10 states have call predecessors, (11), 10 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2025-03-08 05:38:47,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 120 transitions. [2025-03-08 05:38:47,983 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 120 transitions. Word has length 38 [2025-03-08 05:38:47,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:38:47,983 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 120 transitions. [2025-03-08 05:38:47,983 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), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 05:38:47,984 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 120 transitions. [2025-03-08 05:38:47,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-08 05:38:47,986 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:38:47,986 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] [2025-03-08 05:38:47,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 05:38:47,986 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:38:47,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:38:47,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1122037172, now seen corresponding path program 1 times [2025-03-08 05:38:47,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:38:47,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219519399] [2025-03-08 05:38:47,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:38:47,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:38:47,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-08 05:38:48,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-08 05:38:48,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:38:48,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:38:48,057 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 05:38:48,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:38:48,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219519399] [2025-03-08 05:38:48,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219519399] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:38:48,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:38:48,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:38:48,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039258543] [2025-03-08 05:38:48,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:38:48,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:38:48,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:38:48,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:38:48,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:38:48,059 INFO L87 Difference]: Start difference. First operand 96 states and 120 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 05:38:48,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:38:48,090 INFO L93 Difference]: Finished difference Result 188 states and 241 transitions. [2025-03-08 05:38:48,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:38:48,090 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 44 [2025-03-08 05:38:48,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:38:48,091 INFO L225 Difference]: With dead ends: 188 [2025-03-08 05:38:48,091 INFO L226 Difference]: Without dead ends: 99 [2025-03-08 05:38:48,091 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-03-08 05:38:48,092 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:38:48,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 285 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:38:48,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-08 05:38:48,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-03-08 05:38:48,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 77 states have (on average 1.2857142857142858) internal successors, (99), 84 states have internal predecessors, (99), 11 states have call successors, (11), 10 states have call predecessors, (11), 10 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2025-03-08 05:38:48,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 123 transitions. [2025-03-08 05:38:48,108 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 123 transitions. Word has length 44 [2025-03-08 05:38:48,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:38:48,108 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 123 transitions. [2025-03-08 05:38:48,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 05:38:48,108 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 123 transitions. [2025-03-08 05:38:48,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-08 05:38:48,109 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:38:48,109 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] [2025-03-08 05:38:48,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 05:38:48,109 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:38:48,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:38:48,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1055030419, now seen corresponding path program 1 times [2025-03-08 05:38:48,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:38:48,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598086279] [2025-03-08 05:38:48,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:38:48,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:38:48,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-08 05:38:48,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-08 05:38:48,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:38:48,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:38:48,171 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 05:38:48,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:38:48,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598086279] [2025-03-08 05:38:48,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598086279] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:38:48,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:38:48,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:38:48,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53563264] [2025-03-08 05:38:48,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:38:48,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:38:48,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:38:48,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:38:48,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:38:48,173 INFO L87 Difference]: Start difference. First operand 99 states and 123 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 05:38:48,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:38:48,192 INFO L93 Difference]: Finished difference Result 193 states and 246 transitions. [2025-03-08 05:38:48,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:38:48,194 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 44 [2025-03-08 05:38:48,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:38:48,195 INFO L225 Difference]: With dead ends: 193 [2025-03-08 05:38:48,195 INFO L226 Difference]: Without dead ends: 101 [2025-03-08 05:38:48,195 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-03-08 05:38:48,196 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 0 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 216 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-03-08 05:38:48,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 216 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:38:48,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-08 05:38:48,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-03-08 05:38:48,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 79 states have (on average 1.2784810126582278) internal successors, (101), 86 states have internal predecessors, (101), 11 states have call successors, (11), 10 states have call predecessors, (11), 10 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2025-03-08 05:38:48,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 125 transitions. [2025-03-08 05:38:48,207 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 125 transitions. Word has length 44 [2025-03-08 05:38:48,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:38:48,207 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 125 transitions. [2025-03-08 05:38:48,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 05:38:48,208 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 125 transitions. [2025-03-08 05:38:48,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-08 05:38:48,208 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:38:48,208 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] [2025-03-08 05:38:48,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 05:38:48,209 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:38:48,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:38:48,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1117070033, now seen corresponding path program 1 times [2025-03-08 05:38:48,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:38:48,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651801841] [2025-03-08 05:38:48,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:38:48,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:38:48,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-08 05:38:48,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-08 05:38:48,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:38:48,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:38:48,288 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 05:38:48,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:38:48,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651801841] [2025-03-08 05:38:48,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651801841] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:38:48,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:38:48,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:38:48,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041098951] [2025-03-08 05:38:48,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:38:48,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:38:48,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:38:48,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:38:48,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:38:48,290 INFO L87 Difference]: Start difference. First operand 101 states and 125 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 05:38:48,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:38:48,312 INFO L93 Difference]: Finished difference Result 235 states and 295 transitions. [2025-03-08 05:38:48,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:38:48,313 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 44 [2025-03-08 05:38:48,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:38:48,314 INFO L225 Difference]: With dead ends: 235 [2025-03-08 05:38:48,314 INFO L226 Difference]: Without dead ends: 141 [2025-03-08 05:38:48,315 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:38:48,316 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 34 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:38:48,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 139 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:38:48,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-03-08 05:38:48,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2025-03-08 05:38:48,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 110 states have (on average 1.2545454545454546) internal successors, (138), 118 states have internal predecessors, (138), 16 states have call successors, (16), 15 states have call predecessors, (16), 14 states have return successors, (18), 15 states have call predecessors, (18), 16 states have call successors, (18) [2025-03-08 05:38:48,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 172 transitions. [2025-03-08 05:38:48,332 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 172 transitions. Word has length 44 [2025-03-08 05:38:48,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:38:48,332 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 172 transitions. [2025-03-08 05:38:48,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 05:38:48,332 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 172 transitions. [2025-03-08 05:38:48,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-08 05:38:48,333 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:38:48,333 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] [2025-03-08 05:38:48,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 05:38:48,333 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:38:48,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:38:48,333 INFO L85 PathProgramCache]: Analyzing trace with hash -995737485, now seen corresponding path program 1 times [2025-03-08 05:38:48,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:38:48,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900278915] [2025-03-08 05:38:48,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:38:48,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:38:48,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-08 05:38:48,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-08 05:38:48,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:38:48,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:38:48,489 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 05:38:48,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:38:48,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900278915] [2025-03-08 05:38:48,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900278915] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:38:48,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:38:48,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 05:38:48,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99779926] [2025-03-08 05:38:48,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:38:48,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 05:38:48,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:38:48,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 05:38:48,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:38:48,493 INFO L87 Difference]: Start difference. First operand 141 states and 172 transitions. Second operand has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 7 states have internal predecessors, (39), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 05:38:48,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:38:48,646 INFO L93 Difference]: Finished difference Result 398 states and 505 transitions. [2025-03-08 05:38:48,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 05:38:48,647 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 7 states have internal predecessors, (39), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 48 [2025-03-08 05:38:48,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:38:48,649 INFO L225 Difference]: With dead ends: 398 [2025-03-08 05:38:48,649 INFO L226 Difference]: Without dead ends: 264 [2025-03-08 05:38:48,649 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-03-08 05:38:48,650 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 61 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:38:48,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 474 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:38:48,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2025-03-08 05:38:48,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 264. [2025-03-08 05:38:48,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 203 states have (on average 1.2364532019704433) internal successors, (251), 216 states have internal predecessors, (251), 32 states have call successors, (32), 30 states have call predecessors, (32), 28 states have return successors, (40), 30 states have call predecessors, (40), 32 states have call successors, (40) [2025-03-08 05:38:48,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 323 transitions. [2025-03-08 05:38:48,680 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 323 transitions. Word has length 48 [2025-03-08 05:38:48,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:38:48,680 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 323 transitions. [2025-03-08 05:38:48,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 7 states have internal predecessors, (39), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 05:38:48,681 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 323 transitions. [2025-03-08 05:38:48,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-08 05:38:48,684 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:38:48,684 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2025-03-08 05:38:48,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 05:38:48,684 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:38:48,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:38:48,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1188191154, now seen corresponding path program 1 times [2025-03-08 05:38:48,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:38:48,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939492682] [2025-03-08 05:38:48,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:38:48,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:38:48,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-08 05:38:48,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-08 05:38:48,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:38:48,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:38:48,833 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 17 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 05:38:48,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:38:48,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939492682] [2025-03-08 05:38:48,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939492682] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:38:48,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1337009746] [2025-03-08 05:38:48,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:38:48,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:38:48,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:38:48,838 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:38:48,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 05:38:48,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-08 05:38:48,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-08 05:38:48,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:38:48,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:38:48,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 05:38:48,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:38:49,081 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 05:38:49,083 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:38:49,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1337009746] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:38:49,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:38:49,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 16 [2025-03-08 05:38:49,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277104061] [2025-03-08 05:38:49,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:38:49,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:38:49,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:38:49,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:38:49,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2025-03-08 05:38:49,086 INFO L87 Difference]: Start difference. First operand 264 states and 323 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 05:38:49,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:38:49,178 INFO L93 Difference]: Finished difference Result 521 states and 639 transitions. [2025-03-08 05:38:49,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:38:49,178 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 83 [2025-03-08 05:38:49,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:38:49,180 INFO L225 Difference]: With dead ends: 521 [2025-03-08 05:38:49,180 INFO L226 Difference]: Without dead ends: 264 [2025-03-08 05:38:49,181 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2025-03-08 05:38:49,181 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 43 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:38:49,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 505 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:38:49,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2025-03-08 05:38:49,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 264. [2025-03-08 05:38:49,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 203 states have (on average 1.2167487684729064) internal successors, (247), 216 states have internal predecessors, (247), 32 states have call successors, (32), 30 states have call predecessors, (32), 28 states have return successors, (35), 30 states have call predecessors, (35), 32 states have call successors, (35) [2025-03-08 05:38:49,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 314 transitions. [2025-03-08 05:38:49,203 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 314 transitions. Word has length 83 [2025-03-08 05:38:49,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:38:49,203 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 314 transitions. [2025-03-08 05:38:49,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 05:38:49,204 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 314 transitions. [2025-03-08 05:38:49,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-08 05:38:49,205 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:38:49,206 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:38:49,212 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 05:38:49,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:38:49,407 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:38:49,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:38:49,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1825705523, now seen corresponding path program 1 times [2025-03-08 05:38:49,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:38:49,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089892116] [2025-03-08 05:38:49,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:38:49,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:38:49,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-08 05:38:49,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-08 05:38:49,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:38:49,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 05:38:49,424 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 05:38:49,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-08 05:38:49,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-08 05:38:49,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:38:49,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 05:38:49,456 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 05:38:49,456 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 05:38:49,457 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 05:38:49,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 05:38:49,464 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:38:49,511 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 05:38:49,513 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 05:38:49 BoogieIcfgContainer [2025-03-08 05:38:49,513 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 05:38:49,513 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 05:38:49,513 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 05:38:49,513 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 05:38:49,514 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:38:47" (3/4) ... [2025-03-08 05:38:49,517 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-08 05:38:49,578 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 69. [2025-03-08 05:38:49,634 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 05:38:49,634 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 05:38:49,635 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 05:38:49,635 INFO L158 Benchmark]: Toolchain (without parser) took 3315.48ms. Allocated memory is still 167.8MB. Free memory was 122.4MB in the beginning and 82.0MB in the end (delta: 40.4MB). Peak memory consumption was 43.1MB. Max. memory is 16.1GB. [2025-03-08 05:38:49,635 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 115.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 05:38:49,635 INFO L158 Benchmark]: CACSL2BoogieTranslator took 352.86ms. Allocated memory is still 167.8MB. Free memory was 122.4MB in the beginning and 104.0MB in the end (delta: 18.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 05:38:49,635 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.30ms. Allocated memory is still 167.8MB. Free memory was 104.0MB in the beginning and 101.9MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 05:38:49,636 INFO L158 Benchmark]: Boogie Preprocessor took 34.71ms. Allocated memory is still 167.8MB. Free memory was 101.9MB in the beginning and 101.0MB in the end (delta: 889.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 05:38:49,636 INFO L158 Benchmark]: IcfgBuilder took 357.83ms. Allocated memory is still 167.8MB. Free memory was 101.0MB in the beginning and 83.3MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 05:38:49,636 INFO L158 Benchmark]: TraceAbstraction took 2413.75ms. Allocated memory is still 167.8MB. Free memory was 82.4MB in the beginning and 93.2MB in the end (delta: -10.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 05:38:49,636 INFO L158 Benchmark]: Witness Printer took 121.28ms. Allocated memory is still 167.8MB. Free memory was 93.2MB in the beginning and 82.0MB in the end (delta: 11.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 05:38:49,637 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.21ms. Allocated memory is still 201.3MB. Free memory is still 115.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 352.86ms. Allocated memory is still 167.8MB. Free memory was 122.4MB in the beginning and 104.0MB in the end (delta: 18.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.30ms. Allocated memory is still 167.8MB. Free memory was 104.0MB in the beginning and 101.9MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.71ms. Allocated memory is still 167.8MB. Free memory was 101.9MB in the beginning and 101.0MB in the end (delta: 889.1kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 357.83ms. Allocated memory is still 167.8MB. Free memory was 101.0MB in the beginning and 83.3MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2413.75ms. Allocated memory is still 167.8MB. Free memory was 82.4MB in the beginning and 93.2MB in the end (delta: -10.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 121.28ms. Allocated memory is still 167.8MB. Free memory was 93.2MB in the beginning and 82.0MB in the end (delta: 11.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 49]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [49] - GenericResultAtLocation [Line: 415]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [415] - GenericResultAtLocation [Line: 516]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [516] - GenericResultAtLocation [Line: 586]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [586] - GenericResultAtLocation [Line: 769]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [769] - GenericResultAtLocation [Line: 778]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification1_spec.i","") [778] - GenericResultAtLocation [Line: 804]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [804] - GenericResultAtLocation [Line: 842]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [842] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 774]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L219] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L423] int waterLevel = 1; [L424] int methaneLevelCritical = 0; [L591] int pumpRunning = 0; [L592] int systemActive = 1; [L843] int cleanupTimeShifts = 4; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L916] int retValue_acc ; [L917] int tmp ; [L921] FCALL select_helpers() [L922] FCALL select_features() [L923] CALL, EXPR valid_product() [L834] int retValue_acc ; [L837] retValue_acc = 1 [L838] return (retValue_acc); VAL [\result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L923] RET, EXPR valid_product() [L923] tmp = valid_product() [L925] COND TRUE \read(tmp) [L927] FCALL setup() [L928] CALL runTest() [L910] CALL test() [L521] int splverifierCounter ; [L522] int tmp ; [L523] int tmp___0 ; [L524] int tmp___1 ; [L525] int tmp___2 ; [L528] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L532] COND TRUE splverifierCounter < 4 [L538] tmp = __VERIFIER_nondet_int() [L540] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L542] CALL waterRise() VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L441] COND TRUE waterLevel < 2 [L442] waterLevel = waterLevel + 1 VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L542] RET waterRise() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L548] tmp___0 = __VERIFIER_nondet_int() [L550] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L558] tmp___2 = __VERIFIER_nondet_int() [L560] COND TRUE \read(tmp___2) [L562] CALL startSystem() [L765] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L562] RET startSystem() [L575] CALL timeShift() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L599] COND FALSE !(\read(pumpRunning)) VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L606] COND TRUE \read(systemActive) [L608] CALL processEnvironment() [L628] int tmp ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L631] COND TRUE ! pumpRunning [L633] CALL, EXPR isHighWaterLevel() [L743] int retValue_acc ; [L744] int tmp ; [L745] int tmp___0 ; [L749] CALL, EXPR isHighWaterSensorDry() [L503] int retValue_acc ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L506] COND FALSE !(waterLevel < 2) [L510] retValue_acc = 0 [L511] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L749] RET, EXPR isHighWaterSensorDry() [L749] tmp = isHighWaterSensorDry() [L751] COND FALSE !(\read(tmp)) [L754] tmp___0 = 1 VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, tmp___0=1, waterLevel=2] [L756] retValue_acc = tmp___0 [L757] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L633] RET, EXPR isHighWaterLevel() [L633] tmp = isHighWaterLevel() [L635] COND TRUE \read(tmp) [L637] CALL activatePump() [L662] int tmp ; [L666] CALL, EXPR isMethaneAlarm() [L687] int retValue_acc ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L691] CALL, EXPR isMethaneLevelCritical() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L462] int retValue_acc ; [L465] retValue_acc = methaneLevelCritical [L466] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L691] RET, EXPR isMethaneLevelCritical() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L691] retValue_acc = isMethaneLevelCritical() [L693] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L666] RET, EXPR isMethaneAlarm() [L666] tmp = isMethaneAlarm() [L668] COND FALSE !(\read(tmp)) [L672] CALL activatePump__wrappee__highWaterSensor() [L656] pumpRunning = 1 VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L672] RET activatePump__wrappee__highWaterSensor() [L637] RET activatePump() [L608] RET processEnvironment() [L614] CALL __utac_acc__Specification1_spec__1() [L780] int tmp ; [L781] int tmp___0 ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L785] CALL, EXPR isMethaneLevelCritical() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L462] int retValue_acc ; [L465] retValue_acc = methaneLevelCritical [L466] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L785] RET, EXPR isMethaneLevelCritical() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L785] tmp = isMethaneLevelCritical() [L787] COND FALSE !(\read(tmp)) VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L614] RET __utac_acc__Specification1_spec__1() [L575] RET timeShift() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L532] COND TRUE splverifierCounter < 4 [L538] tmp = __VERIFIER_nondet_int() [L540] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L548] tmp___0 = __VERIFIER_nondet_int() [L550] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L552] CALL changeMethaneLevel() VAL [\old(methaneLevelCritical)=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L453] COND FALSE !(\read(methaneLevelCritical)) [L456] methaneLevelCritical = 1 VAL [\old(methaneLevelCritical)=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L552] RET changeMethaneLevel() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L558] tmp___2 = __VERIFIER_nondet_int() [L560] COND TRUE \read(tmp___2) [L562] CALL startSystem() [L765] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L562] RET startSystem() [L575] CALL timeShift() VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L599] COND TRUE \read(pumpRunning) [L601] CALL lowerWaterLevel() [L429] COND TRUE waterLevel > 0 [L430] waterLevel = waterLevel - 1 VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L601] RET lowerWaterLevel() [L606] COND TRUE \read(systemActive) [L608] CALL processEnvironment() [L628] int tmp ; VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L631] COND FALSE !(! pumpRunning) VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L646] FCALL processEnvironment__wrappee__base() VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L608] RET processEnvironment() [L614] CALL __utac_acc__Specification1_spec__1() [L780] int tmp ; [L781] int tmp___0 ; VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L785] CALL, EXPR isMethaneLevelCritical() VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L462] int retValue_acc ; [L465] retValue_acc = methaneLevelCritical [L466] return (retValue_acc); VAL [\old(pumpRunning)=1, \old(waterLevel)=2, \result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L785] RET, EXPR isMethaneLevelCritical() VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L785] tmp = isMethaneLevelCritical() [L787] COND TRUE \read(tmp) [L789] CALL, EXPR isPumpRunning() [L698] int retValue_acc ; [L701] retValue_acc = pumpRunning [L702] return (retValue_acc); VAL [\old(pumpRunning)=1, \old(waterLevel)=2, \result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L789] RET, EXPR isPumpRunning() [L789] tmp___0 = isPumpRunning() [L791] COND TRUE \read(tmp___0) [L793] CALL __automaton_fail() [L774] reach_error() VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 77 locations, 111 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.3s, OverallIterations: 10, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 343 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 337 mSDsluCounter, 2391 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1652 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 305 IncrementalHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 739 mSDtfsCounter, 305 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 144 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=264occurred in iteration=8, InterpolantAutomatonStates: 48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 545 NumberOfCodeBlocks, 545 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 456 ConstructedInterpolants, 0 QuantifiedInterpolants, 698 SizeOfPredicates, 0 NumberOfNonLiveVariables, 286 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 10 InterpolantComputations, 9 PerfectInterpolantSequences, 64/70 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-03-08 05:38:49,654 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE