./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_product41.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_product41.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 7e401b19fa73801dafa3ee94892588c53fc375d864d82edcc9ff671172238c8c --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-19 22:04:42,970 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 22:04:43,036 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:43,040 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 22:04:43,041 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 22:04:43,073 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 22:04:43,074 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 22:04:43,074 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 22:04:43,075 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 22:04:43,076 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 22:04:43,076 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 22:04:43,077 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 22:04:43,077 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 22:04:43,078 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 22:04:43,079 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 22:04:43,080 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 22:04:43,080 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 22:04:43,081 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 22:04:43,081 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 22:04:43,081 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 22:04:43,084 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 22:04:43,085 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 22:04:43,086 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 22:04:43,086 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 22:04:43,086 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 22:04:43,086 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 22:04:43,087 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 22:04:43,087 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 22:04:43,087 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 22:04:43,088 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 22:04:43,088 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 22:04:43,088 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 22:04:43,089 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 22:04:43,089 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 22:04:43,089 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 22:04:43,090 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 22:04:43,090 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 22:04:43,090 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 22:04:43,090 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 22:04:43,090 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 22:04:43,091 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 22:04:43,091 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 22:04:43,091 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 -> 7e401b19fa73801dafa3ee94892588c53fc375d864d82edcc9ff671172238c8c [2024-11-19 22:04:43,346 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 22:04:43,374 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 22:04:43,377 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 22:04:43,378 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 22:04:43,379 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 22:04:43,380 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product41.cil.c [2024-11-19 22:04:44,827 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 22:04:45,035 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 22:04:45,036 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product41.cil.c [2024-11-19 22:04:45,048 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3a0709b2/c34d51df49514fd584dbc7c7dd29e35c/FLAG85df7019c [2024-11-19 22:04:45,059 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3a0709b2/c34d51df49514fd584dbc7c7dd29e35c [2024-11-19 22:04:45,062 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 22:04:45,063 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 22:04:45,064 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 22:04:45,064 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 22:04:45,072 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 22:04:45,072 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:04:45" (1/1) ... [2024-11-19 22:04:45,075 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b6fa11f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:45, skipping insertion in model container [2024-11-19 22:04:45,075 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:04:45" (1/1) ... [2024-11-19 22:04:45,118 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 22:04:45,452 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_product41.cil.c[17493,17506] [2024-11-19 22:04:45,462 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 22:04:45,481 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 22:04:45,491 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [49] [2024-11-19 22:04:45,493 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [415] [2024-11-19 22:04:45,493 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [484] [2024-11-19 22:04:45,496 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [583] [2024-11-19 22:04:45,497 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [758] [2024-11-19 22:04:45,497 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [857] [2024-11-19 22:04:45,497 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [892] [2024-11-19 22:04:45,497 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification1_spec.i","") [901] [2024-11-19 22:04:45,603 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_product41.cil.c[17493,17506] [2024-11-19 22:04:45,606 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 22:04:45,647 INFO L204 MainTranslator]: Completed translation [2024-11-19 22:04:45,649 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:45 WrapperNode [2024-11-19 22:04:45,650 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 22:04:45,651 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 22:04:45,651 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 22:04:45,651 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 22:04:45,658 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:45" (1/1) ... [2024-11-19 22:04:45,677 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:45" (1/1) ... [2024-11-19 22:04:45,704 INFO L138 Inliner]: procedures = 53, calls = 95, calls flagged for inlining = 21, calls inlined = 18, statements flattened = 181 [2024-11-19 22:04:45,704 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 22:04:45,705 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 22:04:45,705 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 22:04:45,705 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 22:04:45,716 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:45" (1/1) ... [2024-11-19 22:04:45,716 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:45" (1/1) ... [2024-11-19 22:04:45,719 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:45" (1/1) ... [2024-11-19 22:04:45,737 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:45,738 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:45" (1/1) ... [2024-11-19 22:04:45,738 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:45" (1/1) ... [2024-11-19 22:04:45,742 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:45" (1/1) ... [2024-11-19 22:04:45,745 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:45" (1/1) ... [2024-11-19 22:04:45,747 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:45" (1/1) ... [2024-11-19 22:04:45,751 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:45" (1/1) ... [2024-11-19 22:04:45,753 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 22:04:45,754 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 22:04:45,754 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 22:04:45,755 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 22:04:45,755 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:45" (1/1) ... [2024-11-19 22:04:45,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 22:04:45,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:04:45,790 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:45,794 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:45,838 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 22:04:45,838 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2024-11-19 22:04:45,838 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2024-11-19 22:04:45,838 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2024-11-19 22:04:45,839 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2024-11-19 22:04:45,839 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-11-19 22:04:45,839 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-11-19 22:04:45,839 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-11-19 22:04:45,839 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-11-19 22:04:45,839 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2024-11-19 22:04:45,839 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2024-11-19 22:04:45,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 22:04:45,840 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2024-11-19 22:04:45,840 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2024-11-19 22:04:45,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 22:04:45,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 22:04:45,915 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 22:04:45,918 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 22:04:46,178 INFO L? ?]: Removed 40 outVars from TransFormulas that were not future-live. [2024-11-19 22:04:46,179 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 22:04:46,199 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 22:04:46,200 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-19 22:04:46,200 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:04:46 BoogieIcfgContainer [2024-11-19 22:04:46,200 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 22:04:46,202 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 22:04:46,203 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 22:04:46,206 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 22:04:46,207 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 10:04:45" (1/3) ... [2024-11-19 22:04:46,207 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57cdee65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:04:46, skipping insertion in model container [2024-11-19 22:04:46,207 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:45" (2/3) ... [2024-11-19 22:04:46,207 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57cdee65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:04:46, skipping insertion in model container [2024-11-19 22:04:46,208 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:04:46" (3/3) ... [2024-11-19 22:04:46,209 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec1_product41.cil.c [2024-11-19 22:04:46,224 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 22:04:46,224 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 22:04:46,286 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 22:04:46,293 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;@25cd344c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 22:04:46,294 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 22:04:46,297 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 61 states have (on average 1.3934426229508197) internal successors, (85), 67 states have internal predecessors, (85), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-19 22:04:46,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-19 22:04:46,305 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:04:46,306 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:46,306 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:04:46,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:04:46,310 INFO L85 PathProgramCache]: Analyzing trace with hash 641919507, now seen corresponding path program 1 times [2024-11-19 22:04:46,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:04:46,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482220059] [2024-11-19 22:04:46,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:04:46,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:04:46,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:04:46,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-19 22:04:46,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:04:46,521 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:46,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:04:46,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482220059] [2024-11-19 22:04:46,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482220059] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:04:46,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:04:46,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 22:04:46,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219659554] [2024-11-19 22:04:46,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:04:46,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 22:04:46,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:04:46,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 22:04:46,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 22:04:46,551 INFO L87 Difference]: Start difference. First operand has 79 states, 61 states have (on average 1.3934426229508197) internal successors, (85), 67 states have internal predecessors, (85), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 22:04:46,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:04:46,575 INFO L93 Difference]: Finished difference Result 150 states and 205 transitions. [2024-11-19 22:04:46,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 22:04:46,576 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:46,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:04:46,583 INFO L225 Difference]: With dead ends: 150 [2024-11-19 22:04:46,583 INFO L226 Difference]: Without dead ends: 70 [2024-11-19 22:04:46,586 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:46,589 INFO L432 NwaCegarLoop]: 99 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, 99 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:46,590 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 99 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:46,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-19 22:04:46,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-11-19 22:04:46,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 54 states have (on average 1.3148148148148149) internal successors, (71), 59 states have internal predecessors, (71), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-19 22:04:46,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 90 transitions. [2024-11-19 22:04:46,623 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 90 transitions. Word has length 23 [2024-11-19 22:04:46,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:04:46,624 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 90 transitions. [2024-11-19 22:04:46,624 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:46,624 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 90 transitions. [2024-11-19 22:04:46,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-19 22:04:46,626 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:04:46,626 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:46,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 22:04:46,627 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:04:46,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:04:46,627 INFO L85 PathProgramCache]: Analyzing trace with hash 298217176, now seen corresponding path program 1 times [2024-11-19 22:04:46,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:04:46,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98276436] [2024-11-19 22:04:46,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:04:46,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:04:46,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:04:46,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-19 22:04:46,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:04:46,765 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:46,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:04:46,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98276436] [2024-11-19 22:04:46,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98276436] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:04:46,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:04:46,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 22:04:46,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656702891] [2024-11-19 22:04:46,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:04:46,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 22:04:46,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:04:46,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 22:04:46,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:04:46,769 INFO L87 Difference]: Start difference. First operand 70 states and 90 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:46,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:04:46,783 INFO L93 Difference]: Finished difference Result 106 states and 136 transitions. [2024-11-19 22:04:46,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 22:04:46,784 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:46,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:04:46,785 INFO L225 Difference]: With dead ends: 106 [2024-11-19 22:04:46,785 INFO L226 Difference]: Without dead ends: 61 [2024-11-19 22:04:46,786 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:46,788 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 12 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 138 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:46,788 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 138 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:46,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-19 22:04:46,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-11-19 22:04:46,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 53 states have internal predecessors, (64), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-19 22:04:46,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 78 transitions. [2024-11-19 22:04:46,798 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 78 transitions. Word has length 24 [2024-11-19 22:04:46,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:04:46,798 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 78 transitions. [2024-11-19 22:04:46,798 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:46,799 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 78 transitions. [2024-11-19 22:04:46,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-19 22:04:46,800 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:04:46,800 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:46,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 22:04:46,801 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:04:46,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:04:46,802 INFO L85 PathProgramCache]: Analyzing trace with hash -851512189, now seen corresponding path program 1 times [2024-11-19 22:04:46,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:04:46,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293028819] [2024-11-19 22:04:46,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:04:46,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:04:46,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:04:46,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-19 22:04:46,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:04:46,936 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:46,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:04:46,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293028819] [2024-11-19 22:04:46,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293028819] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:04:46,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:04:46,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 22:04:46,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787132803] [2024-11-19 22:04:46,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:04:46,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 22:04:46,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:04:46,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 22:04:46,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:04:46,943 INFO L87 Difference]: Start difference. First operand 61 states and 78 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 22:04:46,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:04:46,971 INFO L93 Difference]: Finished difference Result 115 states and 150 transitions. [2024-11-19 22:04:46,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 22:04:46,974 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2024-11-19 22:04:46,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:04:46,975 INFO L225 Difference]: With dead ends: 115 [2024-11-19 22:04:46,976 INFO L226 Difference]: Without dead ends: 61 [2024-11-19 22:04:46,976 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:04:46,979 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 60 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 76 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:46,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 76 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:46,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-19 22:04:46,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-11-19 22:04:46,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 48 states have (on average 1.3125) internal successors, (63), 53 states have internal predecessors, (63), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-19 22:04:46,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 77 transitions. [2024-11-19 22:04:46,993 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 77 transitions. Word has length 28 [2024-11-19 22:04:46,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:04:46,994 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 77 transitions. [2024-11-19 22:04:46,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 22:04:46,994 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 77 transitions. [2024-11-19 22:04:46,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-19 22:04:46,995 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:04:46,996 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:46,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 22:04:46,996 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:04:46,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:04:46,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1802696392, now seen corresponding path program 1 times [2024-11-19 22:04:46,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:04:46,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892713194] [2024-11-19 22:04:46,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:04:46,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:04:47,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:04:47,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-19 22:04:47,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:04:47,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-19 22:04:47,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:04:47,083 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:47,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:04:47,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892713194] [2024-11-19 22:04:47,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892713194] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:04:47,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:04:47,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 22:04:47,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489934435] [2024-11-19 22:04:47,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:04:47,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 22:04:47,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:04:47,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 22:04:47,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:04:47,090 INFO L87 Difference]: Start difference. First operand 61 states and 77 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:47,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:04:47,132 INFO L93 Difference]: Finished difference Result 154 states and 198 transitions. [2024-11-19 22:04:47,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 22:04:47,134 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:47,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:04:47,136 INFO L225 Difference]: With dead ends: 154 [2024-11-19 22:04:47,136 INFO L226 Difference]: Without dead ends: 100 [2024-11-19 22:04:47,137 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:47,138 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 66 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 133 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:47,142 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 133 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:47,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-19 22:04:47,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2024-11-19 22:04:47,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 76 states have (on average 1.3026315789473684) internal successors, (99), 83 states have internal predecessors, (99), 11 states have call successors, (11), 10 states have call predecessors, (11), 10 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-19 22:04:47,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 123 transitions. [2024-11-19 22:04:47,165 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 123 transitions. Word has length 33 [2024-11-19 22:04:47,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:04:47,165 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 123 transitions. [2024-11-19 22:04:47,165 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:47,165 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 123 transitions. [2024-11-19 22:04:47,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-19 22:04:47,167 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:04:47,167 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:47,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 22:04:47,168 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:04:47,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:04:47,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1480574080, now seen corresponding path program 1 times [2024-11-19 22:04:47,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:04:47,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954735848] [2024-11-19 22:04:47,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:04:47,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:04:47,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:04:47,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 22:04:47,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:04:47,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-19 22:04:47,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:04:47,282 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:47,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:04:47,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954735848] [2024-11-19 22:04:47,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954735848] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:04:47,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:04:47,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 22:04:47,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63023113] [2024-11-19 22:04:47,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:04:47,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 22:04:47,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:04:47,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 22:04:47,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:04:47,285 INFO L87 Difference]: Start difference. First operand 98 states and 123 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:47,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:04:47,365 INFO L93 Difference]: Finished difference Result 100 states and 124 transitions. [2024-11-19 22:04:47,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 22:04:47,366 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:47,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:04:47,367 INFO L225 Difference]: With dead ends: 100 [2024-11-19 22:04:47,367 INFO L226 Difference]: Without dead ends: 98 [2024-11-19 22:04:47,368 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:47,369 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 52 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:04:47,369 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 283 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:04:47,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-19 22:04:47,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-11-19 22:04:47,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 76 states have (on average 1.2894736842105263) internal successors, (98), 83 states have internal predecessors, (98), 11 states have call successors, (11), 10 states have call predecessors, (11), 10 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-19 22:04:47,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 122 transitions. [2024-11-19 22:04:47,381 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 122 transitions. Word has length 39 [2024-11-19 22:04:47,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:04:47,381 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 122 transitions. [2024-11-19 22:04:47,382 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:47,382 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 122 transitions. [2024-11-19 22:04:47,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-19 22:04:47,383 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:04:47,383 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:04:47,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 22:04:47,384 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:04:47,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:04:47,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1339383127, now seen corresponding path program 1 times [2024-11-19 22:04:47,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:04:47,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969522123] [2024-11-19 22:04:47,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:04:47,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:04:47,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:04:47,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 22:04:47,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:04:47,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-19 22:04:47,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:04:47,513 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 22:04:47,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:04:47,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969522123] [2024-11-19 22:04:47,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969522123] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:04:47,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:04:47,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 22:04:47,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654771520] [2024-11-19 22:04:47,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:04:47,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 22:04:47,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:04:47,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 22:04:47,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:04:47,516 INFO L87 Difference]: Start difference. First operand 98 states and 122 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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:47,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:04:47,553 INFO L93 Difference]: Finished difference Result 192 states and 245 transitions. [2024-11-19 22:04:47,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 22:04:47,553 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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 45 [2024-11-19 22:04:47,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:04:47,554 INFO L225 Difference]: With dead ends: 192 [2024-11-19 22:04:47,554 INFO L226 Difference]: Without dead ends: 101 [2024-11-19 22:04:47,555 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:04:47,556 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 0 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 289 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:47,560 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 289 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:47,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-19 22:04:47,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-11-19 22:04:47,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 79 states have (on average 1.2784810126582278) internal successors, (101), 86 states have internal predecessors, (101), 11 states have call successors, (11), 10 states have call predecessors, (11), 10 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-19 22:04:47,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 125 transitions. [2024-11-19 22:04:47,580 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 125 transitions. Word has length 45 [2024-11-19 22:04:47,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:04:47,581 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 125 transitions. [2024-11-19 22:04:47,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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:47,581 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 125 transitions. [2024-11-19 22:04:47,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-19 22:04:47,582 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:04:47,582 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:04:47,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 22:04:47,583 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:04:47,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:04:47,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1473396633, now seen corresponding path program 1 times [2024-11-19 22:04:47,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:04:47,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056054820] [2024-11-19 22:04:47,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:04:47,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:04:47,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:04:47,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 22:04:47,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:04:47,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-19 22:04:47,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:04:47,679 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 22:04:47,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:04:47,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056054820] [2024-11-19 22:04:47,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056054820] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:04:47,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:04:47,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 22:04:47,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931676316] [2024-11-19 22:04:47,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:04:47,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 22:04:47,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:04:47,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 22:04:47,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:04:47,684 INFO L87 Difference]: Start difference. First operand 101 states and 125 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 22:04:47,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:04:47,724 INFO L93 Difference]: Finished difference Result 197 states and 250 transitions. [2024-11-19 22:04:47,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 22:04:47,724 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2024-11-19 22:04:47,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:04:47,725 INFO L225 Difference]: With dead ends: 197 [2024-11-19 22:04:47,726 INFO L226 Difference]: Without dead ends: 103 [2024-11-19 22:04:47,727 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:47,729 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 62 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:04:47,730 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 216 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:04:47,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-19 22:04:47,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-11-19 22:04:47,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 81 states have (on average 1.271604938271605) internal successors, (103), 88 states have internal predecessors, (103), 11 states have call successors, (11), 10 states have call predecessors, (11), 10 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-19 22:04:47,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 127 transitions. [2024-11-19 22:04:47,744 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 127 transitions. Word has length 45 [2024-11-19 22:04:47,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:04:47,745 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 127 transitions. [2024-11-19 22:04:47,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 22:04:47,745 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 127 transitions. [2024-11-19 22:04:47,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-19 22:04:47,746 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:04:47,746 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:04:47,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 22:04:47,747 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:04:47,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:04:47,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1411357019, now seen corresponding path program 1 times [2024-11-19 22:04:47,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:04:47,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665195476] [2024-11-19 22:04:47,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:04:47,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:04:47,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:04:47,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 22:04:47,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:04:47,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-19 22:04:47,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:04:47,849 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 22:04:47,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:04:47,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665195476] [2024-11-19 22:04:47,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665195476] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:04:47,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:04:47,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 22:04:47,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505022286] [2024-11-19 22:04:47,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:04:47,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 22:04:47,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:04:47,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 22:04:47,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:04:47,855 INFO L87 Difference]: Start difference. First operand 103 states and 127 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 22:04:47,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:04:47,878 INFO L93 Difference]: Finished difference Result 240 states and 300 transitions. [2024-11-19 22:04:47,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 22:04:47,879 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2024-11-19 22:04:47,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:04:47,882 INFO L225 Difference]: With dead ends: 240 [2024-11-19 22:04:47,884 INFO L226 Difference]: Without dead ends: 144 [2024-11-19 22:04:47,884 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:47,885 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 34 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 141 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:47,886 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 141 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:47,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-19 22:04:47,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2024-11-19 22:04:47,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 113 states have (on average 1.247787610619469) internal successors, (141), 121 states have internal predecessors, (141), 16 states have call successors, (16), 15 states have call predecessors, (16), 14 states have return successors, (18), 15 states have call predecessors, (18), 16 states have call successors, (18) [2024-11-19 22:04:47,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 175 transitions. [2024-11-19 22:04:47,904 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 175 transitions. Word has length 45 [2024-11-19 22:04:47,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:04:47,904 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 175 transitions. [2024-11-19 22:04:47,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 22:04:47,904 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 175 transitions. [2024-11-19 22:04:47,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-19 22:04:47,908 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:04:47,908 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:04:47,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 22:04:47,909 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:04:47,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:04:47,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1522141247, now seen corresponding path program 1 times [2024-11-19 22:04:47,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:04:47,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822332615] [2024-11-19 22:04:47,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:04:47,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:04:47,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:04:48,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-19 22:04:48,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:04:48,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-19 22:04:48,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:04:48,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 22:04:48,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:04:48,089 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 22:04:48,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:04:48,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822332615] [2024-11-19 22:04:48,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822332615] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:04:48,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:04:48,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 22:04:48,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550225100] [2024-11-19 22:04:48,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:04:48,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 22:04:48,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:04:48,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 22:04:48,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 22:04:48,091 INFO L87 Difference]: Start difference. First operand 144 states and 175 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 22:04:48,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:04:48,346 INFO L93 Difference]: Finished difference Result 502 states and 630 transitions. [2024-11-19 22:04:48,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 22:04:48,347 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 49 [2024-11-19 22:04:48,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:04:48,349 INFO L225 Difference]: With dead ends: 502 [2024-11-19 22:04:48,349 INFO L226 Difference]: Without dead ends: 365 [2024-11-19 22:04:48,350 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 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:48,353 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 115 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 22:04:48,354 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 343 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 22:04:48,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2024-11-19 22:04:48,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 359. [2024-11-19 22:04:48,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 282 states have (on average 1.2198581560283688) internal successors, (344), 307 states have internal predecessors, (344), 42 states have call successors, (42), 30 states have call predecessors, (42), 34 states have return successors, (55), 40 states have call predecessors, (55), 42 states have call successors, (55) [2024-11-19 22:04:48,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 441 transitions. [2024-11-19 22:04:48,408 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 441 transitions. Word has length 49 [2024-11-19 22:04:48,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:04:48,409 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 441 transitions. [2024-11-19 22:04:48,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 22:04:48,409 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 441 transitions. [2024-11-19 22:04:48,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-19 22:04:48,410 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:04:48,410 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:04:48,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 22:04:48,411 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:04:48,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:04:48,411 INFO L85 PathProgramCache]: Analyzing trace with hash 2075150747, now seen corresponding path program 1 times [2024-11-19 22:04:48,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:04:48,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919413366] [2024-11-19 22:04:48,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:04:48,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:04:48,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:04:48,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-19 22:04:48,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:04:48,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-19 22:04:48,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:04:48,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-19 22:04:48,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:04:48,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-19 22:04:48,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:04:48,579 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 22:04:48,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:04:48,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919413366] [2024-11-19 22:04:48,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919413366] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 22:04:48,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404856843] [2024-11-19 22:04:48,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:04:48,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:04:48,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:04:48,585 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 22:04:48,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 22:04:48,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:04:48,664 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 22:04:48,670 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:04:48,825 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:04:48,825 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 22:04:48,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1404856843] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:04:48,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 22:04:48,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [12] total 17 [2024-11-19 22:04:48,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752943492] [2024-11-19 22:04:48,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:04:48,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 22:04:48,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:04:48,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 22:04:48,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2024-11-19 22:04:48,827 INFO L87 Difference]: Start difference. First operand 359 states and 441 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 22:04:48,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:04:48,941 INFO L93 Difference]: Finished difference Result 707 states and 873 transitions. [2024-11-19 22:04:48,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 22:04:48,942 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 53 [2024-11-19 22:04:48,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:04:48,944 INFO L225 Difference]: With dead ends: 707 [2024-11-19 22:04:48,944 INFO L226 Difference]: Without dead ends: 355 [2024-11-19 22:04:48,945 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2024-11-19 22:04:48,946 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 47 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 22:04:48,946 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 694 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 22:04:48,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2024-11-19 22:04:48,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 344. [2024-11-19 22:04:48,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 270 states have (on average 1.2037037037037037) internal successors, (325), 292 states have internal predecessors, (325), 40 states have call successors, (40), 30 states have call predecessors, (40), 33 states have return successors, (48), 38 states have call predecessors, (48), 40 states have call successors, (48) [2024-11-19 22:04:48,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 413 transitions. [2024-11-19 22:04:48,978 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 413 transitions. Word has length 53 [2024-11-19 22:04:48,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:04:48,978 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 413 transitions. [2024-11-19 22:04:48,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 22:04:48,978 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 413 transitions. [2024-11-19 22:04:48,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-19 22:04:48,981 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:04:48,982 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:04:48,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-19 22:04:49,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-19 22:04:49,183 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:04:49,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:04:49,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1462219428, now seen corresponding path program 1 times [2024-11-19 22:04:49,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:04:49,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279153634] [2024-11-19 22:04:49,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:04:49,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:04:49,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 22:04:49,200 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 22:04:49,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 22:04:49,233 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 22:04:49,233 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 22:04:49,234 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 22:04:49,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 22:04:49,237 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:04:49,294 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 22:04:49,299 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 10:04:49 BoogieIcfgContainer [2024-11-19 22:04:49,299 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 22:04:49,300 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 22:04:49,300 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 22:04:49,300 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 22:04:49,300 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:46" (3/4) ... [2024-11-19 22:04:49,301 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-19 22:04:49,399 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 22:04:49,399 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 22:04:49,399 INFO L158 Benchmark]: Toolchain (without parser) took 4336.42ms. Allocated memory is still 203.4MB. Free memory was 135.4MB in the beginning and 76.0MB in the end (delta: 59.5MB). Peak memory consumption was 62.1MB. Max. memory is 16.1GB. [2024-11-19 22:04:49,400 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 109.1MB. Free memory is still 71.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 22:04:49,400 INFO L158 Benchmark]: CACSL2BoogieTranslator took 585.78ms. Allocated memory is still 203.4MB. Free memory was 135.2MB in the beginning and 174.0MB in the end (delta: -38.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-19 22:04:49,400 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.83ms. Allocated memory is still 203.4MB. Free memory was 174.0MB in the beginning and 171.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 22:04:49,403 INFO L158 Benchmark]: Boogie Preprocessor took 48.42ms. Allocated memory is still 203.4MB. Free memory was 171.9MB in the beginning and 169.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 22:04:49,403 INFO L158 Benchmark]: RCFGBuilder took 446.28ms. Allocated memory is still 203.4MB. Free memory was 169.8MB in the beginning and 152.2MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-19 22:04:49,403 INFO L158 Benchmark]: TraceAbstraction took 3096.80ms. Allocated memory is still 203.4MB. Free memory was 150.9MB in the beginning and 82.3MB in the end (delta: 68.6MB). Peak memory consumption was 70.5MB. Max. memory is 16.1GB. [2024-11-19 22:04:49,403 INFO L158 Benchmark]: Witness Printer took 99.27ms. Allocated memory is still 203.4MB. Free memory was 82.3MB in the beginning and 76.0MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-19 22:04:49,404 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.15ms. Allocated memory is still 109.1MB. Free memory is still 71.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 585.78ms. Allocated memory is still 203.4MB. Free memory was 135.2MB in the beginning and 174.0MB in the end (delta: -38.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.83ms. Allocated memory is still 203.4MB. Free memory was 174.0MB in the beginning and 171.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.42ms. Allocated memory is still 203.4MB. Free memory was 171.9MB in the beginning and 169.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 446.28ms. Allocated memory is still 203.4MB. Free memory was 169.8MB in the beginning and 152.2MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3096.80ms. Allocated memory is still 203.4MB. Free memory was 150.9MB in the beginning and 82.3MB in the end (delta: 68.6MB). Peak memory consumption was 70.5MB. Max. memory is 16.1GB. * Witness Printer took 99.27ms. Allocated memory is still 203.4MB. Free memory was 82.3MB in the beginning and 76.0MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 49]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [49] - GenericResultAtLocation [Line: 415]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [415] - GenericResultAtLocation [Line: 484]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [484] - GenericResultAtLocation [Line: 583]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [583] - GenericResultAtLocation [Line: 758]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [758] - GenericResultAtLocation [Line: 857]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [857] - GenericResultAtLocation [Line: 892]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [892] - GenericResultAtLocation [Line: 901]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification1_spec.i","") [901] * 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: 897]: 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; [L490] int waterLevel = 1; [L491] int methaneLevelCritical = 0; [L588] int pumpRunning = 0; [L589] int systemActive = 1; [L759] int cleanupTimeShifts = 4; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L835] int retValue_acc ; [L836] int tmp ; [L840] FCALL select_helpers() [L841] FCALL select_features() [L842] CALL, EXPR valid_product() [L884] int retValue_acc ; [L887] retValue_acc = 1 [L888] return (retValue_acc); VAL [\result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L842] RET, EXPR valid_product() [L842] tmp = valid_product() [L844] COND TRUE \read(tmp) [L846] FCALL setup() [L847] CALL runTest() [L826] CALL test() [L421] int splverifierCounter ; [L422] int tmp ; [L423] int tmp___0 ; [L424] int tmp___1 ; [L425] int tmp___2 ; [L428] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L430] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L432] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L438] tmp = __VERIFIER_nondet_int() [L440] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L442] CALL waterRise() VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L508] COND TRUE waterLevel < 2 [L509] waterLevel = waterLevel + 1 VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L442] RET waterRise() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L448] tmp___0 = __VERIFIER_nondet_int() [L450] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L458] tmp___2 = __VERIFIER_nondet_int() [L460] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L473] CALL timeShift() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L596] COND FALSE !(\read(pumpRunning)) VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L603] COND TRUE \read(systemActive) [L605] CALL processEnvironment() [L625] int tmp ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L628] COND TRUE ! pumpRunning [L630] CALL, EXPR isHighWaterLevel() [L740] int retValue_acc ; [L741] int tmp ; [L742] int tmp___0 ; [L746] CALL, EXPR isHighWaterSensorDry() [L570] int retValue_acc ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L573] COND FALSE !(waterLevel < 2) [L577] retValue_acc = 0 [L578] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L746] RET, EXPR isHighWaterSensorDry() [L746] tmp = isHighWaterSensorDry() [L748] COND FALSE !(\read(tmp)) [L751] tmp___0 = 1 VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, tmp___0=1, waterLevel=2] [L753] retValue_acc = tmp___0 [L754] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L630] RET, EXPR isHighWaterLevel() [L630] tmp = isHighWaterLevel() [L632] COND TRUE \read(tmp) [L634] CALL activatePump() [L659] int tmp ; [L663] CALL, EXPR isMethaneAlarm() [L684] int retValue_acc ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L688] CALL, EXPR isMethaneLevelCritical() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L529] int retValue_acc ; [L532] retValue_acc = methaneLevelCritical [L533] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L688] RET, EXPR isMethaneLevelCritical() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L688] retValue_acc = isMethaneLevelCritical() [L690] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L663] RET, EXPR isMethaneAlarm() [L663] tmp = isMethaneAlarm() [L665] COND FALSE !(\read(tmp)) [L669] CALL activatePump__wrappee__highWaterSensor() [L653] pumpRunning = 1 VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L669] RET activatePump__wrappee__highWaterSensor() [L634] RET activatePump() [L605] RET processEnvironment() [L611] CALL __utac_acc__Specification1_spec__1() [L903] int tmp ; [L904] int tmp___0 ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L908] CALL, EXPR isMethaneLevelCritical() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L529] int retValue_acc ; [L532] retValue_acc = methaneLevelCritical [L533] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L908] RET, EXPR isMethaneLevelCritical() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L908] tmp = isMethaneLevelCritical() [L910] COND FALSE !(\read(tmp)) VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L611] RET __utac_acc__Specification1_spec__1() [L473] RET timeShift() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L430] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L432] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L438] tmp = __VERIFIER_nondet_int() [L440] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L448] tmp___0 = __VERIFIER_nondet_int() [L450] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L452] CALL changeMethaneLevel() VAL [\old(methaneLevelCritical)=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L520] COND FALSE !(\read(methaneLevelCritical)) [L523] methaneLevelCritical = 1 VAL [\old(methaneLevelCritical)=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L452] RET changeMethaneLevel() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L458] tmp___2 = __VERIFIER_nondet_int() [L460] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L473] CALL timeShift() VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L596] COND TRUE \read(pumpRunning) [L598] CALL lowerWaterLevel() [L496] COND TRUE waterLevel > 0 [L497] waterLevel = waterLevel - 1 VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L598] RET lowerWaterLevel() [L603] COND TRUE \read(systemActive) [L605] CALL processEnvironment() [L625] int tmp ; VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L628] COND FALSE !(! pumpRunning) VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L643] FCALL processEnvironment__wrappee__base() VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L605] RET processEnvironment() [L611] CALL __utac_acc__Specification1_spec__1() [L903] int tmp ; [L904] int tmp___0 ; VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L908] CALL, EXPR isMethaneLevelCritical() VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L529] int retValue_acc ; [L532] retValue_acc = methaneLevelCritical [L533] return (retValue_acc); VAL [\old(pumpRunning)=1, \old(waterLevel)=2, \result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L908] RET, EXPR isMethaneLevelCritical() VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L908] tmp = isMethaneLevelCritical() [L910] COND TRUE \read(tmp) [L912] CALL, EXPR isPumpRunning() [L695] int retValue_acc ; [L698] retValue_acc = pumpRunning [L699] return (retValue_acc); VAL [\old(pumpRunning)=1, \old(waterLevel)=2, \result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L912] RET, EXPR isPumpRunning() [L912] tmp___0 = isPumpRunning() [L914] COND TRUE \read(tmp___0) [L916] CALL __automaton_fail() [L897] reach_error() VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 79 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.0s, OverallIterations: 11, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 461 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 448 mSDsluCounter, 2412 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1571 mSDsCounter, 38 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 263 IncrementalHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 38 mSolverCounterUnsat, 841 mSDtfsCounter, 263 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 146 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=359occurred in iteration=9, InterpolantAutomatonStates: 47, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 19 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 518 NumberOfCodeBlocks, 518 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 426 ConstructedInterpolants, 0 QuantifiedInterpolants, 795 SizeOfPredicates, 1 NumberOfNonLiveVariables, 217 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 11 InterpolantComputations, 10 PerfectInterpolantSequences, 16/18 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:49,428 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE