./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec2_product56.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_spec2_product56.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 fa0eab3945757815cbe114f72b31b9c97b3f41e20a7d5f245c817ae82afdf9aa --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 05:39:36,957 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:39:36,997 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 05:39:37,001 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:39:37,001 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:39:37,016 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:39:37,017 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:39:37,017 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:39:37,017 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:39:37,017 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:39:37,017 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:39:37,017 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:39:37,018 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:39:37,018 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:39:37,018 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:39:37,018 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:39:37,018 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:39:37,018 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:39:37,018 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:39:37,018 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:39:37,018 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:39:37,018 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:39:37,018 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:39:37,018 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:39:37,018 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:39:37,018 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:39:37,018 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:39:37,018 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:39:37,018 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:39:37,018 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:39:37,018 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:39:37,019 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:39:37,019 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:39:37,019 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:39:37,019 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:39:37,019 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:39:37,019 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:39:37,019 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:39:37,019 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:39:37,019 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:39:37,019 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:39:37,019 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:39:37,019 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:39:37,019 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 -> fa0eab3945757815cbe114f72b31b9c97b3f41e20a7d5f245c817ae82afdf9aa [2025-03-08 05:39:37,409 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:39:37,419 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:39:37,421 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:39:37,422 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:39:37,423 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:39:37,424 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec2_product56.cil.c [2025-03-08 05:39:38,501 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fb94c3a9/c504dbae8b784bac86f4e2fb30e8b2ef/FLAGe4c34bac8 [2025-03-08 05:39:38,781 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:39:38,781 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product56.cil.c [2025-03-08 05:39:38,796 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fb94c3a9/c504dbae8b784bac86f4e2fb30e8b2ef/FLAGe4c34bac8 [2025-03-08 05:39:38,812 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fb94c3a9/c504dbae8b784bac86f4e2fb30e8b2ef [2025-03-08 05:39:38,814 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:39:38,816 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:39:38,819 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:39:38,819 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:39:38,823 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:39:38,824 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:39:38" (1/1) ... [2025-03-08 05:39:38,825 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7dd5dcd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:39:38, skipping insertion in model container [2025-03-08 05:39:38,825 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:39:38" (1/1) ... [2025-03-08 05:39:38,855 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:39:39,037 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_spec2_product56.cil.c[11292,11305] [2025-03-08 05:39:39,088 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:39:39,098 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:39:39,105 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [49] [2025-03-08 05:39:39,106 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [415] [2025-03-08 05:39:39,106 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [424] [2025-03-08 05:39:39,106 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [535] [2025-03-08 05:39:39,107 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [575] [2025-03-08 05:39:39,107 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [827] [2025-03-08 05:39:39,107 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [897] [2025-03-08 05:39:39,107 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [935] [2025-03-08 05:39:39,147 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_spec2_product56.cil.c[11292,11305] [2025-03-08 05:39:39,175 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:39:39,191 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:39:39,192 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:39:39 WrapperNode [2025-03-08 05:39:39,193 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:39:39,194 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:39:39,194 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:39:39,194 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:39:39,198 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:39:39" (1/1) ... [2025-03-08 05:39:39,207 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:39:39" (1/1) ... [2025-03-08 05:39:39,226 INFO L138 Inliner]: procedures = 59, calls = 106, calls flagged for inlining = 25, calls inlined = 22, statements flattened = 229 [2025-03-08 05:39:39,226 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:39:39,227 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:39:39,227 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:39:39,227 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:39:39,233 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:39:39" (1/1) ... [2025-03-08 05:39:39,233 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:39:39" (1/1) ... [2025-03-08 05:39:39,234 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:39:39" (1/1) ... [2025-03-08 05:39:39,247 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:39:39,248 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:39:39" (1/1) ... [2025-03-08 05:39:39,248 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:39:39" (1/1) ... [2025-03-08 05:39:39,250 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:39:39" (1/1) ... [2025-03-08 05:39:39,251 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:39:39" (1/1) ... [2025-03-08 05:39:39,252 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:39:39" (1/1) ... [2025-03-08 05:39:39,252 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:39:39" (1/1) ... [2025-03-08 05:39:39,255 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:39:39,255 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:39:39,256 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:39:39,256 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:39:39,256 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:39:39" (1/1) ... [2025-03-08 05:39:39,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:39:39,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:39:39,280 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:39:39,282 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:39:39,298 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:39:39,299 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2025-03-08 05:39:39,299 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2025-03-08 05:39:39,299 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-03-08 05:39:39,299 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-03-08 05:39:39,299 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-03-08 05:39:39,299 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-03-08 05:39:39,299 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2025-03-08 05:39:39,299 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2025-03-08 05:39:39,299 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__highWaterSensor [2025-03-08 05:39:39,299 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__highWaterSensor [2025-03-08 05:39:39,299 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2025-03-08 05:39:39,299 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2025-03-08 05:39:39,299 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__lowWaterSensor [2025-03-08 05:39:39,299 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__lowWaterSensor [2025-03-08 05:39:39,299 INFO L130 BoogieDeclarations]: Found specification of procedure deactivatePump [2025-03-08 05:39:39,300 INFO L138 BoogieDeclarations]: Found implementation of procedure deactivatePump [2025-03-08 05:39:39,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:39:39,300 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2025-03-08 05:39:39,300 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2025-03-08 05:39:39,300 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:39:39,300 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:39:39,356 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:39:39,358 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:39:39,458 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L727-1: isPumpRunning_#res#1 := isPumpRunning_~retValue_acc~8#1; [2025-03-08 05:39:39,458 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L718-1: isMethaneAlarm_#res#1 := isMethaneAlarm_~retValue_acc~7#1; [2025-03-08 05:39:39,462 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L477: #res := ~retValue_acc~3; [2025-03-08 05:39:39,525 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1029-1: main_#res#1 := main_~retValue_acc~13#1; [2025-03-08 05:39:39,525 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L932-1: valid_product_#res#1 := valid_product_~retValue_acc~12#1; [2025-03-08 05:39:39,543 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L782-1: isHighWaterLevel_#res#1 := isHighWaterLevel_~retValue_acc~9#1; [2025-03-08 05:39:39,544 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L523-1: isHighWaterSensorDry_#res#1 := isHighWaterSensorDry_~retValue_acc~5#1; [2025-03-08 05:39:39,574 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L801-1: isLowWaterLevel_#res#1 := isLowWaterLevel_~retValue_acc~10#1; [2025-03-08 05:39:39,574 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L532-1: isLowWaterSensorDry_#res#1 := isLowWaterSensorDry_~retValue_acc~6#1; [2025-03-08 05:39:39,590 INFO L? ?]: Removed 49 outVars from TransFormulas that were not future-live. [2025-03-08 05:39:39,590 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:39:39,600 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:39:39,601 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:39:39,602 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:39:39 BoogieIcfgContainer [2025-03-08 05:39:39,602 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:39:39,603 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:39:39,605 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:39:39,608 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:39:39,609 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:39:38" (1/3) ... [2025-03-08 05:39:39,609 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72a0a0b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:39:39, skipping insertion in model container [2025-03-08 05:39:39,609 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:39:39" (2/3) ... [2025-03-08 05:39:39,610 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72a0a0b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:39:39, skipping insertion in model container [2025-03-08 05:39:39,610 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:39:39" (3/3) ... [2025-03-08 05:39:39,611 INFO L128 eAbstractionObserver]: Analyzing ICFG minepump_spec2_product56.cil.c [2025-03-08 05:39:39,620 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:39:39,621 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG minepump_spec2_product56.cil.c that has 10 procedures, 104 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-08 05:39:39,672 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:39:39,682 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;@50eac9de, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:39:39,683 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:39:39,685 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 76 states have (on average 1.368421052631579) internal successors, (104), 87 states have internal predecessors, (104), 17 states have call successors, (17), 9 states have call predecessors, (17), 9 states have return successors, (17), 12 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 05:39:39,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-08 05:39:39,694 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:39:39,694 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:39:39,694 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:39:39,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:39:39,698 INFO L85 PathProgramCache]: Analyzing trace with hash -185482749, now seen corresponding path program 1 times [2025-03-08 05:39:39,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:39:39,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123289758] [2025-03-08 05:39:39,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:39:39,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:39:39,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 05:39:39,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 05:39:39,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:39:39,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:39:39,908 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:39:39,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:39:39,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123289758] [2025-03-08 05:39:39,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123289758] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:39:39,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:39:39,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:39:39,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878602701] [2025-03-08 05:39:39,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:39:39,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:39:39,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:39:39,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:39:39,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:39:39,934 INFO L87 Difference]: Start difference. First operand has 104 states, 76 states have (on average 1.368421052631579) internal successors, (104), 87 states have internal predecessors, (104), 17 states have call successors, (17), 9 states have call predecessors, (17), 9 states have return successors, (17), 12 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 05:39:39,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:39:39,972 INFO L93 Difference]: Finished difference Result 187 states and 251 transitions. [2025-03-08 05:39:39,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:39:39,974 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2025-03-08 05:39:39,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:39:39,979 INFO L225 Difference]: With dead ends: 187 [2025-03-08 05:39:39,980 INFO L226 Difference]: Without dead ends: 87 [2025-03-08 05:39:39,984 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:39:39,987 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 16 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 214 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:39:39,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 214 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:39:39,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-08 05:39:40,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-03-08 05:39:40,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 64 states have (on average 1.34375) internal successors, (86), 74 states have internal predecessors, (86), 14 states have call successors, (14), 8 states have call predecessors, (14), 8 states have return successors, (14), 9 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-08 05:39:40,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 114 transitions. [2025-03-08 05:39:40,025 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 114 transitions. Word has length 25 [2025-03-08 05:39:40,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:39:40,026 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 114 transitions. [2025-03-08 05:39:40,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 05:39:40,027 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 114 transitions. [2025-03-08 05:39:40,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-08 05:39:40,030 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:39:40,030 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:39:40,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 05:39:40,031 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:39:40,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:39:40,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1280779342, now seen corresponding path program 1 times [2025-03-08 05:39:40,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:39:40,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667103971] [2025-03-08 05:39:40,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:39:40,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:39:40,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-08 05:39:40,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 05:39:40,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:39:40,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:39:40,153 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:39:40,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:39:40,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667103971] [2025-03-08 05:39:40,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667103971] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:39:40,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:39:40,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:39:40,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782542224] [2025-03-08 05:39:40,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:39:40,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:39:40,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:39:40,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:39:40,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:39:40,157 INFO L87 Difference]: Start difference. First operand 87 states and 114 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 05:39:40,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:39:40,360 INFO L93 Difference]: Finished difference Result 284 states and 380 transitions. [2025-03-08 05:39:40,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:39:40,361 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2025-03-08 05:39:40,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:39:40,365 INFO L225 Difference]: With dead ends: 284 [2025-03-08 05:39:40,365 INFO L226 Difference]: Without dead ends: 205 [2025-03-08 05:39:40,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:39:40,367 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 198 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:39:40,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 481 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:39:40,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-03-08 05:39:40,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 199. [2025-03-08 05:39:40,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 144 states have (on average 1.3819444444444444) internal successors, (199), 166 states have internal predecessors, (199), 33 states have call successors, (33), 21 states have call predecessors, (33), 21 states have return successors, (34), 21 states have call predecessors, (34), 33 states have call successors, (34) [2025-03-08 05:39:40,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 266 transitions. [2025-03-08 05:39:40,386 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 266 transitions. Word has length 29 [2025-03-08 05:39:40,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:39:40,387 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 266 transitions. [2025-03-08 05:39:40,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 05:39:40,387 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 266 transitions. [2025-03-08 05:39:40,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-08 05:39:40,388 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:39:40,388 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:39:40,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 05:39:40,388 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:39:40,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:39:40,389 INFO L85 PathProgramCache]: Analyzing trace with hash -2054687775, now seen corresponding path program 1 times [2025-03-08 05:39:40,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:39:40,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450400811] [2025-03-08 05:39:40,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:39:40,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:39:40,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-08 05:39:40,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-08 05:39:40,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:39:40,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:39:40,507 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:39:40,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:39:40,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450400811] [2025-03-08 05:39:40,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450400811] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:39:40,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:39:40,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:39:40,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006497932] [2025-03-08 05:39:40,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:39:40,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:39:40,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:39:40,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:39:40,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:39:40,509 INFO L87 Difference]: Start difference. First operand 199 states and 266 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 05:39:40,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:39:40,583 INFO L93 Difference]: Finished difference Result 470 states and 647 transitions. [2025-03-08 05:39:40,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:39:40,585 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2025-03-08 05:39:40,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:39:40,587 INFO L225 Difference]: With dead ends: 470 [2025-03-08 05:39:40,589 INFO L226 Difference]: Without dead ends: 279 [2025-03-08 05:39:40,591 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:39:40,592 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 56 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:39:40,592 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 410 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:39:40,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2025-03-08 05:39:40,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 277. [2025-03-08 05:39:40,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 202 states have (on average 1.316831683168317) internal successors, (266), 221 states have internal predecessors, (266), 40 states have call successors, (40), 34 states have call predecessors, (40), 34 states have return successors, (54), 35 states have call predecessors, (54), 40 states have call successors, (54) [2025-03-08 05:39:40,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 360 transitions. [2025-03-08 05:39:40,633 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 360 transitions. Word has length 32 [2025-03-08 05:39:40,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:39:40,633 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 360 transitions. [2025-03-08 05:39:40,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 05:39:40,634 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 360 transitions. [2025-03-08 05:39:40,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-08 05:39:40,639 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:39:40,639 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:39:40,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 05:39:40,639 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:39:40,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:39:40,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1318363880, now seen corresponding path program 1 times [2025-03-08 05:39:40,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:39:40,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173084244] [2025-03-08 05:39:40,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:39:40,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:39:40,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-08 05:39:40,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-08 05:39:40,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:39:40,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:39:40,741 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:39:40,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:39:40,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173084244] [2025-03-08 05:39:40,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173084244] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:39:40,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:39:40,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:39:40,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493972000] [2025-03-08 05:39:40,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:39:40,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:39:40,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:39:40,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:39:40,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:39:40,743 INFO L87 Difference]: Start difference. First operand 277 states and 360 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 05:39:40,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:39:40,781 INFO L93 Difference]: Finished difference Result 550 states and 744 transitions. [2025-03-08 05:39:40,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:39:40,781 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 48 [2025-03-08 05:39:40,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:39:40,783 INFO L225 Difference]: With dead ends: 550 [2025-03-08 05:39:40,784 INFO L226 Difference]: Without dead ends: 281 [2025-03-08 05:39:40,784 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:39:40,785 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 0 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:39:40,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 542 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:39:40,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2025-03-08 05:39:40,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2025-03-08 05:39:40,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 206 states have (on average 1.3106796116504855) internal successors, (270), 225 states have internal predecessors, (270), 40 states have call successors, (40), 34 states have call predecessors, (40), 34 states have return successors, (54), 35 states have call predecessors, (54), 40 states have call successors, (54) [2025-03-08 05:39:40,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 364 transitions. [2025-03-08 05:39:40,809 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 364 transitions. Word has length 48 [2025-03-08 05:39:40,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:39:40,810 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 364 transitions. [2025-03-08 05:39:40,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 05:39:40,810 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 364 transitions. [2025-03-08 05:39:40,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-08 05:39:40,813 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:39:40,814 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:39:40,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 05:39:40,814 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:39:40,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:39:40,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1107012967, now seen corresponding path program 1 times [2025-03-08 05:39:40,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:39:40,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307139747] [2025-03-08 05:39:40,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:39:40,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:39:40,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-08 05:39:40,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-08 05:39:40,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:39:40,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:39:40,916 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:39:40,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:39:40,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307139747] [2025-03-08 05:39:40,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307139747] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:39:40,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:39:40,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:39:40,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317914868] [2025-03-08 05:39:40,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:39:40,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:39:40,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:39:40,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:39:40,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:39:40,919 INFO L87 Difference]: Start difference. First operand 281 states and 364 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 05:39:40,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:39:40,957 INFO L93 Difference]: Finished difference Result 560 states and 741 transitions. [2025-03-08 05:39:40,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:39:40,957 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 48 [2025-03-08 05:39:40,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:39:40,960 INFO L225 Difference]: With dead ends: 560 [2025-03-08 05:39:40,960 INFO L226 Difference]: Without dead ends: 287 [2025-03-08 05:39:40,961 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:39:40,964 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 0 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:39:40,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 438 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:39:40,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2025-03-08 05:39:40,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2025-03-08 05:39:40,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 212 states have (on average 1.3018867924528301) internal successors, (276), 231 states have internal predecessors, (276), 40 states have call successors, (40), 34 states have call predecessors, (40), 34 states have return successors, (54), 35 states have call predecessors, (54), 40 states have call successors, (54) [2025-03-08 05:39:40,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 370 transitions. [2025-03-08 05:39:40,985 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 370 transitions. Word has length 48 [2025-03-08 05:39:40,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:39:40,986 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 370 transitions. [2025-03-08 05:39:40,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 05:39:40,986 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 370 transitions. [2025-03-08 05:39:40,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-08 05:39:40,988 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:39:40,988 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:39:40,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 05:39:40,989 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:39:40,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:39:40,989 INFO L85 PathProgramCache]: Analyzing trace with hash -487074454, now seen corresponding path program 1 times [2025-03-08 05:39:40,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:39:40,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133332974] [2025-03-08 05:39:40,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:39:40,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:39:40,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-08 05:39:41,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-08 05:39:41,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:39:41,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:39:41,070 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:39:41,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:39:41,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133332974] [2025-03-08 05:39:41,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133332974] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:39:41,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:39:41,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:39:41,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813389959] [2025-03-08 05:39:41,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:39:41,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:39:41,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:39:41,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:39:41,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:39:41,073 INFO L87 Difference]: Start difference. First operand 287 states and 370 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 05:39:41,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:39:41,186 INFO L93 Difference]: Finished difference Result 963 states and 1286 transitions. [2025-03-08 05:39:41,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:39:41,187 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 48 [2025-03-08 05:39:41,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:39:41,190 INFO L225 Difference]: With dead ends: 963 [2025-03-08 05:39:41,190 INFO L226 Difference]: Without dead ends: 684 [2025-03-08 05:39:41,191 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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:39:41,192 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 148 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:39:41,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 383 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:39:41,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2025-03-08 05:39:41,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 670. [2025-03-08 05:39:41,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 493 states have (on average 1.2758620689655173) internal successors, (629), 531 states have internal predecessors, (629), 93 states have call successors, (93), 81 states have call predecessors, (93), 83 states have return successors, (150), 85 states have call predecessors, (150), 93 states have call successors, (150) [2025-03-08 05:39:41,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 872 transitions. [2025-03-08 05:39:41,258 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 872 transitions. Word has length 48 [2025-03-08 05:39:41,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:39:41,258 INFO L471 AbstractCegarLoop]: Abstraction has 670 states and 872 transitions. [2025-03-08 05:39:41,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 05:39:41,258 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 872 transitions. [2025-03-08 05:39:41,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-08 05:39:41,259 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:39:41,259 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:39:41,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 05:39:41,259 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:39:41,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:39:41,260 INFO L85 PathProgramCache]: Analyzing trace with hash -143653560, now seen corresponding path program 1 times [2025-03-08 05:39:41,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:39:41,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6642235] [2025-03-08 05:39:41,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:39:41,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:39:41,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-08 05:39:41,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-08 05:39:41,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:39:41,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:39:41,318 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:39:41,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:39:41,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6642235] [2025-03-08 05:39:41,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6642235] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:39:41,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:39:41,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:39:41,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271406411] [2025-03-08 05:39:41,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:39:41,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:39:41,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:39:41,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:39:41,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:39:41,319 INFO L87 Difference]: Start difference. First operand 670 states and 872 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 05:39:41,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:39:41,393 INFO L93 Difference]: Finished difference Result 1088 states and 1456 transitions. [2025-03-08 05:39:41,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:39:41,393 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 52 [2025-03-08 05:39:41,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:39:41,401 INFO L225 Difference]: With dead ends: 1088 [2025-03-08 05:39:41,401 INFO L226 Difference]: Without dead ends: 1086 [2025-03-08 05:39:41,402 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:39:41,403 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 87 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:39:41,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 216 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:39:41,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1086 states. [2025-03-08 05:39:41,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1086 to 1028. [2025-03-08 05:39:41,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1028 states, 751 states have (on average 1.2796271637816246) internal successors, (961), 815 states have internal predecessors, (961), 149 states have call successors, (149), 125 states have call predecessors, (149), 127 states have return successors, (277), 127 states have call predecessors, (277), 149 states have call successors, (277) [2025-03-08 05:39:41,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 1387 transitions. [2025-03-08 05:39:41,486 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 1387 transitions. Word has length 52 [2025-03-08 05:39:41,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:39:41,487 INFO L471 AbstractCegarLoop]: Abstraction has 1028 states and 1387 transitions. [2025-03-08 05:39:41,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 05:39:41,487 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1387 transitions. [2025-03-08 05:39:41,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-08 05:39:41,494 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:39:41,494 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:39:41,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 05:39:41,494 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:39:41,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:39:41,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1537082990, now seen corresponding path program 1 times [2025-03-08 05:39:41,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:39:41,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721701390] [2025-03-08 05:39:41,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:39:41,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:39:41,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-08 05:39:41,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-08 05:39:41,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:39:41,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:39:41,614 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 24 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 05:39:41,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:39:41,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721701390] [2025-03-08 05:39:41,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721701390] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:39:41,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456578627] [2025-03-08 05:39:41,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:39:41,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:39:41,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:39:41,617 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:39:41,618 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:39:41,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-08 05:39:41,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-08 05:39:41,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:39:41,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:39:41,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 05:39:41,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:39:41,742 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-08 05:39:41,742 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:39:41,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [456578627] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:39:41,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:39:41,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 05:39:41,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939720325] [2025-03-08 05:39:41,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:39:41,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:39:41,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:39:41,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:39:41,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:39:41,744 INFO L87 Difference]: Start difference. First operand 1028 states and 1387 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-08 05:39:41,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:39:41,817 INFO L93 Difference]: Finished difference Result 2255 states and 3155 transitions. [2025-03-08 05:39:41,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:39:41,817 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 100 [2025-03-08 05:39:41,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:39:41,823 INFO L225 Difference]: With dead ends: 2255 [2025-03-08 05:39:41,823 INFO L226 Difference]: Without dead ends: 1365 [2025-03-08 05:39:41,826 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:39:41,826 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 87 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:39:41,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 315 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:39:41,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1365 states. [2025-03-08 05:39:41,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1365 to 1160. [2025-03-08 05:39:41,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1160 states, 850 states have (on average 1.28) internal successors, (1088), 913 states have internal predecessors, (1088), 163 states have call successors, (163), 139 states have call predecessors, (163), 146 states have return successors, (248), 144 states have call predecessors, (248), 163 states have call successors, (248) [2025-03-08 05:39:41,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1160 states to 1160 states and 1499 transitions. [2025-03-08 05:39:41,894 INFO L78 Accepts]: Start accepts. Automaton has 1160 states and 1499 transitions. Word has length 100 [2025-03-08 05:39:41,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:39:41,895 INFO L471 AbstractCegarLoop]: Abstraction has 1160 states and 1499 transitions. [2025-03-08 05:39:41,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-08 05:39:41,895 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 1499 transitions. [2025-03-08 05:39:41,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-08 05:39:41,897 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:39:41,898 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:39:41,904 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:39:42,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:39:42,102 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:39:42,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:39:42,102 INFO L85 PathProgramCache]: Analyzing trace with hash -899680422, now seen corresponding path program 1 times [2025-03-08 05:39:42,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:39:42,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479312195] [2025-03-08 05:39:42,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:39:42,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:39:42,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-08 05:39:42,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-08 05:39:42,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:39:42,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:39:42,232 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-08 05:39:42,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:39:42,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479312195] [2025-03-08 05:39:42,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479312195] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:39:42,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1335409345] [2025-03-08 05:39:42,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:39:42,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:39:42,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:39:42,235 INFO L229 MonitoredProcess]: Starting monitored process 3 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:39:42,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 05:39:42,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-08 05:39:42,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-08 05:39:42,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:39:42,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:39:42,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 05:39:42,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:39:42,455 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 33 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 05:39:42,455 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:39:42,797 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-08 05:39:42,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1335409345] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:39:42,798 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:39:42,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 8] total 16 [2025-03-08 05:39:42,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259212934] [2025-03-08 05:39:42,798 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:39:42,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 05:39:42,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:39:42,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 05:39:42,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2025-03-08 05:39:42,800 INFO L87 Difference]: Start difference. First operand 1160 states and 1499 transitions. Second operand has 16 states, 16 states have (on average 9.5625) internal successors, (153), 15 states have internal predecessors, (153), 9 states have call successors, (25), 9 states have call predecessors, (25), 10 states have return successors, (25), 10 states have call predecessors, (25), 9 states have call successors, (25) [2025-03-08 05:39:43,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:39:43,810 INFO L93 Difference]: Finished difference Result 2525 states and 3438 transitions. [2025-03-08 05:39:43,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-08 05:39:43,812 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 9.5625) internal successors, (153), 15 states have internal predecessors, (153), 9 states have call successors, (25), 9 states have call predecessors, (25), 10 states have return successors, (25), 10 states have call predecessors, (25), 9 states have call successors, (25) Word has length 103 [2025-03-08 05:39:43,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:39:43,819 INFO L225 Difference]: With dead ends: 2525 [2025-03-08 05:39:43,819 INFO L226 Difference]: Without dead ends: 1497 [2025-03-08 05:39:43,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 210 SyntacticMatches, 5 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=303, Invalid=1029, Unknown=0, NotChecked=0, Total=1332 [2025-03-08 05:39:43,823 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 666 mSDsluCounter, 774 mSDsCounter, 0 mSdLazyCounter, 1005 mSolverCounterSat, 253 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 668 SdHoareTripleChecker+Valid, 903 SdHoareTripleChecker+Invalid, 1258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 253 IncrementalHoareTripleChecker+Valid, 1005 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 05:39:43,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [668 Valid, 903 Invalid, 1258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [253 Valid, 1005 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 05:39:43,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1497 states. [2025-03-08 05:39:43,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1497 to 1308. [2025-03-08 05:39:43,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1308 states, 955 states have (on average 1.2303664921465969) internal successors, (1175), 1019 states have internal predecessors, (1175), 185 states have call successors, (185), 161 states have call predecessors, (185), 167 states have return successors, (275), 168 states have call predecessors, (275), 185 states have call successors, (275) [2025-03-08 05:39:43,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1308 states to 1308 states and 1635 transitions. [2025-03-08 05:39:43,902 INFO L78 Accepts]: Start accepts. Automaton has 1308 states and 1635 transitions. Word has length 103 [2025-03-08 05:39:43,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:39:43,903 INFO L471 AbstractCegarLoop]: Abstraction has 1308 states and 1635 transitions. [2025-03-08 05:39:43,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 9.5625) internal successors, (153), 15 states have internal predecessors, (153), 9 states have call successors, (25), 9 states have call predecessors, (25), 10 states have return successors, (25), 10 states have call predecessors, (25), 9 states have call successors, (25) [2025-03-08 05:39:43,903 INFO L276 IsEmpty]: Start isEmpty. Operand 1308 states and 1635 transitions. [2025-03-08 05:39:43,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-08 05:39:43,905 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:39:43,905 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:39:43,912 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 05:39:44,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-03-08 05:39:44,106 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:39:44,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:39:44,106 INFO L85 PathProgramCache]: Analyzing trace with hash 436737850, now seen corresponding path program 1 times [2025-03-08 05:39:44,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:39:44,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425746092] [2025-03-08 05:39:44,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:39:44,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:39:44,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-08 05:39:44,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-08 05:39:44,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:39:44,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:39:44,141 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-08 05:39:44,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:39:44,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425746092] [2025-03-08 05:39:44,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425746092] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:39:44,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:39:44,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:39:44,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051182228] [2025-03-08 05:39:44,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:39:44,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:39:44,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:39:44,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:39:44,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:39:44,143 INFO L87 Difference]: Start difference. First operand 1308 states and 1635 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:39:44,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:39:44,214 INFO L93 Difference]: Finished difference Result 2019 states and 2530 transitions. [2025-03-08 05:39:44,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:39:44,214 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 101 [2025-03-08 05:39:44,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:39:44,218 INFO L225 Difference]: With dead ends: 2019 [2025-03-08 05:39:44,219 INFO L226 Difference]: Without dead ends: 719 [2025-03-08 05:39:44,221 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:39:44,222 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 35 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:39:44,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 245 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:39:44,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2025-03-08 05:39:44,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 686. [2025-03-08 05:39:44,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 686 states, 505 states have (on average 1.2297029702970297) internal successors, (621), 541 states have internal predecessors, (621), 94 states have call successors, (94), 82 states have call predecessors, (94), 86 states have return successors, (128), 88 states have call predecessors, (128), 94 states have call successors, (128) [2025-03-08 05:39:44,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 843 transitions. [2025-03-08 05:39:44,259 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 843 transitions. Word has length 101 [2025-03-08 05:39:44,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:39:44,260 INFO L471 AbstractCegarLoop]: Abstraction has 686 states and 843 transitions. [2025-03-08 05:39:44,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:39:44,260 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 843 transitions. [2025-03-08 05:39:44,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-08 05:39:44,261 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:39:44,261 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:39:44,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 05:39:44,262 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:39:44,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:39:44,262 INFO L85 PathProgramCache]: Analyzing trace with hash 653245428, now seen corresponding path program 1 times [2025-03-08 05:39:44,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:39:44,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805625031] [2025-03-08 05:39:44,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:39:44,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:39:44,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-08 05:39:44,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-08 05:39:44,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:39:44,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:39:44,395 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 19 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-08 05:39:44,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:39:44,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805625031] [2025-03-08 05:39:44,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805625031] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:39:44,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630839321] [2025-03-08 05:39:44,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:39:44,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:39:44,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:39:44,398 INFO L229 MonitoredProcess]: Starting monitored process 4 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:39:44,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 05:39:44,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-08 05:39:44,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-08 05:39:44,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:39:44,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:39:44,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 05:39:44,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:39:44,613 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-08 05:39:44,613 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:39:44,731 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-08 05:39:44,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [630839321] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 05:39:44,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 05:39:44,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 5] total 11 [2025-03-08 05:39:44,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100380707] [2025-03-08 05:39:44,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:39:44,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:39:44,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:39:44,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:39:44,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:39:44,733 INFO L87 Difference]: Start difference. First operand 686 states and 843 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-08 05:39:44,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:39:44,866 INFO L93 Difference]: Finished difference Result 1968 states and 2476 transitions. [2025-03-08 05:39:44,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:39:44,866 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 104 [2025-03-08 05:39:44,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:39:44,872 INFO L225 Difference]: With dead ends: 1968 [2025-03-08 05:39:44,872 INFO L226 Difference]: Without dead ends: 1290 [2025-03-08 05:39:44,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 204 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-03-08 05:39:44,875 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 74 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:39:44,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 509 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:39:44,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2025-03-08 05:39:44,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 1182. [2025-03-08 05:39:44,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1182 states, 863 states have (on average 1.2004634994206258) internal successors, (1036), 927 states have internal predecessors, (1036), 163 states have call successors, (163), 145 states have call predecessors, (163), 155 states have return successors, (230), 155 states have call predecessors, (230), 163 states have call successors, (230) [2025-03-08 05:39:44,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1182 states to 1182 states and 1429 transitions. [2025-03-08 05:39:44,961 INFO L78 Accepts]: Start accepts. Automaton has 1182 states and 1429 transitions. Word has length 104 [2025-03-08 05:39:44,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:39:44,961 INFO L471 AbstractCegarLoop]: Abstraction has 1182 states and 1429 transitions. [2025-03-08 05:39:44,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-08 05:39:44,961 INFO L276 IsEmpty]: Start isEmpty. Operand 1182 states and 1429 transitions. [2025-03-08 05:39:44,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-08 05:39:44,963 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:39:44,964 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:39:44,970 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 05:39:45,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:39:45,165 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:39:45,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:39:45,165 INFO L85 PathProgramCache]: Analyzing trace with hash -270677229, now seen corresponding path program 1 times [2025-03-08 05:39:45,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:39:45,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320393396] [2025-03-08 05:39:45,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:39:45,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:39:45,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-08 05:39:45,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-08 05:39:45,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:39:45,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:39:45,257 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 17 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-08 05:39:45,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:39:45,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320393396] [2025-03-08 05:39:45,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320393396] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:39:45,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [973065204] [2025-03-08 05:39:45,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:39:45,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:39:45,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:39:45,260 INFO L229 MonitoredProcess]: Starting monitored process 5 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:39:45,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 05:39:45,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-08 05:39:45,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-08 05:39:45,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:39:45,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:39:45,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 05:39:45,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:39:45,430 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 05:39:45,430 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:39:45,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [973065204] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:39:45,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:39:45,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2025-03-08 05:39:45,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369507717] [2025-03-08 05:39:45,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:39:45,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:39:45,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:39:45,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:39:45,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-03-08 05:39:45,432 INFO L87 Difference]: Start difference. First operand 1182 states and 1429 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 6 states have internal predecessors, (81), 3 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-08 05:39:45,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:39:45,585 INFO L93 Difference]: Finished difference Result 2131 states and 2572 transitions. [2025-03-08 05:39:45,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:39:45,586 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 6 states have internal predecessors, (81), 3 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) Word has length 108 [2025-03-08 05:39:45,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:39:45,588 INFO L225 Difference]: With dead ends: 2131 [2025-03-08 05:39:45,588 INFO L226 Difference]: Without dead ends: 0 [2025-03-08 05:39:45,592 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-03-08 05:39:45,593 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 34 mSDsluCounter, 701 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 886 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:39:45,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 886 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:39:45,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-08 05:39:45,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-08 05:39:45,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:39:45,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-08 05:39:45,595 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 108 [2025-03-08 05:39:45,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:39:45,595 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-08 05:39:45,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 6 states have internal predecessors, (81), 3 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-08 05:39:45,596 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-08 05:39:45,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-08 05:39:45,598 INFO L782 garLoopResultBuilder]: Registering result SAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 05:39:45,607 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 05:39:45,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:39:45,803 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:39:45,805 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-08 05:39:54,251 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 05:39:54,267 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 05:39:54 BoogieIcfgContainer [2025-03-08 05:39:54,267 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 05:39:54,267 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 05:39:54,267 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 05:39:54,267 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 05:39:54,268 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:39:39" (3/4) ... [2025-03-08 05:39:54,269 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 05:39:54,273 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure deactivatePump [2025-03-08 05:39:54,273 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__base [2025-03-08 05:39:54,273 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure changeMethaneLevel [2025-03-08 05:39:54,273 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure cleanup [2025-03-08 05:39:54,273 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure timeShift [2025-03-08 05:39:54,273 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure isMethaneLevelCritical [2025-03-08 05:39:54,273 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__highWaterSensor [2025-03-08 05:39:54,273 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure waterRise [2025-03-08 05:39:54,273 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__lowWaterSensor [2025-03-08 05:39:54,279 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2025-03-08 05:39:54,280 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-03-08 05:39:54,280 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-08 05:39:54,280 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 05:39:54,282 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 05:39:54,352 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 05:39:54,352 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 05:39:54,352 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 05:39:54,353 INFO L158 Benchmark]: Toolchain (without parser) took 15536.91ms. Allocated memory was 167.8MB in the beginning and 251.7MB in the end (delta: 83.9MB). Free memory was 123.3MB in the beginning and 182.2MB in the end (delta: -58.9MB). Peak memory consumption was 20.2MB. Max. memory is 16.1GB. [2025-03-08 05:39:54,354 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 121.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 05:39:54,354 INFO L158 Benchmark]: CACSL2BoogieTranslator took 374.01ms. Allocated memory is still 167.8MB. Free memory was 123.3MB in the beginning and 104.2MB in the end (delta: 19.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 05:39:54,354 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.97ms. Allocated memory is still 167.8MB. Free memory was 104.2MB in the beginning and 102.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 05:39:54,354 INFO L158 Benchmark]: Boogie Preprocessor took 27.96ms. Allocated memory is still 167.8MB. Free memory was 102.4MB in the beginning and 100.7MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 05:39:54,355 INFO L158 Benchmark]: IcfgBuilder took 346.41ms. Allocated memory is still 167.8MB. Free memory was 100.7MB in the beginning and 80.9MB in the end (delta: 19.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 05:39:54,355 INFO L158 Benchmark]: TraceAbstraction took 14663.32ms. Allocated memory was 167.8MB in the beginning and 251.7MB in the end (delta: 83.9MB). Free memory was 80.5MB in the beginning and 193.1MB in the end (delta: -112.6MB). Peak memory consumption was 107.2MB. Max. memory is 16.1GB. [2025-03-08 05:39:54,355 INFO L158 Benchmark]: Witness Printer took 85.14ms. Allocated memory is still 251.7MB. Free memory was 193.1MB in the beginning and 182.2MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 05:39:54,357 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.19ms. Allocated memory is still 201.3MB. Free memory is still 121.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 374.01ms. Allocated memory is still 167.8MB. Free memory was 123.3MB in the beginning and 104.2MB in the end (delta: 19.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.97ms. Allocated memory is still 167.8MB. Free memory was 104.2MB in the beginning and 102.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 27.96ms. Allocated memory is still 167.8MB. Free memory was 102.4MB in the beginning and 100.7MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 346.41ms. Allocated memory is still 167.8MB. Free memory was 100.7MB in the beginning and 80.9MB in the end (delta: 19.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 14663.32ms. Allocated memory was 167.8MB in the beginning and 251.7MB in the end (delta: 83.9MB). Free memory was 80.5MB in the beginning and 193.1MB in the end (delta: -112.6MB). Peak memory consumption was 107.2MB. Max. memory is 16.1GB. * Witness Printer took 85.14ms. Allocated memory is still 251.7MB. Free memory was 193.1MB in the beginning and 182.2MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 49]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [49] - GenericResultAtLocation [Line: 415]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [415] - GenericResultAtLocation [Line: 424]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [424] - GenericResultAtLocation [Line: 535]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [535] - GenericResultAtLocation [Line: 575]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [575] - GenericResultAtLocation [Line: 827]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [827] - GenericResultAtLocation [Line: 897]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [897] - GenericResultAtLocation [Line: 935]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [935] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 420]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 104 locations, 155 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.1s, OverallIterations: 12, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1409 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1401 mSDsluCounter, 5542 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3885 mSDsCounter, 284 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1393 IncrementalHoareTripleChecker+Invalid, 1677 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 284 mSolverCounterUnsat, 1657 mSDtfsCounter, 1393 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 731 GetRequests, 639 SyntacticMatches, 6 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1308occurred in iteration=9, InterpolantAutomatonStates: 77, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 12 MinimizatonAttempts, 615 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 1213 NumberOfCodeBlocks, 1213 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1402 ConstructedInterpolants, 0 QuantifiedInterpolants, 2684 SizeOfPredicates, 3 NumberOfNonLiveVariables, 1410 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 18 InterpolantComputations, 11 PerfectInterpolantSequences, 407/437 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 947]: Location Invariant Derived location invariant: 0 - InvariantResult [Line: 839]: Location Invariant Derived location invariant: ((((((((((((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 <= methaneLevelCritical)) && (2 == waterLevel)) && (1 == systemActive)) && (splverifierCounter == 0)) || ((((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 <= methaneLevelCritical)) && (splverifierCounter == 0)) && (waterLevel <= 2)) && (0 == systemActive))) || ((1 <= methaneLevelCritical) && ((((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 == systemActive)) && (splverifierCounter == 0)) && (waterLevel == 1)) || (((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 == systemActive)) && (splverifierCounter == 0)) && (waterLevel <= 0))))) || (((((1 <= methaneLevelCritical) && (2 == waterLevel)) && (1 == systemActive)) && (splverifierCounter == 0)) && (pumpRunning == 1))) || ((methaneLevelCritical == 0) && ((((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 == systemActive)) && (splverifierCounter == 0)) && (waterLevel == 1)) || (((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 == systemActive)) && (splverifierCounter == 0)) && (waterLevel <= 0))))) || ((((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (2 == waterLevel)) && (methaneLevelCritical == 0)) && (1 == systemActive)) && (splverifierCounter == 0))) || ((((((methAndRunningLastTime == 0) && (2 == waterLevel)) && (methaneLevelCritical == 0)) && (1 == systemActive)) && (splverifierCounter == 0)) && (pumpRunning == 1))) || ((((((methAndRunningLastTime == 0) && (methaneLevelCritical == 0)) && (waterLevel <= 1)) && (1 == systemActive)) && (splverifierCounter == 0)) && (pumpRunning == 1))) || ((((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (methaneLevelCritical == 0)) && (splverifierCounter == 0)) && (waterLevel <= 2)) && (0 == systemActive))) RESULT: Ultimate proved your program to be correct! [2025-03-08 05:39:54,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE