./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec2_product35.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 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_product35.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 34d4dbed37590326da938d00ced1aba27649a4f6be46ad5130f0beeedcfaf5dd --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 14:18:57,997 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 14:18:58,052 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 14:18:58,055 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 14:18:58,056 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 14:18:58,088 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 14:18:58,088 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 14:18:58,088 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 14:18:58,089 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 14:18:58,090 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 14:18:58,090 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 14:18:58,091 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 14:18:58,091 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 14:18:58,091 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 14:18:58,093 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 14:18:58,093 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 14:18:58,094 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 14:18:58,094 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 14:18:58,094 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 14:18:58,094 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 14:18:58,094 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 14:18:58,095 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 14:18:58,095 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 14:18:58,095 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 14:18:58,096 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 14:18:58,096 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 14:18:58,096 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 14:18:58,096 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 14:18:58,096 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 14:18:58,097 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 14:18:58,097 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 14:18:58,097 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 14:18:58,097 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 14:18:58,098 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 14:18:58,098 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 14:18:58,098 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 14:18:58,099 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 14:18:58,099 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 14:18:58,099 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 14:18:58,099 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 14:18:58,099 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 14:18:58,100 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 14:18:58,100 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 34d4dbed37590326da938d00ced1aba27649a4f6be46ad5130f0beeedcfaf5dd [2024-11-18 14:18:58,322 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 14:18:58,343 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 14:18:58,346 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 14:18:58,347 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 14:18:58,347 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 14:18:58,348 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec2_product35.cil.c [2024-11-18 14:18:59,573 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 14:18:59,767 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 14:18:59,768 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product35.cil.c [2024-11-18 14:18:59,778 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4b115134/5609aa732ea1481e8c6c2389be980778/FLAG8ab85b856 [2024-11-18 14:18:59,790 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4b115134/5609aa732ea1481e8c6c2389be980778 [2024-11-18 14:18:59,792 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 14:18:59,793 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 14:18:59,794 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 14:18:59,794 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 14:18:59,798 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 14:18:59,799 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 02:18:59" (1/1) ... [2024-11-18 14:18:59,799 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@426c0e4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:18:59, skipping insertion in model container [2024-11-18 14:18:59,800 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 02:18:59" (1/1) ... [2024-11-18 14:18:59,830 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 14:19:00,045 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product35.cil.c[15769,15782] [2024-11-18 14:19:00,061 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 14:19:00,071 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 14:19:00,078 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [49] [2024-11-18 14:19:00,080 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [415] [2024-11-18 14:19:00,080 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [593] [2024-11-18 14:19:00,080 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [663] [2024-11-18 14:19:00,080 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [703] [2024-11-18 14:19:00,080 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [741] [2024-11-18 14:19:00,080 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [750] [2024-11-18 14:19:00,080 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [847] [2024-11-18 14:19:00,123 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product35.cil.c[15769,15782] [2024-11-18 14:19:00,130 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 14:19:00,147 INFO L204 MainTranslator]: Completed translation [2024-11-18 14:19:00,148 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:19:00 WrapperNode [2024-11-18 14:19:00,148 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 14:19:00,148 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 14:19:00,149 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 14:19:00,149 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 14:19:00,153 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:00" (1/1) ... [2024-11-18 14:19:00,167 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:00" (1/1) ... [2024-11-18 14:19:00,184 INFO L138 Inliner]: procedures = 54, calls = 96, calls flagged for inlining = 22, calls inlined = 19, statements flattened = 179 [2024-11-18 14:19:00,184 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 14:19:00,184 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 14:19:00,184 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 14:19:00,185 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 14:19:00,196 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:00" (1/1) ... [2024-11-18 14:19:00,196 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:00" (1/1) ... [2024-11-18 14:19:00,198 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:00" (1/1) ... [2024-11-18 14:19:00,207 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:00,207 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:00" (1/1) ... [2024-11-18 14:19:00,207 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:00" (1/1) ... [2024-11-18 14:19:00,211 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:00" (1/1) ... [2024-11-18 14:19:00,214 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:00" (1/1) ... [2024-11-18 14:19:00,214 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:00" (1/1) ... [2024-11-18 14:19:00,215 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:00" (1/1) ... [2024-11-18 14:19:00,217 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 14:19:00,217 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 14:19:00,217 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 14:19:00,217 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 14:19:00,218 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:19:00" (1/1) ... [2024-11-18 14:19:00,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 14:19:00,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 14:19:00,245 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:00,247 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:00,295 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 14:19:00,295 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2024-11-18 14:19:00,295 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2024-11-18 14:19:00,295 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-11-18 14:19:00,295 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-11-18 14:19:00,295 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2024-11-18 14:19:00,296 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2024-11-18 14:19:00,296 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-11-18 14:19:00,296 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-11-18 14:19:00,296 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2024-11-18 14:19:00,296 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2024-11-18 14:19:00,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 14:19:00,296 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2024-11-18 14:19:00,296 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2024-11-18 14:19:00,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 14:19:00,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 14:19:00,372 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 14:19:00,373 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 14:19:00,548 INFO L? ?]: Removed 36 outVars from TransFormulas that were not future-live. [2024-11-18 14:19:00,548 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 14:19:00,564 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 14:19:00,567 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-18 14:19:00,568 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:19:00 BoogieIcfgContainer [2024-11-18 14:19:00,568 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 14:19:00,569 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 14:19:00,569 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 14:19:00,572 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 14:19:00,572 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 02:18:59" (1/3) ... [2024-11-18 14:19:00,572 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d958da5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 02:19:00, skipping insertion in model container [2024-11-18 14:19:00,572 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:19:00" (2/3) ... [2024-11-18 14:19:00,573 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d958da5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 02:19:00, skipping insertion in model container [2024-11-18 14:19:00,573 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:19:00" (3/3) ... [2024-11-18 14:19:00,574 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec2_product35.cil.c [2024-11-18 14:19:00,587 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 14:19:00,587 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 14:19:00,626 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 14:19:00,631 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;@2e571d18, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 14:19:00,631 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 14:19:00,635 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 63 states have (on average 1.3968253968253967) internal successors, (88), 69 states have internal predecessors, (88), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-18 14:19:00,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-18 14:19:00,641 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:19:00,642 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:00,642 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:19:00,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:19:00,646 INFO L85 PathProgramCache]: Analyzing trace with hash -479738916, now seen corresponding path program 1 times [2024-11-18 14:19:00,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:19:00,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079957538] [2024-11-18 14:19:00,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:19:00,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:19:00,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:19:00,810 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:00,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:19:00,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079957538] [2024-11-18 14:19:00,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079957538] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:19:00,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:19:00,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 14:19:00,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067905321] [2024-11-18 14:19:00,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:19:00,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 14:19:00,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:19:00,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 14:19:00,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 14:19:00,844 INFO L87 Difference]: Start difference. First operand has 80 states, 63 states have (on average 1.3968253968253967) internal successors, (88), 69 states have internal predecessors, (88), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 14:19:00,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:19:00,871 INFO L93 Difference]: Finished difference Result 151 states and 206 transitions. [2024-11-18 14:19:00,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 14:19:00,873 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:00,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:19:00,880 INFO L225 Difference]: With dead ends: 151 [2024-11-18 14:19:00,881 INFO L226 Difference]: Without dead ends: 71 [2024-11-18 14:19:00,884 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:00,888 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 14:19:00,889 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 14:19:00,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-18 14:19:00,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-11-18 14:19:00,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 56 states have (on average 1.3214285714285714) internal successors, (74), 61 states have internal predecessors, (74), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-18 14:19:00,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 91 transitions. [2024-11-18 14:19:00,921 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 91 transitions. Word has length 25 [2024-11-18 14:19:00,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:19:00,922 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 91 transitions. [2024-11-18 14:19:00,922 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:00,922 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 91 transitions. [2024-11-18 14:19:00,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-18 14:19:00,924 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:19:00,924 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:00,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-18 14:19:00,924 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:19:00,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:19:00,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1989794732, now seen corresponding path program 1 times [2024-11-18 14:19:00,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:19:00,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871361687] [2024-11-18 14:19:00,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:19:00,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:19:00,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:19:01,024 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:01,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:19:01,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871361687] [2024-11-18 14:19:01,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871361687] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:19:01,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:19:01,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 14:19:01,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824842828] [2024-11-18 14:19:01,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:19:01,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 14:19:01,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:19:01,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 14:19:01,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 14:19:01,027 INFO L87 Difference]: Start difference. First operand 71 states and 91 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 14:19:01,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:19:01,046 INFO L93 Difference]: Finished difference Result 103 states and 132 transitions. [2024-11-18 14:19:01,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 14:19:01,051 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:01,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:19:01,052 INFO L225 Difference]: With dead ends: 103 [2024-11-18 14:19:01,052 INFO L226 Difference]: Without dead ends: 62 [2024-11-18 14:19:01,052 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:01,053 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 17 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 14:19:01,054 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 135 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 14:19:01,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-18 14:19:01,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-11-18 14:19:01,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 50 states have (on average 1.34) internal successors, (67), 55 states have internal predecessors, (67), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-18 14:19:01,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 79 transitions. [2024-11-18 14:19:01,076 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 79 transitions. Word has length 26 [2024-11-18 14:19:01,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:19:01,076 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 79 transitions. [2024-11-18 14:19:01,076 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:01,076 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 79 transitions. [2024-11-18 14:19:01,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-18 14:19:01,077 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:19:01,077 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:19:01,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 14:19:01,078 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:19:01,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:19:01,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1216244594, now seen corresponding path program 1 times [2024-11-18 14:19:01,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:19:01,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320796510] [2024-11-18 14:19:01,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:19:01,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:19:01,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:19:01,208 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:01,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:19:01,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320796510] [2024-11-18 14:19:01,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320796510] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:19:01,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:19:01,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 14:19:01,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690567307] [2024-11-18 14:19:01,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:19:01,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 14:19:01,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:19:01,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 14:19:01,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 14:19:01,211 INFO L87 Difference]: Start difference. First operand 62 states and 79 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 14:19:01,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:19:01,252 INFO L93 Difference]: Finished difference Result 169 states and 221 transitions. [2024-11-18 14:19:01,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 14:19:01,253 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2024-11-18 14:19:01,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:19:01,254 INFO L225 Difference]: With dead ends: 169 [2024-11-18 14:19:01,254 INFO L226 Difference]: Without dead ends: 115 [2024-11-18 14:19:01,255 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:01,256 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 58 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 14:19:01,256 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 163 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 14:19:01,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-18 14:19:01,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 110. [2024-11-18 14:19:01,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 87 states have (on average 1.367816091954023) internal successors, (119), 96 states have internal predecessors, (119), 12 states have call successors, (12), 10 states have call predecessors, (12), 10 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-18 14:19:01,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 143 transitions. [2024-11-18 14:19:01,283 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 143 transitions. Word has length 30 [2024-11-18 14:19:01,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:19:01,284 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 143 transitions. [2024-11-18 14:19:01,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 14:19:01,285 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 143 transitions. [2024-11-18 14:19:01,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-18 14:19:01,287 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:19:01,287 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:19:01,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-18 14:19:01,288 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:19:01,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:19:01,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1180659967, now seen corresponding path program 1 times [2024-11-18 14:19:01,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:19:01,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662295199] [2024-11-18 14:19:01,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:19:01,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:19:01,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:19:01,340 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:01,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:19:01,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662295199] [2024-11-18 14:19:01,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662295199] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:19:01,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:19:01,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 14:19:01,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062054010] [2024-11-18 14:19:01,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:19:01,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 14:19:01,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:19:01,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 14:19:01,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 14:19:01,343 INFO L87 Difference]: Start difference. First operand 110 states and 143 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-18 14:19:01,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:19:01,385 INFO L93 Difference]: Finished difference Result 289 states and 384 transitions. [2024-11-18 14:19:01,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 14:19:01,386 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2024-11-18 14:19:01,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:19:01,387 INFO L225 Difference]: With dead ends: 289 [2024-11-18 14:19:01,387 INFO L226 Difference]: Without dead ends: 187 [2024-11-18 14:19:01,388 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:01,389 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 67 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 14:19:01,390 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 126 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 14:19:01,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-11-18 14:19:01,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 185. [2024-11-18 14:19:01,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 144 states have (on average 1.3541666666666667) internal successors, (195), 155 states have internal predecessors, (195), 20 states have call successors, (20), 20 states have call predecessors, (20), 20 states have return successors, (24), 20 states have call predecessors, (24), 20 states have call successors, (24) [2024-11-18 14:19:01,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 239 transitions. [2024-11-18 14:19:01,421 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 239 transitions. Word has length 35 [2024-11-18 14:19:01,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:19:01,421 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 239 transitions. [2024-11-18 14:19:01,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-18 14:19:01,421 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 239 transitions. [2024-11-18 14:19:01,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-18 14:19:01,422 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:19:01,422 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:19:01,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-18 14:19:01,423 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:19:01,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:19:01,423 INFO L85 PathProgramCache]: Analyzing trace with hash 451554397, now seen corresponding path program 1 times [2024-11-18 14:19:01,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:19:01,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764843456] [2024-11-18 14:19:01,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:19:01,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:19:01,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:19:01,501 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:01,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:19:01,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764843456] [2024-11-18 14:19:01,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764843456] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:19:01,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:19:01,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 14:19:01,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377231453] [2024-11-18 14:19:01,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:19:01,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 14:19:01,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:19:01,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 14:19:01,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 14:19:01,505 INFO L87 Difference]: Start difference. First operand 185 states and 239 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 14:19:01,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:19:01,561 INFO L93 Difference]: Finished difference Result 360 states and 470 transitions. [2024-11-18 14:19:01,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 14:19:01,562 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2024-11-18 14:19:01,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:19:01,563 INFO L225 Difference]: With dead ends: 360 [2024-11-18 14:19:01,563 INFO L226 Difference]: Without dead ends: 183 [2024-11-18 14:19:01,564 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:01,565 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 60 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 14:19:01,565 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 269 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 14:19:01,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-18 14:19:01,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2024-11-18 14:19:01,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 142 states have (on average 1.3309859154929577) internal successors, (189), 153 states have internal predecessors, (189), 20 states have call successors, (20), 20 states have call predecessors, (20), 20 states have return successors, (24), 20 states have call predecessors, (24), 20 states have call successors, (24) [2024-11-18 14:19:01,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 233 transitions. [2024-11-18 14:19:01,577 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 233 transitions. Word has length 34 [2024-11-18 14:19:01,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:19:01,577 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 233 transitions. [2024-11-18 14:19:01,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 14:19:01,578 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 233 transitions. [2024-11-18 14:19:01,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-18 14:19:01,578 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:19:01,578 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:19:01,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-18 14:19:01,579 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:19:01,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:19:01,579 INFO L85 PathProgramCache]: Analyzing trace with hash 967117538, now seen corresponding path program 1 times [2024-11-18 14:19:01,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:19:01,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771690335] [2024-11-18 14:19:01,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:19:01,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:19:01,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:19:01,663 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:01,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:19:01,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771690335] [2024-11-18 14:19:01,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771690335] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:19:01,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:19:01,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 14:19:01,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225031551] [2024-11-18 14:19:01,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:19:01,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 14:19:01,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:19:01,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 14:19:01,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 14:19:01,667 INFO L87 Difference]: Start difference. First operand 183 states and 233 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 14:19:01,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:19:01,703 INFO L93 Difference]: Finished difference Result 364 states and 470 transitions. [2024-11-18 14:19:01,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 14:19:01,704 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2024-11-18 14:19:01,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:19:01,706 INFO L225 Difference]: With dead ends: 364 [2024-11-18 14:19:01,706 INFO L226 Difference]: Without dead ends: 189 [2024-11-18 14:19:01,707 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:01,708 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 14:19:01,712 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 297 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 14:19:01,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-11-18 14:19:01,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2024-11-18 14:19:01,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 148 states have (on average 1.3175675675675675) internal successors, (195), 159 states have internal predecessors, (195), 20 states have call successors, (20), 20 states have call predecessors, (20), 20 states have return successors, (24), 20 states have call predecessors, (24), 20 states have call successors, (24) [2024-11-18 14:19:01,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 239 transitions. [2024-11-18 14:19:01,733 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 239 transitions. Word has length 39 [2024-11-18 14:19:01,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:19:01,734 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 239 transitions. [2024-11-18 14:19:01,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 14:19:01,735 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 239 transitions. [2024-11-18 14:19:01,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-18 14:19:01,736 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:19:01,737 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:19:01,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-18 14:19:01,737 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:19:01,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:19:01,738 INFO L85 PathProgramCache]: Analyzing trace with hash -621230364, now seen corresponding path program 1 times [2024-11-18 14:19:01,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:19:01,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155482536] [2024-11-18 14:19:01,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:19:01,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:19:01,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:19:01,817 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:01,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:19:01,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155482536] [2024-11-18 14:19:01,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155482536] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:19:01,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:19:01,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 14:19:01,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105171347] [2024-11-18 14:19:01,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:19:01,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 14:19:01,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:19:01,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 14:19:01,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 14:19:01,819 INFO L87 Difference]: Start difference. First operand 189 states and 239 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 14:19:01,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:19:01,898 INFO L93 Difference]: Finished difference Result 380 states and 490 transitions. [2024-11-18 14:19:01,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-18 14:19:01,898 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2024-11-18 14:19:01,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:19:01,901 INFO L225 Difference]: With dead ends: 380 [2024-11-18 14:19:01,901 INFO L226 Difference]: Without dead ends: 199 [2024-11-18 14:19:01,901 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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:01,903 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 60 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 14:19:01,905 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 327 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 14:19:01,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-11-18 14:19:01,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 193. [2024-11-18 14:19:01,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 152 states have (on average 1.3092105263157894) internal successors, (199), 163 states have internal predecessors, (199), 20 states have call successors, (20), 20 states have call predecessors, (20), 20 states have return successors, (24), 20 states have call predecessors, (24), 20 states have call successors, (24) [2024-11-18 14:19:01,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 243 transitions. [2024-11-18 14:19:01,922 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 243 transitions. Word has length 39 [2024-11-18 14:19:01,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:19:01,923 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 243 transitions. [2024-11-18 14:19:01,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 14:19:01,923 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 243 transitions. [2024-11-18 14:19:01,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-18 14:19:01,924 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:19:01,924 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:19:01,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-18 14:19:01,925 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:19:01,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:19:01,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1984793190, now seen corresponding path program 1 times [2024-11-18 14:19:01,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:19:01,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386975103] [2024-11-18 14:19:01,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:19:01,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:19:01,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:19:01,980 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:01,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:19:01,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386975103] [2024-11-18 14:19:01,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386975103] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:19:01,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:19:01,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 14:19:01,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027903703] [2024-11-18 14:19:01,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:19:01,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 14:19:01,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:19:01,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 14:19:01,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 14:19:01,982 INFO L87 Difference]: Start difference. First operand 193 states and 243 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 14:19:02,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:19:02,004 INFO L93 Difference]: Finished difference Result 463 states and 588 transitions. [2024-11-18 14:19:02,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 14:19:02,005 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2024-11-18 14:19:02,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:19:02,006 INFO L225 Difference]: With dead ends: 463 [2024-11-18 14:19:02,006 INFO L226 Difference]: Without dead ends: 278 [2024-11-18 14:19:02,007 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:02,007 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 38 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 14:19:02,007 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 142 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 14:19:02,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2024-11-18 14:19:02,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2024-11-18 14:19:02,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 219 states have (on average 1.273972602739726) internal successors, (279), 232 states have internal predecessors, (279), 30 states have call successors, (30), 30 states have call predecessors, (30), 28 states have return successors, (34), 28 states have call predecessors, (34), 30 states have call successors, (34) [2024-11-18 14:19:02,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 343 transitions. [2024-11-18 14:19:02,026 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 343 transitions. Word has length 39 [2024-11-18 14:19:02,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:19:02,026 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 343 transitions. [2024-11-18 14:19:02,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 14:19:02,027 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 343 transitions. [2024-11-18 14:19:02,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-18 14:19:02,027 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:19:02,028 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:19:02,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-18 14:19:02,028 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:19:02,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:19:02,029 INFO L85 PathProgramCache]: Analyzing trace with hash 819581964, now seen corresponding path program 1 times [2024-11-18 14:19:02,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:19:02,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396565339] [2024-11-18 14:19:02,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:19:02,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:19:02,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:19:02,080 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:02,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:19:02,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396565339] [2024-11-18 14:19:02,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396565339] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:19:02,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:19:02,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 14:19:02,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910303381] [2024-11-18 14:19:02,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:19:02,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 14:19:02,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:19:02,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 14:19:02,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 14:19:02,083 INFO L87 Difference]: Start difference. First operand 278 states and 343 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 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:02,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:19:02,113 INFO L93 Difference]: Finished difference Result 420 states and 530 transitions. [2024-11-18 14:19:02,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 14:19:02,113 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 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 43 [2024-11-18 14:19:02,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:19:02,117 INFO L225 Difference]: With dead ends: 420 [2024-11-18 14:19:02,117 INFO L226 Difference]: Without dead ends: 418 [2024-11-18 14:19:02,117 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:02,118 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 45 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 145 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:02,118 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 145 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:02,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2024-11-18 14:19:02,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 382. [2024-11-18 14:19:02,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 302 states have (on average 1.3013245033112584) internal successors, (393), 321 states have internal predecessors, (393), 41 states have call successors, (41), 41 states have call predecessors, (41), 38 states have return successors, (55), 38 states have call predecessors, (55), 41 states have call successors, (55) [2024-11-18 14:19:02,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 489 transitions. [2024-11-18 14:19:02,140 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 489 transitions. Word has length 43 [2024-11-18 14:19:02,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:19:02,140 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 489 transitions. [2024-11-18 14:19:02,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 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:02,140 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 489 transitions. [2024-11-18 14:19:02,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-18 14:19:02,142 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:19:02,142 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:19:02,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-18 14:19:02,142 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:19:02,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:19:02,143 INFO L85 PathProgramCache]: Analyzing trace with hash -239993361, now seen corresponding path program 1 times [2024-11-18 14:19:02,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:19:02,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013832302] [2024-11-18 14:19:02,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:19:02,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:19:02,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:19:02,283 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-18 14:19:02,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:19:02,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013832302] [2024-11-18 14:19:02,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013832302] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 14:19:02,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1743854045] [2024-11-18 14:19:02,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:19:02,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 14:19:02,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 14:19:02,298 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:02,303 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:02,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:19:02,372 INFO L255 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-18 14:19:02,377 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 14:19:02,492 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-18 14:19:02,492 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 14:19:02,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1743854045] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:19:02,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 14:19:02,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2024-11-18 14:19:02,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000091770] [2024-11-18 14:19:02,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:19:02,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 14:19:02,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:19:02,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 14:19:02,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-18 14:19:02,494 INFO L87 Difference]: Start difference. First operand 382 states and 489 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-18 14:19:02,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:19:02,582 INFO L93 Difference]: Finished difference Result 1078 states and 1416 transitions. [2024-11-18 14:19:02,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-18 14:19:02,582 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 74 [2024-11-18 14:19:02,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:19:02,585 INFO L225 Difference]: With dead ends: 1078 [2024-11-18 14:19:02,585 INFO L226 Difference]: Without dead ends: 704 [2024-11-18 14:19:02,587 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-18 14:19:02,587 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 32 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 14:19:02,588 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 330 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 14:19:02,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2024-11-18 14:19:02,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 640. [2024-11-18 14:19:02,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 640 states, 500 states have (on average 1.27) internal successors, (635), 533 states have internal predecessors, (635), 71 states have call successors, (71), 71 states have call predecessors, (71), 68 states have return successors, (97), 66 states have call predecessors, (97), 71 states have call successors, (97) [2024-11-18 14:19:02,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 803 transitions. [2024-11-18 14:19:02,627 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 803 transitions. Word has length 74 [2024-11-18 14:19:02,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:19:02,627 INFO L471 AbstractCegarLoop]: Abstraction has 640 states and 803 transitions. [2024-11-18 14:19:02,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-18 14:19:02,628 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 803 transitions. [2024-11-18 14:19:02,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-18 14:19:02,630 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:19:02,631 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:19:02,645 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-18 14:19:02,831 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:02,832 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:19:02,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:19:02,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1936900565, now seen corresponding path program 1 times [2024-11-18 14:19:02,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:19:02,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133189665] [2024-11-18 14:19:02,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:19:02,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:19:02,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 14:19:02,848 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-18 14:19:02,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 14:19:02,878 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-18 14:19:02,879 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-18 14:19:02,879 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-18 14:19:02,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-18 14:19:02,883 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:19:02,945 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-18 14:19:02,947 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 02:19:02 BoogieIcfgContainer [2024-11-18 14:19:02,947 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-18 14:19:02,947 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-18 14:19:02,947 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-18 14:19:02,947 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-18 14:19:02,948 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:00" (3/4) ... [2024-11-18 14:19:02,949 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-18 14:19:03,011 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-18 14:19:03,013 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-18 14:19:03,014 INFO L158 Benchmark]: Toolchain (without parser) took 3220.44ms. Allocated memory was 151.0MB in the beginning and 184.5MB in the end (delta: 33.6MB). Free memory was 113.0MB in the beginning and 74.6MB in the end (delta: 38.4MB). Peak memory consumption was 71.1MB. Max. memory is 16.1GB. [2024-11-18 14:19:03,014 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 151.0MB. Free memory is still 118.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 14:19:03,014 INFO L158 Benchmark]: CACSL2BoogieTranslator took 353.58ms. Allocated memory is still 151.0MB. Free memory was 112.4MB in the beginning and 91.4MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-18 14:19:03,014 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.55ms. Allocated memory is still 151.0MB. Free memory was 91.4MB in the beginning and 89.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 14:19:03,014 INFO L158 Benchmark]: Boogie Preprocessor took 32.24ms. Allocated memory is still 151.0MB. Free memory was 89.4MB in the beginning and 87.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 14:19:03,015 INFO L158 Benchmark]: RCFGBuilder took 350.66ms. Allocated memory is still 151.0MB. Free memory was 87.0MB in the beginning and 104.4MB in the end (delta: -17.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-18 14:19:03,015 INFO L158 Benchmark]: TraceAbstraction took 2377.69ms. Allocated memory was 151.0MB in the beginning and 184.5MB in the end (delta: 33.6MB). Free memory was 103.6MB in the beginning and 80.9MB in the end (delta: 22.7MB). Peak memory consumption was 57.9MB. Max. memory is 16.1GB. [2024-11-18 14:19:03,016 INFO L158 Benchmark]: Witness Printer took 66.17ms. Allocated memory is still 184.5MB. Free memory was 80.9MB in the beginning and 74.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-18 14:19:03,017 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 151.0MB. Free memory is still 118.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 353.58ms. Allocated memory is still 151.0MB. Free memory was 112.4MB in the beginning and 91.4MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.55ms. Allocated memory is still 151.0MB. Free memory was 91.4MB in the beginning and 89.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.24ms. Allocated memory is still 151.0MB. Free memory was 89.4MB in the beginning and 87.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 350.66ms. Allocated memory is still 151.0MB. Free memory was 87.0MB in the beginning and 104.4MB in the end (delta: -17.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 2377.69ms. Allocated memory was 151.0MB in the beginning and 184.5MB in the end (delta: 33.6MB). Free memory was 103.6MB in the beginning and 80.9MB in the end (delta: 22.7MB). Peak memory consumption was 57.9MB. Max. memory is 16.1GB. * Witness Printer took 66.17ms. Allocated memory is still 184.5MB. Free memory was 80.9MB in the beginning and 74.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 49]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [49] - GenericResultAtLocation [Line: 415]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [415] - GenericResultAtLocation [Line: 593]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [593] - GenericResultAtLocation [Line: 663]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [663] - GenericResultAtLocation [Line: 703]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [703] - GenericResultAtLocation [Line: 741]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [741] - GenericResultAtLocation [Line: 750]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [750] - GenericResultAtLocation [Line: 847]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [847] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 746]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L219] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L426] int pumpRunning = 0; [L427] int systemActive = 1; [L665] int methAndRunningLastTime ; [L751] int cleanupTimeShifts = 4; [L849] int waterLevel = 1; [L850] int methaneLevelCritical = 0; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L825] int retValue_acc ; [L826] int tmp ; [L830] FCALL select_helpers() [L831] FCALL select_features() [L832] CALL, EXPR valid_product() [L733] int retValue_acc ; [L736] retValue_acc = 1 [L737] return (retValue_acc); VAL [\result=1, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L832] RET, EXPR valid_product() [L832] tmp = valid_product() [L834] COND TRUE \read(tmp) [L836] FCALL setup() [L837] CALL runTest() [L818] CALL __utac_acc__Specification2_spec__1() [L670] methAndRunningLastTime = 0 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L818] RET __utac_acc__Specification2_spec__1() [L819] CALL test() [L598] int splverifierCounter ; [L599] int tmp ; [L600] int tmp___0 ; [L601] int tmp___1 ; [L602] int tmp___2 ; [L605] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L607] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L609] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L615] tmp = __VERIFIER_nondet_int() [L617] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L619] CALL waterRise() VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L867] COND TRUE waterLevel < 2 [L868] waterLevel = waterLevel + 1 VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L619] RET waterRise() VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L625] tmp___0 = __VERIFIER_nondet_int() [L627] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L629] CALL changeMethaneLevel() VAL [\old(methaneLevelCritical)=0, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L879] COND FALSE !(\read(methaneLevelCritical)) [L882] methaneLevelCritical = 1 VAL [\old(methaneLevelCritical)=0, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L629] RET changeMethaneLevel() VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L635] tmp___2 = __VERIFIER_nondet_int() [L637] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L652] CALL timeShift() VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L434] COND FALSE !(\read(pumpRunning)) VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L441] COND TRUE \read(systemActive) [L443] CALL processEnvironment() [L463] int tmp ; VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L466] COND TRUE ! pumpRunning [L468] CALL, EXPR isHighWaterLevel() [L560] int retValue_acc ; [L561] int tmp ; [L562] int tmp___0 ; [L566] CALL, EXPR isHighWaterSensorDry() [L929] int retValue_acc ; VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L932] COND FALSE !(waterLevel < 2) [L936] retValue_acc = 0 [L937] return (retValue_acc); VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, \result=0, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L566] RET, EXPR isHighWaterSensorDry() [L566] tmp = isHighWaterSensorDry() [L568] COND FALSE !(\read(tmp)) [L571] tmp___0 = 1 VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, tmp___0=1, waterLevel=2] [L573] retValue_acc = tmp___0 [L574] return (retValue_acc); VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, \result=1, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L468] RET, EXPR isHighWaterLevel() [L468] tmp = isHighWaterLevel() [L470] COND TRUE \read(tmp) [L472] CALL activatePump() [L491] pumpRunning = 1 VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L472] RET activatePump() [L443] RET processEnvironment() [L449] CALL __utac_acc__Specification2_spec__2() [L675] int tmp ; [L676] int tmp___0 ; VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L680] CALL, EXPR isMethaneLevelCritical() VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L888] int retValue_acc ; [L891] retValue_acc = methaneLevelCritical [L892] return (retValue_acc); VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, \result=1, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L680] RET, EXPR isMethaneLevelCritical() VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L680] tmp = isMethaneLevelCritical() [L682] COND TRUE \read(tmp) [L684] CALL, EXPR isPumpRunning() [L515] int retValue_acc ; [L518] retValue_acc = pumpRunning [L519] return (retValue_acc); VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, \result=1, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L684] RET, EXPR isPumpRunning() [L684] tmp___0 = isPumpRunning() [L686] COND TRUE \read(tmp___0) VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L687] COND FALSE !(\read(methAndRunningLastTime)) [L692] methAndRunningLastTime = 1 VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L449] RET __utac_acc__Specification2_spec__2() [L652] RET timeShift() VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L607] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L609] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L615] tmp = __VERIFIER_nondet_int() [L617] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L625] tmp___0 = __VERIFIER_nondet_int() [L627] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L635] tmp___2 = __VERIFIER_nondet_int() [L637] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L652] CALL timeShift() VAL [\old(methAndRunningLastTime)=1, \old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L434] COND TRUE \read(pumpRunning) [L436] CALL lowerWaterLevel() [L855] COND TRUE waterLevel > 0 [L856] waterLevel = waterLevel - 1 VAL [\old(methAndRunningLastTime)=1, \old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L436] RET lowerWaterLevel() [L441] COND TRUE \read(systemActive) [L443] CALL processEnvironment() [L463] int tmp ; VAL [\old(methAndRunningLastTime)=1, \old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L466] COND FALSE !(! pumpRunning) VAL [\old(methAndRunningLastTime)=1, \old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L481] FCALL processEnvironment__wrappee__base() VAL [\old(methAndRunningLastTime)=1, \old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L443] RET processEnvironment() [L449] CALL __utac_acc__Specification2_spec__2() [L675] int tmp ; [L676] int tmp___0 ; VAL [\old(methAndRunningLastTime)=1, \old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L680] CALL, EXPR isMethaneLevelCritical() VAL [\old(methAndRunningLastTime)=1, \old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L888] int retValue_acc ; [L891] retValue_acc = methaneLevelCritical [L892] return (retValue_acc); VAL [\old(methAndRunningLastTime)=1, \old(pumpRunning)=1, \old(waterLevel)=2, \result=1, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L680] RET, EXPR isMethaneLevelCritical() VAL [\old(methAndRunningLastTime)=1, \old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L680] tmp = isMethaneLevelCritical() [L682] COND TRUE \read(tmp) [L684] CALL, EXPR isPumpRunning() [L515] int retValue_acc ; [L518] retValue_acc = pumpRunning [L519] return (retValue_acc); VAL [\old(methAndRunningLastTime)=1, \old(pumpRunning)=1, \old(waterLevel)=2, \result=1, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L684] RET, EXPR isPumpRunning() [L684] tmp___0 = isPumpRunning() [L686] COND TRUE \read(tmp___0) VAL [\old(methAndRunningLastTime)=1, \old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L687] COND TRUE \read(methAndRunningLastTime) [L689] CALL __automaton_fail() [L746] reach_error() VAL [\old(methAndRunningLastTime)=1, \old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 80 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.3s, OverallIterations: 11, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 380 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 377 mSDsluCounter, 2034 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1214 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 150 IncrementalHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 820 mSDtfsCounter, 150 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 119 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=640occurred in iteration=10, InterpolantAutomatonStates: 40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 113 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 536 NumberOfCodeBlocks, 536 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 447 ConstructedInterpolants, 0 QuantifiedInterpolants, 821 SizeOfPredicates, 0 NumberOfNonLiveVariables, 264 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 11 InterpolantComputations, 10 PerfectInterpolantSequences, 44/46 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:03,042 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