./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec1_product56.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.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_product56.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a24146f0f51336ad73890bbd928f5403b02b7d1c9a9c70cce136ffcb124619cc --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 07:52:06,857 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 07:52:06,947 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 07:52:06,951 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 07:52:06,952 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 07:52:06,977 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 07:52:06,977 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 07:52:06,978 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 07:52:06,978 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 07:52:06,979 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 07:52:06,979 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 07:52:06,980 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 07:52:06,980 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 07:52:06,980 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 07:52:06,981 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 07:52:06,981 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 07:52:06,981 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 07:52:06,982 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 07:52:06,982 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 07:52:06,985 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 07:52:06,985 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 07:52:06,988 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 07:52:06,988 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 07:52:06,988 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 07:52:06,989 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 07:52:06,989 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 07:52:06,989 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 07:52:06,989 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 07:52:06,989 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 07:52:06,990 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 07:52:06,990 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 07:52:06,990 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 07:52:06,990 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 07:52:06,991 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 07:52:06,991 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 07:52:06,991 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 07:52:06,991 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 07:52:06,992 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 07:52:06,992 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 07:52:06,992 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 07:52:06,992 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 07:52:06,993 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 07:52:06,994 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> a24146f0f51336ad73890bbd928f5403b02b7d1c9a9c70cce136ffcb124619cc [2024-11-16 07:52:07,246 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 07:52:07,269 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 07:52:07,273 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 07:52:07,274 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 07:52:07,275 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 07:52:07,276 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec1_product56.cil.c [2024-11-16 07:52:08,689 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 07:52:08,966 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 07:52:08,967 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product56.cil.c [2024-11-16 07:52:08,989 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c3e93e00/65f09a2bb37147ffb23b70b2485fbc15/FLAGd8e4aa718 [2024-11-16 07:52:09,005 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c3e93e00/65f09a2bb37147ffb23b70b2485fbc15 [2024-11-16 07:52:09,009 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 07:52:09,010 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 07:52:09,012 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 07:52:09,013 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 07:52:09,018 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 07:52:09,019 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 07:52:09" (1/1) ... [2024-11-16 07:52:09,020 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c879384 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:52:09, skipping insertion in model container [2024-11-16 07:52:09,020 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 07:52:09" (1/1) ... [2024-11-16 07:52:09,068 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 07:52:09,347 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_product56.cil.c[16679,16692] [2024-11-16 07:52:09,361 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 07:52:09,373 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 07:52:09,384 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [49] [2024-11-16 07:52:09,385 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [415] [2024-11-16 07:52:09,386 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [490] [2024-11-16 07:52:09,386 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [746] [2024-11-16 07:52:09,386 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification1_spec.i","") [784] [2024-11-16 07:52:09,386 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [811] [2024-11-16 07:52:09,387 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [820] [2024-11-16 07:52:09,387 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [916] [2024-11-16 07:52:09,477 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_product56.cil.c[16679,16692] [2024-11-16 07:52:09,488 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 07:52:09,511 INFO L204 MainTranslator]: Completed translation [2024-11-16 07:52:09,511 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:52:09 WrapperNode [2024-11-16 07:52:09,511 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 07:52:09,512 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 07:52:09,513 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 07:52:09,513 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 07:52:09,520 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:52:09" (1/1) ... [2024-11-16 07:52:09,537 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:52:09" (1/1) ... [2024-11-16 07:52:09,573 INFO L138 Inliner]: procedures = 58, calls = 105, calls flagged for inlining = 24, calls inlined = 21, statements flattened = 223 [2024-11-16 07:52:09,575 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 07:52:09,576 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 07:52:09,577 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 07:52:09,577 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 07:52:09,587 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:52:09" (1/1) ... [2024-11-16 07:52:09,588 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:52:09" (1/1) ... [2024-11-16 07:52:09,590 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:52:09" (1/1) ... [2024-11-16 07:52:09,610 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]. [2024-11-16 07:52:09,611 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:52:09" (1/1) ... [2024-11-16 07:52:09,611 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:52:09" (1/1) ... [2024-11-16 07:52:09,615 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:52:09" (1/1) ... [2024-11-16 07:52:09,616 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:52:09" (1/1) ... [2024-11-16 07:52:09,617 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:52:09" (1/1) ... [2024-11-16 07:52:09,618 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:52:09" (1/1) ... [2024-11-16 07:52:09,620 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 07:52:09,627 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 07:52:09,627 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 07:52:09,627 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 07:52:09,628 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:52:09" (1/1) ... [2024-11-16 07:52:09,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 07:52:09,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 07:52:09,670 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) [2024-11-16 07:52:09,676 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 [2024-11-16 07:52:09,733 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 07:52:09,734 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2024-11-16 07:52:09,734 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2024-11-16 07:52:09,734 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2024-11-16 07:52:09,734 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2024-11-16 07:52:09,735 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-11-16 07:52:09,735 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-11-16 07:52:09,735 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-11-16 07:52:09,735 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-11-16 07:52:09,735 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__highWaterSensor [2024-11-16 07:52:09,735 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__highWaterSensor [2024-11-16 07:52:09,736 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2024-11-16 07:52:09,736 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2024-11-16 07:52:09,736 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__lowWaterSensor [2024-11-16 07:52:09,736 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__lowWaterSensor [2024-11-16 07:52:09,736 INFO L130 BoogieDeclarations]: Found specification of procedure deactivatePump [2024-11-16 07:52:09,736 INFO L138 BoogieDeclarations]: Found implementation of procedure deactivatePump [2024-11-16 07:52:09,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 07:52:09,736 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2024-11-16 07:52:09,736 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2024-11-16 07:52:09,737 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 07:52:09,737 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 07:52:09,818 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 07:52:09,820 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 07:52:09,876 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L962: #res := ~retValue_acc~10; [2024-11-16 07:52:09,952 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L637-1: isMethaneAlarm_#res#1 := isMethaneAlarm_~retValue_acc~3#1; [2024-11-16 07:52:09,953 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L646-1: isPumpRunning_#res#1 := isPumpRunning_~retValue_acc~4#1; [2024-11-16 07:52:10,067 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L913-1: main_#res#1 := main_~retValue_acc~9#1; [2024-11-16 07:52:10,068 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L781-1: valid_product_#res#1 := valid_product_~retValue_acc~8#1; [2024-11-16 07:52:10,115 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L701-1: isHighWaterLevel_#res#1 := isHighWaterLevel_~retValue_acc~5#1; [2024-11-16 07:52:10,115 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L1008-1: isHighWaterSensorDry_#res#1 := isHighWaterSensorDry_~retValue_acc~12#1; [2024-11-16 07:52:10,143 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L1017-1: isLowWaterSensorDry_#res#1 := isLowWaterSensorDry_~retValue_acc~13#1; [2024-11-16 07:52:10,143 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L720-1: isLowWaterLevel_#res#1 := isLowWaterLevel_~retValue_acc~6#1; [2024-11-16 07:52:10,174 INFO L? ?]: Removed 49 outVars from TransFormulas that were not future-live. [2024-11-16 07:52:10,175 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 07:52:10,191 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 07:52:10,191 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 07:52:10,191 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 07:52:10 BoogieIcfgContainer [2024-11-16 07:52:10,191 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 07:52:10,193 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 07:52:10,193 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 07:52:10,196 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 07:52:10,196 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 07:52:09" (1/3) ... [2024-11-16 07:52:10,197 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72a3e499 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 07:52:10, skipping insertion in model container [2024-11-16 07:52:10,197 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:52:09" (2/3) ... [2024-11-16 07:52:10,197 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72a3e499 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 07:52:10, skipping insertion in model container [2024-11-16 07:52:10,197 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 07:52:10" (3/3) ... [2024-11-16 07:52:10,198 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec1_product56.cil.c [2024-11-16 07:52:10,216 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 07:52:10,216 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 07:52:10,281 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 07:52:10,287 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;@75f3257d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 07:52:10,288 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 07:52:10,300 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 83 states have (on average 1.3493975903614457) internal successors, (112), 94 states have internal predecessors, (112), 17 states have call successors, (17), 9 states have call predecessors, (17), 9 states have return successors, (17), 12 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-16 07:52:10,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-16 07:52:10,309 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:52:10,310 INFO L215 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] [2024-11-16 07:52:10,310 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:52:10,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:52:10,315 INFO L85 PathProgramCache]: Analyzing trace with hash -413808755, now seen corresponding path program 1 times [2024-11-16 07:52:10,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:52:10,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927282316] [2024-11-16 07:52:10,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:52:10,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:52:10,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:52:10,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-16 07:52:10,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:52:10,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 07:52:10,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:52:10,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927282316] [2024-11-16 07:52:10,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927282316] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:52:10,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:52:10,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 07:52:10,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515911436] [2024-11-16 07:52:10,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:52:10,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 07:52:10,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:52:10,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 07:52:10,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 07:52:10,552 INFO L87 Difference]: Start difference. First operand has 111 states, 83 states have (on average 1.3493975903614457) internal successors, (112), 94 states have internal predecessors, (112), 17 states have call successors, (17), 9 states have call predecessors, (17), 9 states have return successors, (17), 12 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 07:52:10,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:52:10,588 INFO L93 Difference]: Finished difference Result 213 states and 286 transitions. [2024-11-16 07:52:10,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 07:52:10,590 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2024-11-16 07:52:10,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:52:10,597 INFO L225 Difference]: With dead ends: 213 [2024-11-16 07:52:10,598 INFO L226 Difference]: Without dead ends: 100 [2024-11-16 07:52:10,601 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 07:52:10,604 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 07:52:10,604 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 07:52:10,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-16 07:52:10,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-11-16 07:52:10,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 74 states have (on average 1.2972972972972974) internal successors, (96), 84 states have internal predecessors, (96), 17 states have call successors, (17), 9 states have call predecessors, (17), 8 states have return successors, (16), 11 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-16 07:52:10,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 129 transitions. [2024-11-16 07:52:10,648 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 129 transitions. Word has length 25 [2024-11-16 07:52:10,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:52:10,649 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 129 transitions. [2024-11-16 07:52:10,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 07:52:10,650 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 129 transitions. [2024-11-16 07:52:10,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-16 07:52:10,652 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:52:10,653 INFO L215 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] [2024-11-16 07:52:10,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 07:52:10,654 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:52:10,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:52:10,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1502195066, now seen corresponding path program 1 times [2024-11-16 07:52:10,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:52:10,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909600265] [2024-11-16 07:52:10,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:52:10,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:52:10,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:52:10,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 07:52:10,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:52:10,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 07:52:10,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:52:10,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909600265] [2024-11-16 07:52:10,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909600265] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:52:10,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:52:10,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 07:52:10,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758822621] [2024-11-16 07:52:10,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:52:10,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 07:52:10,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:52:10,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 07:52:10,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 07:52:10,802 INFO L87 Difference]: Start difference. First operand 100 states and 129 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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) [2024-11-16 07:52:10,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:52:10,822 INFO L93 Difference]: Finished difference Result 158 states and 204 transitions. [2024-11-16 07:52:10,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 07:52:10,823 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 28 [2024-11-16 07:52:10,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:52:10,825 INFO L225 Difference]: With dead ends: 158 [2024-11-16 07:52:10,827 INFO L226 Difference]: Without dead ends: 89 [2024-11-16 07:52:10,828 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 07:52:10,829 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 16 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 205 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 [2024-11-16 07:52:10,829 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 205 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 07:52:10,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-16 07:52:10,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-16 07:52:10,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 66 states have (on average 1.3181818181818181) internal successors, (87), 76 states have internal predecessors, (87), 14 states have call successors, (14), 8 states have call predecessors, (14), 8 states have return successors, (14), 9 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-16 07:52:10,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 115 transitions. [2024-11-16 07:52:10,849 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 115 transitions. Word has length 28 [2024-11-16 07:52:10,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:52:10,849 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 115 transitions. [2024-11-16 07:52:10,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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) [2024-11-16 07:52:10,850 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 115 transitions. [2024-11-16 07:52:10,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-16 07:52:10,851 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:52:10,851 INFO L215 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] [2024-11-16 07:52:10,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 07:52:10,852 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:52:10,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:52:10,853 INFO L85 PathProgramCache]: Analyzing trace with hash -577385385, now seen corresponding path program 1 times [2024-11-16 07:52:10,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:52:10,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148570171] [2024-11-16 07:52:10,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:52:10,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:52:10,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:52:10,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-16 07:52:10,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:52:10,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 07:52:10,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:52:10,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148570171] [2024-11-16 07:52:10,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148570171] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:52:10,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:52:10,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 07:52:10,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329361274] [2024-11-16 07:52:10,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:52:10,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 07:52:10,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:52:10,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 07:52:10,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 07:52:10,961 INFO L87 Difference]: Start difference. First operand 89 states and 115 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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) [2024-11-16 07:52:11,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:52:11,003 INFO L93 Difference]: Finished difference Result 251 states and 330 transitions. [2024-11-16 07:52:11,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 07:52:11,004 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 31 [2024-11-16 07:52:11,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:52:11,006 INFO L225 Difference]: With dead ends: 251 [2024-11-16 07:52:11,007 INFO L226 Difference]: Without dead ends: 169 [2024-11-16 07:52:11,007 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 07:52:11,009 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 107 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 07:52:11,009 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 232 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 07:52:11,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-16 07:52:11,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 165. [2024-11-16 07:52:11,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 120 states have (on average 1.3416666666666666) internal successors, (161), 139 states have internal predecessors, (161), 28 states have call successors, (28), 16 states have call predecessors, (28), 16 states have return successors, (28), 17 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-16 07:52:11,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 217 transitions. [2024-11-16 07:52:11,040 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 217 transitions. Word has length 31 [2024-11-16 07:52:11,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:52:11,040 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 217 transitions. [2024-11-16 07:52:11,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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) [2024-11-16 07:52:11,044 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 217 transitions. [2024-11-16 07:52:11,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-16 07:52:11,045 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:52:11,046 INFO L215 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] [2024-11-16 07:52:11,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 07:52:11,046 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:52:11,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:52:11,047 INFO L85 PathProgramCache]: Analyzing trace with hash 2122661214, now seen corresponding path program 1 times [2024-11-16 07:52:11,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:52:11,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326216336] [2024-11-16 07:52:11,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:52:11,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:52:11,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:52:11,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 07:52:11,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:52:11,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 07:52:11,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:52:11,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326216336] [2024-11-16 07:52:11,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326216336] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:52:11,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:52:11,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 07:52:11,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677590912] [2024-11-16 07:52:11,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:52:11,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 07:52:11,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:52:11,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 07:52:11,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 07:52:11,215 INFO L87 Difference]: Start difference. First operand 165 states and 217 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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) [2024-11-16 07:52:11,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:52:11,319 INFO L93 Difference]: Finished difference Result 416 states and 563 transitions. [2024-11-16 07:52:11,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 07:52:11,320 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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 34 [2024-11-16 07:52:11,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:52:11,323 INFO L225 Difference]: With dead ends: 416 [2024-11-16 07:52:11,327 INFO L226 Difference]: Without dead ends: 258 [2024-11-16 07:52:11,329 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-16 07:52:11,329 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 56 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 07:52:11,330 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 413 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 07:52:11,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-11-16 07:52:11,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 257. [2024-11-16 07:52:11,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 190 states have (on average 1.2947368421052632) internal successors, (246), 207 states have internal predecessors, (246), 36 states have call successors, (36), 30 states have call predecessors, (36), 30 states have return successors, (48), 31 states have call predecessors, (48), 36 states have call successors, (48) [2024-11-16 07:52:11,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 330 transitions. [2024-11-16 07:52:11,380 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 330 transitions. Word has length 34 [2024-11-16 07:52:11,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:52:11,381 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 330 transitions. [2024-11-16 07:52:11,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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) [2024-11-16 07:52:11,382 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 330 transitions. [2024-11-16 07:52:11,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-16 07:52:11,383 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:52:11,384 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:52:11,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 07:52:11,384 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:52:11,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:52:11,385 INFO L85 PathProgramCache]: Analyzing trace with hash -2063383769, now seen corresponding path program 1 times [2024-11-16 07:52:11,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:52:11,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190293281] [2024-11-16 07:52:11,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:52:11,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:52:11,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:52:11,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-16 07:52:11,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:52:11,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:52:11,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:52:11,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 07:52:11,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:52:11,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 07:52:11,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:52:11,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190293281] [2024-11-16 07:52:11,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190293281] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:52:11,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:52:11,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 07:52:11,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15450250] [2024-11-16 07:52:11,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:52:11,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 07:52:11,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:52:11,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 07:52:11,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 07:52:11,562 INFO L87 Difference]: Start difference. First operand 257 states and 330 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-16 07:52:11,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:52:11,774 INFO L93 Difference]: Finished difference Result 568 states and 737 transitions. [2024-11-16 07:52:11,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 07:52:11,776 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 50 [2024-11-16 07:52:11,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:52:11,781 INFO L225 Difference]: With dead ends: 568 [2024-11-16 07:52:11,781 INFO L226 Difference]: Without dead ends: 318 [2024-11-16 07:52:11,782 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-16 07:52:11,783 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 60 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 07:52:11,784 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 405 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 07:52:11,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2024-11-16 07:52:11,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 315. [2024-11-16 07:52:11,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 234 states have (on average 1.264957264957265) internal successors, (296), 251 states have internal predecessors, (296), 40 states have call successors, (40), 30 states have call predecessors, (40), 40 states have return successors, (62), 43 states have call predecessors, (62), 40 states have call successors, (62) [2024-11-16 07:52:11,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 398 transitions. [2024-11-16 07:52:11,841 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 398 transitions. Word has length 50 [2024-11-16 07:52:11,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:52:11,842 INFO L471 AbstractCegarLoop]: Abstraction has 315 states and 398 transitions. [2024-11-16 07:52:11,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-16 07:52:11,842 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 398 transitions. [2024-11-16 07:52:11,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-16 07:52:11,844 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:52:11,844 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:52:11,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 07:52:11,844 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:52:11,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:52:11,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1852032856, now seen corresponding path program 1 times [2024-11-16 07:52:11,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:52:11,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515027960] [2024-11-16 07:52:11,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:52:11,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:52:11,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:52:11,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-16 07:52:11,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:52:12,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:52:12,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:52:12,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 07:52:12,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:52:12,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 07:52:12,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:52:12,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515027960] [2024-11-16 07:52:12,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515027960] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:52:12,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:52:12,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 07:52:12,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429161590] [2024-11-16 07:52:12,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:52:12,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 07:52:12,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:52:12,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 07:52:12,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 07:52:12,044 INFO L87 Difference]: Start difference. First operand 315 states and 398 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-16 07:52:12,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:52:12,317 INFO L93 Difference]: Finished difference Result 638 states and 827 transitions. [2024-11-16 07:52:12,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 07:52:12,319 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 50 [2024-11-16 07:52:12,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:52:12,321 INFO L225 Difference]: With dead ends: 638 [2024-11-16 07:52:12,323 INFO L226 Difference]: Without dead ends: 330 [2024-11-16 07:52:12,324 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-16 07:52:12,325 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 198 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 07:52:12,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 450 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 07:52:12,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2024-11-16 07:52:12,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 319. [2024-11-16 07:52:12,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 238 states have (on average 1.2605042016806722) internal successors, (300), 255 states have internal predecessors, (300), 40 states have call successors, (40), 30 states have call predecessors, (40), 40 states have return successors, (62), 43 states have call predecessors, (62), 40 states have call successors, (62) [2024-11-16 07:52:12,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 402 transitions. [2024-11-16 07:52:12,364 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 402 transitions. Word has length 50 [2024-11-16 07:52:12,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:52:12,364 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 402 transitions. [2024-11-16 07:52:12,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-16 07:52:12,364 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 402 transitions. [2024-11-16 07:52:12,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-16 07:52:12,365 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:52:12,366 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:52:12,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 07:52:12,366 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:52:12,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:52:12,367 INFO L85 PathProgramCache]: Analyzing trace with hash 637496106, now seen corresponding path program 1 times [2024-11-16 07:52:12,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:52:12,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867710952] [2024-11-16 07:52:12,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:52:12,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:52:12,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:52:12,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-16 07:52:12,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:52:12,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:52:12,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:52:12,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 07:52:12,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:52:12,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 07:52:12,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:52:12,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867710952] [2024-11-16 07:52:12,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867710952] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:52:12,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:52:12,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 07:52:12,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304085847] [2024-11-16 07:52:12,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:52:12,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 07:52:12,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:52:12,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 07:52:12,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 07:52:12,454 INFO L87 Difference]: Start difference. First operand 319 states and 402 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-16 07:52:12,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:52:12,704 INFO L93 Difference]: Finished difference Result 909 states and 1190 transitions. [2024-11-16 07:52:12,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 07:52:12,705 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 50 [2024-11-16 07:52:12,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:52:12,709 INFO L225 Difference]: With dead ends: 909 [2024-11-16 07:52:12,709 INFO L226 Difference]: Without dead ends: 597 [2024-11-16 07:52:12,710 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-16 07:52:12,715 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 234 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 07:52:12,715 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 339 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 07:52:12,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2024-11-16 07:52:12,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 589. [2024-11-16 07:52:12,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 440 states have (on average 1.2295454545454545) internal successors, (541), 466 states have internal predecessors, (541), 75 states have call successors, (75), 67 states have call predecessors, (75), 73 states have return successors, (127), 76 states have call predecessors, (127), 75 states have call successors, (127) [2024-11-16 07:52:12,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 743 transitions. [2024-11-16 07:52:12,772 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 743 transitions. Word has length 50 [2024-11-16 07:52:12,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:52:12,773 INFO L471 AbstractCegarLoop]: Abstraction has 589 states and 743 transitions. [2024-11-16 07:52:12,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-16 07:52:12,773 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 743 transitions. [2024-11-16 07:52:12,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-16 07:52:12,774 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:52:12,774 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:52:12,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 07:52:12,775 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:52:12,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:52:12,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1407448520, now seen corresponding path program 1 times [2024-11-16 07:52:12,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:52:12,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426481301] [2024-11-16 07:52:12,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:52:12,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:52:12,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:52:12,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 07:52:12,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:52:12,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-16 07:52:12,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:52:12,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:52:12,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:52:12,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 07:52:12,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:52:12,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 07:52:12,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:52:12,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426481301] [2024-11-16 07:52:12,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426481301] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:52:12,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:52:12,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 07:52:12,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878955104] [2024-11-16 07:52:12,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:52:12,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 07:52:12,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:52:12,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 07:52:12,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-16 07:52:12,947 INFO L87 Difference]: Start difference. First operand 589 states and 743 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-16 07:52:13,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:52:13,589 INFO L93 Difference]: Finished difference Result 1963 states and 2569 transitions. [2024-11-16 07:52:13,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-16 07:52:13,590 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 54 [2024-11-16 07:52:13,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:52:13,598 INFO L225 Difference]: With dead ends: 1963 [2024-11-16 07:52:13,599 INFO L226 Difference]: Without dead ends: 1381 [2024-11-16 07:52:13,601 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2024-11-16 07:52:13,602 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 333 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 07:52:13,603 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 386 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 07:52:13,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1381 states. [2024-11-16 07:52:13,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1381 to 1336. [2024-11-16 07:52:13,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1336 states, 987 states have (on average 1.2006079027355623) internal successors, (1185), 1054 states have internal predecessors, (1185), 182 states have call successors, (182), 134 states have call predecessors, (182), 166 states have return successors, (340), 188 states have call predecessors, (340), 182 states have call successors, (340) [2024-11-16 07:52:13,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1336 states to 1336 states and 1707 transitions. [2024-11-16 07:52:13,745 INFO L78 Accepts]: Start accepts. Automaton has 1336 states and 1707 transitions. Word has length 54 [2024-11-16 07:52:13,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:52:13,745 INFO L471 AbstractCegarLoop]: Abstraction has 1336 states and 1707 transitions. [2024-11-16 07:52:13,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-16 07:52:13,746 INFO L276 IsEmpty]: Start isEmpty. Operand 1336 states and 1707 transitions. [2024-11-16 07:52:13,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-16 07:52:13,748 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:52:13,748 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:52:13,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 07:52:13,748 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:52:13,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:52:13,749 INFO L85 PathProgramCache]: Analyzing trace with hash 2139608583, now seen corresponding path program 1 times [2024-11-16 07:52:13,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:52:13,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838798176] [2024-11-16 07:52:13,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:52:13,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:52:13,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 07:52:13,770 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 07:52:13,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 07:52:13,814 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 07:52:13,814 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 07:52:13,815 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 07:52:13,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 07:52:13,823 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:52:13,885 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 07:52:13,891 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 07:52:13 BoogieIcfgContainer [2024-11-16 07:52:13,892 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 07:52:13,892 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 07:52:13,892 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 07:52:13,892 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 07:52:13,893 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 07:52:10" (3/4) ... [2024-11-16 07:52:13,894 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-16 07:52:13,963 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-16 07:52:13,966 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 07:52:13,967 INFO L158 Benchmark]: Toolchain (without parser) took 4956.43ms. Allocated memory was 169.9MB in the beginning and 222.3MB in the end (delta: 52.4MB). Free memory was 110.2MB in the beginning and 160.1MB in the end (delta: -49.9MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. [2024-11-16 07:52:13,967 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 169.9MB. Free memory is still 131.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 07:52:13,968 INFO L158 Benchmark]: CACSL2BoogieTranslator took 500.23ms. Allocated memory is still 169.9MB. Free memory was 110.0MB in the beginning and 88.0MB in the end (delta: 22.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-16 07:52:13,968 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.95ms. Allocated memory is still 169.9MB. Free memory was 88.0MB in the beginning and 85.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 07:52:13,968 INFO L158 Benchmark]: Boogie Preprocessor took 50.01ms. Allocated memory is still 169.9MB. Free memory was 85.6MB in the beginning and 83.3MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 07:52:13,969 INFO L158 Benchmark]: IcfgBuilder took 564.31ms. Allocated memory was 169.9MB in the beginning and 222.3MB in the end (delta: 52.4MB). Free memory was 83.3MB in the beginning and 186.1MB in the end (delta: -102.7MB). Peak memory consumption was 24.6MB. Max. memory is 16.1GB. [2024-11-16 07:52:13,969 INFO L158 Benchmark]: TraceAbstraction took 3698.25ms. Allocated memory is still 222.3MB. Free memory was 185.0MB in the beginning and 165.3MB in the end (delta: 19.7MB). Peak memory consumption was 18.6MB. Max. memory is 16.1GB. [2024-11-16 07:52:13,969 INFO L158 Benchmark]: Witness Printer took 74.16ms. Allocated memory is still 222.3MB. Free memory was 165.3MB in the beginning and 160.1MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-16 07:52:13,971 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.20ms. Allocated memory is still 169.9MB. Free memory is still 131.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 500.23ms. Allocated memory is still 169.9MB. Free memory was 110.0MB in the beginning and 88.0MB in the end (delta: 22.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.95ms. Allocated memory is still 169.9MB. Free memory was 88.0MB in the beginning and 85.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.01ms. Allocated memory is still 169.9MB. Free memory was 85.6MB in the beginning and 83.3MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 564.31ms. Allocated memory was 169.9MB in the beginning and 222.3MB in the end (delta: 52.4MB). Free memory was 83.3MB in the beginning and 186.1MB in the end (delta: -102.7MB). Peak memory consumption was 24.6MB. Max. memory is 16.1GB. * TraceAbstraction took 3698.25ms. Allocated memory is still 222.3MB. Free memory was 185.0MB in the beginning and 165.3MB in the end (delta: 19.7MB). Peak memory consumption was 18.6MB. Max. memory is 16.1GB. * Witness Printer took 74.16ms. Allocated memory is still 222.3MB. Free memory was 165.3MB in the beginning and 160.1MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 49]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [49] - GenericResultAtLocation [Line: 415]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [415] - GenericResultAtLocation [Line: 490]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [490] - GenericResultAtLocation [Line: 746]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [746] - GenericResultAtLocation [Line: 784]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification1_spec.i","") [784] - GenericResultAtLocation [Line: 811]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [811] - GenericResultAtLocation [Line: 820]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [820] - GenericResultAtLocation [Line: 916]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [916] * 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: 816]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L219] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L500] int pumpRunning = 0; [L501] int systemActive = 1; [L821] int cleanupTimeShifts = 4; [L918] int waterLevel = 1; [L919] int methaneLevelCritical = 0; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L894] int retValue_acc ; [L895] int tmp ; [L899] FCALL select_helpers() [L900] FCALL select_features() [L901] CALL, EXPR valid_product() [L776] int retValue_acc ; [L779] retValue_acc = 1 [L780] return (retValue_acc); VAL [\result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L901] RET, EXPR valid_product() [L901] tmp = valid_product() [L903] COND TRUE \read(tmp) [L905] FCALL setup() [L906] CALL runTest() [L888] CALL test() [L423] int splverifierCounter ; [L424] int tmp ; [L425] int tmp___0 ; [L426] int tmp___1 ; [L427] int tmp___2 ; [L430] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L432] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L434] COND TRUE splverifierCounter < 4 [L440] tmp = __VERIFIER_nondet_int() [L442] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L444] CALL waterRise() VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L936] COND TRUE waterLevel < 2 [L937] waterLevel = waterLevel + 1 VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L444] RET waterRise() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L450] tmp___0 = __VERIFIER_nondet_int() [L452] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L454] CALL changeMethaneLevel() VAL [\old(methaneLevelCritical)=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L948] COND FALSE !(\read(methaneLevelCritical)) [L951] methaneLevelCritical = 1 VAL [\old(methaneLevelCritical)=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L454] RET changeMethaneLevel() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L460] tmp___2 = __VERIFIER_nondet_int() [L462] COND TRUE \read(tmp___2) [L464] CALL startSystem() [L742] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L464] RET startSystem() [L479] CALL timeShift() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L508] COND FALSE !(\read(pumpRunning)) VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L515] COND TRUE \read(systemActive) [L517] CALL processEnvironment() [L589] int tmp ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L592] COND FALSE !(\read(pumpRunning)) VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L607] CALL processEnvironment__wrappee__lowWaterSensor() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L563] int tmp ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L566] COND FALSE !(\read(pumpRunning)) VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L581] CALL processEnvironment__wrappee__highWaterSensor() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L537] int tmp ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L540] COND TRUE ! pumpRunning [L542] CALL, EXPR isHighWaterLevel() [L686] int retValue_acc ; [L687] int tmp ; [L688] int tmp___0 ; [L692] CALL, EXPR isHighWaterSensorDry() [L998] int retValue_acc ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L1001] COND FALSE !(waterLevel < 2) [L1005] retValue_acc = 0 [L1006] 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] [L692] RET, EXPR isHighWaterSensorDry() [L692] tmp = isHighWaterSensorDry() [L694] COND FALSE !(\read(tmp)) [L697] 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] [L699] retValue_acc = tmp___0 [L700] 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] [L542] RET, EXPR isHighWaterLevel() [L542] tmp = isHighWaterLevel() [L544] COND TRUE \read(tmp) [L546] CALL activatePump() [L617] pumpRunning = 1 VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L546] RET activatePump() [L581] RET processEnvironment__wrappee__highWaterSensor() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L607] RET processEnvironment__wrappee__lowWaterSensor() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L517] RET processEnvironment() [L523] CALL __utac_acc__Specification1_spec__1() [L787] int tmp ; [L788] int tmp___0 ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L792] CALL, EXPR isMethaneLevelCritical() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L957] int retValue_acc ; [L960] retValue_acc = methaneLevelCritical [L961] 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] [L792] RET, EXPR isMethaneLevelCritical() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L792] tmp = isMethaneLevelCritical() [L794] COND TRUE \read(tmp) [L796] CALL, EXPR isPumpRunning() [L641] int retValue_acc ; [L644] retValue_acc = pumpRunning [L645] 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] [L796] RET, EXPR isPumpRunning() [L796] tmp___0 = isPumpRunning() [L798] COND TRUE \read(tmp___0) [L800] CALL __automaton_fail() [L816] 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 10 procedures, 111 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.6s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1034 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1004 mSDsluCounter, 2569 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1657 mSDsCounter, 293 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 913 IncrementalHoareTripleChecker+Invalid, 1206 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 293 mSolverCounterUnsat, 912 mSDtfsCounter, 913 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 104 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1336occurred in iteration=8, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 8 MinimizatonAttempts, 72 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 380 NumberOfCodeBlocks, 380 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 314 ConstructedInterpolants, 0 QuantifiedInterpolants, 544 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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 RESULT: Ultimate proved your program to be incorrect! [2024-11-16 07:52:14,003 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE