./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_product33.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_product33.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ae076af2cea67b9cfc404edc1600766999266c2b24082e43516a66dae23512b8 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-19 22:04:38,031 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 22:04:38,086 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:38,092 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 22:04:38,092 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 22:04:38,134 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 22:04:38,134 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 22:04:38,135 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 22:04:38,135 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 22:04:38,139 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 22:04:38,139 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 22:04:38,139 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 22:04:38,140 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 22:04:38,141 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 22:04:38,141 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 22:04:38,141 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 22:04:38,141 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 22:04:38,141 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 22:04:38,142 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 22:04:38,142 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 22:04:38,143 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 22:04:38,143 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 22:04:38,143 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 22:04:38,143 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 22:04:38,144 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 22:04:38,144 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 22:04:38,144 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 22:04:38,144 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 22:04:38,144 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 22:04:38,145 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 22:04:38,145 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 22:04:38,145 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 22:04:38,145 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 22:04:38,145 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 22:04:38,145 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 22:04:38,146 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 22:04:38,146 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 22:04:38,146 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 22:04:38,146 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 22:04:38,147 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 22:04:38,147 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 22:04:38,147 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 22:04:38,147 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 -> ae076af2cea67b9cfc404edc1600766999266c2b24082e43516a66dae23512b8 [2024-11-19 22:04:38,332 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 22:04:38,355 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 22:04:38,357 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 22:04:38,358 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 22:04:38,361 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 22:04:38,362 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product33.cil.c [2024-11-19 22:04:39,652 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 22:04:39,867 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 22:04:39,868 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product33.cil.c [2024-11-19 22:04:39,881 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ebc67cc7/390ce927ada04ed389f0c946695028e5/FLAG893b58e9c [2024-11-19 22:04:40,231 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ebc67cc7/390ce927ada04ed389f0c946695028e5 [2024-11-19 22:04:40,233 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 22:04:40,234 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 22:04:40,235 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 22:04:40,235 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 22:04:40,242 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 22:04:40,243 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:04:40" (1/1) ... [2024-11-19 22:04:40,244 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38383ea0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:40, skipping insertion in model container [2024-11-19 22:04:40,244 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:04:40" (1/1) ... [2024-11-19 22:04:40,284 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 22:04:40,463 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_product33.cil.c[11292,11305] [2024-11-19 22:04:40,490 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 22:04:40,497 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 22:04:40,504 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [49] [2024-11-19 22:04:40,505 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [415] [2024-11-19 22:04:40,505 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [424] [2024-11-19 22:04:40,506 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [586] [2024-11-19 22:04:40,506 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [654] [2024-11-19 22:04:40,506 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [692] [2024-11-19 22:04:40,506 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification1_spec.i","") [788] [2024-11-19 22:04:40,506 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [814] [2024-11-19 22:04:40,538 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_product33.cil.c[11292,11305] [2024-11-19 22:04:40,549 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 22:04:40,565 INFO L204 MainTranslator]: Completed translation [2024-11-19 22:04:40,566 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:40 WrapperNode [2024-11-19 22:04:40,566 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 22:04:40,568 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 22:04:40,569 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 22:04:40,569 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 22:04:40,574 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:40" (1/1) ... [2024-11-19 22:04:40,586 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:40" (1/1) ... [2024-11-19 22:04:40,602 INFO L138 Inliner]: procedures = 52, calls = 93, calls flagged for inlining = 19, calls inlined = 16, statements flattened = 164 [2024-11-19 22:04:40,603 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 22:04:40,603 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 22:04:40,603 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 22:04:40,604 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 22:04:40,644 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:40" (1/1) ... [2024-11-19 22:04:40,644 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:40" (1/1) ... [2024-11-19 22:04:40,645 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:40" (1/1) ... [2024-11-19 22:04:40,690 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:40,690 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:40" (1/1) ... [2024-11-19 22:04:40,690 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:40" (1/1) ... [2024-11-19 22:04:40,702 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:40" (1/1) ... [2024-11-19 22:04:40,736 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:40" (1/1) ... [2024-11-19 22:04:40,737 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:40" (1/1) ... [2024-11-19 22:04:40,738 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:40" (1/1) ... [2024-11-19 22:04:40,747 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 22:04:40,748 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 22:04:40,748 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 22:04:40,748 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 22:04:40,749 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:40" (1/1) ... [2024-11-19 22:04:40,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 22:04:40,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:04:40,799 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:40,806 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:40,842 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 22:04:40,842 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2024-11-19 22:04:40,842 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2024-11-19 22:04:40,842 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-11-19 22:04:40,842 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-11-19 22:04:40,842 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2024-11-19 22:04:40,842 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2024-11-19 22:04:40,842 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-11-19 22:04:40,842 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-11-19 22:04:40,842 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2024-11-19 22:04:40,842 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2024-11-19 22:04:40,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 22:04:40,843 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2024-11-19 22:04:40,843 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2024-11-19 22:04:40,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 22:04:40,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 22:04:40,893 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 22:04:40,895 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 22:04:41,037 INFO L? ?]: Removed 36 outVars from TransFormulas that were not future-live. [2024-11-19 22:04:41,038 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 22:04:41,047 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 22:04:41,047 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-19 22:04:41,048 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:04:41 BoogieIcfgContainer [2024-11-19 22:04:41,048 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 22:04:41,049 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 22:04:41,050 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 22:04:41,052 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 22:04:41,052 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 10:04:40" (1/3) ... [2024-11-19 22:04:41,052 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fb79000 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:04:41, skipping insertion in model container [2024-11-19 22:04:41,053 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:40" (2/3) ... [2024-11-19 22:04:41,053 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fb79000 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:04:41, skipping insertion in model container [2024-11-19 22:04:41,053 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:04:41" (3/3) ... [2024-11-19 22:04:41,054 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec1_product33.cil.c [2024-11-19 22:04:41,065 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 22:04:41,066 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 22:04:41,106 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 22:04:41,111 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;@25e316a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 22:04:41,111 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 22:04:41,115 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 57 states have (on average 1.4035087719298245) internal successors, (80), 63 states have internal predecessors, (80), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-19 22:04:41,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-19 22:04:41,121 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:04:41,121 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:41,122 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:04:41,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:04:41,125 INFO L85 PathProgramCache]: Analyzing trace with hash 590347311, now seen corresponding path program 1 times [2024-11-19 22:04:41,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:04:41,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905925321] [2024-11-19 22:04:41,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:04:41,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:04:41,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:04:41,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-19 22:04:41,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:04:41,287 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:41,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:04:41,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905925321] [2024-11-19 22:04:41,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905925321] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:04:41,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:04:41,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 22:04:41,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738724020] [2024-11-19 22:04:41,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:04:41,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 22:04:41,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:04:41,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 22:04:41,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 22:04:41,309 INFO L87 Difference]: Start difference. First operand has 74 states, 57 states have (on average 1.4035087719298245) internal successors, (80), 63 states have internal predecessors, (80), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 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:41,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:04:41,329 INFO L93 Difference]: Finished difference Result 140 states and 191 transitions. [2024-11-19 22:04:41,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 22:04:41,330 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:41,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:04:41,336 INFO L225 Difference]: With dead ends: 140 [2024-11-19 22:04:41,336 INFO L226 Difference]: Without dead ends: 65 [2024-11-19 22:04:41,338 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:41,341 INFO L432 NwaCegarLoop]: 92 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, 92 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:41,342 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 92 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:41,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-19 22:04:41,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-11-19 22:04:41,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 50 states have (on average 1.32) internal successors, (66), 55 states have internal predecessors, (66), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 22:04:41,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 83 transitions. [2024-11-19 22:04:41,385 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 83 transitions. Word has length 23 [2024-11-19 22:04:41,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:04:41,386 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 83 transitions. [2024-11-19 22:04:41,386 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:41,386 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 83 transitions. [2024-11-19 22:04:41,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-19 22:04:41,390 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:04:41,390 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:41,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 22:04:41,391 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:04:41,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:04:41,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1050726016, now seen corresponding path program 1 times [2024-11-19 22:04:41,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:04:41,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218699628] [2024-11-19 22:04:41,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:04:41,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:04:41,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:04:41,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-19 22:04:41,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:04:41,510 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:41,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:04:41,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218699628] [2024-11-19 22:04:41,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218699628] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:04:41,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:04:41,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 22:04:41,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022364257] [2024-11-19 22:04:41,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:04:41,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 22:04:41,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:04:41,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 22:04:41,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:04:41,517 INFO L87 Difference]: Start difference. First operand 65 states and 83 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:41,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:04:41,537 INFO L93 Difference]: Finished difference Result 96 states and 122 transitions. [2024-11-19 22:04:41,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 22:04:41,538 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:41,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:04:41,539 INFO L225 Difference]: With dead ends: 96 [2024-11-19 22:04:41,541 INFO L226 Difference]: Without dead ends: 56 [2024-11-19 22:04:41,542 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:41,543 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 12 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 124 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:41,544 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 124 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:41,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-19 22:04:41,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-11-19 22:04:41,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 49 states have internal predecessors, (59), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-19 22:04:41,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 71 transitions. [2024-11-19 22:04:41,556 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 71 transitions. Word has length 24 [2024-11-19 22:04:41,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:04:41,556 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 71 transitions. [2024-11-19 22:04:41,556 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:41,556 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 71 transitions. [2024-11-19 22:04:41,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-19 22:04:41,557 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:04:41,557 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] [2024-11-19 22:04:41,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 22:04:41,557 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:04:41,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:04:41,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1139566475, now seen corresponding path program 1 times [2024-11-19 22:04:41,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:04:41,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070204253] [2024-11-19 22:04:41,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:04:41,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:04:41,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:04:41,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-19 22:04:41,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:04:41,738 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:41,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:04:41,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070204253] [2024-11-19 22:04:41,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070204253] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:04:41,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:04:41,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 22:04:41,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432982792] [2024-11-19 22:04:41,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:04:41,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 22:04:41,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:04:41,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 22:04:41,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 22:04:41,740 INFO L87 Difference]: Start difference. First operand 56 states and 71 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 22:04:41,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:04:41,874 INFO L93 Difference]: Finished difference Result 105 states and 136 transitions. [2024-11-19 22:04:41,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 22:04:41,875 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2024-11-19 22:04:41,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:04:41,876 INFO L225 Difference]: With dead ends: 105 [2024-11-19 22:04:41,876 INFO L226 Difference]: Without dead ends: 56 [2024-11-19 22:04:41,876 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-19 22:04:41,877 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 67 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 22:04:41,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 173 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 22:04:41,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-19 22:04:41,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-11-19 22:04:41,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 44 states have (on average 1.3181818181818181) internal successors, (58), 49 states have internal predecessors, (58), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-19 22:04:41,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2024-11-19 22:04:41,888 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 70 transitions. Word has length 28 [2024-11-19 22:04:41,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:04:41,889 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 70 transitions. [2024-11-19 22:04:41,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 22:04:41,889 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2024-11-19 22:04:41,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-19 22:04:41,890 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:04:41,890 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:04:41,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 22:04:41,897 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:04:41,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:04:41,897 INFO L85 PathProgramCache]: Analyzing trace with hash -863474034, now seen corresponding path program 1 times [2024-11-19 22:04:41,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:04:41,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186390851] [2024-11-19 22:04:41,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:04:41,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:04:41,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:04:41,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-19 22:04:41,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:04:41,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-19 22:04:41,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:04:42,000 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:42,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:04:42,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186390851] [2024-11-19 22:04:42,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186390851] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:04:42,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:04:42,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 22:04:42,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9113346] [2024-11-19 22:04:42,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:04:42,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 22:04:42,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:04:42,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 22:04:42,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:04:42,006 INFO L87 Difference]: Start difference. First operand 56 states and 70 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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:42,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:04:42,059 INFO L93 Difference]: Finished difference Result 143 states and 183 transitions. [2024-11-19 22:04:42,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 22:04:42,065 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 33 [2024-11-19 22:04:42,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:04:42,066 INFO L225 Difference]: With dead ends: 143 [2024-11-19 22:04:42,066 INFO L226 Difference]: Without dead ends: 94 [2024-11-19 22:04:42,067 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:42,068 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 59 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:04:42,074 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 130 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:04:42,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-19 22:04:42,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92. [2024-11-19 22:04:42,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 71 states have (on average 1.3098591549295775) internal successors, (93), 77 states have internal predecessors, (93), 10 states have call successors, (10), 10 states have call predecessors, (10), 10 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2024-11-19 22:04:42,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 115 transitions. [2024-11-19 22:04:42,099 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 115 transitions. Word has length 33 [2024-11-19 22:04:42,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:04:42,100 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 115 transitions. [2024-11-19 22:04:42,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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:42,100 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 115 transitions. [2024-11-19 22:04:42,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-19 22:04:42,108 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:04:42,108 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:04:42,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 22:04:42,108 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:04:42,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:04:42,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1650841319, now seen corresponding path program 1 times [2024-11-19 22:04:42,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:04:42,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985207747] [2024-11-19 22:04:42,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:04:42,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:04:42,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:04:42,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-19 22:04:42,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:04:42,302 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:42,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:04:42,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985207747] [2024-11-19 22:04:42,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985207747] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:04:42,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:04:42,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 22:04:42,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086231188] [2024-11-19 22:04:42,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:04:42,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 22:04:42,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:04:42,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 22:04:42,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:04:42,310 INFO L87 Difference]: Start difference. First operand 92 states and 115 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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:42,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:04:42,362 INFO L93 Difference]: Finished difference Result 180 states and 229 transitions. [2024-11-19 22:04:42,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 22:04:42,369 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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 37 [2024-11-19 22:04:42,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:04:42,370 INFO L225 Difference]: With dead ends: 180 [2024-11-19 22:04:42,370 INFO L226 Difference]: Without dead ends: 95 [2024-11-19 22:04:42,370 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:04:42,371 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 0 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 261 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:42,371 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 261 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:42,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-19 22:04:42,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-19 22:04:42,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 74 states have (on average 1.2972972972972974) internal successors, (96), 80 states have internal predecessors, (96), 10 states have call successors, (10), 10 states have call predecessors, (10), 10 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2024-11-19 22:04:42,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 118 transitions. [2024-11-19 22:04:42,397 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 118 transitions. Word has length 37 [2024-11-19 22:04:42,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:04:42,403 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 118 transitions. [2024-11-19 22:04:42,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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:42,404 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 118 transitions. [2024-11-19 22:04:42,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-19 22:04:42,405 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:04:42,405 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:04:42,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 22:04:42,405 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:04:42,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:04:42,405 INFO L85 PathProgramCache]: Analyzing trace with hash 629772965, now seen corresponding path program 1 times [2024-11-19 22:04:42,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:04:42,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404582620] [2024-11-19 22:04:42,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:04:42,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:04:42,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:04:42,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-19 22:04:42,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:04:42,519 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:42,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:04:42,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404582620] [2024-11-19 22:04:42,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404582620] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:04:42,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:04:42,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 22:04:42,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637177318] [2024-11-19 22:04:42,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:04:42,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 22:04:42,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:04:42,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 22:04:42,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 22:04:42,521 INFO L87 Difference]: Start difference. First operand 95 states and 118 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 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:42,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:04:42,566 INFO L93 Difference]: Finished difference Result 185 states and 236 transitions. [2024-11-19 22:04:42,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 22:04:42,566 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 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 37 [2024-11-19 22:04:42,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:04:42,567 INFO L225 Difference]: With dead ends: 185 [2024-11-19 22:04:42,567 INFO L226 Difference]: Without dead ends: 97 [2024-11-19 22:04:42,568 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 22:04:42,569 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 0 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:04:42,569 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 322 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:04:42,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-19 22:04:42,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-19 22:04:42,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 76 states have (on average 1.2894736842105263) internal successors, (98), 82 states have internal predecessors, (98), 10 states have call successors, (10), 10 states have call predecessors, (10), 10 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2024-11-19 22:04:42,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 120 transitions. [2024-11-19 22:04:42,588 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 120 transitions. Word has length 37 [2024-11-19 22:04:42,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:04:42,588 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 120 transitions. [2024-11-19 22:04:42,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 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:42,589 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 120 transitions. [2024-11-19 22:04:42,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-19 22:04:42,589 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:04:42,589 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:04:42,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 22:04:42,589 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:04:42,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:04:42,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1364371741, now seen corresponding path program 1 times [2024-11-19 22:04:42,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:04:42,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544311380] [2024-11-19 22:04:42,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:04:42,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:04:42,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:04:42,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-19 22:04:42,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:04:42,638 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:42,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:04:42,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544311380] [2024-11-19 22:04:42,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544311380] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:04:42,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:04:42,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 22:04:42,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690582395] [2024-11-19 22:04:42,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:04:42,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 22:04:42,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:04:42,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 22:04:42,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:04:42,640 INFO L87 Difference]: Start difference. First operand 97 states and 120 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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:42,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:04:42,660 INFO L93 Difference]: Finished difference Result 230 states and 288 transitions. [2024-11-19 22:04:42,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 22:04:42,660 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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 37 [2024-11-19 22:04:42,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:04:42,661 INFO L225 Difference]: With dead ends: 230 [2024-11-19 22:04:42,661 INFO L226 Difference]: Without dead ends: 140 [2024-11-19 22:04:42,663 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:42,665 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 36 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 125 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:42,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 125 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:42,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-19 22:04:42,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 138. [2024-11-19 22:04:42,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 108 states have (on average 1.2685185185185186) internal successors, (137), 115 states have internal predecessors, (137), 15 states have call successors, (15), 15 states have call predecessors, (15), 14 states have return successors, (17), 14 states have call predecessors, (17), 15 states have call successors, (17) [2024-11-19 22:04:42,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 169 transitions. [2024-11-19 22:04:42,681 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 169 transitions. Word has length 37 [2024-11-19 22:04:42,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:04:42,682 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 169 transitions. [2024-11-19 22:04:42,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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:42,682 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 169 transitions. [2024-11-19 22:04:42,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-19 22:04:42,683 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:04:42,684 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:04:42,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 22:04:42,685 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:04:42,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:04:42,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1514317370, now seen corresponding path program 1 times [2024-11-19 22:04:42,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:04:42,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70534591] [2024-11-19 22:04:42,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:04:42,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:04:42,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:04:42,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 22:04:42,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:04:42,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-19 22:04:42,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:04:42,768 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:42,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:04:42,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70534591] [2024-11-19 22:04:42,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70534591] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:04:42,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:04:42,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 22:04:42,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003262651] [2024-11-19 22:04:42,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:04:42,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 22:04:42,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:04:42,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 22:04:42,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:04:42,771 INFO L87 Difference]: Start difference. First operand 138 states and 169 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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:42,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:04:42,805 INFO L93 Difference]: Finished difference Result 140 states and 170 transitions. [2024-11-19 22:04:42,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 22:04:42,805 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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 39 [2024-11-19 22:04:42,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:04:42,807 INFO L225 Difference]: With dead ends: 140 [2024-11-19 22:04:42,809 INFO L226 Difference]: Without dead ends: 138 [2024-11-19 22:04:42,809 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 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:42,810 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 45 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:04:42,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 242 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:04:42,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-19 22:04:42,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2024-11-19 22:04:42,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 108 states have (on average 1.25) internal successors, (135), 115 states have internal predecessors, (135), 15 states have call successors, (15), 15 states have call predecessors, (15), 14 states have return successors, (17), 14 states have call predecessors, (17), 15 states have call successors, (17) [2024-11-19 22:04:42,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 167 transitions. [2024-11-19 22:04:42,825 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 167 transitions. Word has length 39 [2024-11-19 22:04:42,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:04:42,825 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 167 transitions. [2024-11-19 22:04:42,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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:42,826 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 167 transitions. [2024-11-19 22:04:42,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-19 22:04:42,828 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:04:42,829 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:04:42,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 22:04:42,829 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:04:42,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:04:42,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1301773501, now seen corresponding path program 1 times [2024-11-19 22:04:42,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:04:42,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915840533] [2024-11-19 22:04:42,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:04:42,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:04:42,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:04:42,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-19 22:04:42,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:04:42,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 22:04:42,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:04:42,930 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:42,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:04:42,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915840533] [2024-11-19 22:04:42,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915840533] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:04:42,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:04:42,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 22:04:42,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141900305] [2024-11-19 22:04:42,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:04:42,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 22:04:42,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:04:42,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 22:04:42,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 22:04:42,932 INFO L87 Difference]: Start difference. First operand 138 states and 167 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 22:04:43,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:04:43,076 INFO L93 Difference]: Finished difference Result 472 states and 590 transitions. [2024-11-19 22:04:43,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 22:04:43,077 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 41 [2024-11-19 22:04:43,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:04:43,079 INFO L225 Difference]: With dead ends: 472 [2024-11-19 22:04:43,079 INFO L226 Difference]: Without dead ends: 341 [2024-11-19 22:04:43,079 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2024-11-19 22:04:43,080 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 102 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 22:04:43,080 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 308 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 22:04:43,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2024-11-19 22:04:43,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 335. [2024-11-19 22:04:43,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 262 states have (on average 1.2213740458015268) internal successors, (320), 283 states have internal predecessors, (320), 38 states have call successors, (38), 30 states have call predecessors, (38), 34 states have return successors, (51), 36 states have call predecessors, (51), 38 states have call successors, (51) [2024-11-19 22:04:43,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 409 transitions. [2024-11-19 22:04:43,137 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 409 transitions. Word has length 41 [2024-11-19 22:04:43,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:04:43,138 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 409 transitions. [2024-11-19 22:04:43,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 22:04:43,139 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 409 transitions. [2024-11-19 22:04:43,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-19 22:04:43,140 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:04:43,140 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:04:43,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 22:04:43,146 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:04:43,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:04:43,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1239842087, now seen corresponding path program 1 times [2024-11-19 22:04:43,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:04:43,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488462928] [2024-11-19 22:04:43,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:04:43,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:04:43,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 22:04:43,163 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 22:04:43,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 22:04:43,186 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 22:04:43,186 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 22:04:43,187 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 22:04:43,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 22:04:43,190 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:04:43,218 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 22:04:43,220 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 10:04:43 BoogieIcfgContainer [2024-11-19 22:04:43,220 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 22:04:43,221 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 22:04:43,221 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 22:04:43,221 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 22:04:43,222 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:41" (3/4) ... [2024-11-19 22:04:43,222 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-19 22:04:43,278 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 22:04:43,278 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 22:04:43,278 INFO L158 Benchmark]: Toolchain (without parser) took 3044.74ms. Allocated memory was 201.3MB in the beginning and 306.2MB in the end (delta: 104.9MB). Free memory was 130.9MB in the beginning and 254.9MB in the end (delta: -124.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 22:04:43,279 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 201.3MB. Free memory is still 159.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 22:04:43,279 INFO L158 Benchmark]: CACSL2BoogieTranslator took 331.81ms. Allocated memory is still 201.3MB. Free memory was 130.7MB in the beginning and 109.7MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-19 22:04:43,279 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.73ms. Allocated memory is still 201.3MB. Free memory was 109.7MB in the beginning and 107.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 22:04:43,279 INFO L158 Benchmark]: Boogie Preprocessor took 144.13ms. Allocated memory is still 201.3MB. Free memory was 107.3MB in the beginning and 170.3MB in the end (delta: -63.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-19 22:04:43,279 INFO L158 Benchmark]: RCFGBuilder took 299.86ms. Allocated memory is still 201.3MB. Free memory was 170.3MB in the beginning and 153.5MB in the end (delta: 16.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-19 22:04:43,280 INFO L158 Benchmark]: TraceAbstraction took 2171.14ms. Allocated memory was 201.3MB in the beginning and 306.2MB in the end (delta: 104.9MB). Free memory was 152.5MB in the beginning and 259.1MB in the end (delta: -106.6MB). Peak memory consumption was 1.4MB. Max. memory is 16.1GB. [2024-11-19 22:04:43,280 INFO L158 Benchmark]: Witness Printer took 57.05ms. Allocated memory is still 306.2MB. Free memory was 259.1MB in the beginning and 254.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 22:04:43,281 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.09ms. Allocated memory is still 201.3MB. Free memory is still 159.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 331.81ms. Allocated memory is still 201.3MB. Free memory was 130.7MB in the beginning and 109.7MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.73ms. Allocated memory is still 201.3MB. Free memory was 109.7MB in the beginning and 107.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 144.13ms. Allocated memory is still 201.3MB. Free memory was 107.3MB in the beginning and 170.3MB in the end (delta: -63.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 299.86ms. Allocated memory is still 201.3MB. Free memory was 170.3MB in the beginning and 153.5MB in the end (delta: 16.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 2171.14ms. Allocated memory was 201.3MB in the beginning and 306.2MB in the end (delta: 104.9MB). Free memory was 152.5MB in the beginning and 259.1MB in the end (delta: -106.6MB). Peak memory consumption was 1.4MB. Max. memory is 16.1GB. * Witness Printer took 57.05ms. Allocated memory is still 306.2MB. Free memory was 259.1MB in the beginning and 254.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 49]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [49] - GenericResultAtLocation [Line: 415]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [415] - GenericResultAtLocation [Line: 424]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [424] - GenericResultAtLocation [Line: 586]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [586] - GenericResultAtLocation [Line: 654]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [654] - GenericResultAtLocation [Line: 692]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [692] - GenericResultAtLocation [Line: 788]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification1_spec.i","") [788] - GenericResultAtLocation [Line: 814]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [814] * 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: 420]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L219] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L434] int pumpRunning = 0; [L435] int systemActive = 1; [L693] int cleanupTimeShifts = 4; [L816] int waterLevel = 1; [L817] int methaneLevelCritical = 0; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L766] int retValue_acc ; [L767] int tmp ; [L771] FCALL select_helpers() [L772] FCALL select_features() [L773] CALL, EXPR valid_product() [L684] int retValue_acc ; [L687] retValue_acc = 1 [L688] return (retValue_acc); VAL [\result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L773] RET, EXPR valid_product() [L773] tmp = valid_product() [L775] COND TRUE \read(tmp) [L777] FCALL setup() [L778] CALL runTest() [L760] CALL test() [L591] int splverifierCounter ; [L592] int tmp ; [L593] int tmp___0 ; [L594] int tmp___1 ; [L595] int tmp___2 ; [L598] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L600] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L602] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L608] tmp = __VERIFIER_nondet_int() [L610] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L612] CALL waterRise() VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L834] COND TRUE waterLevel < 2 [L835] waterLevel = waterLevel + 1 VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L612] RET waterRise() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L618] tmp___0 = __VERIFIER_nondet_int() [L620] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L622] CALL changeMethaneLevel() VAL [\old(methaneLevelCritical)=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L846] COND FALSE !(\read(methaneLevelCritical)) [L849] methaneLevelCritical = 1 VAL [\old(methaneLevelCritical)=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L622] RET changeMethaneLevel() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L628] tmp___2 = __VERIFIER_nondet_int() [L630] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L643] CALL timeShift() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L442] COND FALSE !(\read(pumpRunning)) VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L449] COND TRUE \read(systemActive) [L451] CALL processEnvironment() [L471] int tmp ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L474] COND TRUE ! pumpRunning [L476] CALL, EXPR isHighWaterLevel() [L568] int retValue_acc ; [L569] int tmp ; [L570] int tmp___0 ; [L574] CALL, EXPR isHighWaterSensorDry() [L896] int retValue_acc ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L899] COND FALSE !(waterLevel < 2) [L903] retValue_acc = 0 [L904] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L574] RET, EXPR isHighWaterSensorDry() [L574] tmp = isHighWaterSensorDry() [L576] COND FALSE !(\read(tmp)) [L579] tmp___0 = 1 VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, tmp___0=1, waterLevel=2] [L581] retValue_acc = tmp___0 [L582] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L476] RET, EXPR isHighWaterLevel() [L476] tmp = isHighWaterLevel() [L478] COND TRUE \read(tmp) [L480] CALL activatePump() [L499] pumpRunning = 1 VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L480] RET activatePump() [L451] RET processEnvironment() [L457] CALL __utac_acc__Specification1_spec__1() [L790] int tmp ; [L791] int tmp___0 ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L795] CALL, EXPR isMethaneLevelCritical() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L855] int retValue_acc ; [L858] retValue_acc = methaneLevelCritical [L859] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L795] RET, EXPR isMethaneLevelCritical() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L795] tmp = isMethaneLevelCritical() [L797] COND TRUE \read(tmp) [L799] CALL, EXPR isPumpRunning() [L523] int retValue_acc ; [L526] retValue_acc = pumpRunning [L527] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L799] RET, EXPR isPumpRunning() [L799] tmp___0 = isPumpRunning() [L801] COND TRUE \read(tmp___0) [L803] CALL __automaton_fail() [L420] reach_error() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 74 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.1s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 331 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 321 mSDsluCounter, 1777 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1139 mSDsCounter, 32 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 238 IncrementalHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 32 mSolverCounterUnsat, 638 mSDtfsCounter, 238 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 73 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=335occurred in iteration=9, InterpolantAutomatonStates: 43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 10 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 344 NumberOfCodeBlocks, 344 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 290 ConstructedInterpolants, 0 QuantifiedInterpolants, 498 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-19 22:04:43,297 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