./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec2_product35.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/minepump_spec2_product35.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 34d4dbed37590326da938d00ced1aba27649a4f6be46ad5130f0beeedcfaf5dd --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 15:14:00,638 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 15:14:00,694 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 15:14:00,698 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 15:14:00,699 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 15:14:00,718 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 15:14:00,719 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 15:14:00,719 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 15:14:00,720 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 15:14:00,721 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 15:14:00,721 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 15:14:00,721 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 15:14:00,722 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 15:14:00,722 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 15:14:00,722 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 15:14:00,722 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 15:14:00,723 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 15:14:00,723 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 15:14:00,723 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 15:14:00,723 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 15:14:00,723 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 15:14:00,726 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 15:14:00,726 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 15:14:00,727 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 15:14:00,727 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 15:14:00,727 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 15:14:00,727 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 15:14:00,727 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 15:14:00,728 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 15:14:00,728 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 15:14:00,728 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 15:14:00,728 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 15:14:00,728 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 15:14:00,728 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 15:14:00,729 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 15:14:00,729 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 15:14:00,729 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 15:14:00,729 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 15:14:00,729 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 15:14:00,730 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 15:14:00,730 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 15:14:00,731 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 15:14:00,731 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 -> 34d4dbed37590326da938d00ced1aba27649a4f6be46ad5130f0beeedcfaf5dd [2024-11-08 15:14:00,902 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 15:14:00,931 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 15:14:00,937 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 15:14:00,938 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 15:14:00,942 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 15:14:00,943 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec2_product35.cil.c [2024-11-08 15:14:02,229 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 15:14:02,438 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 15:14:02,439 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product35.cil.c [2024-11-08 15:14:02,451 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f2235624/adda8a4200be4b22953c245226814da2/FLAG64b0ee2a8 [2024-11-08 15:14:02,468 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f2235624/adda8a4200be4b22953c245226814da2 [2024-11-08 15:14:02,470 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 15:14:02,472 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 15:14:02,476 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 15:14:02,476 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 15:14:02,484 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 15:14:02,486 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:14:02" (1/1) ... [2024-11-08 15:14:02,488 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75f885ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:14:02, skipping insertion in model container [2024-11-08 15:14:02,489 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:14:02" (1/1) ... [2024-11-08 15:14:02,530 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 15:14:02,915 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_spec2_product35.cil.c[15769,15782] [2024-11-08 15:14:02,939 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 15:14:02,953 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 15:14:02,960 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [49] [2024-11-08 15:14:02,961 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [415] [2024-11-08 15:14:02,961 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [593] [2024-11-08 15:14:02,962 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [663] [2024-11-08 15:14:02,962 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [703] [2024-11-08 15:14:02,962 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [741] [2024-11-08 15:14:02,962 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [750] [2024-11-08 15:14:02,962 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [847] [2024-11-08 15:14:03,017 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_spec2_product35.cil.c[15769,15782] [2024-11-08 15:14:03,025 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 15:14:03,049 INFO L204 MainTranslator]: Completed translation [2024-11-08 15:14:03,049 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:14:03 WrapperNode [2024-11-08 15:14:03,049 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 15:14:03,050 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 15:14:03,050 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 15:14:03,050 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 15:14:03,055 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:14:03" (1/1) ... [2024-11-08 15:14:03,075 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:14:03" (1/1) ... [2024-11-08 15:14:03,092 INFO L138 Inliner]: procedures = 54, calls = 96, calls flagged for inlining = 22, calls inlined = 19, statements flattened = 179 [2024-11-08 15:14:03,094 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 15:14:03,095 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 15:14:03,095 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 15:14:03,095 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 15:14:03,103 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:14:03" (1/1) ... [2024-11-08 15:14:03,104 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:14:03" (1/1) ... [2024-11-08 15:14:03,106 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:14:03" (1/1) ... [2024-11-08 15:14:03,119 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 15:14:03,120 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:14:03" (1/1) ... [2024-11-08 15:14:03,120 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:14:03" (1/1) ... [2024-11-08 15:14:03,123 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:14:03" (1/1) ... [2024-11-08 15:14:03,126 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:14:03" (1/1) ... [2024-11-08 15:14:03,130 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:14:03" (1/1) ... [2024-11-08 15:14:03,131 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:14:03" (1/1) ... [2024-11-08 15:14:03,136 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 15:14:03,137 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 15:14:03,137 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 15:14:03,137 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 15:14:03,138 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:14:03" (1/1) ... [2024-11-08 15:14:03,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 15:14:03,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:14:03,171 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 15:14:03,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 15:14:03,204 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 15:14:03,205 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2024-11-08 15:14:03,205 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2024-11-08 15:14:03,205 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-11-08 15:14:03,205 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-11-08 15:14:03,205 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2024-11-08 15:14:03,205 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2024-11-08 15:14:03,205 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-11-08 15:14:03,205 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-11-08 15:14:03,205 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2024-11-08 15:14:03,205 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2024-11-08 15:14:03,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 15:14:03,205 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2024-11-08 15:14:03,205 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2024-11-08 15:14:03,205 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 15:14:03,206 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 15:14:03,262 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 15:14:03,264 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 15:14:03,462 INFO L? ?]: Removed 36 outVars from TransFormulas that were not future-live. [2024-11-08 15:14:03,462 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 15:14:03,474 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 15:14:03,474 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-08 15:14:03,474 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:14:03 BoogieIcfgContainer [2024-11-08 15:14:03,475 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 15:14:03,476 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 15:14:03,476 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 15:14:03,479 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 15:14:03,479 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 03:14:02" (1/3) ... [2024-11-08 15:14:03,479 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51b03af4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:14:03, skipping insertion in model container [2024-11-08 15:14:03,479 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:14:03" (2/3) ... [2024-11-08 15:14:03,480 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51b03af4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:14:03, skipping insertion in model container [2024-11-08 15:14:03,480 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:14:03" (3/3) ... [2024-11-08 15:14:03,481 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec2_product35.cil.c [2024-11-08 15:14:03,493 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 15:14:03,494 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 15:14:03,536 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 15:14:03,541 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;@5edae5f8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 15:14:03,541 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 15:14:03,549 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 63 states have (on average 1.3968253968253967) internal successors, (88), 69 states have internal predecessors, (88), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-08 15:14:03,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-08 15:14:03,562 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:14:03,562 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:14:03,563 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:14:03,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:14:03,568 INFO L85 PathProgramCache]: Analyzing trace with hash -479738916, now seen corresponding path program 1 times [2024-11-08 15:14:03,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:14:03,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900800162] [2024-11-08 15:14:03,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:14:03,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:14:03,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:03,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 15:14:03,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:03,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:14:03,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:14:03,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900800162] [2024-11-08 15:14:03,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900800162] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:14:03,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:14:03,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 15:14:03,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28228002] [2024-11-08 15:14:03,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:14:03,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 15:14:03,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:14:03,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 15:14:03,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 15:14:03,809 INFO L87 Difference]: Start difference. First operand has 80 states, 63 states have (on average 1.3968253968253967) internal successors, (88), 69 states have internal predecessors, (88), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 15:14:03,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:14:03,831 INFO L93 Difference]: Finished difference Result 151 states and 206 transitions. [2024-11-08 15:14:03,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 15:14:03,832 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2024-11-08 15:14:03,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:14:03,838 INFO L225 Difference]: With dead ends: 151 [2024-11-08 15:14:03,839 INFO L226 Difference]: Without dead ends: 71 [2024-11-08 15:14:03,841 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 15:14:03,844 INFO L432 NwaCegarLoop]: 100 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, 100 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:14:03,844 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:14:03,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-08 15:14:03,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-11-08 15:14:03,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 56 states have (on average 1.3214285714285714) internal successors, (74), 61 states have internal predecessors, (74), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-08 15:14:03,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 91 transitions. [2024-11-08 15:14:03,875 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 91 transitions. Word has length 25 [2024-11-08 15:14:03,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:14:03,875 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 91 transitions. [2024-11-08 15:14:03,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 15:14:03,875 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 91 transitions. [2024-11-08 15:14:03,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-08 15:14:03,877 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:14:03,877 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:14:03,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 15:14:03,877 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:14:03,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:14:03,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1989794732, now seen corresponding path program 1 times [2024-11-08 15:14:03,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:14:03,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400359284] [2024-11-08 15:14:03,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:14:03,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:14:03,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:03,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 15:14:03,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:03,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:14:03,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:14:03,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400359284] [2024-11-08 15:14:03,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400359284] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:14:03,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:14:03,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:14:03,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423209886] [2024-11-08 15:14:03,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:14:03,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:14:03,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:14:03,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:14:03,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:14:03,963 INFO L87 Difference]: Start difference. First operand 71 states and 91 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 15:14:03,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:14:03,973 INFO L93 Difference]: Finished difference Result 103 states and 132 transitions. [2024-11-08 15:14:03,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:14:03,974 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 26 [2024-11-08 15:14:03,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:14:03,975 INFO L225 Difference]: With dead ends: 103 [2024-11-08 15:14:03,975 INFO L226 Difference]: Without dead ends: 62 [2024-11-08 15:14:03,976 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:14:03,977 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 17 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:14:03,977 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 135 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:14:03,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-08 15:14:03,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-11-08 15:14:03,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 50 states have (on average 1.34) internal successors, (67), 55 states have internal predecessors, (67), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 15:14:03,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 79 transitions. [2024-11-08 15:14:03,984 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 79 transitions. Word has length 26 [2024-11-08 15:14:03,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:14:03,984 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 79 transitions. [2024-11-08 15:14:03,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 15:14:03,984 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 79 transitions. [2024-11-08 15:14:03,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-08 15:14:03,985 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:14:03,985 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:14:03,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 15:14:03,985 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:14:03,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:14:03,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1216244594, now seen corresponding path program 1 times [2024-11-08 15:14:03,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:14:03,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724362111] [2024-11-08 15:14:03,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:14:03,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:14:04,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:04,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 15:14:04,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:04,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:14:04,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:14:04,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724362111] [2024-11-08 15:14:04,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724362111] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:14:04,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:14:04,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:14:04,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108816937] [2024-11-08 15:14:04,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:14:04,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:14:04,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:14:04,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:14:04,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:14:04,065 INFO L87 Difference]: Start difference. First operand 62 states and 79 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 15:14:04,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:14:04,086 INFO L93 Difference]: Finished difference Result 169 states and 221 transitions. [2024-11-08 15:14:04,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:14:04,086 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2024-11-08 15:14:04,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:14:04,088 INFO L225 Difference]: With dead ends: 169 [2024-11-08 15:14:04,088 INFO L226 Difference]: Without dead ends: 115 [2024-11-08 15:14:04,088 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:14:04,089 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 58 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:14:04,090 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 163 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:14:04,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-08 15:14:04,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 110. [2024-11-08 15:14:04,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 87 states have (on average 1.367816091954023) internal successors, (119), 96 states have internal predecessors, (119), 12 states have call successors, (12), 10 states have call predecessors, (12), 10 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 15:14:04,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 143 transitions. [2024-11-08 15:14:04,103 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 143 transitions. Word has length 30 [2024-11-08 15:14:04,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:14:04,103 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 143 transitions. [2024-11-08 15:14:04,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 15:14:04,103 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 143 transitions. [2024-11-08 15:14:04,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-08 15:14:04,105 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:14:04,105 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:14:04,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 15:14:04,105 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:14:04,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:14:04,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1180659967, now seen corresponding path program 1 times [2024-11-08 15:14:04,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:14:04,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285615028] [2024-11-08 15:14:04,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:14:04,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:14:04,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:04,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 15:14:04,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:04,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 15:14:04,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:04,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:14:04,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:14:04,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285615028] [2024-11-08 15:14:04,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285615028] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:14:04,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:14:04,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:14:04,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736194679] [2024-11-08 15:14:04,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:14:04,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:14:04,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:14:04,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:14:04,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:14:04,144 INFO L87 Difference]: Start difference. First operand 110 states and 143 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-08 15:14:04,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:14:04,173 INFO L93 Difference]: Finished difference Result 289 states and 384 transitions. [2024-11-08 15:14:04,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:14:04,174 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2024-11-08 15:14:04,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:14:04,175 INFO L225 Difference]: With dead ends: 289 [2024-11-08 15:14:04,175 INFO L226 Difference]: Without dead ends: 187 [2024-11-08 15:14:04,176 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:14:04,177 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 67 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:14:04,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 126 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:14:04,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-11-08 15:14:04,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 185. [2024-11-08 15:14:04,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 144 states have (on average 1.3541666666666667) internal successors, (195), 155 states have internal predecessors, (195), 20 states have call successors, (20), 20 states have call predecessors, (20), 20 states have return successors, (24), 20 states have call predecessors, (24), 20 states have call successors, (24) [2024-11-08 15:14:04,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 239 transitions. [2024-11-08 15:14:04,210 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 239 transitions. Word has length 35 [2024-11-08 15:14:04,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:14:04,210 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 239 transitions. [2024-11-08 15:14:04,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-08 15:14:04,210 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 239 transitions. [2024-11-08 15:14:04,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-08 15:14:04,211 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:14:04,211 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:14:04,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 15:14:04,212 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:14:04,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:14:04,216 INFO L85 PathProgramCache]: Analyzing trace with hash 451554397, now seen corresponding path program 1 times [2024-11-08 15:14:04,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:14:04,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630586391] [2024-11-08 15:14:04,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:14:04,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:14:04,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:04,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-08 15:14:04,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:04,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:14:04,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:14:04,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630586391] [2024-11-08 15:14:04,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630586391] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:14:04,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:14:04,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 15:14:04,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163884990] [2024-11-08 15:14:04,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:14:04,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:14:04,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:14:04,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:14:04,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:14:04,344 INFO L87 Difference]: Start difference. First operand 185 states and 239 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 15:14:04,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:14:04,417 INFO L93 Difference]: Finished difference Result 360 states and 470 transitions. [2024-11-08 15:14:04,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:14:04,418 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), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2024-11-08 15:14:04,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:14:04,419 INFO L225 Difference]: With dead ends: 360 [2024-11-08 15:14:04,419 INFO L226 Difference]: Without dead ends: 183 [2024-11-08 15:14:04,420 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 15:14:04,421 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 60 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:14:04,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 269 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:14:04,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-08 15:14:04,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2024-11-08 15:14:04,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 142 states have (on average 1.3309859154929577) internal successors, (189), 153 states have internal predecessors, (189), 20 states have call successors, (20), 20 states have call predecessors, (20), 20 states have return successors, (24), 20 states have call predecessors, (24), 20 states have call successors, (24) [2024-11-08 15:14:04,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 233 transitions. [2024-11-08 15:14:04,442 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 233 transitions. Word has length 34 [2024-11-08 15:14:04,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:14:04,443 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 233 transitions. [2024-11-08 15:14:04,443 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), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 15:14:04,443 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 233 transitions. [2024-11-08 15:14:04,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-08 15:14:04,446 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:14:04,446 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:14:04,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 15:14:04,446 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:14:04,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:14:04,447 INFO L85 PathProgramCache]: Analyzing trace with hash 967117538, now seen corresponding path program 1 times [2024-11-08 15:14:04,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:14:04,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681074922] [2024-11-08 15:14:04,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:14:04,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:14:04,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:04,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 15:14:04,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:04,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:14:04,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:14:04,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681074922] [2024-11-08 15:14:04,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681074922] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:14:04,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:14:04,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 15:14:04,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808508546] [2024-11-08 15:14:04,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:14:04,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:14:04,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:14:04,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:14:04,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:14:04,544 INFO L87 Difference]: Start difference. First operand 183 states and 233 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 15:14:04,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:14:04,575 INFO L93 Difference]: Finished difference Result 364 states and 470 transitions. [2024-11-08 15:14:04,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:14:04,576 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2024-11-08 15:14:04,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:14:04,579 INFO L225 Difference]: With dead ends: 364 [2024-11-08 15:14:04,580 INFO L226 Difference]: Without dead ends: 189 [2024-11-08 15:14:04,581 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:14:04,581 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:14:04,582 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 297 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:14:04,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-11-08 15:14:04,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2024-11-08 15:14:04,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 148 states have (on average 1.3175675675675675) internal successors, (195), 159 states have internal predecessors, (195), 20 states have call successors, (20), 20 states have call predecessors, (20), 20 states have return successors, (24), 20 states have call predecessors, (24), 20 states have call successors, (24) [2024-11-08 15:14:04,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 239 transitions. [2024-11-08 15:14:04,600 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 239 transitions. Word has length 39 [2024-11-08 15:14:04,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:14:04,600 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 239 transitions. [2024-11-08 15:14:04,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 15:14:04,601 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 239 transitions. [2024-11-08 15:14:04,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-08 15:14:04,605 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:14:04,605 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:14:04,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 15:14:04,605 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:14:04,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:14:04,606 INFO L85 PathProgramCache]: Analyzing trace with hash -621230364, now seen corresponding path program 1 times [2024-11-08 15:14:04,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:14:04,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147253978] [2024-11-08 15:14:04,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:14:04,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:14:04,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:04,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 15:14:04,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:04,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:14:04,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:14:04,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147253978] [2024-11-08 15:14:04,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147253978] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:14:04,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:14:04,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 15:14:04,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465001110] [2024-11-08 15:14:04,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:14:04,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:14:04,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:14:04,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:14:04,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:14:04,672 INFO L87 Difference]: Start difference. First operand 189 states and 239 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 15:14:04,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:14:04,707 INFO L93 Difference]: Finished difference Result 380 states and 490 transitions. [2024-11-08 15:14:04,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 15:14:04,708 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 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 39 [2024-11-08 15:14:04,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:14:04,710 INFO L225 Difference]: With dead ends: 380 [2024-11-08 15:14:04,710 INFO L226 Difference]: Without dead ends: 199 [2024-11-08 15:14:04,711 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 15:14:04,712 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 60 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:14:04,714 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 327 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:14:04,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-11-08 15:14:04,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 193. [2024-11-08 15:14:04,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 152 states have (on average 1.3092105263157894) internal successors, (199), 163 states have internal predecessors, (199), 20 states have call successors, (20), 20 states have call predecessors, (20), 20 states have return successors, (24), 20 states have call predecessors, (24), 20 states have call successors, (24) [2024-11-08 15:14:04,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 243 transitions. [2024-11-08 15:14:04,726 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 243 transitions. Word has length 39 [2024-11-08 15:14:04,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:14:04,727 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 243 transitions. [2024-11-08 15:14:04,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 15:14:04,727 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 243 transitions. [2024-11-08 15:14:04,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-08 15:14:04,729 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:14:04,729 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:14:04,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 15:14:04,730 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:14:04,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:14:04,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1984793190, now seen corresponding path program 1 times [2024-11-08 15:14:04,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:14:04,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509230284] [2024-11-08 15:14:04,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:14:04,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:14:04,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:04,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 15:14:04,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:04,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:14:04,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:14:04,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509230284] [2024-11-08 15:14:04,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509230284] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:14:04,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:14:04,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:14:04,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285412247] [2024-11-08 15:14:04,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:14:04,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:14:04,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:14:04,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:14:04,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:14:04,789 INFO L87 Difference]: Start difference. First operand 193 states and 243 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 15:14:04,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:14:04,811 INFO L93 Difference]: Finished difference Result 463 states and 588 transitions. [2024-11-08 15:14:04,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:14:04,812 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 39 [2024-11-08 15:14:04,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:14:04,814 INFO L225 Difference]: With dead ends: 463 [2024-11-08 15:14:04,816 INFO L226 Difference]: Without dead ends: 278 [2024-11-08 15:14:04,817 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:14:04,818 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 38 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:14:04,818 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 142 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:14:04,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2024-11-08 15:14:04,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2024-11-08 15:14:04,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 219 states have (on average 1.273972602739726) internal successors, (279), 232 states have internal predecessors, (279), 30 states have call successors, (30), 30 states have call predecessors, (30), 28 states have return successors, (34), 28 states have call predecessors, (34), 30 states have call successors, (34) [2024-11-08 15:14:04,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 343 transitions. [2024-11-08 15:14:04,836 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 343 transitions. Word has length 39 [2024-11-08 15:14:04,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:14:04,837 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 343 transitions. [2024-11-08 15:14:04,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 15:14:04,837 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 343 transitions. [2024-11-08 15:14:04,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-08 15:14:04,838 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:14:04,838 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:14:04,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 15:14:04,838 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:14:04,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:14:04,840 INFO L85 PathProgramCache]: Analyzing trace with hash 819581964, now seen corresponding path program 1 times [2024-11-08 15:14:04,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:14:04,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382666915] [2024-11-08 15:14:04,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:14:04,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:14:04,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:04,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 15:14:04,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:04,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 15:14:04,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:04,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:14:04,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:14:04,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382666915] [2024-11-08 15:14:04,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382666915] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:14:04,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:14:04,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:14:04,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991075951] [2024-11-08 15:14:04,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:14:04,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 15:14:04,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:14:04,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 15:14:04,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:14:04,917 INFO L87 Difference]: Start difference. First operand 278 states and 343 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-08 15:14:05,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:14:05,054 INFO L93 Difference]: Finished difference Result 580 states and 745 transitions. [2024-11-08 15:14:05,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:14:05,055 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 43 [2024-11-08 15:14:05,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:14:05,058 INFO L225 Difference]: With dead ends: 580 [2024-11-08 15:14:05,058 INFO L226 Difference]: Without dead ends: 578 [2024-11-08 15:14:05,058 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:14:05,059 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 123 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:14:05,059 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 188 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:14:05,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2024-11-08 15:14:05,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 506. [2024-11-08 15:14:05,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 406 states have (on average 1.2980295566502462) internal successors, (527), 437 states have internal predecessors, (527), 53 states have call successors, (53), 41 states have call predecessors, (53), 46 states have return successors, (81), 50 states have call predecessors, (81), 53 states have call successors, (81) [2024-11-08 15:14:05,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 661 transitions. [2024-11-08 15:14:05,091 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 661 transitions. Word has length 43 [2024-11-08 15:14:05,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:14:05,091 INFO L471 AbstractCegarLoop]: Abstraction has 506 states and 661 transitions. [2024-11-08 15:14:05,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-08 15:14:05,092 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 661 transitions. [2024-11-08 15:14:05,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-08 15:14:05,094 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:14:05,094 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:14:05,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 15:14:05,094 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:14:05,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:14:05,095 INFO L85 PathProgramCache]: Analyzing trace with hash -239993361, now seen corresponding path program 1 times [2024-11-08 15:14:05,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:14:05,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419956758] [2024-11-08 15:14:05,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:14:05,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:14:05,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:05,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 15:14:05,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:05,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 15:14:05,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:05,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 15:14:05,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:05,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 15:14:05,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:05,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 15:14:05,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:05,336 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 15:14:05,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:14:05,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419956758] [2024-11-08 15:14:05,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419956758] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:14:05,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [340673631] [2024-11-08 15:14:05,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:14:05,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:14:05,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:14:05,343 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 15:14:05,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 15:14:05,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:14:05,455 INFO L255 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-08 15:14:05,468 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:14:05,682 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-08 15:14:05,682 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:14:05,842 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-08 15:14:05,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [340673631] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 15:14:05,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-08 15:14:05,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9, 5] total 13 [2024-11-08 15:14:05,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639024882] [2024-11-08 15:14:05,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:14:05,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 15:14:05,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:14:05,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 15:14:05,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-11-08 15:14:05,843 INFO L87 Difference]: Start difference. First operand 506 states and 661 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 15:14:05,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:14:05,967 INFO L93 Difference]: Finished difference Result 1428 states and 1914 transitions. [2024-11-08 15:14:05,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 15:14:05,968 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 74 [2024-11-08 15:14:05,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:14:05,972 INFO L225 Difference]: With dead ends: 1428 [2024-11-08 15:14:05,973 INFO L226 Difference]: Without dead ends: 930 [2024-11-08 15:14:05,974 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 150 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-11-08 15:14:05,975 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 42 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:14:05,975 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 351 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:14:05,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states. [2024-11-08 15:14:06,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 834. [2024-11-08 15:14:06,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 834 states, 660 states have (on average 1.2636363636363637) internal successors, (834), 713 states have internal predecessors, (834), 91 states have call successors, (91), 71 states have call predecessors, (91), 82 states have return successors, (137), 86 states have call predecessors, (137), 91 states have call successors, (137) [2024-11-08 15:14:06,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 1062 transitions. [2024-11-08 15:14:06,037 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 1062 transitions. Word has length 74 [2024-11-08 15:14:06,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:14:06,038 INFO L471 AbstractCegarLoop]: Abstraction has 834 states and 1062 transitions. [2024-11-08 15:14:06,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 15:14:06,038 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1062 transitions. [2024-11-08 15:14:06,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-08 15:14:06,040 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:14:06,041 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:14:06,055 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 15:14:06,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-08 15:14:06,245 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:14:06,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:14:06,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1936900565, now seen corresponding path program 1 times [2024-11-08 15:14:06,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:14:06,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724541816] [2024-11-08 15:14:06,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:14:06,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:14:06,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 15:14:06,256 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 15:14:06,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 15:14:06,281 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 15:14:06,281 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 15:14:06,282 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 15:14:06,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 15:14:06,285 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:14:06,325 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 15:14:06,327 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 03:14:06 BoogieIcfgContainer [2024-11-08 15:14:06,327 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 15:14:06,327 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 15:14:06,327 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 15:14:06,327 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 15:14:06,328 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:14:03" (3/4) ... [2024-11-08 15:14:06,328 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-08 15:14:06,392 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 15:14:06,392 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 15:14:06,393 INFO L158 Benchmark]: Toolchain (without parser) took 3921.10ms. Allocated memory was 188.7MB in the beginning and 320.9MB in the end (delta: 132.1MB). Free memory was 119.3MB in the beginning and 265.4MB in the end (delta: -146.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 15:14:06,393 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 188.7MB. Free memory is still 147.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 15:14:06,393 INFO L158 Benchmark]: CACSL2BoogieTranslator took 573.56ms. Allocated memory is still 188.7MB. Free memory was 119.1MB in the beginning and 152.0MB in the end (delta: -32.9MB). Peak memory consumption was 14.6MB. Max. memory is 16.1GB. [2024-11-08 15:14:06,393 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.01ms. Allocated memory is still 188.7MB. Free memory was 151.8MB in the beginning and 149.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 15:14:06,393 INFO L158 Benchmark]: Boogie Preprocessor took 41.28ms. Allocated memory is still 188.7MB. Free memory was 149.7MB in the beginning and 146.7MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 15:14:06,394 INFO L158 Benchmark]: RCFGBuilder took 337.85ms. Allocated memory is still 188.7MB. Free memory was 146.7MB in the beginning and 129.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 15:14:06,394 INFO L158 Benchmark]: TraceAbstraction took 2850.97ms. Allocated memory was 188.7MB in the beginning and 320.9MB in the end (delta: 132.1MB). Free memory was 128.9MB in the beginning and 272.7MB in the end (delta: -143.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 15:14:06,394 INFO L158 Benchmark]: Witness Printer took 64.96ms. Allocated memory is still 320.9MB. Free memory was 272.7MB in the beginning and 265.4MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 15:14:06,395 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.12ms. Allocated memory is still 188.7MB. Free memory is still 147.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 573.56ms. Allocated memory is still 188.7MB. Free memory was 119.1MB in the beginning and 152.0MB in the end (delta: -32.9MB). Peak memory consumption was 14.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.01ms. Allocated memory is still 188.7MB. Free memory was 151.8MB in the beginning and 149.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.28ms. Allocated memory is still 188.7MB. Free memory was 149.7MB in the beginning and 146.7MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 337.85ms. Allocated memory is still 188.7MB. Free memory was 146.7MB in the beginning and 129.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2850.97ms. Allocated memory was 188.7MB in the beginning and 320.9MB in the end (delta: 132.1MB). Free memory was 128.9MB in the beginning and 272.7MB in the end (delta: -143.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 64.96ms. Allocated memory is still 320.9MB. Free memory was 272.7MB in the beginning and 265.4MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 49]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [49] - GenericResultAtLocation [Line: 415]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [415] - GenericResultAtLocation [Line: 593]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [593] - GenericResultAtLocation [Line: 663]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [663] - GenericResultAtLocation [Line: 703]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [703] - GenericResultAtLocation [Line: 741]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [741] - GenericResultAtLocation [Line: 750]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [750] - GenericResultAtLocation [Line: 847]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [847] * 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: 746]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L219] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L426] int pumpRunning = 0; [L427] int systemActive = 1; [L665] int methAndRunningLastTime ; [L751] int cleanupTimeShifts = 4; [L849] int waterLevel = 1; [L850] int methaneLevelCritical = 0; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L825] int retValue_acc ; [L826] int tmp ; [L830] FCALL select_helpers() [L831] FCALL select_features() [L832] CALL, EXPR valid_product() [L733] int retValue_acc ; [L736] retValue_acc = 1 [L737] return (retValue_acc); VAL [\result=1, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L832] RET, EXPR valid_product() [L832] tmp = valid_product() [L834] COND TRUE \read(tmp) [L836] FCALL setup() [L837] CALL runTest() [L818] CALL __utac_acc__Specification2_spec__1() [L670] methAndRunningLastTime = 0 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L818] RET __utac_acc__Specification2_spec__1() [L819] CALL test() [L598] int splverifierCounter ; [L599] int tmp ; [L600] int tmp___0 ; [L601] int tmp___1 ; [L602] int tmp___2 ; [L605] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L607] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L609] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L615] tmp = __VERIFIER_nondet_int() [L617] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L619] CALL waterRise() VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L867] COND TRUE waterLevel < 2 [L868] waterLevel = waterLevel + 1 VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L619] RET waterRise() VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L625] tmp___0 = __VERIFIER_nondet_int() [L627] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L629] CALL changeMethaneLevel() VAL [\old(methaneLevelCritical)=0, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L879] COND FALSE !(\read(methaneLevelCritical)) [L882] methaneLevelCritical = 1 VAL [\old(methaneLevelCritical)=0, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L629] RET changeMethaneLevel() VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L635] tmp___2 = __VERIFIER_nondet_int() [L637] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L652] CALL timeShift() VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L434] COND FALSE !(\read(pumpRunning)) VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L441] COND TRUE \read(systemActive) [L443] CALL processEnvironment() [L463] int tmp ; VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L466] COND TRUE ! pumpRunning [L468] CALL, EXPR isHighWaterLevel() [L560] int retValue_acc ; [L561] int tmp ; [L562] int tmp___0 ; [L566] CALL, EXPR isHighWaterSensorDry() [L929] int retValue_acc ; VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L932] COND FALSE !(waterLevel < 2) [L936] retValue_acc = 0 [L937] return (retValue_acc); VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, \result=0, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L566] RET, EXPR isHighWaterSensorDry() [L566] tmp = isHighWaterSensorDry() [L568] COND FALSE !(\read(tmp)) [L571] tmp___0 = 1 VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, tmp___0=1, waterLevel=2] [L573] retValue_acc = tmp___0 [L574] return (retValue_acc); VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, \result=1, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L468] RET, EXPR isHighWaterLevel() [L468] tmp = isHighWaterLevel() [L470] COND TRUE \read(tmp) [L472] CALL activatePump() [L491] pumpRunning = 1 VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L472] RET activatePump() [L443] RET processEnvironment() [L449] CALL __utac_acc__Specification2_spec__2() [L675] int tmp ; [L676] int tmp___0 ; VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L680] CALL, EXPR isMethaneLevelCritical() VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L888] int retValue_acc ; [L891] retValue_acc = methaneLevelCritical [L892] return (retValue_acc); VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, \result=1, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L680] RET, EXPR isMethaneLevelCritical() VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L680] tmp = isMethaneLevelCritical() [L682] COND TRUE \read(tmp) [L684] CALL, EXPR isPumpRunning() [L515] int retValue_acc ; [L518] retValue_acc = pumpRunning [L519] return (retValue_acc); VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, \result=1, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L684] RET, EXPR isPumpRunning() [L684] tmp___0 = isPumpRunning() [L686] COND TRUE \read(tmp___0) VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L687] COND FALSE !(\read(methAndRunningLastTime)) [L692] methAndRunningLastTime = 1 VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L449] RET __utac_acc__Specification2_spec__2() [L652] RET timeShift() VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L607] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L609] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L615] tmp = __VERIFIER_nondet_int() [L617] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L625] tmp___0 = __VERIFIER_nondet_int() [L627] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L635] tmp___2 = __VERIFIER_nondet_int() [L637] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L652] CALL timeShift() VAL [\old(methAndRunningLastTime)=1, \old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L434] COND TRUE \read(pumpRunning) [L436] CALL lowerWaterLevel() [L855] COND TRUE waterLevel > 0 [L856] waterLevel = waterLevel - 1 VAL [\old(methAndRunningLastTime)=1, \old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L436] RET lowerWaterLevel() [L441] COND TRUE \read(systemActive) [L443] CALL processEnvironment() [L463] int tmp ; VAL [\old(methAndRunningLastTime)=1, \old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L466] COND FALSE !(! pumpRunning) VAL [\old(methAndRunningLastTime)=1, \old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L481] FCALL processEnvironment__wrappee__base() VAL [\old(methAndRunningLastTime)=1, \old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L443] RET processEnvironment() [L449] CALL __utac_acc__Specification2_spec__2() [L675] int tmp ; [L676] int tmp___0 ; VAL [\old(methAndRunningLastTime)=1, \old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L680] CALL, EXPR isMethaneLevelCritical() VAL [\old(methAndRunningLastTime)=1, \old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L888] int retValue_acc ; [L891] retValue_acc = methaneLevelCritical [L892] return (retValue_acc); VAL [\old(methAndRunningLastTime)=1, \old(pumpRunning)=1, \old(waterLevel)=2, \result=1, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L680] RET, EXPR isMethaneLevelCritical() VAL [\old(methAndRunningLastTime)=1, \old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L680] tmp = isMethaneLevelCritical() [L682] COND TRUE \read(tmp) [L684] CALL, EXPR isPumpRunning() [L515] int retValue_acc ; [L518] retValue_acc = pumpRunning [L519] return (retValue_acc); VAL [\old(methAndRunningLastTime)=1, \old(pumpRunning)=1, \old(waterLevel)=2, \result=1, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L684] RET, EXPR isPumpRunning() [L684] tmp___0 = isPumpRunning() [L686] COND TRUE \read(tmp___0) VAL [\old(methAndRunningLastTime)=1, \old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L687] COND TRUE \read(methAndRunningLastTime) [L689] CALL __automaton_fail() [L746] reach_error() VAL [\old(methAndRunningLastTime)=1, \old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 80 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.8s, OverallIterations: 11, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 475 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 465 mSDsluCounter, 2098 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1285 mSDsCounter, 44 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 170 IncrementalHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 44 mSolverCounterUnsat, 813 mSDtfsCounter, 170 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 224 GetRequests, 190 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=834occurred in iteration=10, InterpolantAutomatonStates: 43, 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, 10 MinimizatonAttempts, 181 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 536 NumberOfCodeBlocks, 536 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 520 ConstructedInterpolants, 0 QuantifiedInterpolants, 1031 SizeOfPredicates, 1 NumberOfNonLiveVariables, 264 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 12 InterpolantComputations, 10 PerfectInterpolantSequences, 65/69 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-08 15:14:06,427 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE