./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec4_product33.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f 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_spec4_product33.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 5399744cbc243992ccbbf21bf0e09dd5dced55fce1050770392b2964c31c4145 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 23:17:50,039 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 23:17:50,117 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 23:17:50,123 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 23:17:50,126 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 23:17:50,155 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 23:17:50,156 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 23:17:50,157 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 23:17:50,157 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 23:17:50,158 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 23:17:50,159 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 23:17:50,159 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 23:17:50,160 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 23:17:50,160 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 23:17:50,161 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 23:17:50,161 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 23:17:50,161 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 23:17:50,161 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 23:17:50,162 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 23:17:50,164 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 23:17:50,165 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 23:17:50,165 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 23:17:50,168 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 23:17:50,168 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 23:17:50,169 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 23:17:50,169 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 23:17:50,169 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 23:17:50,169 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 23:17:50,170 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 23:17:50,170 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 23:17:50,170 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 23:17:50,170 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 23:17:50,170 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 23:17:50,171 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 23:17:50,172 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 23:17:50,173 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 23:17:50,173 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 23:17:50,173 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 23:17:50,174 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 23:17:50,174 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 23:17:50,174 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 23:17:50,174 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 23:17:50,175 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 -> 5399744cbc243992ccbbf21bf0e09dd5dced55fce1050770392b2964c31c4145 [2024-11-09 23:17:50,435 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 23:17:50,464 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 23:17:50,467 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 23:17:50,468 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 23:17:50,469 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 23:17:50,470 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec4_product33.cil.c [2024-11-09 23:17:52,021 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 23:17:52,253 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 23:17:52,253 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product33.cil.c [2024-11-09 23:17:52,266 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/637cf77f1/67c5f06cbd774160a7f9d4ebb43b57a3/FLAGd93f370ec [2024-11-09 23:17:52,588 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/637cf77f1/67c5f06cbd774160a7f9d4ebb43b57a3 [2024-11-09 23:17:52,590 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 23:17:52,591 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 23:17:52,592 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 23:17:52,592 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 23:17:52,597 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 23:17:52,597 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:17:52" (1/1) ... [2024-11-09 23:17:52,598 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@401a6a05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:17:52, skipping insertion in model container [2024-11-09 23:17:52,598 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:17:52" (1/1) ... [2024-11-09 23:17:52,640 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 23:17:52,955 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_spec4_product33.cil.c[17260,17273] [2024-11-09 23:17:52,964 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 23:17:52,992 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 23:17:53,001 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [49] [2024-11-09 23:17:53,003 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [415] [2024-11-09 23:17:53,003 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [519] [2024-11-09 23:17:53,003 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [554] [2024-11-09 23:17:53,004 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [619] [2024-11-09 23:17:53,004 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [718] [2024-11-09 23:17:53,004 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [874] [2024-11-09 23:17:53,004 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification4_spec.i","") [883] [2024-11-09 23:17:53,084 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_spec4_product33.cil.c[17260,17273] [2024-11-09 23:17:53,090 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 23:17:53,115 INFO L204 MainTranslator]: Completed translation [2024-11-09 23:17:53,116 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:17:53 WrapperNode [2024-11-09 23:17:53,116 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 23:17:53,117 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 23:17:53,119 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 23:17:53,120 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 23:17:53,126 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:17:53" (1/1) ... [2024-11-09 23:17:53,141 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:17:53" (1/1) ... [2024-11-09 23:17:53,169 INFO L138 Inliner]: procedures = 52, calls = 93, calls flagged for inlining = 21, calls inlined = 17, statements flattened = 169 [2024-11-09 23:17:53,170 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 23:17:53,171 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 23:17:53,171 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 23:17:53,171 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 23:17:53,183 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:17:53" (1/1) ... [2024-11-09 23:17:53,184 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:17:53" (1/1) ... [2024-11-09 23:17:53,185 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:17:53" (1/1) ... [2024-11-09 23:17:53,212 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-09 23:17:53,213 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:17:53" (1/1) ... [2024-11-09 23:17:53,213 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:17:53" (1/1) ... [2024-11-09 23:17:53,217 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:17:53" (1/1) ... [2024-11-09 23:17:53,217 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:17:53" (1/1) ... [2024-11-09 23:17:53,219 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:17:53" (1/1) ... [2024-11-09 23:17:53,220 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:17:53" (1/1) ... [2024-11-09 23:17:53,225 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 23:17:53,226 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 23:17:53,226 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 23:17:53,226 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 23:17:53,227 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:17:53" (1/1) ... [2024-11-09 23:17:53,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 23:17:53,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:17:53,263 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-09 23:17:53,265 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-09 23:17:53,307 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 23:17:53,307 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2024-11-09 23:17:53,307 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2024-11-09 23:17:53,307 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-11-09 23:17:53,307 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-11-09 23:17:53,307 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-11-09 23:17:53,307 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-11-09 23:17:53,307 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2024-11-09 23:17:53,307 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2024-11-09 23:17:53,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 23:17:53,308 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2024-11-09 23:17:53,308 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2024-11-09 23:17:53,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 23:17:53,308 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 23:17:53,380 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 23:17:53,382 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 23:17:53,530 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L816-1: isPumpRunning_#res#1 := isPumpRunning_~retValue_acc~10#1; [2024-11-09 23:17:53,530 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L715-1: isHighWaterSensorDry_#res#1 := isHighWaterSensorDry_~retValue_acc~8#1; [2024-11-09 23:17:53,531 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L701-1: getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~7#1; [2024-11-09 23:17:53,531 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L871-1: isHighWaterLevel_#res#1 := isHighWaterLevel_~retValue_acc~11#1; [2024-11-09 23:17:53,606 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L551-1: valid_product_#res#1 := valid_product_~retValue_acc~5#1; [2024-11-09 23:17:53,607 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L516-1: main_#res#1 := main_~retValue_acc~3#1; [2024-11-09 23:17:53,623 INFO L? ?]: Removed 37 outVars from TransFormulas that were not future-live. [2024-11-09 23:17:53,624 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 23:17:53,645 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 23:17:53,645 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 23:17:53,646 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 11:17:53 BoogieIcfgContainer [2024-11-09 23:17:53,646 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 23:17:53,649 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 23:17:53,649 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 23:17:53,653 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 23:17:53,653 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 11:17:52" (1/3) ... [2024-11-09 23:17:53,653 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b7afeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:17:53, skipping insertion in model container [2024-11-09 23:17:53,654 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:17:53" (2/3) ... [2024-11-09 23:17:53,654 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b7afeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:17:53, skipping insertion in model container [2024-11-09 23:17:53,654 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 11:17:53" (3/3) ... [2024-11-09 23:17:53,655 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec4_product33.cil.c [2024-11-09 23:17:53,670 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 23:17:53,671 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 23:17:53,728 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 23:17:53,737 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;@6ed65e0b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 23:17:53,737 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 23:17:53,743 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 59 states have (on average 1.3898305084745763) internal successors, (82), 65 states have internal predecessors, (82), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 23:17:53,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 23:17:53,753 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:17:53,754 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] [2024-11-09 23:17:53,754 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:17:53,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:17:53,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1456763022, now seen corresponding path program 1 times [2024-11-09 23:17:53,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:17:53,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134536286] [2024-11-09 23:17:53,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:17:53,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:17:53,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:17:53,982 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-09 23:17:53,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:17:53,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134536286] [2024-11-09 23:17:53,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134536286] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:17:53,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:17:53,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 23:17:53,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775204524] [2024-11-09 23:17:53,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:17:53,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 23:17:53,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:17:54,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 23:17:54,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 23:17:54,019 INFO L87 Difference]: Start difference. First operand has 74 states, 59 states have (on average 1.3898305084745763) internal successors, (82), 65 states have internal predecessors, (82), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:17:54,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:17:54,045 INFO L93 Difference]: Finished difference Result 139 states and 190 transitions. [2024-11-09 23:17:54,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 23:17:54,048 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-09 23:17:54,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:17:54,058 INFO L225 Difference]: With dead ends: 139 [2024-11-09 23:17:54,058 INFO L226 Difference]: Without dead ends: 63 [2024-11-09 23:17:54,063 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-09 23:17:54,068 INFO L432 NwaCegarLoop]: 91 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, 91 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-09 23:17:54,069 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:17:54,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-09 23:17:54,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-11-09 23:17:54,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 50 states have (on average 1.32) internal successors, (66), 55 states have internal predecessors, (66), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-09 23:17:54,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 81 transitions. [2024-11-09 23:17:54,116 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 81 transitions. Word has length 21 [2024-11-09 23:17:54,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:17:54,117 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 81 transitions. [2024-11-09 23:17:54,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:17:54,117 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 81 transitions. [2024-11-09 23:17:54,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 23:17:54,119 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:17:54,119 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] [2024-11-09 23:17:54,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 23:17:54,120 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:17:54,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:17:54,121 INFO L85 PathProgramCache]: Analyzing trace with hash -2015690732, now seen corresponding path program 1 times [2024-11-09 23:17:54,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:17:54,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258381307] [2024-11-09 23:17:54,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:17:54,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:17:54,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:17:54,268 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-09 23:17:54,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:17:54,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258381307] [2024-11-09 23:17:54,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258381307] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:17:54,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:17:54,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:17:54,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322842436] [2024-11-09 23:17:54,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:17:54,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:17:54,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:17:54,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:17:54,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:17:54,276 INFO L87 Difference]: Start difference. First operand 63 states and 81 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:17:54,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:17:54,296 INFO L93 Difference]: Finished difference Result 91 states and 117 transitions. [2024-11-09 23:17:54,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:17:54,298 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-09 23:17:54,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:17:54,299 INFO L225 Difference]: With dead ends: 91 [2024-11-09 23:17:54,300 INFO L226 Difference]: Without dead ends: 53 [2024-11-09 23:17:54,302 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:17:54,303 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 11 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 118 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-09 23:17:54,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 118 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:17:54,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-09 23:17:54,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-11-09 23:17:54,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 48 states have internal predecessors, (58), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 23:17:54,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 68 transitions. [2024-11-09 23:17:54,318 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 68 transitions. Word has length 23 [2024-11-09 23:17:54,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:17:54,319 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 68 transitions. [2024-11-09 23:17:54,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:17:54,319 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 68 transitions. [2024-11-09 23:17:54,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 23:17:54,321 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:17:54,321 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-09 23:17:54,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 23:17:54,321 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:17:54,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:17:54,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1148252583, now seen corresponding path program 1 times [2024-11-09 23:17:54,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:17:54,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132138951] [2024-11-09 23:17:54,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:17:54,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:17:54,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:17:54,422 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-09 23:17:54,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:17:54,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132138951] [2024-11-09 23:17:54,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132138951] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:17:54,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:17:54,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 23:17:54,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343791727] [2024-11-09 23:17:54,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:17:54,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:17:54,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:17:54,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:17:54,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:17:54,425 INFO L87 Difference]: Start difference. First operand 53 states and 68 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:17:54,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:17:54,433 INFO L93 Difference]: Finished difference Result 99 states and 130 transitions. [2024-11-09 23:17:54,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:17:54,433 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-09 23:17:54,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:17:54,434 INFO L225 Difference]: With dead ends: 99 [2024-11-09 23:17:54,434 INFO L226 Difference]: Without dead ends: 53 [2024-11-09 23:17:54,434 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-09 23:17:54,435 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 50 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 66 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-09 23:17:54,436 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 66 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:17:54,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-09 23:17:54,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-11-09 23:17:54,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 48 states have internal predecessors, (57), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 23:17:54,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 67 transitions. [2024-11-09 23:17:54,442 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 67 transitions. Word has length 25 [2024-11-09 23:17:54,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:17:54,442 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 67 transitions. [2024-11-09 23:17:54,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:17:54,443 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 67 transitions. [2024-11-09 23:17:54,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 23:17:54,444 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:17:54,444 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] [2024-11-09 23:17:54,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 23:17:54,444 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:17:54,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:17:54,445 INFO L85 PathProgramCache]: Analyzing trace with hash -618995034, now seen corresponding path program 1 times [2024-11-09 23:17:54,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:17:54,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470174815] [2024-11-09 23:17:54,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:17:54,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:17:54,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:17:54,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-09 23:17:54,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:17:54,488 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-09 23:17:54,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:17:54,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470174815] [2024-11-09 23:17:54,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470174815] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:17:54,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:17:54,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:17:54,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735804354] [2024-11-09 23:17:54,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:17:54,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:17:54,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:17:54,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:17:54,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:17:54,491 INFO L87 Difference]: Start difference. First operand 53 states and 67 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (2), 1 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-09 23:17:54,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:17:54,519 INFO L93 Difference]: Finished difference Result 134 states and 174 transitions. [2024-11-09 23:17:54,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:17:54,519 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2024-11-09 23:17:54,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:17:54,520 INFO L225 Difference]: With dead ends: 134 [2024-11-09 23:17:54,520 INFO L226 Difference]: Without dead ends: 88 [2024-11-09 23:17:54,521 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-09 23:17:54,522 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 56 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:17:54,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 121 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:17:54,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-09 23:17:54,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 85. [2024-11-09 23:17:54,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 68 states have (on average 1.3235294117647058) internal successors, (90), 74 states have internal predecessors, (90), 8 states have call successors, (8), 8 states have call predecessors, (8), 8 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-09 23:17:54,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 108 transitions. [2024-11-09 23:17:54,558 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 108 transitions. Word has length 30 [2024-11-09 23:17:54,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:17:54,558 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 108 transitions. [2024-11-09 23:17:54,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (2), 1 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-09 23:17:54,559 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 108 transitions. [2024-11-09 23:17:54,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 23:17:54,560 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:17:54,560 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-09 23:17:54,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 23:17:54,560 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:17:54,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:17:54,561 INFO L85 PathProgramCache]: Analyzing trace with hash -765249400, now seen corresponding path program 1 times [2024-11-09 23:17:54,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:17:54,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519859343] [2024-11-09 23:17:54,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:17:54,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:17:54,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:17:54,660 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-09 23:17:54,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:17:54,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519859343] [2024-11-09 23:17:54,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519859343] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:17:54,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:17:54,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 23:17:54,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010628688] [2024-11-09 23:17:54,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:17:54,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:17:54,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:17:54,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:17:54,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:17:54,663 INFO L87 Difference]: Start difference. First operand 85 states and 108 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:17:54,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:17:54,710 INFO L93 Difference]: Finished difference Result 166 states and 215 transitions. [2024-11-09 23:17:54,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:17:54,711 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-09 23:17:54,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:17:54,712 INFO L225 Difference]: With dead ends: 166 [2024-11-09 23:17:54,713 INFO L226 Difference]: Without dead ends: 88 [2024-11-09 23:17:54,713 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:17:54,714 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 0 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:17:54,715 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 249 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:17:54,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-09 23:17:54,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-11-09 23:17:54,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 71 states have (on average 1.3098591549295775) internal successors, (93), 77 states have internal predecessors, (93), 8 states have call successors, (8), 8 states have call predecessors, (8), 8 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-09 23:17:54,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 111 transitions. [2024-11-09 23:17:54,734 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 111 transitions. Word has length 34 [2024-11-09 23:17:54,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:17:54,734 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 111 transitions. [2024-11-09 23:17:54,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:17:54,734 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 111 transitions. [2024-11-09 23:17:54,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 23:17:54,735 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:17:54,735 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-09 23:17:54,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 23:17:54,736 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:17:54,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:17:54,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1058652407, now seen corresponding path program 1 times [2024-11-09 23:17:54,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:17:54,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476421322] [2024-11-09 23:17:54,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:17:54,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:17:54,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:17:54,862 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-09 23:17:54,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:17:54,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476421322] [2024-11-09 23:17:54,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476421322] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:17:54,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:17:54,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 23:17:54,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263485219] [2024-11-09 23:17:54,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:17:54,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:17:54,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:17:54,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:17:54,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:17:54,866 INFO L87 Difference]: Start difference. First operand 88 states and 111 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:17:54,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:17:54,925 INFO L93 Difference]: Finished difference Result 171 states and 222 transitions. [2024-11-09 23:17:54,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:17:54,926 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-09 23:17:54,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:17:54,927 INFO L225 Difference]: With dead ends: 171 [2024-11-09 23:17:54,927 INFO L226 Difference]: Without dead ends: 90 [2024-11-09 23:17:54,928 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:17:54,929 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 52 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:17:54,930 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 186 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:17:54,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-09 23:17:54,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-11-09 23:17:54,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 73 states have (on average 1.3013698630136987) internal successors, (95), 79 states have internal predecessors, (95), 8 states have call successors, (8), 8 states have call predecessors, (8), 8 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-09 23:17:54,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 113 transitions. [2024-11-09 23:17:54,946 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 113 transitions. Word has length 34 [2024-11-09 23:17:54,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:17:54,946 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 113 transitions. [2024-11-09 23:17:54,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:17:54,946 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 113 transitions. [2024-11-09 23:17:54,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 23:17:54,947 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:17:54,947 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-09 23:17:54,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 23:17:54,948 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:17:54,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:17:54,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1956451211, now seen corresponding path program 1 times [2024-11-09 23:17:54,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:17:54,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058610430] [2024-11-09 23:17:54,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:17:54,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:17:54,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:17:55,054 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-09 23:17:55,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:17:55,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058610430] [2024-11-09 23:17:55,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058610430] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:17:55,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:17:55,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 23:17:55,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866961380] [2024-11-09 23:17:55,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:17:55,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:17:55,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:17:55,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:17:55,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:17:55,059 INFO L87 Difference]: Start difference. First operand 90 states and 113 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:17:55,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:17:55,097 INFO L93 Difference]: Finished difference Result 213 states and 271 transitions. [2024-11-09 23:17:55,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:17:55,098 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-09 23:17:55,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:17:55,099 INFO L225 Difference]: With dead ends: 213 [2024-11-09 23:17:55,099 INFO L226 Difference]: Without dead ends: 130 [2024-11-09 23:17:55,100 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:17:55,101 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 33 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:17:55,103 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 117 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:17:55,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-09 23:17:55,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 127. [2024-11-09 23:17:55,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 103 states have (on average 1.2815533980582525) internal successors, (132), 110 states have internal predecessors, (132), 12 states have call successors, (12), 12 states have call predecessors, (12), 11 states have return successors, (14), 11 states have call predecessors, (14), 12 states have call successors, (14) [2024-11-09 23:17:55,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 158 transitions. [2024-11-09 23:17:55,119 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 158 transitions. Word has length 34 [2024-11-09 23:17:55,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:17:55,120 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 158 transitions. [2024-11-09 23:17:55,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:17:55,120 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 158 transitions. [2024-11-09 23:17:55,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-09 23:17:55,121 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:17:55,122 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] [2024-11-09 23:17:55,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 23:17:55,122 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:17:55,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:17:55,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1355830358, now seen corresponding path program 1 times [2024-11-09 23:17:55,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:17:55,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089984038] [2024-11-09 23:17:55,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:17:55,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:17:55,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:17:55,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:17:55,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:17:55,231 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-09 23:17:55,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:17:55,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089984038] [2024-11-09 23:17:55,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089984038] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:17:55,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:17:55,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 23:17:55,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612093785] [2024-11-09 23:17:55,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:17:55,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:17:55,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:17:55,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:17:55,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:17:55,235 INFO L87 Difference]: Start difference. First operand 127 states and 158 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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-09 23:17:55,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:17:55,313 INFO L93 Difference]: Finished difference Result 245 states and 307 transitions. [2024-11-09 23:17:55,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:17:55,314 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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 36 [2024-11-09 23:17:55,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:17:55,317 INFO L225 Difference]: With dead ends: 245 [2024-11-09 23:17:55,317 INFO L226 Difference]: Without dead ends: 125 [2024-11-09 23:17:55,318 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-09 23:17:55,319 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 19 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:17:55,319 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 237 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:17:55,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-09 23:17:55,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2024-11-09 23:17:55,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 101 states have (on average 1.2673267326732673) internal successors, (128), 108 states have internal predecessors, (128), 12 states have call successors, (12), 12 states have call predecessors, (12), 11 states have return successors, (14), 11 states have call predecessors, (14), 12 states have call successors, (14) [2024-11-09 23:17:55,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 154 transitions. [2024-11-09 23:17:55,344 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 154 transitions. Word has length 36 [2024-11-09 23:17:55,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:17:55,344 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 154 transitions. [2024-11-09 23:17:55,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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-09 23:17:55,345 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 154 transitions. [2024-11-09 23:17:55,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-09 23:17:55,346 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:17:55,346 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] [2024-11-09 23:17:55,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 23:17:55,346 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:17:55,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:17:55,347 INFO L85 PathProgramCache]: Analyzing trace with hash 353926445, now seen corresponding path program 1 times [2024-11-09 23:17:55,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:17:55,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801164016] [2024-11-09 23:17:55,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:17:55,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:17:55,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:17:55,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 23:17:55,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:17:55,450 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-09 23:17:55,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:17:55,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801164016] [2024-11-09 23:17:55,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801164016] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:17:55,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:17:55,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 23:17:55,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254742545] [2024-11-09 23:17:55,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:17:55,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 23:17:55,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:17:55,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 23:17:55,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 23:17:55,453 INFO L87 Difference]: Start difference. First operand 125 states and 154 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 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-09 23:17:55,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:17:55,664 INFO L93 Difference]: Finished difference Result 326 states and 428 transitions. [2024-11-09 23:17:55,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 23:17:55,665 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 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 38 [2024-11-09 23:17:55,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:17:55,667 INFO L225 Difference]: With dead ends: 326 [2024-11-09 23:17:55,667 INFO L226 Difference]: Without dead ends: 243 [2024-11-09 23:17:55,667 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-09 23:17:55,672 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 80 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:17:55,672 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 376 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:17:55,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2024-11-09 23:17:55,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 240. [2024-11-09 23:17:55,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 195 states have (on average 1.235897435897436) internal successors, (241), 209 states have internal predecessors, (241), 22 states have call successors, (22), 19 states have call predecessors, (22), 22 states have return successors, (39), 21 states have call predecessors, (39), 22 states have call successors, (39) [2024-11-09 23:17:55,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 302 transitions. [2024-11-09 23:17:55,707 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 302 transitions. Word has length 38 [2024-11-09 23:17:55,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:17:55,707 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 302 transitions. [2024-11-09 23:17:55,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 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-09 23:17:55,708 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 302 transitions. [2024-11-09 23:17:55,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-09 23:17:55,710 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:17:55,711 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] [2024-11-09 23:17:55,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 23:17:55,711 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:17:55,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:17:55,712 INFO L85 PathProgramCache]: Analyzing trace with hash 511128780, now seen corresponding path program 1 times [2024-11-09 23:17:55,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:17:55,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201655919] [2024-11-09 23:17:55,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:17:55,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:17:55,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:17:55,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 23:17:55,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:17:55,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 23:17:55,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:17:55,822 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-09 23:17:55,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:17:55,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201655919] [2024-11-09 23:17:55,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201655919] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:17:55,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:17:55,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 23:17:55,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626189810] [2024-11-09 23:17:55,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:17:55,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 23:17:55,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:17:55,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 23:17:55,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 23:17:55,824 INFO L87 Difference]: Start difference. First operand 240 states and 302 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 23:17:55,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:17:55,993 INFO L93 Difference]: Finished difference Result 246 states and 306 transitions. [2024-11-09 23:17:55,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 23:17:55,994 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 40 [2024-11-09 23:17:55,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:17:55,997 INFO L225 Difference]: With dead ends: 246 [2024-11-09 23:17:55,997 INFO L226 Difference]: Without dead ends: 243 [2024-11-09 23:17:56,001 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-09 23:17:56,001 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 99 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:17:56,002 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 263 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:17:56,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2024-11-09 23:17:56,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 240. [2024-11-09 23:17:56,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 195 states have (on average 1.2256410256410257) internal successors, (239), 209 states have internal predecessors, (239), 22 states have call successors, (22), 19 states have call predecessors, (22), 22 states have return successors, (39), 21 states have call predecessors, (39), 22 states have call successors, (39) [2024-11-09 23:17:56,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 300 transitions. [2024-11-09 23:17:56,022 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 300 transitions. Word has length 40 [2024-11-09 23:17:56,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:17:56,023 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 300 transitions. [2024-11-09 23:17:56,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 23:17:56,024 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 300 transitions. [2024-11-09 23:17:56,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-09 23:17:56,027 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:17:56,028 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:17:56,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 23:17:56,028 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:17:56,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:17:56,029 INFO L85 PathProgramCache]: Analyzing trace with hash 592269430, now seen corresponding path program 1 times [2024-11-09 23:17:56,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:17:56,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372088611] [2024-11-09 23:17:56,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:17:56,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:17:56,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:17:56,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 23:17:56,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:17:56,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-09 23:17:56,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:17:56,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-09 23:17:56,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:17:56,204 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:17:56,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:17:56,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372088611] [2024-11-09 23:17:56,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372088611] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:17:56,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1776990417] [2024-11-09 23:17:56,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:17:56,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:17:56,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:17:56,209 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 23:17:56,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 23:17:56,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:17:56,305 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 23:17:56,314 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:17:56,435 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:17:56,435 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:17:56,561 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:17:56,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1776990417] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:17:56,561 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:17:56,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 8 [2024-11-09 23:17:56,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516771684] [2024-11-09 23:17:56,561 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:17:56,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 23:17:56,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:17:56,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 23:17:56,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-09 23:17:56,563 INFO L87 Difference]: Start difference. First operand 240 states and 300 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 6 states have internal predecessors, (58), 3 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 23:17:56,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:17:56,943 INFO L93 Difference]: Finished difference Result 551 states and 727 transitions. [2024-11-09 23:17:56,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-09 23:17:56,944 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 6 states have internal predecessors, (58), 3 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 62 [2024-11-09 23:17:56,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:17:56,946 INFO L225 Difference]: With dead ends: 551 [2024-11-09 23:17:56,946 INFO L226 Difference]: Without dead ends: 353 [2024-11-09 23:17:56,949 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 126 SyntacticMatches, 6 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2024-11-09 23:17:56,950 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 144 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 23:17:56,950 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 449 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 23:17:56,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2024-11-09 23:17:56,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 324. [2024-11-09 23:17:56,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 261 states have (on average 1.2298850574712643) internal successors, (321), 280 states have internal predecessors, (321), 31 states have call successors, (31), 27 states have call predecessors, (31), 31 states have return successors, (58), 28 states have call predecessors, (58), 31 states have call successors, (58) [2024-11-09 23:17:56,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 410 transitions. [2024-11-09 23:17:56,978 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 410 transitions. Word has length 62 [2024-11-09 23:17:56,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:17:56,979 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 410 transitions. [2024-11-09 23:17:56,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 6 states have internal predecessors, (58), 3 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 23:17:56,979 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 410 transitions. [2024-11-09 23:17:56,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-09 23:17:56,981 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:17:56,981 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:17:56,999 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 23:17:57,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-09 23:17:57,182 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:17:57,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:17:57,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1455364287, now seen corresponding path program 2 times [2024-11-09 23:17:57,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:17:57,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649548663] [2024-11-09 23:17:57,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:17:57,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:17:57,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 23:17:57,201 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 23:17:57,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 23:17:57,237 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 23:17:57,237 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 23:17:57,238 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 23:17:57,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 23:17:57,242 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:17:57,321 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 23:17:57,323 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 11:17:57 BoogieIcfgContainer [2024-11-09 23:17:57,324 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 23:17:57,325 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 23:17:57,325 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 23:17:57,325 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 23:17:57,326 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 11:17:53" (3/4) ... [2024-11-09 23:17:57,326 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-09 23:17:57,439 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 23:17:57,439 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 23:17:57,440 INFO L158 Benchmark]: Toolchain (without parser) took 4849.00ms. Allocated memory was 159.4MB in the beginning and 192.9MB in the end (delta: 33.6MB). Free memory was 89.7MB in the beginning and 161.6MB in the end (delta: -71.9MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. [2024-11-09 23:17:57,440 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 117.4MB. Free memory is still 79.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 23:17:57,441 INFO L158 Benchmark]: CACSL2BoogieTranslator took 524.41ms. Allocated memory is still 159.4MB. Free memory was 89.5MB in the beginning and 124.0MB in the end (delta: -34.5MB). Peak memory consumption was 18.0MB. Max. memory is 16.1GB. [2024-11-09 23:17:57,441 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.60ms. Allocated memory is still 159.4MB. Free memory was 124.0MB in the beginning and 121.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 23:17:57,441 INFO L158 Benchmark]: Boogie Preprocessor took 54.89ms. Allocated memory is still 159.4MB. Free memory was 121.9MB in the beginning and 119.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 23:17:57,441 INFO L158 Benchmark]: IcfgBuilder took 419.53ms. Allocated memory is still 159.4MB. Free memory was 119.8MB in the beginning and 102.3MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-09 23:17:57,441 INFO L158 Benchmark]: TraceAbstraction took 3675.29ms. Allocated memory was 159.4MB in the beginning and 192.9MB in the end (delta: 33.6MB). Free memory was 102.3MB in the beginning and 66.8MB in the end (delta: 35.5MB). Peak memory consumption was 72.7MB. Max. memory is 16.1GB. [2024-11-09 23:17:57,442 INFO L158 Benchmark]: Witness Printer took 114.66ms. Allocated memory is still 192.9MB. Free memory was 66.8MB in the beginning and 161.6MB in the end (delta: -94.8MB). Peak memory consumption was 5.8MB. Max. memory is 16.1GB. [2024-11-09 23:17:57,443 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.31ms. Allocated memory is still 117.4MB. Free memory is still 79.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 524.41ms. Allocated memory is still 159.4MB. Free memory was 89.5MB in the beginning and 124.0MB in the end (delta: -34.5MB). Peak memory consumption was 18.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.60ms. Allocated memory is still 159.4MB. Free memory was 124.0MB in the beginning and 121.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.89ms. Allocated memory is still 159.4MB. Free memory was 121.9MB in the beginning and 119.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 419.53ms. Allocated memory is still 159.4MB. Free memory was 119.8MB in the beginning and 102.3MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3675.29ms. Allocated memory was 159.4MB in the beginning and 192.9MB in the end (delta: 33.6MB). Free memory was 102.3MB in the beginning and 66.8MB in the end (delta: 35.5MB). Peak memory consumption was 72.7MB. Max. memory is 16.1GB. * Witness Printer took 114.66ms. Allocated memory is still 192.9MB. Free memory was 66.8MB in the beginning and 161.6MB in the end (delta: -94.8MB). Peak memory consumption was 5.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 49]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [49] - GenericResultAtLocation [Line: 415]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [415] - GenericResultAtLocation [Line: 519]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [519] - GenericResultAtLocation [Line: 554]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [554] - GenericResultAtLocation [Line: 619]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [619] - GenericResultAtLocation [Line: 718]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [718] - GenericResultAtLocation [Line: 874]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [874] - GenericResultAtLocation [Line: 883]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification4_spec.i","") [883] * 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: 879]: 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; [L416] int cleanupTimeShifts = 4; [L625] int waterLevel = 1; [L626] int methaneLevelCritical = 0; [L722] int pumpRunning = 0; [L723] int systemActive = 1; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L497] int retValue_acc ; [L498] int tmp ; [L502] FCALL select_helpers() [L503] FCALL select_features() [L504] CALL, EXPR valid_product() [L546] int retValue_acc ; [L549] retValue_acc = 1 [L550] return (retValue_acc); VAL [\result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L504] RET, EXPR valid_product() [L504] tmp = valid_product() [L506] COND TRUE \read(tmp) [L508] FCALL setup() [L509] CALL runTest() [L488] CALL test() [L556] int splverifierCounter ; [L557] int tmp ; [L558] int tmp___0 ; [L559] int tmp___1 ; [L560] int tmp___2 ; [L563] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L565] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L567] COND TRUE splverifierCounter < 4 [L573] tmp = __VERIFIER_nondet_int() [L575] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L577] CALL waterRise() VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L643] COND TRUE waterLevel < 2 [L644] waterLevel = waterLevel + 1 VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L577] RET waterRise() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L583] tmp___0 = __VERIFIER_nondet_int() [L585] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L593] tmp___2 = __VERIFIER_nondet_int() [L595] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L608] CALL timeShift() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L730] COND FALSE !(\read(pumpRunning)) VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L737] COND TRUE \read(systemActive) [L739] CALL processEnvironment() [L759] int tmp ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L762] COND TRUE ! pumpRunning [L764] CALL, EXPR isHighWaterLevel() [L856] int retValue_acc ; [L857] int tmp ; [L858] int tmp___0 ; [L862] CALL, EXPR isHighWaterSensorDry() [L705] int retValue_acc ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L708] COND FALSE !(waterLevel < 2) [L712] retValue_acc = 0 [L713] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L862] RET, EXPR isHighWaterSensorDry() [L862] tmp = isHighWaterSensorDry() [L864] COND FALSE !(\read(tmp)) [L867] tmp___0 = 1 VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, tmp___0=1, waterLevel=2] [L869] retValue_acc = tmp___0 [L870] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L764] RET, EXPR isHighWaterLevel() [L764] tmp = isHighWaterLevel() [L766] COND TRUE \read(tmp) [L768] CALL activatePump() [L787] pumpRunning = 1 VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L768] RET activatePump() [L739] RET processEnvironment() [L745] CALL __utac_acc__Specification4_spec__1() [L885] int tmp ; [L886] int tmp___0 ; [L890] CALL, EXPR getWaterLevel() [L696] int retValue_acc ; [L699] retValue_acc = waterLevel [L700] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L890] RET, EXPR getWaterLevel() [L890] tmp = getWaterLevel() [L892] COND FALSE !(tmp == 0) VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L745] RET __utac_acc__Specification4_spec__1() [L608] RET timeShift() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L565] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L567] COND TRUE splverifierCounter < 4 [L573] tmp = __VERIFIER_nondet_int() [L575] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L583] tmp___0 = __VERIFIER_nondet_int() [L585] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L593] tmp___2 = __VERIFIER_nondet_int() [L595] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L608] CALL timeShift() VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L730] COND TRUE \read(pumpRunning) [L732] CALL lowerWaterLevel() [L631] COND TRUE waterLevel > 0 [L632] waterLevel = waterLevel - 1 VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L732] RET lowerWaterLevel() [L737] COND TRUE \read(systemActive) [L739] CALL processEnvironment() [L759] int tmp ; VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L762] COND FALSE !(! pumpRunning) VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L777] FCALL processEnvironment__wrappee__base() VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L739] RET processEnvironment() [L745] CALL __utac_acc__Specification4_spec__1() [L885] int tmp ; [L886] int tmp___0 ; [L890] CALL, EXPR getWaterLevel() [L696] int retValue_acc ; [L699] retValue_acc = waterLevel [L700] return (retValue_acc); VAL [\old(pumpRunning)=1, \old(waterLevel)=2, \result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L890] RET, EXPR getWaterLevel() [L890] tmp = getWaterLevel() [L892] COND FALSE !(tmp == 0) VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L745] RET __utac_acc__Specification4_spec__1() [L608] RET timeShift() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=1] [L565] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=1] [L567] COND TRUE splverifierCounter < 4 [L573] tmp = __VERIFIER_nondet_int() [L575] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=1] [L583] tmp___0 = __VERIFIER_nondet_int() [L585] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=1] [L593] tmp___2 = __VERIFIER_nondet_int() [L595] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=1] [L608] CALL timeShift() VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L730] COND TRUE \read(pumpRunning) [L732] CALL lowerWaterLevel() [L631] COND TRUE waterLevel > 0 [L632] waterLevel = waterLevel - 1 VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L732] RET lowerWaterLevel() [L737] COND TRUE \read(systemActive) [L739] CALL processEnvironment() [L759] int tmp ; VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L762] COND FALSE !(! pumpRunning) VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L777] FCALL processEnvironment__wrappee__base() VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L739] RET processEnvironment() [L745] CALL __utac_acc__Specification4_spec__1() [L885] int tmp ; [L886] int tmp___0 ; [L890] CALL, EXPR getWaterLevel() [L696] int retValue_acc ; [L699] retValue_acc = waterLevel [L700] return (retValue_acc); VAL [\old(pumpRunning)=1, \old(waterLevel)=1, \result=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L890] RET, EXPR getWaterLevel() [L890] tmp = getWaterLevel() [L892] COND TRUE tmp == 0 [L894] CALL, EXPR isPumpRunning() [L811] int retValue_acc ; [L814] retValue_acc = pumpRunning [L815] return (retValue_acc); VAL [\old(pumpRunning)=1, \old(waterLevel)=1, \result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L894] RET, EXPR isPumpRunning() [L894] tmp___0 = isPumpRunning() [L896] COND TRUE \read(tmp___0) [L898] CALL __automaton_fail() [L879] reach_error() VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 74 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.5s, OverallIterations: 12, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 559 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 544 mSDsluCounter, 2273 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1485 mSDsCounter, 56 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 510 IncrementalHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 56 mSolverCounterUnsat, 788 mSDtfsCounter, 510 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 216 GetRequests, 156 SyntacticMatches, 6 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=324occurred in iteration=11, InterpolantAutomatonStates: 65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 41 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 525 NumberOfCodeBlocks, 525 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 488 ConstructedInterpolants, 0 QuantifiedInterpolants, 932 SizeOfPredicates, 2 NumberOfNonLiveVariables, 228 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 13 InterpolantComputations, 10 PerfectInterpolantSequences, 35/48 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-09 23:17:57,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE