./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product44.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product44.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 cb53e49317620dbde25b1d7f6fa7078b4950e13e4d138c624b27be1c4ee0f3ad --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-19 22:04:46,839 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 22:04:46,910 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 22:04:46,919 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 22:04:46,920 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 22:04:46,945 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 22:04:46,945 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 22:04:46,946 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 22:04:46,946 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 22:04:46,950 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 22:04:46,950 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 22:04:46,950 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 22:04:46,951 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 22:04:46,951 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 22:04:46,951 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 22:04:46,952 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 22:04:46,952 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 22:04:46,952 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 22:04:46,952 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 22:04:46,953 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 22:04:46,953 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 22:04:46,955 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 22:04:46,955 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 22:04:46,955 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 22:04:46,955 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 22:04:46,956 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 22:04:46,956 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 22:04:46,956 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 22:04:46,956 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 22:04:46,957 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 22:04:46,957 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 22:04:46,957 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 22:04:46,957 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 22:04:46,957 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 22:04:46,958 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 22:04:46,958 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 22:04:46,960 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 22:04:46,960 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 22:04:46,960 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 22:04:46,960 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 22:04:46,960 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 22:04:46,961 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 22:04:46,961 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 -> cb53e49317620dbde25b1d7f6fa7078b4950e13e4d138c624b27be1c4ee0f3ad [2024-11-19 22:04:47,198 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 22:04:47,223 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 22:04:47,226 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 22:04:47,227 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 22:04:47,228 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 22:04:47,229 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product44.cil.c [2024-11-19 22:04:48,670 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 22:04:48,886 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 22:04:48,887 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product44.cil.c [2024-11-19 22:04:48,906 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d12cfcbb/4cd5364a7d9847f5ab30ebed5d9c1e73/FLAG6caa79d40 [2024-11-19 22:04:49,231 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d12cfcbb/4cd5364a7d9847f5ab30ebed5d9c1e73 [2024-11-19 22:04:49,233 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 22:04:49,235 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 22:04:49,237 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 22:04:49,237 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 22:04:49,243 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 22:04:49,243 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:04:49" (1/1) ... [2024-11-19 22:04:49,244 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74b91e9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:49, skipping insertion in model container [2024-11-19 22:04:49,244 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:04:49" (1/1) ... [2024-11-19 22:04:49,294 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 22:04:49,468 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product44.cil.c[1605,1618] [2024-11-19 22:04:49,594 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 22:04:49,604 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 22:04:49,613 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [49] [2024-11-19 22:04:49,614 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [58] [2024-11-19 22:04:49,614 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [424] [2024-11-19 22:04:49,614 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [499] [2024-11-19 22:04:49,614 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [701] [2024-11-19 22:04:49,615 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification1_spec.i","") [796] [2024-11-19 22:04:49,615 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [822] [2024-11-19 22:04:49,615 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [860] [2024-11-19 22:04:49,621 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product44.cil.c[1605,1618] [2024-11-19 22:04:49,691 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 22:04:49,720 INFO L204 MainTranslator]: Completed translation [2024-11-19 22:04:49,721 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:49 WrapperNode [2024-11-19 22:04:49,721 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 22:04:49,722 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 22:04:49,722 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 22:04:49,722 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 22:04:49,729 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:49" (1/1) ... [2024-11-19 22:04:49,745 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:49" (1/1) ... [2024-11-19 22:04:49,774 INFO L138 Inliner]: procedures = 55, calls = 98, calls flagged for inlining = 24, calls inlined = 21, statements flattened = 191 [2024-11-19 22:04:49,775 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 22:04:49,776 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 22:04:49,776 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 22:04:49,776 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 22:04:49,786 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:49" (1/1) ... [2024-11-19 22:04:49,786 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:49" (1/1) ... [2024-11-19 22:04:49,788 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:49" (1/1) ... [2024-11-19 22:04:49,799 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-19 22:04:49,800 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:49" (1/1) ... [2024-11-19 22:04:49,800 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:49" (1/1) ... [2024-11-19 22:04:49,805 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:49" (1/1) ... [2024-11-19 22:04:49,811 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:49" (1/1) ... [2024-11-19 22:04:49,812 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:49" (1/1) ... [2024-11-19 22:04:49,813 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:49" (1/1) ... [2024-11-19 22:04:49,817 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 22:04:49,817 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 22:04:49,818 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 22:04:49,819 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 22:04:49,820 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:49" (1/1) ... [2024-11-19 22:04:49,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 22:04:49,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:04:49,868 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-19 22:04:49,872 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-19 22:04:49,913 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 22:04:49,913 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2024-11-19 22:04:49,914 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2024-11-19 22:04:49,914 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2024-11-19 22:04:49,914 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2024-11-19 22:04:49,914 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-11-19 22:04:49,914 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-11-19 22:04:49,914 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-11-19 22:04:49,915 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-11-19 22:04:49,915 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2024-11-19 22:04:49,915 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2024-11-19 22:04:49,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 22:04:49,915 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2024-11-19 22:04:49,915 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2024-11-19 22:04:49,916 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 22:04:49,916 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 22:04:49,976 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 22:04:49,978 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 22:04:50,197 INFO L? ?]: Removed 40 outVars from TransFormulas that were not future-live. [2024-11-19 22:04:50,197 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 22:04:50,214 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 22:04:50,215 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-19 22:04:50,216 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:04:50 BoogieIcfgContainer [2024-11-19 22:04:50,216 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 22:04:50,218 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 22:04:50,219 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 22:04:50,223 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 22:04:50,223 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 10:04:49" (1/3) ... [2024-11-19 22:04:50,224 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a6973a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:04:50, skipping insertion in model container [2024-11-19 22:04:50,224 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:49" (2/3) ... [2024-11-19 22:04:50,225 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a6973a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:04:50, skipping insertion in model container [2024-11-19 22:04:50,225 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:04:50" (3/3) ... [2024-11-19 22:04:50,226 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec1_product44.cil.c [2024-11-19 22:04:50,238 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 22:04:50,238 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 22:04:50,289 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 22:04:50,295 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;@134f07ef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 22:04:50,296 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 22:04:50,299 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 66 states have (on average 1.378787878787879) internal successors, (91), 72 states have internal predecessors, (91), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-19 22:04:50,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-19 22:04:50,308 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:04:50,308 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:04:50,309 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:04:50,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:04:50,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1891059469, now seen corresponding path program 1 times [2024-11-19 22:04:50,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:04:50,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404095681] [2024-11-19 22:04:50,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:04:50,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:04:50,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:04:50,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-19 22:04:50,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:04:50,595 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-19 22:04:50,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:04:50,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404095681] [2024-11-19 22:04:50,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404095681] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:04:50,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:04:50,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 22:04:50,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570506287] [2024-11-19 22:04:50,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:04:50,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 22:04:50,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:04:50,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 22:04:50,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 22:04:50,634 INFO L87 Difference]: Start difference. First operand has 84 states, 66 states have (on average 1.378787878787879) internal successors, (91), 72 states have internal predecessors, (91), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 22:04:50,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:04:50,666 INFO L93 Difference]: Finished difference Result 160 states and 217 transitions. [2024-11-19 22:04:50,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 22:04:50,668 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2024-11-19 22:04:50,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:04:50,678 INFO L225 Difference]: With dead ends: 160 [2024-11-19 22:04:50,679 INFO L226 Difference]: Without dead ends: 75 [2024-11-19 22:04:50,683 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-19 22:04:50,688 INFO L432 NwaCegarLoop]: 105 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, 105 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-19 22:04:50,689 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:04:50,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-19 22:04:50,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-11-19 22:04:50,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 59 states have (on average 1.305084745762712) internal successors, (77), 64 states have internal predecessors, (77), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-19 22:04:50,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 96 transitions. [2024-11-19 22:04:50,739 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 96 transitions. Word has length 23 [2024-11-19 22:04:50,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:04:50,740 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 96 transitions. [2024-11-19 22:04:50,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 22:04:50,742 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 96 transitions. [2024-11-19 22:04:50,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-19 22:04:50,745 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:04:50,745 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:04:50,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 22:04:50,745 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:04:50,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:04:50,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1547357138, now seen corresponding path program 1 times [2024-11-19 22:04:50,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:04:50,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860598149] [2024-11-19 22:04:50,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:04:50,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:04:50,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:04:50,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-19 22:04:50,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:04:50,859 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-19 22:04:50,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:04:50,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860598149] [2024-11-19 22:04:50,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860598149] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:04:50,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:04:50,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 22:04:50,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32758182] [2024-11-19 22:04:50,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:04:50,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 22:04:50,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:04:50,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 22:04:50,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:04:50,863 INFO L87 Difference]: Start difference. First operand 75 states and 96 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 22:04:50,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:04:50,875 INFO L93 Difference]: Finished difference Result 111 states and 142 transitions. [2024-11-19 22:04:50,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 22:04:50,876 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2024-11-19 22:04:50,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:04:50,877 INFO L225 Difference]: With dead ends: 111 [2024-11-19 22:04:50,877 INFO L226 Difference]: Without dead ends: 66 [2024-11-19 22:04:50,878 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-19 22:04:50,879 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 18 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 144 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-19 22:04:50,879 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 144 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:04:50,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-19 22:04:50,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-11-19 22:04:50,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 53 states have (on average 1.320754716981132) internal successors, (70), 58 states have internal predecessors, (70), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-19 22:04:50,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 84 transitions. [2024-11-19 22:04:50,885 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 84 transitions. Word has length 24 [2024-11-19 22:04:50,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:04:50,885 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 84 transitions. [2024-11-19 22:04:50,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 22:04:50,885 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 84 transitions. [2024-11-19 22:04:50,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-19 22:04:50,886 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:04:50,886 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:04:50,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 22:04:50,887 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:04:50,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:04:50,887 INFO L85 PathProgramCache]: Analyzing trace with hash 628813452, now seen corresponding path program 1 times [2024-11-19 22:04:50,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:04:50,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945239919] [2024-11-19 22:04:50,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:04:50,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:04:50,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:04:50,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 22:04:50,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:04:50,993 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-19 22:04:50,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:04:50,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945239919] [2024-11-19 22:04:50,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945239919] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:04:50,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:04:50,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 22:04:50,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937245346] [2024-11-19 22:04:50,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:04:50,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 22:04:50,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:04:50,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 22:04:50,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:04:50,995 INFO L87 Difference]: Start difference. First operand 66 states and 84 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 22:04:51,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:04:51,062 INFO L93 Difference]: Finished difference Result 164 states and 213 transitions. [2024-11-19 22:04:51,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 22:04:51,063 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2024-11-19 22:04:51,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:04:51,065 INFO L225 Difference]: With dead ends: 164 [2024-11-19 22:04:51,066 INFO L226 Difference]: Without dead ends: 105 [2024-11-19 22:04:51,067 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 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-19 22:04:51,068 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 77 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:04:51,070 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 333 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:04:51,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-19 22:04:51,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 100. [2024-11-19 22:04:51,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 79 states have (on average 1.3417721518987342) internal successors, (106), 86 states have internal predecessors, (106), 11 states have call successors, (11), 9 states have call predecessors, (11), 9 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-19 22:04:51,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 129 transitions. [2024-11-19 22:04:51,090 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 129 transitions. Word has length 29 [2024-11-19 22:04:51,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:04:51,091 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 129 transitions. [2024-11-19 22:04:51,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 22:04:51,091 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 129 transitions. [2024-11-19 22:04:51,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-19 22:04:51,093 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:04:51,094 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] [2024-11-19 22:04:51,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 22:04:51,095 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:04:51,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:04:51,097 INFO L85 PathProgramCache]: Analyzing trace with hash -470396509, now seen corresponding path program 1 times [2024-11-19 22:04:51,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:04:51,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471014208] [2024-11-19 22:04:51,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:04:51,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:04:51,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:04:51,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:04:51,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:04:51,228 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-19 22:04:51,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:04:51,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471014208] [2024-11-19 22:04:51,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471014208] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:04:51,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:04:51,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 22:04:51,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323643801] [2024-11-19 22:04:51,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:04:51,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 22:04:51,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:04:51,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 22:04:51,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:04:51,236 INFO L87 Difference]: Start difference. First operand 100 states and 129 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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-19 22:04:51,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:04:51,342 INFO L93 Difference]: Finished difference Result 230 states and 304 transitions. [2024-11-19 22:04:51,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 22:04:51,346 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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 32 [2024-11-19 22:04:51,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:04:51,347 INFO L225 Difference]: With dead ends: 230 [2024-11-19 22:04:51,348 INFO L226 Difference]: Without dead ends: 137 [2024-11-19 22:04:51,349 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-19 22:04:51,351 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 67 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 22:04:51,353 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 280 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 22:04:51,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-19 22:04:51,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2024-11-19 22:04:51,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 107 states have (on average 1.2897196261682242) internal successors, (138), 116 states have internal predecessors, (138), 15 states have call successors, (15), 14 states have call predecessors, (15), 14 states have return successors, (19), 15 states have call predecessors, (19), 15 states have call successors, (19) [2024-11-19 22:04:51,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 172 transitions. [2024-11-19 22:04:51,381 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 172 transitions. Word has length 32 [2024-11-19 22:04:51,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:04:51,382 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 172 transitions. [2024-11-19 22:04:51,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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-19 22:04:51,382 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 172 transitions. [2024-11-19 22:04:51,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-19 22:04:51,384 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:04:51,384 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1] [2024-11-19 22:04:51,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 22:04:51,385 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:04:51,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:04:51,389 INFO L85 PathProgramCache]: Analyzing trace with hash 749204649, now seen corresponding path program 1 times [2024-11-19 22:04:51,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:04:51,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226596007] [2024-11-19 22:04:51,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:04:51,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:04:51,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:04:51,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-19 22:04:51,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:04:51,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 22:04:51,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:04:51,451 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 22:04:51,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:04:51,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226596007] [2024-11-19 22:04:51,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226596007] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:04:51,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:04:51,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 22:04:51,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925164486] [2024-11-19 22:04:51,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:04:51,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 22:04:51,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:04:51,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 22:04:51,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:04:51,457 INFO L87 Difference]: Start difference. First operand 137 states and 172 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (3), 2 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-19 22:04:51,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:04:51,484 INFO L93 Difference]: Finished difference Result 269 states and 339 transitions. [2024-11-19 22:04:51,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 22:04:51,484 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (3), 2 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 49 [2024-11-19 22:04:51,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:04:51,489 INFO L225 Difference]: With dead ends: 269 [2024-11-19 22:04:51,489 INFO L226 Difference]: Without dead ends: 139 [2024-11-19 22:04:51,490 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-19 22:04:51,491 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 37 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:04:51,491 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 188 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:04:51,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-19 22:04:51,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 137. [2024-11-19 22:04:51,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 107 states have (on average 1.280373831775701) internal successors, (137), 116 states have internal predecessors, (137), 15 states have call successors, (15), 14 states have call predecessors, (15), 14 states have return successors, (17), 15 states have call predecessors, (17), 15 states have call successors, (17) [2024-11-19 22:04:51,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 169 transitions. [2024-11-19 22:04:51,532 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 169 transitions. Word has length 49 [2024-11-19 22:04:51,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:04:51,534 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 169 transitions. [2024-11-19 22:04:51,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (3), 2 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-19 22:04:51,534 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 169 transitions. [2024-11-19 22:04:51,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-19 22:04:51,538 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:04:51,538 INFO L215 NwaCegarLoop]: trace histogram [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-19 22:04:51,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 22:04:51,539 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:04:51,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:04:51,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1916118752, now seen corresponding path program 1 times [2024-11-19 22:04:51,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:04:51,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664428934] [2024-11-19 22:04:51,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:04:51,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:04:51,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:04:51,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-19 22:04:51,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:04:51,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 22:04:51,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:04:51,667 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 22:04:51,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:04:51,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664428934] [2024-11-19 22:04:51,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664428934] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:04:51,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:04:51,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 22:04:51,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668560746] [2024-11-19 22:04:51,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:04:51,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 22:04:51,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:04:51,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 22:04:51,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:04:51,672 INFO L87 Difference]: Start difference. First operand 137 states and 169 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 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-19 22:04:51,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:04:51,708 INFO L93 Difference]: Finished difference Result 270 states and 339 transitions. [2024-11-19 22:04:51,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 22:04:51,709 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 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 46 [2024-11-19 22:04:51,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:04:51,710 INFO L225 Difference]: With dead ends: 270 [2024-11-19 22:04:51,710 INFO L226 Difference]: Without dead ends: 140 [2024-11-19 22:04:51,711 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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-19 22:04:51,712 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 0 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 317 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-19 22:04:51,712 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 317 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:04:51,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-19 22:04:51,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2024-11-19 22:04:51,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 110 states have (on average 1.2727272727272727) internal successors, (140), 119 states have internal predecessors, (140), 15 states have call successors, (15), 14 states have call predecessors, (15), 14 states have return successors, (17), 15 states have call predecessors, (17), 15 states have call successors, (17) [2024-11-19 22:04:51,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 172 transitions. [2024-11-19 22:04:51,728 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 172 transitions. Word has length 46 [2024-11-19 22:04:51,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:04:51,729 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 172 transitions. [2024-11-19 22:04:51,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 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-19 22:04:51,730 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 172 transitions. [2024-11-19 22:04:51,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-19 22:04:51,731 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:04:51,731 INFO L215 NwaCegarLoop]: trace histogram [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-19 22:04:51,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 22:04:51,732 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:04:51,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:04:51,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1782105246, now seen corresponding path program 1 times [2024-11-19 22:04:51,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:04:51,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034422261] [2024-11-19 22:04:51,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:04:51,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:04:51,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:04:51,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-19 22:04:51,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:04:51,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 22:04:51,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:04:51,858 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 22:04:51,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:04:51,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034422261] [2024-11-19 22:04:51,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034422261] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:04:51,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:04:51,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 22:04:51,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206694240] [2024-11-19 22:04:51,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:04:51,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 22:04:51,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:04:51,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 22:04:51,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 22:04:51,862 INFO L87 Difference]: Start difference. First operand 140 states and 172 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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-19 22:04:51,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:04:51,888 INFO L93 Difference]: Finished difference Result 275 states and 344 transitions. [2024-11-19 22:04:51,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 22:04:51,888 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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 46 [2024-11-19 22:04:51,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:04:51,890 INFO L225 Difference]: With dead ends: 275 [2024-11-19 22:04:51,890 INFO L226 Difference]: Without dead ends: 142 [2024-11-19 22:04:51,890 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 22:04:51,891 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 0 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:04:51,892 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 240 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:04:51,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-19 22:04:51,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2024-11-19 22:04:51,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 112 states have (on average 1.2678571428571428) internal successors, (142), 121 states have internal predecessors, (142), 15 states have call successors, (15), 14 states have call predecessors, (15), 14 states have return successors, (17), 15 states have call predecessors, (17), 15 states have call successors, (17) [2024-11-19 22:04:51,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 174 transitions. [2024-11-19 22:04:51,918 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 174 transitions. Word has length 46 [2024-11-19 22:04:51,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:04:51,918 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 174 transitions. [2024-11-19 22:04:51,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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-19 22:04:51,918 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 174 transitions. [2024-11-19 22:04:51,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-19 22:04:51,922 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:04:51,922 INFO L215 NwaCegarLoop]: trace histogram [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-19 22:04:51,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 22:04:51,922 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:04:51,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:04:51,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1844144860, now seen corresponding path program 1 times [2024-11-19 22:04:51,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:04:51,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895597642] [2024-11-19 22:04:51,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:04:51,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:04:51,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:04:52,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-19 22:04:52,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:04:52,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 22:04:52,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:04:52,033 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 22:04:52,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:04:52,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895597642] [2024-11-19 22:04:52,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895597642] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:04:52,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:04:52,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 22:04:52,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005978936] [2024-11-19 22:04:52,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:04:52,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 22:04:52,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:04:52,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 22:04:52,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:04:52,038 INFO L87 Difference]: Start difference. First operand 142 states and 174 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 2 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-19 22:04:52,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:04:52,072 INFO L93 Difference]: Finished difference Result 352 states and 437 transitions. [2024-11-19 22:04:52,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 22:04:52,072 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 2 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 46 [2024-11-19 22:04:52,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:04:52,074 INFO L225 Difference]: With dead ends: 352 [2024-11-19 22:04:52,074 INFO L226 Difference]: Without dead ends: 217 [2024-11-19 22:04:52,075 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-19 22:04:52,076 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 38 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 153 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-19 22:04:52,076 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 153 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:04:52,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-11-19 22:04:52,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2024-11-19 22:04:52,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 171 states have (on average 1.2456140350877194) internal successors, (213), 182 states have internal predecessors, (213), 24 states have call successors, (24), 23 states have call predecessors, (24), 21 states have return successors, (26), 22 states have call predecessors, (26), 24 states have call successors, (26) [2024-11-19 22:04:52,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 263 transitions. [2024-11-19 22:04:52,096 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 263 transitions. Word has length 46 [2024-11-19 22:04:52,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:04:52,097 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 263 transitions. [2024-11-19 22:04:52,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 2 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-19 22:04:52,097 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 263 transitions. [2024-11-19 22:04:52,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-19 22:04:52,098 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:04:52,098 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2024-11-19 22:04:52,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 22:04:52,098 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:04:52,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:04:52,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1488971454, now seen corresponding path program 1 times [2024-11-19 22:04:52,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:04:52,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366074249] [2024-11-19 22:04:52,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:04:52,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:04:52,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:04:52,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-19 22:04:52,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:04:52,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-19 22:04:52,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:04:52,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-19 22:04:52,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:04:52,283 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 22:04:52,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:04:52,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366074249] [2024-11-19 22:04:52,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366074249] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:04:52,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:04:52,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 22:04:52,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112529749] [2024-11-19 22:04:52,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:04:52,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 22:04:52,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:04:52,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 22:04:52,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-19 22:04:52,286 INFO L87 Difference]: Start difference. First operand 217 states and 263 transitions. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 22:04:52,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:04:52,751 INFO L93 Difference]: Finished difference Result 715 states and 898 transitions. [2024-11-19 22:04:52,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-19 22:04:52,752 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 50 [2024-11-19 22:04:52,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:04:52,757 INFO L225 Difference]: With dead ends: 715 [2024-11-19 22:04:52,759 INFO L226 Difference]: Without dead ends: 505 [2024-11-19 22:04:52,760 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=548, Unknown=0, NotChecked=0, Total=650 [2024-11-19 22:04:52,761 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 158 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 22:04:52,761 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 520 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 22:04:52,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2024-11-19 22:04:52,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 488. [2024-11-19 22:04:52,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 382 states have (on average 1.2146596858638743) internal successors, (464), 410 states have internal predecessors, (464), 56 states have call successors, (56), 46 states have call predecessors, (56), 49 states have return successors, (74), 52 states have call predecessors, (74), 56 states have call successors, (74) [2024-11-19 22:04:52,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 594 transitions. [2024-11-19 22:04:52,813 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 594 transitions. Word has length 50 [2024-11-19 22:04:52,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:04:52,813 INFO L471 AbstractCegarLoop]: Abstraction has 488 states and 594 transitions. [2024-11-19 22:04:52,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 22:04:52,814 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 594 transitions. [2024-11-19 22:04:52,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-19 22:04:52,816 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:04:52,817 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:04:52,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 22:04:52,817 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:04:52,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:04:52,818 INFO L85 PathProgramCache]: Analyzing trace with hash -892169705, now seen corresponding path program 1 times [2024-11-19 22:04:52,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:04:52,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639112778] [2024-11-19 22:04:52,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:04:52,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:04:52,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 22:04:52,844 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 22:04:52,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 22:04:52,890 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 22:04:52,890 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 22:04:52,891 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 22:04:52,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 22:04:52,897 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:04:52,966 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 22:04:52,968 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 10:04:52 BoogieIcfgContainer [2024-11-19 22:04:52,968 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 22:04:52,969 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 22:04:52,969 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 22:04:52,971 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 22:04:52,972 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:04:50" (3/4) ... [2024-11-19 22:04:52,972 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-19 22:04:53,054 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 22:04:53,055 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 22:04:53,055 INFO L158 Benchmark]: Toolchain (without parser) took 3820.21ms. Allocated memory was 155.2MB in the beginning and 226.5MB in the end (delta: 71.3MB). Free memory was 100.8MB in the beginning and 131.9MB in the end (delta: -31.1MB). Peak memory consumption was 42.5MB. Max. memory is 16.1GB. [2024-11-19 22:04:53,058 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 155.2MB. Free memory is still 119.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 22:04:53,058 INFO L158 Benchmark]: CACSL2BoogieTranslator took 484.12ms. Allocated memory is still 155.2MB. Free memory was 100.3MB in the beginning and 78.3MB in the end (delta: 22.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-19 22:04:53,058 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.22ms. Allocated memory is still 155.2MB. Free memory was 78.3MB in the beginning and 75.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 22:04:53,058 INFO L158 Benchmark]: Boogie Preprocessor took 41.00ms. Allocated memory is still 155.2MB. Free memory was 75.7MB in the beginning and 73.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 22:04:53,058 INFO L158 Benchmark]: RCFGBuilder took 398.75ms. Allocated memory is still 155.2MB. Free memory was 73.6MB in the beginning and 56.3MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-19 22:04:53,059 INFO L158 Benchmark]: TraceAbstraction took 2750.45ms. Allocated memory was 155.2MB in the beginning and 226.5MB in the end (delta: 71.3MB). Free memory was 55.3MB in the beginning and 138.2MB in the end (delta: -82.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 22:04:53,059 INFO L158 Benchmark]: Witness Printer took 85.83ms. Allocated memory is still 226.5MB. Free memory was 138.2MB in the beginning and 131.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-19 22:04:53,062 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.23ms. Allocated memory is still 155.2MB. Free memory is still 119.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 484.12ms. Allocated memory is still 155.2MB. Free memory was 100.3MB in the beginning and 78.3MB in the end (delta: 22.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.22ms. Allocated memory is still 155.2MB. Free memory was 78.3MB in the beginning and 75.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.00ms. Allocated memory is still 155.2MB. Free memory was 75.7MB in the beginning and 73.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 398.75ms. Allocated memory is still 155.2MB. Free memory was 73.6MB in the beginning and 56.3MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2750.45ms. Allocated memory was 155.2MB in the beginning and 226.5MB in the end (delta: 71.3MB). Free memory was 55.3MB in the beginning and 138.2MB in the end (delta: -82.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 85.83ms. Allocated memory is still 226.5MB. Free memory was 138.2MB in the beginning and 131.9MB in the end (delta: 6.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,"wsllib_check.i","") [49] - GenericResultAtLocation [Line: 58]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [58] - GenericResultAtLocation [Line: 424]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [424] - GenericResultAtLocation [Line: 499]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [499] - GenericResultAtLocation [Line: 701]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [701] - GenericResultAtLocation [Line: 796]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification1_spec.i","") [796] - GenericResultAtLocation [Line: 822]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [822] - GenericResultAtLocation [Line: 860]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [860] * 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: 54]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L228] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L508] int pumpRunning = 0; [L509] int systemActive = 1; [L703] int waterLevel = 1; [L704] int methaneLevelCritical = 0; [L861] int cleanupTimeShifts = 4; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L934] int retValue_acc ; [L935] int tmp ; [L939] FCALL select_helpers() [L940] FCALL select_features() [L941] CALL, EXPR valid_product() [L852] int retValue_acc ; [L855] retValue_acc = 1 [L856] return (retValue_acc); VAL [\result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L941] RET, EXPR valid_product() [L941] tmp = valid_product() [L943] COND TRUE \read(tmp) [L945] FCALL setup() [L946] CALL runTest() [L928] CALL test() [L432] int splverifierCounter ; [L433] int tmp ; [L434] int tmp___0 ; [L435] int tmp___1 ; [L436] int tmp___2 ; [L439] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L441] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L443] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L449] tmp = __VERIFIER_nondet_int() [L451] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L453] CALL waterRise() VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L721] COND TRUE waterLevel < 2 [L722] waterLevel = waterLevel + 1 VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L453] RET waterRise() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L459] tmp___0 = __VERIFIER_nondet_int() [L461] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L469] tmp___2 = __VERIFIER_nondet_int() [L471] COND TRUE \read(tmp___2) [L473] CALL startSystem() [L697] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L473] RET startSystem() [L488] CALL timeShift() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L516] COND FALSE !(\read(pumpRunning)) VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L523] COND TRUE \read(systemActive) [L525] CALL processEnvironment() [L545] int tmp ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L548] COND TRUE ! pumpRunning [L550] CALL, EXPR isHighWaterLevel() [L660] int retValue_acc ; [L661] int tmp ; [L662] int tmp___0 ; [L666] CALL, EXPR isHighWaterSensorDry() [L783] int retValue_acc ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L786] COND FALSE !(waterLevel < 2) [L790] retValue_acc = 0 [L791] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L666] RET, EXPR isHighWaterSensorDry() [L666] tmp = isHighWaterSensorDry() [L668] COND FALSE !(\read(tmp)) [L671] tmp___0 = 1 VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, tmp___0=1, waterLevel=2] [L673] retValue_acc = tmp___0 [L674] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L550] RET, EXPR isHighWaterLevel() [L550] tmp = isHighWaterLevel() [L552] COND TRUE \read(tmp) [L554] CALL activatePump() [L579] int tmp ; [L583] CALL, EXPR isMethaneAlarm() [L604] int retValue_acc ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L608] CALL, EXPR isMethaneLevelCritical() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L742] int retValue_acc ; [L745] retValue_acc = methaneLevelCritical [L746] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L608] RET, EXPR isMethaneLevelCritical() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L608] retValue_acc = isMethaneLevelCritical() [L610] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L583] RET, EXPR isMethaneAlarm() [L583] tmp = isMethaneAlarm() [L585] COND FALSE !(\read(tmp)) [L589] CALL activatePump__wrappee__highWaterSensor() [L573] pumpRunning = 1 VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L589] RET activatePump__wrappee__highWaterSensor() [L554] RET activatePump() [L525] RET processEnvironment() [L531] CALL __utac_acc__Specification1_spec__1() [L798] int tmp ; [L799] int tmp___0 ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L803] CALL, EXPR isMethaneLevelCritical() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L742] int retValue_acc ; [L745] retValue_acc = methaneLevelCritical [L746] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L803] RET, EXPR isMethaneLevelCritical() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L803] tmp = isMethaneLevelCritical() [L805] COND FALSE !(\read(tmp)) VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L531] RET __utac_acc__Specification1_spec__1() [L488] RET timeShift() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L441] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L443] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L449] tmp = __VERIFIER_nondet_int() [L451] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L459] tmp___0 = __VERIFIER_nondet_int() [L461] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L463] CALL changeMethaneLevel() VAL [\old(methaneLevelCritical)=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L733] COND FALSE !(\read(methaneLevelCritical)) [L736] methaneLevelCritical = 1 VAL [\old(methaneLevelCritical)=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L463] RET changeMethaneLevel() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L469] tmp___2 = __VERIFIER_nondet_int() [L471] COND TRUE \read(tmp___2) [L473] CALL startSystem() [L697] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L473] RET startSystem() [L488] CALL timeShift() VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L516] COND TRUE \read(pumpRunning) [L518] CALL lowerWaterLevel() [L709] COND TRUE waterLevel > 0 [L710] waterLevel = waterLevel - 1 VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L518] RET lowerWaterLevel() [L523] COND TRUE \read(systemActive) [L525] CALL processEnvironment() [L545] int tmp ; VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L548] COND FALSE !(! pumpRunning) VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L563] FCALL processEnvironment__wrappee__base() VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L525] RET processEnvironment() [L531] CALL __utac_acc__Specification1_spec__1() [L798] int tmp ; [L799] int tmp___0 ; VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L803] CALL, EXPR isMethaneLevelCritical() VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L742] int retValue_acc ; [L745] retValue_acc = methaneLevelCritical [L746] return (retValue_acc); VAL [\old(pumpRunning)=1, \old(waterLevel)=2, \result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L803] RET, EXPR isMethaneLevelCritical() VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L803] tmp = isMethaneLevelCritical() [L805] COND TRUE \read(tmp) [L807] CALL, EXPR isPumpRunning() [L615] int retValue_acc ; [L618] retValue_acc = pumpRunning [L619] return (retValue_acc); VAL [\old(pumpRunning)=1, \old(waterLevel)=2, \result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L807] RET, EXPR isPumpRunning() [L807] tmp___0 = isPumpRunning() [L809] COND TRUE \read(tmp___0) [L811] CALL __automaton_fail() [L54] reach_error() VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 84 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.6s, OverallIterations: 10, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 407 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 395 mSDsluCounter, 2280 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1495 mSDsCounter, 46 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 343 IncrementalHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 46 mSolverCounterUnsat, 785 mSDtfsCounter, 343 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 90 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=488occurred in iteration=9, InterpolantAutomatonStates: 53, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 24 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 428 NumberOfCodeBlocks, 428 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 336 ConstructedInterpolants, 0 QuantifiedInterpolants, 458 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 15/15 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-19 22:04:53,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE