./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec2_product42.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/minepump_spec2_product42.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 23f15893fb26009b2882a55698a2d895d2e3e404fcbd45ba17e1cf64b2b2b34e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 14:19:03,732 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 14:19:03,862 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 14:19:03,865 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 14:19:03,875 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 14:19:03,941 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 14:19:03,944 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 14:19:03,945 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 14:19:03,945 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 14:19:03,945 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 14:19:03,945 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 14:19:03,946 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 14:19:03,946 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 14:19:03,946 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 14:19:03,946 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 14:19:03,947 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 14:19:03,947 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 14:19:03,953 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 14:19:03,954 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 14:19:03,954 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 14:19:03,954 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 14:19:03,958 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 14:19:03,958 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 14:19:03,958 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 14:19:03,958 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 14:19:03,959 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 14:19:03,959 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 14:19:03,959 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 14:19:03,959 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 14:19:03,959 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 14:19:03,959 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 14:19:03,959 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 14:19:03,960 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 14:19:03,960 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 14:19:03,960 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 14:19:03,960 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 14:19:03,960 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 14:19:03,960 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 14:19:03,960 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 14:19:03,960 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 14:19:03,961 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 14:19:03,965 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 14:19:03,965 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 -> 23f15893fb26009b2882a55698a2d895d2e3e404fcbd45ba17e1cf64b2b2b34e [2024-11-18 14:19:04,365 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 14:19:04,403 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 14:19:04,410 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 14:19:04,411 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 14:19:04,412 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 14:19:04,416 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec2_product42.cil.c [2024-11-18 14:19:06,143 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 14:19:06,321 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 14:19:06,321 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product42.cil.c [2024-11-18 14:19:06,331 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca0e04d4b/27b0e1f889a04da185e8ed30c774674d/FLAG7ac566265 [2024-11-18 14:19:06,347 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca0e04d4b/27b0e1f889a04da185e8ed30c774674d [2024-11-18 14:19:06,350 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 14:19:06,352 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 14:19:06,353 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 14:19:06,354 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 14:19:06,358 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 14:19:06,359 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 02:19:06" (1/1) ... [2024-11-18 14:19:06,359 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5465d9a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:19:06, skipping insertion in model container [2024-11-18 14:19:06,360 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 02:19:06" (1/1) ... [2024-11-18 14:19:06,390 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 14:19:06,578 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product42.cil.c[17055,17068] [2024-11-18 14:19:06,589 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 14:19:06,598 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 14:19:06,607 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [49] [2024-11-18 14:19:06,608 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [415] [2024-11-18 14:19:06,608 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [487] [2024-11-18 14:19:06,609 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [674] [2024-11-18 14:19:06,609 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [714] [2024-11-18 14:19:06,609 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [752] [2024-11-18 14:19:06,609 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [849] [2024-11-18 14:19:06,609 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [858] [2024-11-18 14:19:06,644 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product42.cil.c[17055,17068] [2024-11-18 14:19:06,647 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 14:19:06,662 INFO L204 MainTranslator]: Completed translation [2024-11-18 14:19:06,663 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:19:06 WrapperNode [2024-11-18 14:19:06,663 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 14:19:06,664 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 14:19:06,664 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 14:19:06,664 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 14:19:06,669 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:19:06" (1/1) ... [2024-11-18 14:19:06,678 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:19:06" (1/1) ... [2024-11-18 14:19:06,695 INFO L138 Inliner]: procedures = 55, calls = 97, calls flagged for inlining = 23, calls inlined = 20, statements flattened = 192 [2024-11-18 14:19:06,695 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 14:19:06,696 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 14:19:06,696 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 14:19:06,696 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 14:19:06,704 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:19:06" (1/1) ... [2024-11-18 14:19:06,705 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:19:06" (1/1) ... [2024-11-18 14:19:06,706 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:19:06" (1/1) ... [2024-11-18 14:19:06,716 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-18 14:19:06,716 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:19:06" (1/1) ... [2024-11-18 14:19:06,716 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:19:06" (1/1) ... [2024-11-18 14:19:06,720 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:19:06" (1/1) ... [2024-11-18 14:19:06,723 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:19:06" (1/1) ... [2024-11-18 14:19:06,724 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:19:06" (1/1) ... [2024-11-18 14:19:06,725 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:19:06" (1/1) ... [2024-11-18 14:19:06,726 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 14:19:06,727 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 14:19:06,727 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 14:19:06,727 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 14:19:06,728 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:19:06" (1/1) ... [2024-11-18 14:19:06,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 14:19:06,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 14:19:06,772 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-18 14:19:06,776 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-18 14:19:06,811 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 14:19:06,811 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2024-11-18 14:19:06,811 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2024-11-18 14:19:06,811 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2024-11-18 14:19:06,811 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2024-11-18 14:19:06,811 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-11-18 14:19:06,811 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-11-18 14:19:06,812 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-11-18 14:19:06,812 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-11-18 14:19:06,812 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2024-11-18 14:19:06,812 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2024-11-18 14:19:06,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 14:19:06,812 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2024-11-18 14:19:06,812 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2024-11-18 14:19:06,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 14:19:06,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 14:19:06,877 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 14:19:06,879 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 14:19:07,067 INFO L? ?]: Removed 40 outVars from TransFormulas that were not future-live. [2024-11-18 14:19:07,067 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 14:19:07,083 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 14:19:07,084 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-18 14:19:07,084 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:19:07 BoogieIcfgContainer [2024-11-18 14:19:07,084 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 14:19:07,087 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 14:19:07,087 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 14:19:07,090 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 14:19:07,090 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 02:19:06" (1/3) ... [2024-11-18 14:19:07,091 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@975c630 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 02:19:07, skipping insertion in model container [2024-11-18 14:19:07,091 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:19:06" (2/3) ... [2024-11-18 14:19:07,091 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@975c630 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 02:19:07, skipping insertion in model container [2024-11-18 14:19:07,092 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:19:07" (3/3) ... [2024-11-18 14:19:07,093 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec2_product42.cil.c [2024-11-18 14:19:07,110 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 14:19:07,110 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 14:19:07,173 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 14:19:07,183 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;@438d6fc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 14:19:07,183 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 14:19:07,187 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 64 states have (on average 1.390625) internal successors, (89), 70 states have internal predecessors, (89), 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-18 14:19:07,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-18 14:19:07,202 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:19:07,203 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:19:07,203 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:19:07,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:19:07,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1298361785, now seen corresponding path program 1 times [2024-11-18 14:19:07,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:19:07,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825184826] [2024-11-18 14:19:07,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:19:07,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:19:07,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:19:07,359 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-18 14:19:07,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:19:07,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825184826] [2024-11-18 14:19:07,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825184826] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:19:07,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:19:07,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 14:19:07,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680615144] [2024-11-18 14:19:07,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:19:07,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 14:19:07,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:19:07,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 14:19:07,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 14:19:07,398 INFO L87 Difference]: Start difference. First operand has 82 states, 64 states have (on average 1.390625) internal successors, (89), 70 states have internal predecessors, (89), 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 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 14:19:07,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:19:07,459 INFO L93 Difference]: Finished difference Result 155 states and 212 transitions. [2024-11-18 14:19:07,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 14:19:07,462 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2024-11-18 14:19:07,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:19:07,469 INFO L225 Difference]: With dead ends: 155 [2024-11-18 14:19:07,469 INFO L226 Difference]: Without dead ends: 73 [2024-11-18 14:19:07,472 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-18 14:19:07,474 INFO L432 NwaCegarLoop]: 103 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, 103 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-18 14:19:07,475 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 14:19:07,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-18 14:19:07,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-11-18 14:19:07,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 57 states have (on average 1.3157894736842106) internal successors, (75), 62 states have internal predecessors, (75), 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-18 14:19:07,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 94 transitions. [2024-11-18 14:19:07,514 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 94 transitions. Word has length 25 [2024-11-18 14:19:07,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:19:07,514 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 94 transitions. [2024-11-18 14:19:07,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 14:19:07,515 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 94 transitions. [2024-11-18 14:19:07,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-18 14:19:07,516 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:19:07,516 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:19:07,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-18 14:19:07,517 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:19:07,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:19:07,518 INFO L85 PathProgramCache]: Analyzing trace with hash -544570962, now seen corresponding path program 1 times [2024-11-18 14:19:07,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:19:07,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557584904] [2024-11-18 14:19:07,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:19:07,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:19:07,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:19:07,710 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-18 14:19:07,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:19:07,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557584904] [2024-11-18 14:19:07,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557584904] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:19:07,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:19:07,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 14:19:07,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211578816] [2024-11-18 14:19:07,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:19:07,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 14:19:07,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:19:07,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 14:19:07,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 14:19:07,718 INFO L87 Difference]: Start difference. First operand 73 states and 94 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 14:19:07,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:19:07,744 INFO L93 Difference]: Finished difference Result 110 states and 142 transitions. [2024-11-18 14:19:07,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 14:19:07,745 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2024-11-18 14:19:07,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:19:07,746 INFO L225 Difference]: With dead ends: 110 [2024-11-18 14:19:07,746 INFO L226 Difference]: Without dead ends: 64 [2024-11-18 14:19:07,747 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-18 14:19:07,747 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 13 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 145 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-18 14:19:07,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 145 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 14:19:07,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-18 14:19:07,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-11-18 14:19:07,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 51 states have (on average 1.3333333333333333) internal successors, (68), 56 states have internal predecessors, (68), 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-18 14:19:07,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 82 transitions. [2024-11-18 14:19:07,762 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 82 transitions. Word has length 26 [2024-11-18 14:19:07,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:19:07,762 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 82 transitions. [2024-11-18 14:19:07,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 14:19:07,763 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 82 transitions. [2024-11-18 14:19:07,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-18 14:19:07,764 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:19:07,764 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] [2024-11-18 14:19:07,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 14:19:07,768 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:19:07,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:19:07,769 INFO L85 PathProgramCache]: Analyzing trace with hash -2042208755, now seen corresponding path program 1 times [2024-11-18 14:19:07,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:19:07,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500456068] [2024-11-18 14:19:07,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:19:07,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:19:07,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:19:08,103 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-18 14:19:08,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:19:08,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500456068] [2024-11-18 14:19:08,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500456068] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:19:08,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:19:08,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 14:19:08,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202706837] [2024-11-18 14:19:08,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:19:08,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 14:19:08,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:19:08,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 14:19:08,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 14:19:08,109 INFO L87 Difference]: Start difference. First operand 64 states and 82 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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-18 14:19:08,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:19:08,222 INFO L93 Difference]: Finished difference Result 120 states and 157 transitions. [2024-11-18 14:19:08,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 14:19:08,223 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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 31 [2024-11-18 14:19:08,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:19:08,224 INFO L225 Difference]: With dead ends: 120 [2024-11-18 14:19:08,224 INFO L226 Difference]: Without dead ends: 64 [2024-11-18 14:19:08,224 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-18 14:19:08,225 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 76 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 14:19:08,226 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 232 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 14:19:08,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-18 14:19:08,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-11-18 14:19:08,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 51 states have (on average 1.3137254901960784) internal successors, (67), 56 states have internal predecessors, (67), 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-18 14:19:08,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 81 transitions. [2024-11-18 14:19:08,255 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 81 transitions. Word has length 31 [2024-11-18 14:19:08,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:19:08,259 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 81 transitions. [2024-11-18 14:19:08,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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-18 14:19:08,260 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 81 transitions. [2024-11-18 14:19:08,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-18 14:19:08,260 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:19:08,261 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] [2024-11-18 14:19:08,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-18 14:19:08,261 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:19:08,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:19:08,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1332459068, now seen corresponding path program 1 times [2024-11-18 14:19:08,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:19:08,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549056348] [2024-11-18 14:19:08,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:19:08,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:19:08,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:19:08,377 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-18 14:19:08,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:19:08,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549056348] [2024-11-18 14:19:08,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549056348] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:19:08,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:19:08,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 14:19:08,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765391429] [2024-11-18 14:19:08,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:19:08,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 14:19:08,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:19:08,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 14:19:08,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 14:19:08,385 INFO L87 Difference]: Start difference. First operand 64 states and 81 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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-18 14:19:08,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:19:08,459 INFO L93 Difference]: Finished difference Result 161 states and 208 transitions. [2024-11-18 14:19:08,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 14:19:08,461 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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 36 [2024-11-18 14:19:08,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:19:08,462 INFO L225 Difference]: With dead ends: 161 [2024-11-18 14:19:08,462 INFO L226 Difference]: Without dead ends: 105 [2024-11-18 14:19:08,463 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-18 14:19:08,463 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 70 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 142 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.1s IncrementalHoareTripleChecker+Time [2024-11-18 14:19:08,464 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 142 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 14:19:08,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-18 14:19:08,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2024-11-18 14:19:08,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 81 states have (on average 1.308641975308642) internal successors, (106), 88 states have internal predecessors, (106), 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-18 14:19:08,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 130 transitions. [2024-11-18 14:19:08,496 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 130 transitions. Word has length 36 [2024-11-18 14:19:08,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:19:08,497 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 130 transitions. [2024-11-18 14:19:08,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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-18 14:19:08,497 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 130 transitions. [2024-11-18 14:19:08,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-18 14:19:08,498 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:19:08,498 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:19:08,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-18 14:19:08,501 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:19:08,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:19:08,501 INFO L85 PathProgramCache]: Analyzing trace with hash -491826932, now seen corresponding path program 1 times [2024-11-18 14:19:08,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:19:08,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431443488] [2024-11-18 14:19:08,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:19:08,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:19:08,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:19:08,675 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-18 14:19:08,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:19:08,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431443488] [2024-11-18 14:19:08,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431443488] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:19:08,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:19:08,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 14:19:08,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179556177] [2024-11-18 14:19:08,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:19:08,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 14:19:08,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:19:08,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 14:19:08,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 14:19:08,682 INFO L87 Difference]: Start difference. First operand 103 states and 130 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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-18 14:19:08,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:19:08,785 INFO L93 Difference]: Finished difference Result 197 states and 252 transitions. [2024-11-18 14:19:08,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 14:19:08,786 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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 42 [2024-11-18 14:19:08,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:19:08,787 INFO L225 Difference]: With dead ends: 197 [2024-11-18 14:19:08,788 INFO L226 Difference]: Without dead ends: 102 [2024-11-18 14:19:08,788 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-18 14:19:08,789 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 54 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 298 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.1s IncrementalHoareTripleChecker+Time [2024-11-18 14:19:08,797 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 298 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 14:19:08,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-18 14:19:08,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2024-11-18 14:19:08,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 80 states have (on average 1.2875) internal successors, (103), 87 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-18 14:19:08,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 127 transitions. [2024-11-18 14:19:08,816 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 127 transitions. Word has length 42 [2024-11-18 14:19:08,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:19:08,819 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 127 transitions. [2024-11-18 14:19:08,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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-18 14:19:08,820 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 127 transitions. [2024-11-18 14:19:08,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-18 14:19:08,820 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:19:08,821 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] [2024-11-18 14:19:08,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-18 14:19:08,821 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:19:08,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:19:08,822 INFO L85 PathProgramCache]: Analyzing trace with hash 552716463, now seen corresponding path program 1 times [2024-11-18 14:19:08,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:19:08,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888798539] [2024-11-18 14:19:08,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:19:08,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:19:08,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:19:08,930 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-18 14:19:08,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:19:08,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888798539] [2024-11-18 14:19:08,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888798539] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:19:08,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:19:08,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 14:19:08,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026133662] [2024-11-18 14:19:08,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:19:08,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 14:19:08,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:19:08,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 14:19:08,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 14:19:08,936 INFO L87 Difference]: Start difference. First operand 102 states and 127 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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-18 14:19:08,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:19:08,978 INFO L93 Difference]: Finished difference Result 199 states and 254 transitions. [2024-11-18 14:19:08,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 14:19:08,979 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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 48 [2024-11-18 14:19:08,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:19:08,980 INFO L225 Difference]: With dead ends: 199 [2024-11-18 14:19:08,983 INFO L226 Difference]: Without dead ends: 105 [2024-11-18 14:19:08,984 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-18 14:19:08,985 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 305 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-18 14:19:08,985 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 305 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 14:19:08,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-18 14:19:09,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-11-18 14:19:09,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 83 states have (on average 1.2771084337349397) internal successors, (106), 90 states have internal predecessors, (106), 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-18 14:19:09,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 130 transitions. [2024-11-18 14:19:09,006 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 130 transitions. Word has length 48 [2024-11-18 14:19:09,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:19:09,007 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 130 transitions. [2024-11-18 14:19:09,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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-18 14:19:09,007 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 130 transitions. [2024-11-18 14:19:09,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-18 14:19:09,011 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:19:09,011 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] [2024-11-18 14:19:09,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-18 14:19:09,012 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:19:09,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:19:09,012 INFO L85 PathProgramCache]: Analyzing trace with hash 693265073, now seen corresponding path program 1 times [2024-11-18 14:19:09,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:19:09,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617016748] [2024-11-18 14:19:09,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:19:09,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:19:09,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:19:09,111 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-18 14:19:09,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:19:09,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617016748] [2024-11-18 14:19:09,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617016748] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:19:09,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:19:09,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 14:19:09,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467054205] [2024-11-18 14:19:09,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:19:09,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 14:19:09,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:19:09,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 14:19:09,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 14:19:09,117 INFO L87 Difference]: Start difference. First operand 105 states and 130 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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-18 14:19:09,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:19:09,143 INFO L93 Difference]: Finished difference Result 204 states and 259 transitions. [2024-11-18 14:19:09,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 14:19:09,144 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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 48 [2024-11-18 14:19:09,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:19:09,145 INFO L225 Difference]: With dead ends: 204 [2024-11-18 14:19:09,148 INFO L226 Difference]: Without dead ends: 107 [2024-11-18 14:19:09,149 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 14:19:09,149 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 0 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 14:19:09,151 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 231 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 14:19:09,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-18 14:19:09,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-11-18 14:19:09,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 85 states have (on average 1.2705882352941176) internal successors, (108), 92 states have internal predecessors, (108), 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-18 14:19:09,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 132 transitions. [2024-11-18 14:19:09,172 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 132 transitions. Word has length 48 [2024-11-18 14:19:09,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:19:09,176 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 132 transitions. [2024-11-18 14:19:09,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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-18 14:19:09,177 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 132 transitions. [2024-11-18 14:19:09,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-18 14:19:09,177 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:19:09,177 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] [2024-11-18 14:19:09,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-18 14:19:09,178 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:19:09,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:19:09,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1678474189, now seen corresponding path program 1 times [2024-11-18 14:19:09,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:19:09,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063369634] [2024-11-18 14:19:09,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:19:09,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:19:09,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:19:09,285 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-18 14:19:09,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:19:09,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063369634] [2024-11-18 14:19:09,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063369634] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:19:09,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:19:09,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 14:19:09,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046905044] [2024-11-18 14:19:09,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:19:09,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 14:19:09,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:19:09,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 14:19:09,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 14:19:09,287 INFO L87 Difference]: Start difference. First operand 107 states and 132 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-18 14:19:09,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:19:09,332 INFO L93 Difference]: Finished difference Result 248 states and 310 transitions. [2024-11-18 14:19:09,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 14:19:09,333 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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 48 [2024-11-18 14:19:09,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:19:09,334 INFO L225 Difference]: With dead ends: 248 [2024-11-18 14:19:09,337 INFO L226 Difference]: Without dead ends: 149 [2024-11-18 14:19:09,338 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-18 14:19:09,338 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 34 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 148 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-18 14:19:09,339 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 148 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 14:19:09,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-18 14:19:09,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2024-11-18 14:19:09,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 118 states have (on average 1.2457627118644068) internal successors, (147), 126 states have internal predecessors, (147), 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-18 14:19:09,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 181 transitions. [2024-11-18 14:19:09,366 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 181 transitions. Word has length 48 [2024-11-18 14:19:09,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:19:09,369 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 181 transitions. [2024-11-18 14:19:09,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-18 14:19:09,370 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 181 transitions. [2024-11-18 14:19:09,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-18 14:19:09,370 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:19:09,370 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] [2024-11-18 14:19:09,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-18 14:19:09,371 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:19:09,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:19:09,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1903900979, now seen corresponding path program 1 times [2024-11-18 14:19:09,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:19:09,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038110281] [2024-11-18 14:19:09,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:19:09,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:19:09,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:19:09,543 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-18 14:19:09,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:19:09,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038110281] [2024-11-18 14:19:09,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038110281] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:19:09,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:19:09,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 14:19:09,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625446260] [2024-11-18 14:19:09,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:19:09,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 14:19:09,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:19:09,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 14:19:09,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 14:19:09,549 INFO L87 Difference]: Start difference. First operand 149 states and 181 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-18 14:19:09,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:19:09,576 INFO L93 Difference]: Finished difference Result 225 states and 278 transitions. [2024-11-18 14:19:09,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 14:19:09,576 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 52 [2024-11-18 14:19:09,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:19:09,581 INFO L225 Difference]: With dead ends: 225 [2024-11-18 14:19:09,581 INFO L226 Difference]: Without dead ends: 223 [2024-11-18 14:19:09,581 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-18 14:19:09,582 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 41 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 14:19:09,582 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 149 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 14:19:09,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-11-18 14:19:09,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 219. [2024-11-18 14:19:09,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 173 states have (on average 1.254335260115607) internal successors, (217), 186 states have internal predecessors, (217), 24 states have call successors, (24), 22 states have call predecessors, (24), 21 states have return successors, (30), 22 states have call predecessors, (30), 24 states have call successors, (30) [2024-11-18 14:19:09,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 271 transitions. [2024-11-18 14:19:09,616 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 271 transitions. Word has length 52 [2024-11-18 14:19:09,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:19:09,616 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 271 transitions. [2024-11-18 14:19:09,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-18 14:19:09,617 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 271 transitions. [2024-11-18 14:19:09,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-18 14:19:09,621 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:19:09,621 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:19:09,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-18 14:19:09,622 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:19:09,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:19:09,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1105031866, now seen corresponding path program 1 times [2024-11-18 14:19:09,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:19:09,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153473133] [2024-11-18 14:19:09,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:19:09,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:19:09,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:19:09,833 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 23 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-18 14:19:09,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:19:09,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153473133] [2024-11-18 14:19:09,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153473133] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 14:19:09,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1022419226] [2024-11-18 14:19:09,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:19:09,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 14:19:09,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 14:19:09,878 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-18 14:19:09,899 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-18 14:19:10,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:19:10,050 INFO L255 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-18 14:19:10,057 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 14:19:10,312 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-18 14:19:10,314 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 14:19:10,478 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-18 14:19:10,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1022419226] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-18 14:19:10,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-18 14:19:10,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 5] total 10 [2024-11-18 14:19:10,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844097761] [2024-11-18 14:19:10,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:19:10,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 14:19:10,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:19:10,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 14:19:10,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-18 14:19:10,484 INFO L87 Difference]: Start difference. First operand 219 states and 271 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-18 14:19:10,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:19:10,629 INFO L93 Difference]: Finished difference Result 614 states and 778 transitions. [2024-11-18 14:19:10,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-18 14:19:10,630 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 84 [2024-11-18 14:19:10,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:19:10,637 INFO L225 Difference]: With dead ends: 614 [2024-11-18 14:19:10,638 INFO L226 Difference]: Without dead ends: 403 [2024-11-18 14:19:10,639 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 165 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-11-18 14:19:10,640 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 42 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 14:19:10,640 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 358 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 14:19:10,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2024-11-18 14:19:10,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 353. [2024-11-18 14:19:10,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 276 states have (on average 1.2355072463768115) internal successors, (341), 297 states have internal predecessors, (341), 40 states have call successors, (40), 37 states have call predecessors, (40), 36 states have return successors, (52), 37 states have call predecessors, (52), 40 states have call successors, (52) [2024-11-18 14:19:10,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 433 transitions. [2024-11-18 14:19:10,691 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 433 transitions. Word has length 84 [2024-11-18 14:19:10,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:19:10,691 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 433 transitions. [2024-11-18 14:19:10,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-18 14:19:10,692 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 433 transitions. [2024-11-18 14:19:10,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-18 14:19:10,696 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:19:10,696 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:19:10,721 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-18 14:19:10,899 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-18 14:19:10,905 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:19:10,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:19:10,906 INFO L85 PathProgramCache]: Analyzing trace with hash -138549802, now seen corresponding path program 1 times [2024-11-18 14:19:10,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:19:10,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516262762] [2024-11-18 14:19:10,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:19:10,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:19:10,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:19:11,151 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 21 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-18 14:19:11,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:19:11,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516262762] [2024-11-18 14:19:11,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516262762] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 14:19:11,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [496492233] [2024-11-18 14:19:11,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:19:11,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 14:19:11,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 14:19:11,157 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 14:19:11,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-18 14:19:11,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:19:11,379 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-18 14:19:11,382 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 14:19:11,586 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-18 14:19:11,586 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 14:19:11,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [496492233] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:19:11,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 14:19:11,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 16 [2024-11-18 14:19:11,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881689056] [2024-11-18 14:19:11,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:19:11,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-18 14:19:11,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:19:11,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-18 14:19:11,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2024-11-18 14:19:11,592 INFO L87 Difference]: Start difference. First operand 353 states and 433 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 6 states have internal predecessors, (65), 3 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-18 14:19:11,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:19:11,731 INFO L93 Difference]: Finished difference Result 692 states and 857 transitions. [2024-11-18 14:19:11,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-18 14:19:11,736 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 6 states have internal predecessors, (65), 3 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 88 [2024-11-18 14:19:11,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:19:11,737 INFO L225 Difference]: With dead ends: 692 [2024-11-18 14:19:11,737 INFO L226 Difference]: Without dead ends: 347 [2024-11-18 14:19:11,738 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2024-11-18 14:19:11,739 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 47 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 14:19:11,739 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 406 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 14:19:11,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2024-11-18 14:19:11,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 316. [2024-11-18 14:19:11,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 247 states have (on average 1.2267206477732793) internal successors, (303), 262 states have internal predecessors, (303), 36 states have call successors, (36), 34 states have call predecessors, (36), 32 states have return successors, (42), 34 states have call predecessors, (42), 36 states have call successors, (42) [2024-11-18 14:19:11,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 381 transitions. [2024-11-18 14:19:11,781 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 381 transitions. Word has length 88 [2024-11-18 14:19:11,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:19:11,781 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 381 transitions. [2024-11-18 14:19:11,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 6 states have internal predecessors, (65), 3 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-18 14:19:11,782 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 381 transitions. [2024-11-18 14:19:11,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-18 14:19:11,790 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:19:11,791 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:19:11,827 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-18 14:19:11,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-18 14:19:11,992 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:19:11,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:19:11,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1845093653, now seen corresponding path program 1 times [2024-11-18 14:19:11,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:19:11,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030615741] [2024-11-18 14:19:11,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:19:11,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:19:12,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 14:19:12,032 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-18 14:19:12,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 14:19:12,106 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-18 14:19:12,106 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-18 14:19:12,107 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-18 14:19:12,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-18 14:19:12,115 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:19:12,253 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-18 14:19:12,255 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 02:19:12 BoogieIcfgContainer [2024-11-18 14:19:12,259 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-18 14:19:12,260 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-18 14:19:12,260 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-18 14:19:12,260 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-18 14:19:12,260 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:19:07" (3/4) ... [2024-11-18 14:19:12,261 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-18 14:19:12,419 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-18 14:19:12,424 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-18 14:19:12,425 INFO L158 Benchmark]: Toolchain (without parser) took 6073.27ms. Allocated memory was 167.8MB in the beginning and 255.9MB in the end (delta: 88.1MB). Free memory was 116.5MB in the beginning and 139.5MB in the end (delta: -23.0MB). Peak memory consumption was 67.9MB. Max. memory is 16.1GB. [2024-11-18 14:19:12,426 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 167.8MB. Free memory was 131.3MB in the beginning and 131.1MB in the end (delta: 235.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 14:19:12,427 INFO L158 Benchmark]: CACSL2BoogieTranslator took 309.76ms. Allocated memory is still 167.8MB. Free memory was 116.5MB in the beginning and 94.7MB in the end (delta: 21.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-18 14:19:12,428 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.66ms. Allocated memory is still 167.8MB. Free memory was 94.7MB in the beginning and 92.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 14:19:12,428 INFO L158 Benchmark]: Boogie Preprocessor took 30.68ms. Allocated memory is still 167.8MB. Free memory was 92.7MB in the beginning and 90.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 14:19:12,428 INFO L158 Benchmark]: RCFGBuilder took 357.17ms. Allocated memory is still 167.8MB. Free memory was 90.6MB in the beginning and 72.5MB in the end (delta: 18.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-18 14:19:12,429 INFO L158 Benchmark]: TraceAbstraction took 5172.46ms. Allocated memory was 167.8MB in the beginning and 255.9MB in the end (delta: 88.1MB). Free memory was 71.8MB in the beginning and 147.9MB in the end (delta: -76.1MB). Peak memory consumption was 13.4MB. Max. memory is 16.1GB. [2024-11-18 14:19:12,432 INFO L158 Benchmark]: Witness Printer took 164.90ms. Allocated memory is still 255.9MB. Free memory was 147.9MB in the beginning and 139.5MB in the end (delta: 8.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-18 14:19:12,433 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.21ms. Allocated memory is still 167.8MB. Free memory was 131.3MB in the beginning and 131.1MB in the end (delta: 235.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 309.76ms. Allocated memory is still 167.8MB. Free memory was 116.5MB in the beginning and 94.7MB in the end (delta: 21.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.66ms. Allocated memory is still 167.8MB. Free memory was 94.7MB in the beginning and 92.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.68ms. Allocated memory is still 167.8MB. Free memory was 92.7MB in the beginning and 90.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 357.17ms. Allocated memory is still 167.8MB. Free memory was 90.6MB in the beginning and 72.5MB in the end (delta: 18.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 5172.46ms. Allocated memory was 167.8MB in the beginning and 255.9MB in the end (delta: 88.1MB). Free memory was 71.8MB in the beginning and 147.9MB in the end (delta: -76.1MB). Peak memory consumption was 13.4MB. Max. memory is 16.1GB. * Witness Printer took 164.90ms. Allocated memory is still 255.9MB. Free memory was 147.9MB in the beginning and 139.5MB in the end (delta: 8.4MB). Peak memory consumption was 10.5MB. 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: 487]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [487] - GenericResultAtLocation [Line: 674]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [674] - GenericResultAtLocation [Line: 714]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [714] - GenericResultAtLocation [Line: 752]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [752] - GenericResultAtLocation [Line: 849]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [849] - GenericResultAtLocation [Line: 858]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [858] * 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: 854]: 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; [L496] int pumpRunning = 0; [L497] int systemActive = 1; [L676] int methAndRunningLastTime ; [L753] int cleanupTimeShifts = 4; [L860] int waterLevel = 1; [L861] int methaneLevelCritical = 0; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L827] int retValue_acc ; [L828] int tmp ; [L832] FCALL select_helpers() [L833] FCALL select_features() [L834] CALL, EXPR valid_product() [L744] int retValue_acc ; [L747] retValue_acc = 1 [L748] return (retValue_acc); VAL [\result=1, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L834] RET, EXPR valid_product() [L834] tmp = valid_product() [L836] COND TRUE \read(tmp) [L838] FCALL setup() [L839] CALL runTest() [L820] CALL __utac_acc__Specification2_spec__1() [L681] methAndRunningLastTime = 0 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L820] RET __utac_acc__Specification2_spec__1() [L821] CALL test() [L422] int splverifierCounter ; [L423] int tmp ; [L424] int tmp___0 ; [L425] int tmp___1 ; [L426] int tmp___2 ; [L429] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L431] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L433] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L439] tmp = __VERIFIER_nondet_int() [L441] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L443] CALL waterRise() VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L878] COND TRUE waterLevel < 2 [L879] waterLevel = waterLevel + 1 VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L443] RET waterRise() VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L449] tmp___0 = __VERIFIER_nondet_int() [L451] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L459] tmp___2 = __VERIFIER_nondet_int() [L461] COND TRUE \read(tmp___2) [L463] CALL startSystem() [L670] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L463] RET startSystem() [L476] CALL timeShift() VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L504] COND FALSE !(\read(pumpRunning)) VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L511] COND TRUE \read(systemActive) [L513] CALL processEnvironment() [L533] int tmp ; VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L536] COND TRUE ! pumpRunning [L538] CALL, EXPR isHighWaterLevel() [L648] int retValue_acc ; [L649] int tmp ; [L650] int tmp___0 ; [L654] CALL, EXPR isHighWaterSensorDry() [L940] int retValue_acc ; VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L943] COND FALSE !(waterLevel < 2) [L947] retValue_acc = 0 [L948] return (retValue_acc); VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, \result=0, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L654] RET, EXPR isHighWaterSensorDry() [L654] tmp = isHighWaterSensorDry() [L656] COND FALSE !(\read(tmp)) [L659] tmp___0 = 1 VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, tmp___0=1, waterLevel=2] [L661] retValue_acc = tmp___0 [L662] return (retValue_acc); VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, \result=1, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L538] RET, EXPR isHighWaterLevel() [L538] tmp = isHighWaterLevel() [L540] COND TRUE \read(tmp) [L542] CALL activatePump() [L567] int tmp ; [L571] CALL, EXPR isMethaneAlarm() [L592] int retValue_acc ; VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L596] CALL, EXPR isMethaneLevelCritical() VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L899] int retValue_acc ; [L902] retValue_acc = methaneLevelCritical [L903] return (retValue_acc); VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, \result=0, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L596] RET, EXPR isMethaneLevelCritical() VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L596] retValue_acc = isMethaneLevelCritical() [L598] return (retValue_acc); VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, \result=0, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L571] RET, EXPR isMethaneAlarm() [L571] tmp = isMethaneAlarm() [L573] COND FALSE !(\read(tmp)) [L577] CALL activatePump__wrappee__highWaterSensor() [L561] pumpRunning = 1 VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L577] RET activatePump__wrappee__highWaterSensor() [L542] RET activatePump() [L513] RET processEnvironment() [L519] CALL __utac_acc__Specification2_spec__2() [L686] int tmp ; [L687] int tmp___0 ; VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L691] CALL, EXPR isMethaneLevelCritical() VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L899] int retValue_acc ; [L902] retValue_acc = methaneLevelCritical [L903] return (retValue_acc); VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, \result=0, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L691] RET, EXPR isMethaneLevelCritical() VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L691] tmp = isMethaneLevelCritical() [L693] COND FALSE !(\read(tmp)) [L709] methAndRunningLastTime = 0 VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L519] RET __utac_acc__Specification2_spec__2() [L476] RET timeShift() VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L431] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L433] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L439] tmp = __VERIFIER_nondet_int() [L441] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L449] tmp___0 = __VERIFIER_nondet_int() [L451] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L453] CALL changeMethaneLevel() VAL [\old(methaneLevelCritical)=0, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L890] COND FALSE !(\read(methaneLevelCritical)) [L893] methaneLevelCritical = 1 VAL [\old(methaneLevelCritical)=0, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L453] RET changeMethaneLevel() VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L459] tmp___2 = __VERIFIER_nondet_int() [L461] COND TRUE \read(tmp___2) [L463] CALL startSystem() [L670] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L463] RET startSystem() [L476] CALL timeShift() VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L504] COND TRUE \read(pumpRunning) [L506] CALL lowerWaterLevel() [L866] COND TRUE waterLevel > 0 [L867] waterLevel = waterLevel - 1 VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L506] RET lowerWaterLevel() [L511] COND TRUE \read(systemActive) [L513] CALL processEnvironment() [L533] int tmp ; VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L536] COND FALSE !(! pumpRunning) VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L551] FCALL processEnvironment__wrappee__base() VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L513] RET processEnvironment() [L519] CALL __utac_acc__Specification2_spec__2() [L686] int tmp ; [L687] int tmp___0 ; VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L691] CALL, EXPR isMethaneLevelCritical() VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L899] int retValue_acc ; [L902] retValue_acc = methaneLevelCritical [L903] return (retValue_acc); VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=1, \old(waterLevel)=2, \result=1, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L691] RET, EXPR isMethaneLevelCritical() VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L691] tmp = isMethaneLevelCritical() [L693] COND TRUE \read(tmp) [L695] CALL, EXPR isPumpRunning() [L603] int retValue_acc ; [L606] retValue_acc = pumpRunning [L607] return (retValue_acc); VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=1, \old(waterLevel)=2, \result=1, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L695] RET, EXPR isPumpRunning() [L695] tmp___0 = isPumpRunning() [L697] COND TRUE \read(tmp___0) VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L698] COND FALSE !(\read(methAndRunningLastTime)) [L703] methAndRunningLastTime = 1 VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L519] RET __utac_acc__Specification2_spec__2() [L476] RET timeShift() VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=1] [L431] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=1] [L433] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=1] [L439] tmp = __VERIFIER_nondet_int() [L441] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=1] [L449] tmp___0 = __VERIFIER_nondet_int() [L451] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=1] [L459] tmp___2 = __VERIFIER_nondet_int() [L461] COND TRUE \read(tmp___2) [L463] CALL startSystem() [L670] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L463] RET startSystem() [L476] CALL timeShift() VAL [\old(methAndRunningLastTime)=1, \old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L504] COND TRUE \read(pumpRunning) [L506] CALL lowerWaterLevel() [L866] COND TRUE waterLevel > 0 [L867] waterLevel = waterLevel - 1 VAL [\old(methAndRunningLastTime)=1, \old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L506] RET lowerWaterLevel() [L511] COND TRUE \read(systemActive) [L513] CALL processEnvironment() [L533] int tmp ; VAL [\old(methAndRunningLastTime)=1, \old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L536] COND FALSE !(! pumpRunning) VAL [\old(methAndRunningLastTime)=1, \old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L551] FCALL processEnvironment__wrappee__base() VAL [\old(methAndRunningLastTime)=1, \old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L513] RET processEnvironment() [L519] CALL __utac_acc__Specification2_spec__2() [L686] int tmp ; [L687] int tmp___0 ; VAL [\old(methAndRunningLastTime)=1, \old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L691] CALL, EXPR isMethaneLevelCritical() VAL [\old(methAndRunningLastTime)=1, \old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L899] int retValue_acc ; [L902] retValue_acc = methaneLevelCritical [L903] return (retValue_acc); VAL [\old(methAndRunningLastTime)=1, \old(pumpRunning)=1, \old(waterLevel)=1, \result=1, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L691] RET, EXPR isMethaneLevelCritical() VAL [\old(methAndRunningLastTime)=1, \old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L691] tmp = isMethaneLevelCritical() [L693] COND TRUE \read(tmp) [L695] CALL, EXPR isPumpRunning() [L603] int retValue_acc ; [L606] retValue_acc = pumpRunning [L607] return (retValue_acc); VAL [\old(methAndRunningLastTime)=1, \old(pumpRunning)=1, \old(waterLevel)=1, \result=1, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L695] RET, EXPR isPumpRunning() [L695] tmp___0 = isPumpRunning() [L697] COND TRUE \read(tmp___0) VAL [\old(methAndRunningLastTime)=1, \old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L698] COND TRUE \read(methAndRunningLastTime) [L700] CALL __automaton_fail() [L854] reach_error() VAL [\old(methAndRunningLastTime)=1, \old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 82 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.0s, OverallIterations: 12, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 383 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 377 mSDsluCounter, 2517 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1545 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 208 IncrementalHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 972 mSDtfsCounter, 208 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 315 GetRequests, 271 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=353occurred in iteration=10, 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.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 87 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 817 NumberOfCodeBlocks, 817 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 770 ConstructedInterpolants, 0 QuantifiedInterpolants, 1408 SizeOfPredicates, 1 NumberOfNonLiveVariables, 596 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 14 InterpolantComputations, 11 PerfectInterpolantSequences, 154/162 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-18 14:19:12,466 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE