./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec1_product51.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/minepump_spec1_product51.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 311cf727219391e066955da60e9a83cfca77eaf7b53c342c6934d47c5123e76f --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 05:38:50,288 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:38:50,340 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 05:38:50,347 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:38:50,347 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:38:50,394 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:38:50,395 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:38:50,395 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:38:50,395 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:38:50,396 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:38:50,396 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:38:50,396 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:38:50,396 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:38:50,396 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:38:50,396 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:38:50,396 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:38:50,396 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:38:50,396 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:38:50,397 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:38:50,397 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:38:50,397 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:38:50,397 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:38:50,397 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:38:50,397 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:38:50,397 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:38:50,397 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:38:50,397 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:38:50,397 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:38:50,397 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:38:50,397 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:38:50,398 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:38:50,398 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:38:50,398 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:38:50,398 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:38:50,398 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:38:50,398 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:38:50,398 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:38:50,398 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:38:50,398 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:38:50,398 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:38:50,398 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:38:50,399 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:38:50,399 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:38:50,399 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 -> 311cf727219391e066955da60e9a83cfca77eaf7b53c342c6934d47c5123e76f [2025-03-08 05:38:50,653 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:38:50,662 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:38:50,664 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:38:50,667 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:38:50,667 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:38:50,668 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec1_product51.cil.c [2025-03-08 05:38:51,774 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70f3021c0/04907b7fbf4d4cd3936300cebf0d3199/FLAG46f25a00b [2025-03-08 05:38:52,101 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:38:52,102 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product51.cil.c [2025-03-08 05:38:52,119 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70f3021c0/04907b7fbf4d4cd3936300cebf0d3199/FLAG46f25a00b [2025-03-08 05:38:52,370 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70f3021c0/04907b7fbf4d4cd3936300cebf0d3199 [2025-03-08 05:38:52,372 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:38:52,374 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:38:52,375 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:38:52,375 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:38:52,379 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:38:52,380 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:38:52" (1/1) ... [2025-03-08 05:38:52,381 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@496caa94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:52, skipping insertion in model container [2025-03-08 05:38:52,381 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:38:52" (1/1) ... [2025-03-08 05:38:52,405 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:38:52,655 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product51.cil.c[15256,15269] [2025-03-08 05:38:52,669 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:38:52,679 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:38:52,685 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [49] [2025-03-08 05:38:52,686 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [121] [2025-03-08 05:38:52,686 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [343] [2025-03-08 05:38:52,687 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [709] [2025-03-08 05:38:52,687 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [718] [2025-03-08 05:38:52,687 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification1_spec.i","") [756] [2025-03-08 05:38:52,687 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [782] [2025-03-08 05:38:52,687 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [878] [2025-03-08 05:38:52,737 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product51.cil.c[15256,15269] [2025-03-08 05:38:52,751 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:38:52,770 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:38:52,770 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:52 WrapperNode [2025-03-08 05:38:52,770 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:38:52,772 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:38:52,772 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:38:52,772 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:38:52,777 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:52" (1/1) ... [2025-03-08 05:38:52,790 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:52" (1/1) ... [2025-03-08 05:38:52,818 INFO L138 Inliner]: procedures = 56, calls = 100, calls flagged for inlining = 22, calls inlined = 19, statements flattened = 198 [2025-03-08 05:38:52,820 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:38:52,821 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:38:52,821 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:38:52,821 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:38:52,827 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:52" (1/1) ... [2025-03-08 05:38:52,827 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:52" (1/1) ... [2025-03-08 05:38:52,829 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:52" (1/1) ... [2025-03-08 05:38:52,849 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 05:38:52,850 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:52" (1/1) ... [2025-03-08 05:38:52,850 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:52" (1/1) ... [2025-03-08 05:38:52,856 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:52" (1/1) ... [2025-03-08 05:38:52,859 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:52" (1/1) ... [2025-03-08 05:38:52,860 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:52" (1/1) ... [2025-03-08 05:38:52,861 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:52" (1/1) ... [2025-03-08 05:38:52,862 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:38:52,864 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:38:52,866 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:38:52,867 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:38:52,867 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:52" (1/1) ... [2025-03-08 05:38:52,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:38:52,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:38:52,895 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 05:38:52,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 05:38:52,916 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:38:52,916 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2025-03-08 05:38:52,917 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2025-03-08 05:38:52,917 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2025-03-08 05:38:52,917 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2025-03-08 05:38:52,917 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-03-08 05:38:52,917 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-03-08 05:38:52,917 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-03-08 05:38:52,917 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-03-08 05:38:52,917 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__highWaterSensor [2025-03-08 05:38:52,917 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__highWaterSensor [2025-03-08 05:38:52,918 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2025-03-08 05:38:52,918 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2025-03-08 05:38:52,918 INFO L130 BoogieDeclarations]: Found specification of procedure deactivatePump [2025-03-08 05:38:52,918 INFO L138 BoogieDeclarations]: Found implementation of procedure deactivatePump [2025-03-08 05:38:52,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:38:52,918 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2025-03-08 05:38:52,918 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2025-03-08 05:38:52,918 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:38:52,918 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:38:52,969 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:38:52,970 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:38:53,010 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L924: #res := ~retValue_acc~10; [2025-03-08 05:38:53,089 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L979-1: isLowWaterSensorDry_#res#1 := isLowWaterSensorDry_~retValue_acc~13#1; [2025-03-08 05:38:53,090 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L325-1: isLowWaterLevel_#res#1 := isLowWaterLevel_~retValue_acc~3#1; [2025-03-08 05:38:53,090 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L251-1: isPumpRunning_#res#1 := isPumpRunning_~retValue_acc~1#1; [2025-03-08 05:38:53,160 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L753-1: valid_product_#res#1 := valid_product_~retValue_acc~8#1; [2025-03-08 05:38:53,160 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L875-1: main_#res#1 := main_~retValue_acc~9#1; [2025-03-08 05:38:53,188 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L306-1: isHighWaterLevel_#res#1 := isHighWaterLevel_~retValue_acc~2#1; [2025-03-08 05:38:53,188 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L970-1: isHighWaterSensorDry_#res#1 := isHighWaterSensorDry_~retValue_acc~12#1; [2025-03-08 05:38:53,207 INFO L? ?]: Removed 45 outVars from TransFormulas that were not future-live. [2025-03-08 05:38:53,207 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:38:53,215 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:38:53,215 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:38:53,215 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:38:53 BoogieIcfgContainer [2025-03-08 05:38:53,215 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:38:53,217 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:38:53,217 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:38:53,220 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:38:53,220 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:38:52" (1/3) ... [2025-03-08 05:38:53,221 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48a3deed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:38:53, skipping insertion in model container [2025-03-08 05:38:53,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:52" (2/3) ... [2025-03-08 05:38:53,221 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48a3deed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:38:53, skipping insertion in model container [2025-03-08 05:38:53,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:38:53" (3/3) ... [2025-03-08 05:38:53,222 INFO L128 eAbstractionObserver]: Analyzing ICFG minepump_spec1_product51.cil.c [2025-03-08 05:38:53,234 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:38:53,235 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG minepump_spec1_product51.cil.c that has 9 procedures, 90 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-08 05:38:53,274 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:38:53,282 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;@8097b4d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:38:53,283 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:38:53,288 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 67 states have (on average 1.373134328358209) internal successors, (92), 76 states have internal predecessors, (92), 13 states have call successors, (13), 8 states have call predecessors, (13), 8 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-08 05:38:53,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-08 05:38:53,294 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:38:53,294 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:38:53,295 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:38:53,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:38:53,298 INFO L85 PathProgramCache]: Analyzing trace with hash 539006516, now seen corresponding path program 1 times [2025-03-08 05:38:53,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:38:53,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812237131] [2025-03-08 05:38:53,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:38:53,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:38:53,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 05:38:53,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 05:38:53,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:38:53,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:38:53,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:38:53,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:38:53,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812237131] [2025-03-08 05:38:53,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812237131] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:38:53,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:38:53,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:38:53,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685581561] [2025-03-08 05:38:53,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:38:53,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:38:53,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:38:53,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:38:53,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:38:53,499 INFO L87 Difference]: Start difference. First operand has 90 states, 67 states have (on average 1.373134328358209) internal successors, (92), 76 states have internal predecessors, (92), 13 states have call successors, (13), 8 states have call predecessors, (13), 8 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 05:38:53,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:38:53,519 INFO L93 Difference]: Finished difference Result 160 states and 212 transitions. [2025-03-08 05:38:53,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:38:53,520 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2025-03-08 05:38:53,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:38:53,525 INFO L225 Difference]: With dead ends: 160 [2025-03-08 05:38:53,525 INFO L226 Difference]: Without dead ends: 73 [2025-03-08 05:38:53,527 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:38:53,528 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 15 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:38:53,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 175 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:38:53,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-03-08 05:38:53,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2025-03-08 05:38:53,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 55 states have (on average 1.3454545454545455) internal successors, (74), 63 states have internal predecessors, (74), 10 states have call successors, (10), 7 states have call predecessors, (10), 7 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-08 05:38:53,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 94 transitions. [2025-03-08 05:38:53,559 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 94 transitions. Word has length 23 [2025-03-08 05:38:53,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:38:53,559 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 94 transitions. [2025-03-08 05:38:53,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 05:38:53,560 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 94 transitions. [2025-03-08 05:38:53,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-08 05:38:53,561 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:38:53,561 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] [2025-03-08 05:38:53,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 05:38:53,561 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:38:53,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:38:53,562 INFO L85 PathProgramCache]: Analyzing trace with hash -441539538, now seen corresponding path program 1 times [2025-03-08 05:38:53,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:38:53,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638383046] [2025-03-08 05:38:53,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:38:53,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:38:53,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-08 05:38:53,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 05:38:53,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:38:53,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:38:53,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:38:53,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:38:53,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638383046] [2025-03-08 05:38:53,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638383046] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:38:53,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:38:53,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:38:53,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991550237] [2025-03-08 05:38:53,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:38:53,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:38:53,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:38:53,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:38:53,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:38:53,718 INFO L87 Difference]: Start difference. First operand 73 states and 94 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 05:38:53,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:38:53,914 INFO L93 Difference]: Finished difference Result 244 states and 321 transitions. [2025-03-08 05:38:53,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:38:53,916 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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 26 [2025-03-08 05:38:53,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:38:53,917 INFO L225 Difference]: With dead ends: 244 [2025-03-08 05:38:53,917 INFO L226 Difference]: Without dead ends: 178 [2025-03-08 05:38:53,918 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:38:53,919 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 222 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:38:53,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 383 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:38:53,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2025-03-08 05:38:53,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 172. [2025-03-08 05:38:53,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 127 states have (on average 1.3779527559055118) internal successors, (175), 145 states have internal predecessors, (175), 25 states have call successors, (25), 19 states have call predecessors, (25), 19 states have return successors, (26), 17 states have call predecessors, (26), 25 states have call successors, (26) [2025-03-08 05:38:53,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 226 transitions. [2025-03-08 05:38:53,952 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 226 transitions. Word has length 26 [2025-03-08 05:38:53,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:38:53,952 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 226 transitions. [2025-03-08 05:38:53,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 05:38:53,953 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 226 transitions. [2025-03-08 05:38:53,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-08 05:38:53,954 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:38:53,955 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:38:53,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 05:38:53,955 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:38:53,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:38:53,957 INFO L85 PathProgramCache]: Analyzing trace with hash -225645134, now seen corresponding path program 1 times [2025-03-08 05:38:53,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:38:53,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292473406] [2025-03-08 05:38:53,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:38:53,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:38:53,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-08 05:38:53,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-08 05:38:53,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:38:53,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:38:54,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:38:54,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:38:54,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292473406] [2025-03-08 05:38:54,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292473406] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:38:54,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:38:54,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:38:54,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083918619] [2025-03-08 05:38:54,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:38:54,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:38:54,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:38:54,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:38:54,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:38:54,065 INFO L87 Difference]: Start difference. First operand 172 states and 226 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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:38:54,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:38:54,130 INFO L93 Difference]: Finished difference Result 409 states and 553 transitions. [2025-03-08 05:38:54,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:38:54,132 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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 30 [2025-03-08 05:38:54,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:38:54,134 INFO L225 Difference]: With dead ends: 409 [2025-03-08 05:38:54,134 INFO L226 Difference]: Without dead ends: 244 [2025-03-08 05:38:54,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:38:54,135 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 48 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:38:54,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 329 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:38:54,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2025-03-08 05:38:54,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 242. [2025-03-08 05:38:54,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 179 states have (on average 1.324022346368715) internal successors, (237), 196 states have internal predecessors, (237), 32 states have call successors, (32), 30 states have call predecessors, (32), 30 states have return successors, (42), 29 states have call predecessors, (42), 32 states have call successors, (42) [2025-03-08 05:38:54,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 311 transitions. [2025-03-08 05:38:54,158 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 311 transitions. Word has length 30 [2025-03-08 05:38:54,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:38:54,159 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 311 transitions. [2025-03-08 05:38:54,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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:38:54,159 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 311 transitions. [2025-03-08 05:38:54,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-08 05:38:54,159 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:38:54,160 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:38:54,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 05:38:54,160 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:38:54,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:38:54,160 INFO L85 PathProgramCache]: Analyzing trace with hash 777080965, now seen corresponding path program 1 times [2025-03-08 05:38:54,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:38:54,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805200496] [2025-03-08 05:38:54,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:38:54,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:38:54,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-08 05:38:54,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-08 05:38:54,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:38:54,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:38:54,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:38:54,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:38:54,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805200496] [2025-03-08 05:38:54,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805200496] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:38:54,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:38:54,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:38:54,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236946338] [2025-03-08 05:38:54,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:38:54,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:38:54,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:38:54,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:38:54,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:38:54,247 INFO L87 Difference]: Start difference. First operand 242 states and 311 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 05:38:54,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:38:54,274 INFO L93 Difference]: Finished difference Result 483 states and 632 transitions. [2025-03-08 05:38:54,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:38:54,276 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 40 [2025-03-08 05:38:54,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:38:54,280 INFO L225 Difference]: With dead ends: 483 [2025-03-08 05:38:54,280 INFO L226 Difference]: Without dead ends: 248 [2025-03-08 05:38:54,281 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:38:54,282 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 0 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 358 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:38:54,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 358 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:38:54,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2025-03-08 05:38:54,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2025-03-08 05:38:54,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 185 states have (on average 1.3135135135135134) internal successors, (243), 202 states have internal predecessors, (243), 32 states have call successors, (32), 30 states have call predecessors, (32), 30 states have return successors, (42), 29 states have call predecessors, (42), 32 states have call successors, (42) [2025-03-08 05:38:54,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 317 transitions. [2025-03-08 05:38:54,320 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 317 transitions. Word has length 40 [2025-03-08 05:38:54,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:38:54,320 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 317 transitions. [2025-03-08 05:38:54,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 05:38:54,321 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 317 transitions. [2025-03-08 05:38:54,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-08 05:38:54,323 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:38:54,324 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:38:54,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 05:38:54,324 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:38:54,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:38:54,324 INFO L85 PathProgramCache]: Analyzing trace with hash -219991388, now seen corresponding path program 1 times [2025-03-08 05:38:54,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:38:54,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178628306] [2025-03-08 05:38:54,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:38:54,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:38:54,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-08 05:38:54,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-08 05:38:54,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:38:54,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:38:54,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:38:54,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:38:54,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178628306] [2025-03-08 05:38:54,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178628306] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:38:54,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:38:54,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:38:54,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618352646] [2025-03-08 05:38:54,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:38:54,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:38:54,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:38:54,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:38:54,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:38:54,422 INFO L87 Difference]: Start difference. First operand 248 states and 317 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 05:38:54,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:38:54,458 INFO L93 Difference]: Finished difference Result 493 states and 651 transitions. [2025-03-08 05:38:54,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:38:54,460 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 40 [2025-03-08 05:38:54,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:38:54,461 INFO L225 Difference]: With dead ends: 493 [2025-03-08 05:38:54,461 INFO L226 Difference]: Without dead ends: 252 [2025-03-08 05:38:54,462 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:38:54,465 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 0 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 442 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:38:54,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 442 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:38:54,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2025-03-08 05:38:54,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 252. [2025-03-08 05:38:54,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 189 states have (on average 1.306878306878307) internal successors, (247), 206 states have internal predecessors, (247), 32 states have call successors, (32), 30 states have call predecessors, (32), 30 states have return successors, (42), 29 states have call predecessors, (42), 32 states have call successors, (42) [2025-03-08 05:38:54,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 321 transitions. [2025-03-08 05:38:54,497 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 321 transitions. Word has length 40 [2025-03-08 05:38:54,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:38:54,498 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 321 transitions. [2025-03-08 05:38:54,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 05:38:54,498 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 321 transitions. [2025-03-08 05:38:54,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-08 05:38:54,499 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:38:54,499 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:38:54,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 05:38:54,499 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:38:54,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:38:54,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1037639838, now seen corresponding path program 1 times [2025-03-08 05:38:54,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:38:54,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421030096] [2025-03-08 05:38:54,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:38:54,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:38:54,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-08 05:38:54,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-08 05:38:54,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:38:54,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:38:54,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:38:54,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:38:54,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421030096] [2025-03-08 05:38:54,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421030096] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:38:54,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:38:54,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:38:54,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525579266] [2025-03-08 05:38:54,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:38:54,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:38:54,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:38:54,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:38:54,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:38:54,570 INFO L87 Difference]: Start difference. First operand 252 states and 321 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 05:38:54,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:38:54,664 INFO L93 Difference]: Finished difference Result 849 states and 1120 transitions. [2025-03-08 05:38:54,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:38:54,666 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 40 [2025-03-08 05:38:54,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:38:54,668 INFO L225 Difference]: With dead ends: 849 [2025-03-08 05:38:54,668 INFO L226 Difference]: Without dead ends: 604 [2025-03-08 05:38:54,669 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:38:54,670 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 125 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:38:54,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 306 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:38:54,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2025-03-08 05:38:54,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 590. [2025-03-08 05:38:54,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 441 states have (on average 1.2811791383219955) internal successors, (565), 475 states have internal predecessors, (565), 75 states have call successors, (75), 71 states have call predecessors, (75), 73 states have return successors, (118), 71 states have call predecessors, (118), 75 states have call successors, (118) [2025-03-08 05:38:54,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 758 transitions. [2025-03-08 05:38:54,721 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 758 transitions. Word has length 40 [2025-03-08 05:38:54,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:38:54,721 INFO L471 AbstractCegarLoop]: Abstraction has 590 states and 758 transitions. [2025-03-08 05:38:54,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 05:38:54,722 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 758 transitions. [2025-03-08 05:38:54,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-08 05:38:54,723 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:38:54,723 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] [2025-03-08 05:38:54,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 05:38:54,723 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:38:54,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:38:54,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1063234236, now seen corresponding path program 1 times [2025-03-08 05:38:54,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:38:54,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016414366] [2025-03-08 05:38:54,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:38:54,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:38:54,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-08 05:38:54,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-08 05:38:54,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:38:54,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:38:54,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:38:54,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:38:54,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016414366] [2025-03-08 05:38:54,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016414366] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:38:54,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:38:54,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:38:54,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486917434] [2025-03-08 05:38:54,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:38:54,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:38:54,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:38:54,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:38:54,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:38:54,840 INFO L87 Difference]: Start difference. First operand 590 states and 758 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 05:38:54,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:38:54,982 INFO L93 Difference]: Finished difference Result 1728 states and 2292 transitions. [2025-03-08 05:38:54,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:38:54,983 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2025-03-08 05:38:54,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:38:54,993 INFO L225 Difference]: With dead ends: 1728 [2025-03-08 05:38:54,993 INFO L226 Difference]: Without dead ends: 1145 [2025-03-08 05:38:54,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:38:54,998 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 65 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:38:54,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 422 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:38:55,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1145 states. [2025-03-08 05:38:55,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1145 to 1145. [2025-03-08 05:38:55,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1145 states, 848 states have (on average 1.2570754716981132) internal successors, (1066), 915 states have internal predecessors, (1066), 150 states have call successors, (150), 142 states have call predecessors, (150), 146 states have return successors, (249), 142 states have call predecessors, (249), 150 states have call successors, (249) [2025-03-08 05:38:55,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1145 states to 1145 states and 1465 transitions. [2025-03-08 05:38:55,103 INFO L78 Accepts]: Start accepts. Automaton has 1145 states and 1465 transitions. Word has length 44 [2025-03-08 05:38:55,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:38:55,104 INFO L471 AbstractCegarLoop]: Abstraction has 1145 states and 1465 transitions. [2025-03-08 05:38:55,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 05:38:55,104 INFO L276 IsEmpty]: Start isEmpty. Operand 1145 states and 1465 transitions. [2025-03-08 05:38:55,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-08 05:38:55,105 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:38:55,105 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:38:55,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 05:38:55,107 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:38:55,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:38:55,107 INFO L85 PathProgramCache]: Analyzing trace with hash 351619493, now seen corresponding path program 1 times [2025-03-08 05:38:55,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:38:55,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973895583] [2025-03-08 05:38:55,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:38:55,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:38:55,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-08 05:38:55,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-08 05:38:55,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:38:55,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 05:38:55,122 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 05:38:55,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-08 05:38:55,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-08 05:38:55,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:38:55,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 05:38:55,149 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 05:38:55,151 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 05:38:55,152 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 05:38:55,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 05:38:55,156 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:38:55,193 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 05:38:55,195 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 05:38:55 BoogieIcfgContainer [2025-03-08 05:38:55,195 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 05:38:55,195 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 05:38:55,195 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 05:38:55,196 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 05:38:55,196 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:38:53" (3/4) ... [2025-03-08 05:38:55,197 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-08 05:38:55,257 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 42. [2025-03-08 05:38:55,317 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 05:38:55,317 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 05:38:55,317 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 05:38:55,318 INFO L158 Benchmark]: Toolchain (without parser) took 2944.35ms. Allocated memory is still 142.6MB. Free memory was 112.3MB in the beginning and 78.9MB in the end (delta: 33.4MB). Peak memory consumption was 35.2MB. Max. memory is 16.1GB. [2025-03-08 05:38:55,318 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 05:38:55,318 INFO L158 Benchmark]: CACSL2BoogieTranslator took 396.57ms. Allocated memory is still 142.6MB. Free memory was 112.3MB in the beginning and 93.7MB in the end (delta: 18.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 05:38:55,318 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.57ms. Allocated memory is still 142.6MB. Free memory was 93.7MB in the beginning and 92.4MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 05:38:55,318 INFO L158 Benchmark]: Boogie Preprocessor took 42.70ms. Allocated memory is still 142.6MB. Free memory was 92.4MB in the beginning and 90.4MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 05:38:55,319 INFO L158 Benchmark]: IcfgBuilder took 350.64ms. Allocated memory is still 142.6MB. Free memory was 90.4MB in the beginning and 71.6MB in the end (delta: 18.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 05:38:55,319 INFO L158 Benchmark]: TraceAbstraction took 1978.17ms. Allocated memory is still 142.6MB. Free memory was 71.6MB in the beginning and 88.4MB in the end (delta: -16.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 05:38:55,319 INFO L158 Benchmark]: Witness Printer took 122.02ms. Allocated memory is still 142.6MB. Free memory was 88.4MB in the beginning and 78.9MB in the end (delta: 9.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 05:38:55,320 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.25ms. Allocated memory is still 201.3MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 396.57ms. Allocated memory is still 142.6MB. Free memory was 112.3MB in the beginning and 93.7MB in the end (delta: 18.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.57ms. Allocated memory is still 142.6MB. Free memory was 93.7MB in the beginning and 92.4MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.70ms. Allocated memory is still 142.6MB. Free memory was 92.4MB in the beginning and 90.4MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 350.64ms. Allocated memory is still 142.6MB. Free memory was 90.4MB in the beginning and 71.6MB in the end (delta: 18.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1978.17ms. Allocated memory is still 142.6MB. Free memory was 71.6MB in the beginning and 88.4MB in the end (delta: -16.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 122.02ms. Allocated memory is still 142.6MB. Free memory was 88.4MB in the beginning and 78.9MB in the end (delta: 9.5MB). 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,"scenario.i","") [49] - GenericResultAtLocation [Line: 121]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [121] - GenericResultAtLocation [Line: 343]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [343] - GenericResultAtLocation [Line: 709]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [709] - GenericResultAtLocation [Line: 718]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [718] - GenericResultAtLocation [Line: 756]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification1_spec.i","") [756] - GenericResultAtLocation [Line: 782]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [782] - GenericResultAtLocation [Line: 878]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [878] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 714]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L131] int pumpRunning = 0; [L132] int systemActive = 1; [L513] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L783] int cleanupTimeShifts = 4; [L880] int waterLevel = 1; [L881] int methaneLevelCritical = 0; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L856] int retValue_acc ; [L857] int tmp ; [L861] FCALL select_helpers() [L862] FCALL select_features() [L863] CALL, EXPR valid_product() [L748] int retValue_acc ; [L751] retValue_acc = 1 [L752] return (retValue_acc); VAL [\result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L863] RET, EXPR valid_product() [L863] tmp = valid_product() [L865] COND TRUE \read(tmp) [L867] FCALL setup() [L868] CALL runTest() [L850] CALL test() [L56] int splverifierCounter ; [L57] int tmp ; [L58] int tmp___0 ; [L59] int tmp___1 ; [L60] int tmp___2 ; [L63] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L67] COND TRUE splverifierCounter < 4 [L73] tmp = __VERIFIER_nondet_int() [L75] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L77] CALL waterRise() VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L898] COND TRUE waterLevel < 2 [L899] waterLevel = waterLevel + 1 VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L77] RET waterRise() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L83] tmp___0 = __VERIFIER_nondet_int() [L85] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L87] CALL changeMethaneLevel() VAL [\old(methaneLevelCritical)=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L910] COND FALSE !(\read(methaneLevelCritical)) [L913] methaneLevelCritical = 1 VAL [\old(methaneLevelCritical)=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L87] RET changeMethaneLevel() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L93] tmp___2 = __VERIFIER_nondet_int() [L95] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L110] CALL timeShift() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L139] COND FALSE !(\read(pumpRunning)) VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L146] COND TRUE \read(systemActive) [L148] CALL processEnvironment() [L194] int tmp ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L197] COND FALSE !(\read(pumpRunning)) VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L212] CALL processEnvironment__wrappee__highWaterSensor() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L168] int tmp ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L171] COND TRUE ! pumpRunning [L173] CALL, EXPR isHighWaterLevel() [L291] int retValue_acc ; [L292] int tmp ; [L293] int tmp___0 ; [L297] CALL, EXPR isHighWaterSensorDry() [L960] int retValue_acc ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L963] COND FALSE !(waterLevel < 2) [L967] retValue_acc = 0 [L968] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L297] RET, EXPR isHighWaterSensorDry() [L297] tmp = isHighWaterSensorDry() [L299] COND FALSE !(\read(tmp)) [L302] tmp___0 = 1 VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, tmp___0=1, waterLevel=2] [L304] retValue_acc = tmp___0 [L305] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L173] RET, EXPR isHighWaterLevel() [L173] tmp = isHighWaterLevel() [L175] COND TRUE \read(tmp) [L177] CALL activatePump() [L222] pumpRunning = 1 VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L177] RET activatePump() [L212] RET processEnvironment__wrappee__highWaterSensor() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L148] RET processEnvironment() [L154] CALL __utac_acc__Specification1_spec__1() [L758] int tmp ; [L759] int tmp___0 ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L763] CALL, EXPR isMethaneLevelCritical() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L919] int retValue_acc ; [L922] retValue_acc = methaneLevelCritical [L923] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L763] RET, EXPR isMethaneLevelCritical() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L763] tmp = isMethaneLevelCritical() [L765] COND TRUE \read(tmp) [L767] CALL, EXPR isPumpRunning() [L246] int retValue_acc ; [L249] retValue_acc = pumpRunning [L250] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L767] RET, EXPR isPumpRunning() [L767] tmp___0 = isPumpRunning() [L769] COND TRUE \read(tmp___0) [L771] CALL __automaton_fail() [L714] reach_error() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 90 locations, 131 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.9s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 480 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 475 mSDsluCounter, 2415 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1690 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 256 IncrementalHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 725 mSDtfsCounter, 256 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1145occurred in iteration=7, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 7 MinimizatonAttempts, 22 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 291 NumberOfCodeBlocks, 291 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 236 ConstructedInterpolants, 0 QuantifiedInterpolants, 450 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-03-08 05:38:55,339 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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE