./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec1_product50.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/minepump_spec1_product50.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 7291fd5b9449f17989061ec30bdd7b74e8732c40c8095270267a47672f4a66be --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 15:13:21,373 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 15:13:21,455 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 15:13:21,458 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 15:13:21,458 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 15:13:21,500 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 15:13:21,500 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 15:13:21,501 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 15:13:21,502 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 15:13:21,503 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 15:13:21,504 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 15:13:21,505 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 15:13:21,505 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 15:13:21,505 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 15:13:21,506 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 15:13:21,506 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 15:13:21,506 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 15:13:21,507 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 15:13:21,507 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 15:13:21,507 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 15:13:21,507 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 15:13:21,508 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 15:13:21,508 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 15:13:21,509 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 15:13:21,509 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 15:13:21,509 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 15:13:21,510 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 15:13:21,510 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 15:13:21,510 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 15:13:21,511 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 15:13:21,511 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 15:13:21,511 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 15:13:21,512 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 15:13:21,512 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 15:13:21,512 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 15:13:21,513 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 15:13:21,513 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 15:13:21,513 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 15:13:21,513 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 15:13:21,514 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 15:13:21,514 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 15:13:21,515 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 15:13:21,516 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 -> 7291fd5b9449f17989061ec30bdd7b74e8732c40c8095270267a47672f4a66be [2024-11-08 15:13:21,773 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 15:13:21,798 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 15:13:21,801 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 15:13:21,803 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 15:13:21,803 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 15:13:21,804 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec1_product50.cil.c [2024-11-08 15:13:23,303 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 15:13:23,562 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 15:13:23,563 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product50.cil.c [2024-11-08 15:13:23,574 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1cf50d24b/e227fe1d0d02425780836c3c219317ee/FLAGe725e3c10 [2024-11-08 15:13:23,588 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1cf50d24b/e227fe1d0d02425780836c3c219317ee [2024-11-08 15:13:23,590 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 15:13:23,592 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 15:13:23,593 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 15:13:23,593 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 15:13:23,600 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 15:13:23,601 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:13:23" (1/1) ... [2024-11-08 15:13:23,601 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@161ff776 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:13:23, skipping insertion in model container [2024-11-08 15:13:23,601 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:13:23" (1/1) ... [2024-11-08 15:13:23,649 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 15:13:23,859 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product50.cil.c[6254,6267] [2024-11-08 15:13:23,961 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 15:13:23,975 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 15:13:23,984 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification1_spec.i","") [49] [2024-11-08 15:13:23,986 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [78] [2024-11-08 15:13:23,986 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [188] [2024-11-08 15:13:23,987 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [290] [2024-11-08 15:13:23,987 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [325] [2024-11-08 15:13:23,987 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [393] [2024-11-08 15:13:23,987 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [402] [2024-11-08 15:13:23,988 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [609] [2024-11-08 15:13:24,016 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product50.cil.c[6254,6267] [2024-11-08 15:13:24,055 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 15:13:24,075 INFO L204 MainTranslator]: Completed translation [2024-11-08 15:13:24,075 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:13:24 WrapperNode [2024-11-08 15:13:24,075 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 15:13:24,076 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 15:13:24,076 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 15:13:24,076 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 15:13:24,081 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:13:24" (1/1) ... [2024-11-08 15:13:24,100 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:13:24" (1/1) ... [2024-11-08 15:13:24,129 INFO L138 Inliner]: procedures = 56, calls = 99, calls flagged for inlining = 23, calls inlined = 20, statements flattened = 201 [2024-11-08 15:13:24,130 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 15:13:24,131 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 15:13:24,131 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 15:13:24,131 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 15:13:24,141 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:13:24" (1/1) ... [2024-11-08 15:13:24,141 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:13:24" (1/1) ... [2024-11-08 15:13:24,143 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:13:24" (1/1) ... [2024-11-08 15:13:24,161 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-08 15:13:24,161 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:13:24" (1/1) ... [2024-11-08 15:13:24,161 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:13:24" (1/1) ... [2024-11-08 15:13:24,171 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:13:24" (1/1) ... [2024-11-08 15:13:24,179 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:13:24" (1/1) ... [2024-11-08 15:13:24,180 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:13:24" (1/1) ... [2024-11-08 15:13:24,182 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:13:24" (1/1) ... [2024-11-08 15:13:24,184 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 15:13:24,189 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 15:13:24,189 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 15:13:24,189 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 15:13:24,190 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:13:24" (1/1) ... [2024-11-08 15:13:24,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 15:13:24,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:13:24,227 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-08 15:13:24,229 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-08 15:13:24,275 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 15:13:24,275 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2024-11-08 15:13:24,275 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2024-11-08 15:13:24,275 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-11-08 15:13:24,275 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-11-08 15:13:24,276 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-11-08 15:13:24,276 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-11-08 15:13:24,276 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2024-11-08 15:13:24,276 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2024-11-08 15:13:24,276 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__highWaterSensor [2024-11-08 15:13:24,276 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__highWaterSensor [2024-11-08 15:13:24,276 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2024-11-08 15:13:24,276 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2024-11-08 15:13:24,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 15:13:24,277 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2024-11-08 15:13:24,277 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2024-11-08 15:13:24,277 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 15:13:24,277 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 15:13:24,350 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 15:13:24,351 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 15:13:24,612 INFO L? ?]: Removed 45 outVars from TransFormulas that were not future-live. [2024-11-08 15:13:24,613 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 15:13:24,628 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 15:13:24,629 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-08 15:13:24,629 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:13:24 BoogieIcfgContainer [2024-11-08 15:13:24,629 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 15:13:24,631 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 15:13:24,631 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 15:13:24,634 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 15:13:24,634 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 03:13:23" (1/3) ... [2024-11-08 15:13:24,635 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64231483 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:13:24, skipping insertion in model container [2024-11-08 15:13:24,635 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:13:24" (2/3) ... [2024-11-08 15:13:24,635 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64231483 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:13:24, skipping insertion in model container [2024-11-08 15:13:24,635 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:13:24" (3/3) ... [2024-11-08 15:13:24,636 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec1_product50.cil.c [2024-11-08 15:13:24,648 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 15:13:24,648 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 15:13:24,708 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 15:13:24,716 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;@1f48694e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 15:13:24,717 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 15:13:24,722 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 67 states have (on average 1.3880597014925373) internal successors, (93), 75 states have internal predecessors, (93), 11 states have call successors, (11), 7 states have call predecessors, (11), 7 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-08 15:13:24,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-08 15:13:24,731 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:13:24,732 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-08 15:13:24,732 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:13:24,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:13:24,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1284973020, now seen corresponding path program 1 times [2024-11-08 15:13:24,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:13:24,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829794244] [2024-11-08 15:13:24,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:13:24,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:13:24,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:13:24,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 15:13:24,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:13:24,958 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-08 15:13:24,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:13:24,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829794244] [2024-11-08 15:13:24,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829794244] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:13:24,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:13:24,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 15:13:24,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957794101] [2024-11-08 15:13:24,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:13:24,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 15:13:24,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:13:25,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 15:13:25,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 15:13:25,013 INFO L87 Difference]: Start difference. First operand has 87 states, 67 states have (on average 1.3880597014925373) internal successors, (93), 75 states have internal predecessors, (93), 11 states have call successors, (11), 7 states have call predecessors, (11), 7 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) 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, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 15:13:25,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:13:25,047 INFO L93 Difference]: Finished difference Result 166 states and 225 transitions. [2024-11-08 15:13:25,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 15:13:25,049 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, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2024-11-08 15:13:25,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:13:25,060 INFO L225 Difference]: With dead ends: 166 [2024-11-08 15:13:25,060 INFO L226 Difference]: Without dead ends: 78 [2024-11-08 15:13:25,065 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 15:13:25,070 INFO L432 NwaCegarLoop]: 109 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, 109 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-08 15:13:25,071 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:13:25,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-08 15:13:25,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-11-08 15:13:25,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 60 states have (on average 1.3166666666666667) internal successors, (79), 67 states have internal predecessors, (79), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-08 15:13:25,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 100 transitions. [2024-11-08 15:13:25,108 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 100 transitions. Word has length 23 [2024-11-08 15:13:25,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:13:25,109 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 100 transitions. [2024-11-08 15:13:25,109 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, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 15:13:25,110 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 100 transitions. [2024-11-08 15:13:25,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-08 15:13:25,112 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:13:25,112 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] [2024-11-08 15:13:25,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 15:13:25,113 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:13:25,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:13:25,114 INFO L85 PathProgramCache]: Analyzing trace with hash -489560550, now seen corresponding path program 1 times [2024-11-08 15:13:25,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:13:25,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694979098] [2024-11-08 15:13:25,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:13:25,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:13:25,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:13:25,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 15:13:25,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:13:25,309 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-08 15:13:25,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:13:25,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694979098] [2024-11-08 15:13:25,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694979098] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:13:25,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:13:25,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:13:25,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123334425] [2024-11-08 15:13:25,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:13:25,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:13:25,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:13:25,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:13:25,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:13:25,314 INFO L87 Difference]: Start difference. First operand 78 states and 100 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 15:13:25,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:13:25,339 INFO L93 Difference]: Finished difference Result 121 states and 155 transitions. [2024-11-08 15:13:25,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:13:25,340 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2024-11-08 15:13:25,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:13:25,341 INFO L225 Difference]: With dead ends: 121 [2024-11-08 15:13:25,341 INFO L226 Difference]: Without dead ends: 69 [2024-11-08 15:13:25,342 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-08 15:13:25,344 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 13 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 157 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-08 15:13:25,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 157 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:13:25,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-08 15:13:25,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-08 15:13:25,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 54 states have (on average 1.3333333333333333) internal successors, (72), 61 states have internal predecessors, (72), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-08 15:13:25,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 88 transitions. [2024-11-08 15:13:25,361 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 88 transitions. Word has length 24 [2024-11-08 15:13:25,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:13:25,362 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 88 transitions. [2024-11-08 15:13:25,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 15:13:25,362 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 88 transitions. [2024-11-08 15:13:25,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-08 15:13:25,363 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:13:25,363 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] [2024-11-08 15:13:25,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 15:13:25,364 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:13:25,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:13:25,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1301531266, now seen corresponding path program 1 times [2024-11-08 15:13:25,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:13:25,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769487967] [2024-11-08 15:13:25,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:13:25,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:13:25,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:13:25,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 15:13:25,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:13:25,497 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-08 15:13:25,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:13:25,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769487967] [2024-11-08 15:13:25,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769487967] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:13:25,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:13:25,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:13:25,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157904463] [2024-11-08 15:13:25,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:13:25,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:13:25,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:13:25,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:13:25,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:13:25,501 INFO L87 Difference]: Start difference. First operand 69 states and 88 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 15:13:25,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:13:25,520 INFO L93 Difference]: Finished difference Result 131 states and 170 transitions. [2024-11-08 15:13:25,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:13:25,521 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2024-11-08 15:13:25,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:13:25,522 INFO L225 Difference]: With dead ends: 131 [2024-11-08 15:13:25,523 INFO L226 Difference]: Without dead ends: 69 [2024-11-08 15:13:25,524 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-08 15:13:25,525 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 68 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:13:25,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 86 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:13:25,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-08 15:13:25,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-08 15:13:25,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 54 states have (on average 1.3148148148148149) internal successors, (71), 61 states have internal predecessors, (71), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-08 15:13:25,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 87 transitions. [2024-11-08 15:13:25,543 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 87 transitions. Word has length 29 [2024-11-08 15:13:25,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:13:25,543 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 87 transitions. [2024-11-08 15:13:25,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 15:13:25,544 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 87 transitions. [2024-11-08 15:13:25,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-08 15:13:25,545 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:13:25,545 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] [2024-11-08 15:13:25,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 15:13:25,545 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:13:25,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:13:25,546 INFO L85 PathProgramCache]: Analyzing trace with hash 774759404, now seen corresponding path program 1 times [2024-11-08 15:13:25,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:13:25,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889882975] [2024-11-08 15:13:25,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:13:25,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:13:25,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:13:25,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 15:13:25,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:13:25,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:13:25,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:13:25,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-08 15:13:25,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:13:25,709 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-08 15:13:25,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:13:25,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889882975] [2024-11-08 15:13:25,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889882975] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:13:25,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:13:25,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 15:13:25,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197620951] [2024-11-08 15:13:25,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:13:25,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:13:25,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:13:25,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:13:25,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:13:25,712 INFO L87 Difference]: Start difference. First operand 69 states and 87 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 15:13:25,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:13:25,972 INFO L93 Difference]: Finished difference Result 203 states and 256 transitions. [2024-11-08 15:13:25,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 15:13:25,972 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 39 [2024-11-08 15:13:25,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:13:25,974 INFO L225 Difference]: With dead ends: 203 [2024-11-08 15:13:25,974 INFO L226 Difference]: Without dead ends: 141 [2024-11-08 15:13:25,978 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-08 15:13:25,979 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 155 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 15:13:25,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 263 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 15:13:25,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-08 15:13:26,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 135. [2024-11-08 15:13:26,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 104 states have (on average 1.2596153846153846) internal successors, (131), 111 states have internal predecessors, (131), 14 states have call successors, (14), 13 states have call predecessors, (14), 16 states have return successors, (19), 15 states have call predecessors, (19), 14 states have call successors, (19) [2024-11-08 15:13:26,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 164 transitions. [2024-11-08 15:13:26,010 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 164 transitions. Word has length 39 [2024-11-08 15:13:26,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:13:26,010 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 164 transitions. [2024-11-08 15:13:26,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 15:13:26,012 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 164 transitions. [2024-11-08 15:13:26,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-08 15:13:26,013 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:13:26,013 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:13:26,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 15:13:26,017 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:13:26,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:13:26,017 INFO L85 PathProgramCache]: Analyzing trace with hash -2013400487, now seen corresponding path program 1 times [2024-11-08 15:13:26,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:13:26,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292736720] [2024-11-08 15:13:26,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:13:26,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:13:26,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:13:26,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 15:13:26,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:13:26,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 15:13:26,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:13:26,169 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-08 15:13:26,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:13:26,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292736720] [2024-11-08 15:13:26,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292736720] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:13:26,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:13:26,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 15:13:26,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638174836] [2024-11-08 15:13:26,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:13:26,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 15:13:26,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:13:26,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 15:13:26,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 15:13:26,172 INFO L87 Difference]: Start difference. First operand 135 states and 164 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 15:13:26,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:13:26,342 INFO L93 Difference]: Finished difference Result 268 states and 329 transitions. [2024-11-08 15:13:26,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 15:13:26,343 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 43 [2024-11-08 15:13:26,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:13:26,346 INFO L225 Difference]: With dead ends: 268 [2024-11-08 15:13:26,347 INFO L226 Difference]: Without dead ends: 140 [2024-11-08 15:13:26,349 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-08 15:13:26,350 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 49 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:13:26,351 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 337 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:13:26,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-08 15:13:26,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 138. [2024-11-08 15:13:26,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 107 states have (on average 1.2523364485981308) internal successors, (134), 114 states have internal predecessors, (134), 14 states have call successors, (14), 13 states have call predecessors, (14), 16 states have return successors, (19), 15 states have call predecessors, (19), 14 states have call successors, (19) [2024-11-08 15:13:26,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 167 transitions. [2024-11-08 15:13:26,383 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 167 transitions. Word has length 43 [2024-11-08 15:13:26,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:13:26,384 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 167 transitions. [2024-11-08 15:13:26,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 15:13:26,384 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 167 transitions. [2024-11-08 15:13:26,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-08 15:13:26,385 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:13:26,385 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:13:26,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 15:13:26,386 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:13:26,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:13:26,386 INFO L85 PathProgramCache]: Analyzing trace with hash 287422103, now seen corresponding path program 1 times [2024-11-08 15:13:26,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:13:26,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426323533] [2024-11-08 15:13:26,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:13:26,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:13:26,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:13:26,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 15:13:26,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:13:26,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 15:13:26,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:13:26,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:13:26,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:13:26,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426323533] [2024-11-08 15:13:26,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426323533] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:13:26,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:13:26,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 15:13:26,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577602006] [2024-11-08 15:13:26,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:13:26,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 15:13:26,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:13:26,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 15:13:26,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 15:13:26,517 INFO L87 Difference]: Start difference. First operand 138 states and 167 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 15:13:26,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:13:26,679 INFO L93 Difference]: Finished difference Result 273 states and 337 transitions. [2024-11-08 15:13:26,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 15:13:26,680 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 43 [2024-11-08 15:13:26,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:13:26,684 INFO L225 Difference]: With dead ends: 273 [2024-11-08 15:13:26,684 INFO L226 Difference]: Without dead ends: 142 [2024-11-08 15:13:26,685 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-08 15:13:26,685 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 108 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:13:26,689 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 258 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:13:26,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-08 15:13:26,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 140. [2024-11-08 15:13:26,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 109 states have (on average 1.2477064220183487) internal successors, (136), 116 states have internal predecessors, (136), 14 states have call successors, (14), 13 states have call predecessors, (14), 16 states have return successors, (19), 15 states have call predecessors, (19), 14 states have call successors, (19) [2024-11-08 15:13:26,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 169 transitions. [2024-11-08 15:13:26,712 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 169 transitions. Word has length 43 [2024-11-08 15:13:26,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:13:26,713 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 169 transitions. [2024-11-08 15:13:26,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 15:13:26,713 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 169 transitions. [2024-11-08 15:13:26,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-08 15:13:26,716 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:13:26,716 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:13:26,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 15:13:26,716 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:13:26,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:13:26,717 INFO L85 PathProgramCache]: Analyzing trace with hash -530226347, now seen corresponding path program 1 times [2024-11-08 15:13:26,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:13:26,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030267307] [2024-11-08 15:13:26,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:13:26,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:13:26,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:13:26,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 15:13:26,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:13:26,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 15:13:26,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:13:26,884 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-08 15:13:26,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:13:26,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030267307] [2024-11-08 15:13:26,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030267307] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:13:26,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:13:26,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 15:13:26,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889953822] [2024-11-08 15:13:26,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:13:26,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:13:26,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:13:26,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:13:26,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:13:26,887 INFO L87 Difference]: Start difference. First operand 140 states and 169 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 15:13:27,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:13:27,072 INFO L93 Difference]: Finished difference Result 396 states and 500 transitions. [2024-11-08 15:13:27,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 15:13:27,073 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 43 [2024-11-08 15:13:27,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:13:27,075 INFO L225 Difference]: With dead ends: 396 [2024-11-08 15:13:27,076 INFO L226 Difference]: Without dead ends: 263 [2024-11-08 15:13:27,076 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 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-08 15:13:27,078 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 191 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:13:27,078 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 276 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:13:27,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2024-11-08 15:13:27,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 255. [2024-11-08 15:13:27,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 196 states have (on average 1.239795918367347) internal successors, (243), 207 states have internal predecessors, (243), 29 states have call successors, (29), 28 states have call predecessors, (29), 29 states have return successors, (44), 29 states have call predecessors, (44), 29 states have call successors, (44) [2024-11-08 15:13:27,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 316 transitions. [2024-11-08 15:13:27,111 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 316 transitions. Word has length 43 [2024-11-08 15:13:27,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:13:27,111 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 316 transitions. [2024-11-08 15:13:27,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 15:13:27,112 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 316 transitions. [2024-11-08 15:13:27,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-08 15:13:27,113 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:13:27,113 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:13:27,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 15:13:27,113 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:13:27,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:13:27,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1371224164, now seen corresponding path program 1 times [2024-11-08 15:13:27,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:13:27,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174413860] [2024-11-08 15:13:27,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:13:27,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:13:27,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:13:27,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 15:13:27,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:13:27,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 15:13:27,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:13:27,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-08 15:13:27,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:13:27,230 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-08 15:13:27,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:13:27,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174413860] [2024-11-08 15:13:27,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174413860] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:13:27,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:13:27,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 15:13:27,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914120132] [2024-11-08 15:13:27,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:13:27,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 15:13:27,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:13:27,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 15:13:27,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 15:13:27,232 INFO L87 Difference]: Start difference. First operand 255 states and 316 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 15:13:27,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:13:27,403 INFO L93 Difference]: Finished difference Result 259 states and 318 transitions. [2024-11-08 15:13:27,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 15:13:27,407 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 45 [2024-11-08 15:13:27,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:13:27,409 INFO L225 Difference]: With dead ends: 259 [2024-11-08 15:13:27,409 INFO L226 Difference]: Without dead ends: 257 [2024-11-08 15:13:27,410 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-08 15:13:27,410 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 101 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:13:27,410 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 278 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:13:27,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2024-11-08 15:13:27,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 255. [2024-11-08 15:13:27,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 196 states have (on average 1.219387755102041) internal successors, (239), 207 states have internal predecessors, (239), 29 states have call successors, (29), 28 states have call predecessors, (29), 29 states have return successors, (44), 29 states have call predecessors, (44), 29 states have call successors, (44) [2024-11-08 15:13:27,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 312 transitions. [2024-11-08 15:13:27,440 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 312 transitions. Word has length 45 [2024-11-08 15:13:27,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:13:27,440 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 312 transitions. [2024-11-08 15:13:27,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 15:13:27,440 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 312 transitions. [2024-11-08 15:13:27,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-08 15:13:27,441 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:13:27,441 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:13:27,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 15:13:27,442 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:13:27,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:13:27,442 INFO L85 PathProgramCache]: Analyzing trace with hash -702494737, now seen corresponding path program 1 times [2024-11-08 15:13:27,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:13:27,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812555903] [2024-11-08 15:13:27,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:13:27,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:13:27,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:13:27,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 15:13:27,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:13:27,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-08 15:13:27,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:13:27,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 15:13:27,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:13:27,554 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-08 15:13:27,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:13:27,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812555903] [2024-11-08 15:13:27,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812555903] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:13:27,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:13:27,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 15:13:27,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900267238] [2024-11-08 15:13:27,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:13:27,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 15:13:27,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:13:27,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 15:13:27,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-08 15:13:27,556 INFO L87 Difference]: Start difference. First operand 255 states and 312 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 15:13:27,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:13:27,981 INFO L93 Difference]: Finished difference Result 801 states and 1007 transitions. [2024-11-08 15:13:27,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-08 15:13:27,984 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 47 [2024-11-08 15:13:27,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:13:27,989 INFO L225 Difference]: With dead ends: 801 [2024-11-08 15:13:27,989 INFO L226 Difference]: Without dead ends: 553 [2024-11-08 15:13:27,991 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2024-11-08 15:13:27,991 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 264 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 15:13:27,992 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 361 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 15:13:27,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2024-11-08 15:13:28,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 549. [2024-11-08 15:13:28,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 420 states have (on average 1.1904761904761905) internal successors, (500), 447 states have internal predecessors, (500), 64 states have call successors, (64), 56 states have call predecessors, (64), 64 states have return successors, (103), 64 states have call predecessors, (103), 64 states have call successors, (103) [2024-11-08 15:13:28,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 667 transitions. [2024-11-08 15:13:28,051 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 667 transitions. Word has length 47 [2024-11-08 15:13:28,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:13:28,051 INFO L471 AbstractCegarLoop]: Abstraction has 549 states and 667 transitions. [2024-11-08 15:13:28,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 15:13:28,051 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 667 transitions. [2024-11-08 15:13:28,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-08 15:13:28,052 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:13:28,053 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:13:28,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 15:13:28,053 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:13:28,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:13:28,053 INFO L85 PathProgramCache]: Analyzing trace with hash -540609749, now seen corresponding path program 1 times [2024-11-08 15:13:28,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:13:28,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570080599] [2024-11-08 15:13:28,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:13:28,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:13:28,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 15:13:28,070 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 15:13:28,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 15:13:28,106 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 15:13:28,106 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 15:13:28,107 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 15:13:28,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 15:13:28,110 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:13:28,158 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 15:13:28,161 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 03:13:28 BoogieIcfgContainer [2024-11-08 15:13:28,161 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 15:13:28,162 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 15:13:28,162 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 15:13:28,162 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 15:13:28,162 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:13:24" (3/4) ... [2024-11-08 15:13:28,163 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-08 15:13:28,234 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 15:13:28,235 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 15:13:28,235 INFO L158 Benchmark]: Toolchain (without parser) took 4643.40ms. Allocated memory was 184.5MB in the beginning and 262.1MB in the end (delta: 77.6MB). Free memory was 126.5MB in the beginning and 201.8MB in the end (delta: -75.2MB). Peak memory consumption was 3.1MB. Max. memory is 16.1GB. [2024-11-08 15:13:28,235 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 184.5MB. Free memory is still 147.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 15:13:28,236 INFO L158 Benchmark]: CACSL2BoogieTranslator took 482.47ms. Allocated memory is still 184.5MB. Free memory was 126.5MB in the beginning and 104.8MB in the end (delta: 21.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-08 15:13:28,236 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.08ms. Allocated memory is still 184.5MB. Free memory was 104.8MB in the beginning and 102.6MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 15:13:28,236 INFO L158 Benchmark]: Boogie Preprocessor took 53.24ms. Allocated memory is still 184.5MB. Free memory was 102.6MB in the beginning and 100.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 15:13:28,236 INFO L158 Benchmark]: RCFGBuilder took 440.63ms. Allocated memory is still 184.5MB. Free memory was 100.6MB in the beginning and 81.1MB in the end (delta: 19.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-08 15:13:28,236 INFO L158 Benchmark]: TraceAbstraction took 3530.10ms. Allocated memory was 184.5MB in the beginning and 262.1MB in the end (delta: 77.6MB). Free memory was 80.4MB in the beginning and 207.0MB in the end (delta: -126.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 15:13:28,237 INFO L158 Benchmark]: Witness Printer took 72.76ms. Allocated memory is still 262.1MB. Free memory was 207.0MB in the beginning and 201.8MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 15:13:28,238 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 184.5MB. Free memory is still 147.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 482.47ms. Allocated memory is still 184.5MB. Free memory was 126.5MB in the beginning and 104.8MB in the end (delta: 21.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.08ms. Allocated memory is still 184.5MB. Free memory was 104.8MB in the beginning and 102.6MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.24ms. Allocated memory is still 184.5MB. Free memory was 102.6MB in the beginning and 100.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 440.63ms. Allocated memory is still 184.5MB. Free memory was 100.6MB in the beginning and 81.1MB in the end (delta: 19.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 3530.10ms. Allocated memory was 184.5MB in the beginning and 262.1MB in the end (delta: 77.6MB). Free memory was 80.4MB in the beginning and 207.0MB in the end (delta: -126.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 72.76ms. Allocated memory is still 262.1MB. Free memory was 207.0MB in the beginning and 201.8MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. 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,"Specification1_spec.i","") [49] - GenericResultAtLocation [Line: 78]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [78] - GenericResultAtLocation [Line: 188]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [188] - GenericResultAtLocation [Line: 290]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [290] - GenericResultAtLocation [Line: 325]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [325] - GenericResultAtLocation [Line: 393]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [393] - GenericResultAtLocation [Line: 402]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [402] - GenericResultAtLocation [Line: 609]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [609] * 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: 398]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L86] int waterLevel = 1; [L87] int methaneLevelCritical = 0; [L189] int cleanupTimeShifts = 4; [L405] int pumpRunning = 0; [L406] int systemActive = 1; [L779] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L268] int retValue_acc ; [L269] int tmp ; [L273] FCALL select_helpers() [L274] FCALL select_features() [L275] CALL, EXPR valid_product() [L317] int retValue_acc ; [L320] retValue_acc = 1 [L321] return (retValue_acc); VAL [\result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L275] RET, EXPR valid_product() [L275] tmp = valid_product() [L277] COND TRUE \read(tmp) [L279] FCALL setup() [L280] CALL runTest() [L259] CALL test() [L328] int splverifierCounter ; [L329] int tmp ; [L330] int tmp___0 ; [L331] int tmp___1 ; [L332] int tmp___2 ; [L335] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L337] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L339] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L345] tmp = __VERIFIER_nondet_int() [L347] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L349] CALL waterRise() VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L104] COND TRUE waterLevel < 2 [L105] waterLevel = waterLevel + 1 VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L349] RET waterRise() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L355] tmp___0 = __VERIFIER_nondet_int() [L357] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L359] CALL changeMethaneLevel() VAL [\old(methaneLevelCritical)=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L116] COND FALSE !(\read(methaneLevelCritical)) [L119] methaneLevelCritical = 1 VAL [\old(methaneLevelCritical)=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L359] RET changeMethaneLevel() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L365] tmp___2 = __VERIFIER_nondet_int() [L367] COND FALSE !(\read(tmp___2)) [L373] tmp___1 = __VERIFIER_nondet_int() [L375] COND TRUE \read(tmp___1) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L382] CALL timeShift() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L412] COND FALSE !(\read(pumpRunning)) VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L419] COND TRUE \read(systemActive) [L421] CALL processEnvironment() [L467] int tmp ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L470] COND FALSE !(\read(pumpRunning)) VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L485] CALL processEnvironment__wrappee__highWaterSensor() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L441] int tmp ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L444] COND TRUE ! pumpRunning [L446] CALL, EXPR isHighWaterLevel() [L564] int retValue_acc ; [L565] int tmp ; [L566] int tmp___0 ; [L570] CALL, EXPR isHighWaterSensorDry() [L166] int retValue_acc ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L169] COND FALSE !(waterLevel < 2) [L173] retValue_acc = 0 [L174] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L570] RET, EXPR isHighWaterSensorDry() [L570] tmp = isHighWaterSensorDry() [L572] COND FALSE !(\read(tmp)) [L575] tmp___0 = 1 VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, tmp___0=1, waterLevel=2] [L577] retValue_acc = tmp___0 [L578] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L446] RET, EXPR isHighWaterLevel() [L446] tmp = isHighWaterLevel() [L448] COND TRUE \read(tmp) [L450] CALL activatePump() [L495] pumpRunning = 1 VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L450] RET activatePump() [L485] RET processEnvironment__wrappee__highWaterSensor() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L421] RET processEnvironment() [L427] CALL __utac_acc__Specification1_spec__1() [L54] int tmp ; [L55] int tmp___0 ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L59] CALL, EXPR isMethaneLevelCritical() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L125] int retValue_acc ; [L128] retValue_acc = methaneLevelCritical [L129] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L59] RET, EXPR isMethaneLevelCritical() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L59] tmp = isMethaneLevelCritical() [L61] COND TRUE \read(tmp) [L63] CALL, EXPR isPumpRunning() [L519] int retValue_acc ; [L522] retValue_acc = pumpRunning [L523] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L63] RET, EXPR isPumpRunning() [L63] tmp___0 = isPumpRunning() [L65] COND TRUE \read(tmp___0) [L67] CALL __automaton_fail() [L398] reach_error() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 87 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.4s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 975 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 949 mSDsluCounter, 2125 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1334 mSDsCounter, 217 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 834 IncrementalHoareTripleChecker+Invalid, 1051 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 217 mSolverCounterUnsat, 791 mSDtfsCounter, 834 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 114 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=549occurred in iteration=9, InterpolantAutomatonStates: 62, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 24 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 387 NumberOfCodeBlocks, 387 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 327 ConstructedInterpolants, 0 QuantifiedInterpolants, 664 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-08 15:13:28,274 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