./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec1_product49.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f 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_product49.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 d7c4dde0ada366116691c2f175a080cab4880a7b4b6a5f42c97520b77f10420a --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 20:52:28,560 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 20:52:28,615 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 20:52:28,620 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 20:52:28,620 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 20:52:28,634 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 20:52:28,635 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 20:52:28,635 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 20:52:28,636 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 20:52:28,636 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 20:52:28,636 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 20:52:28,637 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 20:52:28,637 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 20:52:28,637 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 20:52:28,638 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 20:52:28,638 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 20:52:28,638 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 20:52:28,638 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 20:52:28,639 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 20:52:28,639 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 20:52:28,639 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 20:52:28,643 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 20:52:28,643 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 20:52:28,643 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 20:52:28,643 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 20:52:28,643 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 20:52:28,644 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 20:52:28,644 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 20:52:28,644 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 20:52:28,644 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 20:52:28,644 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 20:52:28,645 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 20:52:28,645 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 20:52:28,645 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 20:52:28,645 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 20:52:28,645 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 20:52:28,646 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 20:52:28,646 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 20:52:28,650 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 20:52:28,650 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 20:52:28,650 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 20:52:28,651 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 20:52:28,651 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 -> d7c4dde0ada366116691c2f175a080cab4880a7b4b6a5f42c97520b77f10420a [2024-11-11 20:52:28,877 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 20:52:28,901 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 20:52:28,903 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 20:52:28,904 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 20:52:28,905 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 20:52:28,906 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec1_product49.cil.c [2024-11-11 20:52:30,235 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 20:52:30,497 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 20:52:30,498 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product49.cil.c [2024-11-11 20:52:30,508 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d5d90789/d5b2272ae8b24340989b15ad6feee4da/FLAG6007ad4f1 [2024-11-11 20:52:30,826 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d5d90789/d5b2272ae8b24340989b15ad6feee4da [2024-11-11 20:52:30,828 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 20:52:30,829 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 20:52:30,830 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 20:52:30,830 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 20:52:30,834 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 20:52:30,835 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 08:52:30" (1/1) ... [2024-11-11 20:52:30,836 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16f4e071 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:52:30, skipping insertion in model container [2024-11-11 20:52:30,836 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 08:52:30" (1/1) ... [2024-11-11 20:52:30,871 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 20:52:31,110 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_product49.cil.c[18430,18443] [2024-11-11 20:52:31,114 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 20:52:31,123 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 20:52:31,136 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification1_spec.i","") [49] [2024-11-11 20:52:31,137 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [78] [2024-11-11 20:52:31,138 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [182] [2024-11-11 20:52:31,138 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [548] [2024-11-11 20:52:31,138 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [751] [2024-11-11 20:52:31,138 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [816] [2024-11-11 20:52:31,138 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [851] [2024-11-11 20:52:31,139 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [955] [2024-11-11 20:52:31,202 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_product49.cil.c[18430,18443] [2024-11-11 20:52:31,202 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 20:52:31,227 INFO L204 MainTranslator]: Completed translation [2024-11-11 20:52:31,228 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:52:31 WrapperNode [2024-11-11 20:52:31,228 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 20:52:31,229 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 20:52:31,229 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 20:52:31,229 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 20:52:31,235 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:52:31" (1/1) ... [2024-11-11 20:52:31,246 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:52:31" (1/1) ... [2024-11-11 20:52:31,271 INFO L138 Inliner]: procedures = 55, calls = 98, calls flagged for inlining = 22, calls inlined = 19, statements flattened = 198 [2024-11-11 20:52:31,272 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 20:52:31,273 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 20:52:31,273 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 20:52:31,273 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 20:52:31,283 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:52:31" (1/1) ... [2024-11-11 20:52:31,284 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:52:31" (1/1) ... [2024-11-11 20:52:31,286 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:52:31" (1/1) ... [2024-11-11 20:52:31,305 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-11 20:52:31,306 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:52:31" (1/1) ... [2024-11-11 20:52:31,310 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:52:31" (1/1) ... [2024-11-11 20:52:31,315 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:52:31" (1/1) ... [2024-11-11 20:52:31,319 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:52:31" (1/1) ... [2024-11-11 20:52:31,323 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:52:31" (1/1) ... [2024-11-11 20:52:31,325 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:52:31" (1/1) ... [2024-11-11 20:52:31,330 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 20:52:31,331 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 20:52:31,331 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 20:52:31,331 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 20:52:31,333 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:52:31" (1/1) ... [2024-11-11 20:52:31,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 20:52:31,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:52:31,372 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-11 20:52:31,375 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-11 20:52:31,419 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 20:52:31,419 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2024-11-11 20:52:31,419 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2024-11-11 20:52:31,419 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-11-11 20:52:31,420 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-11-11 20:52:31,420 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-11-11 20:52:31,420 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-11-11 20:52:31,420 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2024-11-11 20:52:31,420 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2024-11-11 20:52:31,420 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__highWaterSensor [2024-11-11 20:52:31,421 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__highWaterSensor [2024-11-11 20:52:31,421 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2024-11-11 20:52:31,421 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2024-11-11 20:52:31,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 20:52:31,421 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2024-11-11 20:52:31,421 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2024-11-11 20:52:31,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 20:52:31,422 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 20:52:31,491 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 20:52:31,492 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 20:52:31,709 INFO L? ?]: Removed 45 outVars from TransFormulas that were not future-live. [2024-11-11 20:52:31,709 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 20:52:31,720 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 20:52:31,721 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-11 20:52:31,721 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:52:31 BoogieIcfgContainer [2024-11-11 20:52:31,721 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 20:52:31,723 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 20:52:31,724 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 20:52:31,726 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 20:52:31,727 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 08:52:30" (1/3) ... [2024-11-11 20:52:31,727 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@706bbb1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 08:52:31, skipping insertion in model container [2024-11-11 20:52:31,727 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:52:31" (2/3) ... [2024-11-11 20:52:31,728 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@706bbb1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 08:52:31, skipping insertion in model container [2024-11-11 20:52:31,728 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:52:31" (3/3) ... [2024-11-11 20:52:31,729 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec1_product49.cil.c [2024-11-11 20:52:31,743 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 20:52:31,743 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 20:52:31,794 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 20:52:31,800 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;@54838a27, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 20:52:31,800 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 20:52:31,804 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 66 states have (on average 1.393939393939394) internal successors, (92), 74 states have internal predecessors, (92), 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-11 20:52:31,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-11 20:52:31,811 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:52:31,811 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:52:31,811 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:52:31,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:52:31,816 INFO L85 PathProgramCache]: Analyzing trace with hash -155620000, now seen corresponding path program 1 times [2024-11-11 20:52:31,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:52:31,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156097203] [2024-11-11 20:52:31,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:52:31,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:52:31,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:52:32,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 20:52:32,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:52:32,021 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-11 20:52:32,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:52:32,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156097203] [2024-11-11 20:52:32,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156097203] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:52:32,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:52:32,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 20:52:32,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396785064] [2024-11-11 20:52:32,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:52:32,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-11 20:52:32,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:52:32,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-11 20:52:32,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-11 20:52:32,047 INFO L87 Difference]: Start difference. First operand has 86 states, 66 states have (on average 1.393939393939394) internal successors, (92), 74 states have internal predecessors, (92), 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-11 20:52:32,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:52:32,070 INFO L93 Difference]: Finished difference Result 164 states and 223 transitions. [2024-11-11 20:52:32,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 20:52:32,072 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-11 20:52:32,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:52:32,080 INFO L225 Difference]: With dead ends: 164 [2024-11-11 20:52:32,080 INFO L226 Difference]: Without dead ends: 77 [2024-11-11 20:52:32,084 INFO L434 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-11 20:52:32,087 INFO L435 NwaCegarLoop]: 108 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, 108 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-11 20:52:32,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:52:32,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-11 20:52:32,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-11-11 20:52:32,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 59 states have (on average 1.3220338983050848) internal successors, (78), 66 states have internal predecessors, (78), 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-11 20:52:32,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 99 transitions. [2024-11-11 20:52:32,134 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 99 transitions. Word has length 23 [2024-11-11 20:52:32,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:52:32,134 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 99 transitions. [2024-11-11 20:52:32,135 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-11 20:52:32,135 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 99 transitions. [2024-11-11 20:52:32,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-11 20:52:32,137 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:52:32,137 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:52:32,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 20:52:32,137 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:52:32,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:52:32,138 INFO L85 PathProgramCache]: Analyzing trace with hash 639792470, now seen corresponding path program 1 times [2024-11-11 20:52:32,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:52:32,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889112047] [2024-11-11 20:52:32,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:52:32,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:52:32,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:52:32,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 20:52:32,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:52:32,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:52:32,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:52:32,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889112047] [2024-11-11 20:52:32,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889112047] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:52:32,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:52:32,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 20:52:32,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150026530] [2024-11-11 20:52:32,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:52:32,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 20:52:32,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:52:32,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 20:52:32,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 20:52:32,235 INFO L87 Difference]: Start difference. First operand 77 states and 99 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-11 20:52:32,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:52:32,250 INFO L93 Difference]: Finished difference Result 120 states and 154 transitions. [2024-11-11 20:52:32,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 20:52:32,251 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-11 20:52:32,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:52:32,252 INFO L225 Difference]: With dead ends: 120 [2024-11-11 20:52:32,252 INFO L226 Difference]: Without dead ends: 68 [2024-11-11 20:52:32,252 INFO L434 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-11 20:52:32,253 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 12 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 156 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-11 20:52:32,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 156 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:52:32,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-11 20:52:32,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-11-11 20:52:32,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 53 states have (on average 1.3396226415094339) internal successors, (71), 60 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-11 20:52:32,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 87 transitions. [2024-11-11 20:52:32,260 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 87 transitions. Word has length 24 [2024-11-11 20:52:32,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:52:32,261 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 87 transitions. [2024-11-11 20:52:32,261 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-11 20:52:32,261 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 87 transitions. [2024-11-11 20:52:32,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-11 20:52:32,266 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:52:32,266 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:52:32,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 20:52:32,267 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:52:32,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:52:32,268 INFO L85 PathProgramCache]: Analyzing trace with hash -116184494, now seen corresponding path program 1 times [2024-11-11 20:52:32,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:52:32,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121925226] [2024-11-11 20:52:32,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:52:32,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:52:32,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:52:32,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 20:52:32,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:52:32,391 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-11 20:52:32,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:52:32,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121925226] [2024-11-11 20:52:32,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121925226] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:52:32,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:52:32,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 20:52:32,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421419329] [2024-11-11 20:52:32,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:52:32,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 20:52:32,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:52:32,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 20:52:32,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 20:52:32,397 INFO L87 Difference]: Start difference. First operand 68 states and 87 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-11 20:52:32,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:52:32,414 INFO L93 Difference]: Finished difference Result 129 states and 168 transitions. [2024-11-11 20:52:32,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 20:52:32,416 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 28 [2024-11-11 20:52:32,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:52:32,417 INFO L225 Difference]: With dead ends: 129 [2024-11-11 20:52:32,417 INFO L226 Difference]: Without dead ends: 68 [2024-11-11 20:52:32,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 20:52:32,419 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 69 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 85 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-11 20:52:32,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 85 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:52:32,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-11 20:52:32,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-11-11 20:52:32,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 53 states have (on average 1.320754716981132) internal successors, (70), 60 states have internal predecessors, (70), 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-11 20:52:32,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 86 transitions. [2024-11-11 20:52:32,426 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 86 transitions. Word has length 28 [2024-11-11 20:52:32,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:52:32,426 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 86 transitions. [2024-11-11 20:52:32,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-11 20:52:32,427 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 86 transitions. [2024-11-11 20:52:32,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-11 20:52:32,427 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:52:32,427 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:52:32,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 20:52:32,428 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:52:32,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:52:32,429 INFO L85 PathProgramCache]: Analyzing trace with hash 512288066, now seen corresponding path program 1 times [2024-11-11 20:52:32,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:52:32,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671555436] [2024-11-11 20:52:32,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:52:32,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:52:32,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:52:32,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 20:52:32,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:52:32,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 20:52:32,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:52:32,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-11 20:52:32,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:52:32,538 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-11 20:52:32,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:52:32,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671555436] [2024-11-11 20:52:32,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671555436] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:52:32,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:52:32,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 20:52:32,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229922756] [2024-11-11 20:52:32,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:52:32,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 20:52:32,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:52:32,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 20:52:32,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 20:52:32,543 INFO L87 Difference]: Start difference. First operand 68 states and 86 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-11 20:52:32,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:52:32,734 INFO L93 Difference]: Finished difference Result 200 states and 253 transitions. [2024-11-11 20:52:32,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 20:52:32,735 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 38 [2024-11-11 20:52:32,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:52:32,736 INFO L225 Difference]: With dead ends: 200 [2024-11-11 20:52:32,736 INFO L226 Difference]: Without dead ends: 139 [2024-11-11 20:52:32,737 INFO L434 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-11 20:52:32,737 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 170 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 259 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.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:52:32,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 259 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 20:52:32,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-11 20:52:32,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 133. [2024-11-11 20:52:32,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 102 states have (on average 1.2647058823529411) internal successors, (129), 109 states have internal predecessors, (129), 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-11 20:52:32,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 162 transitions. [2024-11-11 20:52:32,768 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 162 transitions. Word has length 38 [2024-11-11 20:52:32,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:52:32,768 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 162 transitions. [2024-11-11 20:52:32,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-11 20:52:32,768 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 162 transitions. [2024-11-11 20:52:32,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-11 20:52:32,769 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:52:32,769 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:52:32,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 20:52:32,769 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:52:32,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:52:32,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1332077163, now seen corresponding path program 1 times [2024-11-11 20:52:32,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:52:32,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833374041] [2024-11-11 20:52:32,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:52:32,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:52:32,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:52:32,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 20:52:32,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:52:32,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-11 20:52:32,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:52:32,866 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-11 20:52:32,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:52:32,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833374041] [2024-11-11 20:52:32,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833374041] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:52:32,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:52:32,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:52:32,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606840602] [2024-11-11 20:52:32,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:52:32,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:52:32,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:52:32,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:52:32,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:52:32,870 INFO L87 Difference]: Start difference. First operand 133 states and 162 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 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-11 20:52:33,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:52:33,029 INFO L93 Difference]: Finished difference Result 347 states and 446 transitions. [2024-11-11 20:52:33,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 20:52:33,030 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 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 42 [2024-11-11 20:52:33,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:52:33,032 INFO L225 Difference]: With dead ends: 347 [2024-11-11 20:52:33,032 INFO L226 Difference]: Without dead ends: 221 [2024-11-11 20:52:33,033 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 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-11 20:52:33,034 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 121 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:52:33,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 321 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 20:52:33,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2024-11-11 20:52:33,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 215. [2024-11-11 20:52:33,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 165 states have (on average 1.2666666666666666) internal successors, (209), 174 states have internal predecessors, (209), 24 states have call successors, (24), 23 states have call predecessors, (24), 25 states have return successors, (34), 24 states have call predecessors, (34), 24 states have call successors, (34) [2024-11-11 20:52:33,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 267 transitions. [2024-11-11 20:52:33,059 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 267 transitions. Word has length 42 [2024-11-11 20:52:33,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:52:33,059 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 267 transitions. [2024-11-11 20:52:33,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 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-11 20:52:33,060 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 267 transitions. [2024-11-11 20:52:33,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-11 20:52:33,061 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:52:33,061 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:52:33,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 20:52:33,061 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:52:33,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:52:33,061 INFO L85 PathProgramCache]: Analyzing trace with hash -2145241683, now seen corresponding path program 1 times [2024-11-11 20:52:33,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:52:33,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022818143] [2024-11-11 20:52:33,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:52:33,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:52:33,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:52:33,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 20:52:33,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:52:33,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-11 20:52:33,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:52:33,161 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-11 20:52:33,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:52:33,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022818143] [2024-11-11 20:52:33,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022818143] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:52:33,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:52:33,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:52:33,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089846159] [2024-11-11 20:52:33,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:52:33,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:52:33,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:52:33,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:52:33,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:52:33,164 INFO L87 Difference]: Start difference. First operand 215 states and 267 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 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-11 20:52:33,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:52:33,291 INFO L93 Difference]: Finished difference Result 431 states and 542 transitions. [2024-11-11 20:52:33,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 20:52:33,292 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 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 42 [2024-11-11 20:52:33,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:52:33,293 INFO L225 Difference]: With dead ends: 431 [2024-11-11 20:52:33,293 INFO L226 Difference]: Without dead ends: 223 [2024-11-11 20:52:33,294 INFO L434 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-11 20:52:33,295 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 49 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 332 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-11 20:52:33,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 332 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 20:52:33,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-11-11 20:52:33,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 221. [2024-11-11 20:52:33,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 171 states have (on average 1.2573099415204678) internal successors, (215), 180 states have internal predecessors, (215), 24 states have call successors, (24), 23 states have call predecessors, (24), 25 states have return successors, (34), 24 states have call predecessors, (34), 24 states have call successors, (34) [2024-11-11 20:52:33,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 273 transitions. [2024-11-11 20:52:33,329 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 273 transitions. Word has length 42 [2024-11-11 20:52:33,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:52:33,330 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 273 transitions. [2024-11-11 20:52:33,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 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-11 20:52:33,330 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 273 transitions. [2024-11-11 20:52:33,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-11 20:52:33,333 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:52:33,333 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:52:33,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 20:52:33,334 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:52:33,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:52:33,334 INFO L85 PathProgramCache]: Analyzing trace with hash 155580907, now seen corresponding path program 1 times [2024-11-11 20:52:33,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:52:33,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653051479] [2024-11-11 20:52:33,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:52:33,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:52:33,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:52:33,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 20:52:33,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:52:33,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-11 20:52:33,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:52:33,426 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-11 20:52:33,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:52:33,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653051479] [2024-11-11 20:52:33,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653051479] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:52:33,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:52:33,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:52:33,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983971607] [2024-11-11 20:52:33,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:52:33,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:52:33,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:52:33,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:52:33,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:52:33,430 INFO L87 Difference]: Start difference. First operand 221 states and 273 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 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-11 20:52:33,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:52:33,547 INFO L93 Difference]: Finished difference Result 400 states and 499 transitions. [2024-11-11 20:52:33,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 20:52:33,548 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 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 42 [2024-11-11 20:52:33,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:52:33,551 INFO L225 Difference]: With dead ends: 400 [2024-11-11 20:52:33,551 INFO L226 Difference]: Without dead ends: 186 [2024-11-11 20:52:33,552 INFO L434 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-11 20:52:33,553 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 119 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:52:33,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 210 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 20:52:33,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-11 20:52:33,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 184. [2024-11-11 20:52:33,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 142 states have (on average 1.232394366197183) internal successors, (175), 150 states have internal predecessors, (175), 20 states have call successors, (20), 19 states have call predecessors, (20), 21 states have return successors, (25), 20 states have call predecessors, (25), 20 states have call successors, (25) [2024-11-11 20:52:33,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 220 transitions. [2024-11-11 20:52:33,572 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 220 transitions. Word has length 42 [2024-11-11 20:52:33,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:52:33,573 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 220 transitions. [2024-11-11 20:52:33,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 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-11 20:52:33,573 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 220 transitions. [2024-11-11 20:52:33,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-11 20:52:33,575 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:52:33,577 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:52:33,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 20:52:33,577 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:52:33,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:52:33,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1724031866, now seen corresponding path program 1 times [2024-11-11 20:52:33,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:52:33,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161125988] [2024-11-11 20:52:33,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:52:33,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:52:33,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:52:33,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 20:52:33,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:52:33,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:52:33,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:52:33,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 20:52:33,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:52:33,686 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-11 20:52:33,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:52:33,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161125988] [2024-11-11 20:52:33,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161125988] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:52:33,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:52:33,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:52:33,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12436473] [2024-11-11 20:52:33,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:52:33,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:52:33,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:52:33,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:52:33,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:52:33,689 INFO L87 Difference]: Start difference. First operand 184 states and 220 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (4), 2 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-11 20:52:33,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:52:33,838 INFO L93 Difference]: Finished difference Result 188 states and 222 transitions. [2024-11-11 20:52:33,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:52:33,839 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (4), 2 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 44 [2024-11-11 20:52:33,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:52:33,841 INFO L225 Difference]: With dead ends: 188 [2024-11-11 20:52:33,841 INFO L226 Difference]: Without dead ends: 186 [2024-11-11 20:52:33,841 INFO L434 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-11 20:52:33,841 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 116 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 273 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-11 20:52:33,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 273 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 20:52:33,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-11 20:52:33,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 184. [2024-11-11 20:52:33,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 142 states have (on average 1.2112676056338028) internal successors, (172), 150 states have internal predecessors, (172), 20 states have call successors, (20), 19 states have call predecessors, (20), 21 states have return successors, (25), 20 states have call predecessors, (25), 20 states have call successors, (25) [2024-11-11 20:52:33,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 217 transitions. [2024-11-11 20:52:33,854 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 217 transitions. Word has length 44 [2024-11-11 20:52:33,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:52:33,854 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 217 transitions. [2024-11-11 20:52:33,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (4), 2 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-11 20:52:33,855 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 217 transitions. [2024-11-11 20:52:33,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-11 20:52:33,855 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:52:33,855 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:52:33,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 20:52:33,856 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:52:33,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:52:33,856 INFO L85 PathProgramCache]: Analyzing trace with hash 971065167, now seen corresponding path program 1 times [2024-11-11 20:52:33,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:52:33,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120445755] [2024-11-11 20:52:33,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:52:33,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:52:33,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:52:33,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 20:52:33,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:52:33,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-11 20:52:33,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:52:33,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-11 20:52:33,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:52:33,961 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-11 20:52:33,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:52:33,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120445755] [2024-11-11 20:52:33,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120445755] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:52:33,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:52:33,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 20:52:33,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623705426] [2024-11-11 20:52:33,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:52:33,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 20:52:33,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:52:33,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 20:52:33,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-11 20:52:33,963 INFO L87 Difference]: Start difference. First operand 184 states and 217 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 5 states have internal predecessors, (39), 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-11 20:52:34,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:52:34,291 INFO L93 Difference]: Finished difference Result 594 states and 718 transitions. [2024-11-11 20:52:34,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-11 20:52:34,291 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 5 states have internal predecessors, (39), 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 46 [2024-11-11 20:52:34,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:52:34,294 INFO L225 Difference]: With dead ends: 594 [2024-11-11 20:52:34,294 INFO L226 Difference]: Without dead ends: 417 [2024-11-11 20:52:34,295 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2024-11-11 20:52:34,296 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 268 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 20:52:34,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 349 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 20:52:34,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2024-11-11 20:52:34,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 353. [2024-11-11 20:52:34,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 268 states have (on average 1.1865671641791045) internal successors, (318), 285 states have internal predecessors, (318), 40 states have call successors, (40), 38 states have call predecessors, (40), 44 states have return successors, (55), 40 states have call predecessors, (55), 40 states have call successors, (55) [2024-11-11 20:52:34,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 413 transitions. [2024-11-11 20:52:34,322 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 413 transitions. Word has length 46 [2024-11-11 20:52:34,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:52:34,322 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 413 transitions. [2024-11-11 20:52:34,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 5 states have internal predecessors, (39), 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-11 20:52:34,322 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 413 transitions. [2024-11-11 20:52:34,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-11 20:52:34,323 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:52:34,323 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:52:34,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 20:52:34,323 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:52:34,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:52:34,324 INFO L85 PathProgramCache]: Analyzing trace with hash 334345555, now seen corresponding path program 1 times [2024-11-11 20:52:34,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:52:34,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5314024] [2024-11-11 20:52:34,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:52:34,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:52:34,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-11 20:52:34,334 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-11 20:52:34,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-11 20:52:34,367 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-11 20:52:34,367 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-11 20:52:34,368 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-11 20:52:34,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 20:52:34,371 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:52:34,409 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-11 20:52:34,410 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.11 08:52:34 BoogieIcfgContainer [2024-11-11 20:52:34,411 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-11 20:52:34,411 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-11 20:52:34,411 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-11 20:52:34,411 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-11 20:52:34,412 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:52:31" (3/4) ... [2024-11-11 20:52:34,413 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-11 20:52:34,475 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-11 20:52:34,475 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-11 20:52:34,477 INFO L158 Benchmark]: Toolchain (without parser) took 3648.10ms. Allocated memory was 136.3MB in the beginning and 182.5MB in the end (delta: 46.1MB). Free memory was 102.4MB in the beginning and 90.2MB in the end (delta: 12.1MB). Peak memory consumption was 60.2MB. Max. memory is 16.1GB. [2024-11-11 20:52:34,477 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 136.3MB. Free memory is still 109.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 20:52:34,478 INFO L158 Benchmark]: CACSL2BoogieTranslator took 398.28ms. Allocated memory is still 136.3MB. Free memory was 101.8MB in the beginning and 80.3MB in the end (delta: 21.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-11 20:52:34,478 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.43ms. Allocated memory is still 136.3MB. Free memory was 80.3MB in the beginning and 78.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-11 20:52:34,478 INFO L158 Benchmark]: Boogie Preprocessor took 57.30ms. Allocated memory is still 136.3MB. Free memory was 78.2MB in the beginning and 76.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-11 20:52:34,478 INFO L158 Benchmark]: RCFGBuilder took 390.72ms. Allocated memory is still 136.3MB. Free memory was 75.7MB in the beginning and 58.2MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-11 20:52:34,478 INFO L158 Benchmark]: TraceAbstraction took 2687.37ms. Allocated memory was 136.3MB in the beginning and 182.5MB in the end (delta: 46.1MB). Free memory was 57.3MB in the beginning and 94.4MB in the end (delta: -37.2MB). Peak memory consumption was 9.9MB. Max. memory is 16.1GB. [2024-11-11 20:52:34,478 INFO L158 Benchmark]: Witness Printer took 65.46ms. Allocated memory is still 182.5MB. Free memory was 94.4MB in the beginning and 90.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-11 20:52:34,479 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.17ms. Allocated memory is still 136.3MB. Free memory is still 109.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 398.28ms. Allocated memory is still 136.3MB. Free memory was 101.8MB in the beginning and 80.3MB in the end (delta: 21.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.43ms. Allocated memory is still 136.3MB. Free memory was 80.3MB in the beginning and 78.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.30ms. Allocated memory is still 136.3MB. Free memory was 78.2MB in the beginning and 76.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 390.72ms. Allocated memory is still 136.3MB. Free memory was 75.7MB in the beginning and 58.2MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2687.37ms. Allocated memory was 136.3MB in the beginning and 182.5MB in the end (delta: 46.1MB). Free memory was 57.3MB in the beginning and 94.4MB in the end (delta: -37.2MB). Peak memory consumption was 9.9MB. Max. memory is 16.1GB. * Witness Printer took 65.46ms. Allocated memory is still 182.5MB. Free memory was 94.4MB in the beginning and 90.2MB in the end (delta: 4.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,"Test.i","") [78] - GenericResultAtLocation [Line: 182]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [182] - GenericResultAtLocation [Line: 548]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [548] - GenericResultAtLocation [Line: 751]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [751] - GenericResultAtLocation [Line: 816]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [816] - GenericResultAtLocation [Line: 851]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [851] - GenericResultAtLocation [Line: 955]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [955] * 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: 960]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L79] int cleanupTimeShifts = 4; [L352] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L555] int pumpRunning = 0; [L556] int systemActive = 1; [L853] int waterLevel = 1; [L854] int methaneLevelCritical = 0; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L160] int retValue_acc ; [L161] int tmp ; [L165] FCALL select_helpers() [L166] FCALL select_features() [L167] CALL, EXPR valid_product() [L843] int retValue_acc ; [L846] retValue_acc = 1 [L847] return (retValue_acc); VAL [\result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L167] RET, EXPR valid_product() [L167] tmp = valid_product() [L169] COND TRUE \read(tmp) [L171] FCALL setup() [L172] CALL runTest() [L151] CALL test() [L753] int splverifierCounter ; [L754] int tmp ; [L755] int tmp___0 ; [L756] int tmp___1 ; [L757] int tmp___2 ; [L760] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L762] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L764] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L770] tmp = __VERIFIER_nondet_int() [L772] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L774] CALL waterRise() VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L871] COND TRUE waterLevel < 2 [L872] waterLevel = waterLevel + 1 VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L774] RET waterRise() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L780] tmp___0 = __VERIFIER_nondet_int() [L782] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L784] CALL changeMethaneLevel() VAL [\old(methaneLevelCritical)=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L883] COND FALSE !(\read(methaneLevelCritical)) [L886] methaneLevelCritical = 1 VAL [\old(methaneLevelCritical)=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L784] RET changeMethaneLevel() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L790] tmp___2 = __VERIFIER_nondet_int() [L792] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L805] CALL timeShift() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L562] COND FALSE !(\read(pumpRunning)) VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L569] COND TRUE \read(systemActive) [L571] CALL processEnvironment() [L617] int tmp ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L620] COND FALSE !(\read(pumpRunning)) VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L635] CALL processEnvironment__wrappee__highWaterSensor() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L591] int tmp ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L594] COND TRUE ! pumpRunning [L596] CALL, EXPR isHighWaterLevel() [L714] int retValue_acc ; [L715] int tmp ; [L716] int tmp___0 ; [L720] CALL, EXPR isHighWaterSensorDry() [L933] int retValue_acc ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L936] COND FALSE !(waterLevel < 2) [L940] retValue_acc = 0 [L941] 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] [L720] RET, EXPR isHighWaterSensorDry() [L720] tmp = isHighWaterSensorDry() [L722] COND FALSE !(\read(tmp)) [L725] 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] [L727] retValue_acc = tmp___0 [L728] 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] [L596] RET, EXPR isHighWaterLevel() [L596] tmp = isHighWaterLevel() [L598] COND TRUE \read(tmp) [L600] CALL activatePump() [L645] pumpRunning = 1 VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L600] RET activatePump() [L635] RET processEnvironment__wrappee__highWaterSensor() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L571] RET processEnvironment() [L577] 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] [L892] int retValue_acc ; [L895] retValue_acc = methaneLevelCritical [L896] 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() [L669] int retValue_acc ; [L672] retValue_acc = pumpRunning [L673] 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() [L960] 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, 86 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.6s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 951 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 924 mSDsluCounter, 2093 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1366 mSDsCounter, 195 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 831 IncrementalHoareTripleChecker+Invalid, 1026 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 195 mSolverCounterUnsat, 727 mSDtfsCounter, 831 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 116 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=353occurred 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.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 82 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 379 NumberOfCodeBlocks, 379 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 320 ConstructedInterpolants, 0 QuantifiedInterpolants, 567 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-11 20:52:34,506 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