./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec2_product33.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/minepump_spec2_product33.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6e02099a7691e56a2269c7f6adf0fcb5caba1ee7f52ae5d6ac320766d29d8d07 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 02:03:46,528 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 02:03:46,604 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-22 02:03:46,610 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 02:03:46,610 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 02:03:46,630 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 02:03:46,630 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 02:03:46,631 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 02:03:46,631 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 02:03:46,632 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 02:03:46,632 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 02:03:46,632 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 02:03:46,633 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 02:03:46,633 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 02:03:46,635 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 02:03:46,635 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 02:03:46,635 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 02:03:46,636 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 02:03:46,636 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 02:03:46,636 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 02:03:46,636 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 02:03:46,640 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 02:03:46,640 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 02:03:46,640 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 02:03:46,640 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 02:03:46,640 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 02:03:46,641 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 02:03:46,641 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 02:03:46,641 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 02:03:46,641 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 02:03:46,641 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 02:03:46,641 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 02:03:46,642 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 02:03:46,642 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 02:03:46,642 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 02:03:46,642 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 02:03:46,642 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 02:03:46,642 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 02:03:46,642 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 02:03:46,642 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 02:03:46,643 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 02:03:46,643 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 02:03:46,643 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 -> 6e02099a7691e56a2269c7f6adf0fcb5caba1ee7f52ae5d6ac320766d29d8d07 [2024-11-22 02:03:46,833 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 02:03:46,855 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 02:03:46,858 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 02:03:46,859 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 02:03:46,859 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 02:03:46,860 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec2_product33.cil.c [2024-11-22 02:03:48,066 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 02:03:48,247 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 02:03:48,247 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product33.cil.c [2024-11-22 02:03:48,258 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54cd14d69/cfb00ecaaf7f4ff1a68ba1208a9e585f/FLAG0ac827e95 [2024-11-22 02:03:48,625 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54cd14d69/cfb00ecaaf7f4ff1a68ba1208a9e585f [2024-11-22 02:03:48,627 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 02:03:48,628 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 02:03:48,629 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 02:03:48,629 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 02:03:48,633 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 02:03:48,633 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 02:03:48" (1/1) ... [2024-11-22 02:03:48,634 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48dedcf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:03:48, skipping insertion in model container [2024-11-22 02:03:48,634 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 02:03:48" (1/1) ... [2024-11-22 02:03:48,672 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 02:03:48,826 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_product33.cil.c[4842,4855] [2024-11-22 02:03:48,907 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 02:03:48,919 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 02:03:48,927 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [49] [2024-11-22 02:03:48,928 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [87] [2024-11-22 02:03:48,929 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [188] [2024-11-22 02:03:48,929 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [289] [2024-11-22 02:03:48,929 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [298] [2024-11-22 02:03:48,929 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [454] [2024-11-22 02:03:48,930 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [519] [2024-11-22 02:03:48,930 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [885] [2024-11-22 02:03:48,948 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_product33.cil.c[4842,4855] [2024-11-22 02:03:48,976 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 02:03:48,992 INFO L204 MainTranslator]: Completed translation [2024-11-22 02:03:48,992 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:03:48 WrapperNode [2024-11-22 02:03:48,993 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 02:03:48,993 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 02:03:48,993 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 02:03:48,994 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 02:03:48,998 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:03:48" (1/1) ... [2024-11-22 02:03:49,020 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:03:48" (1/1) ... [2024-11-22 02:03:49,059 INFO L138 Inliner]: procedures = 53, calls = 94, calls flagged for inlining = 20, calls inlined = 17, statements flattened = 172 [2024-11-22 02:03:49,059 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 02:03:49,060 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 02:03:49,060 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 02:03:49,060 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 02:03:49,073 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:03:48" (1/1) ... [2024-11-22 02:03:49,073 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:03:48" (1/1) ... [2024-11-22 02:03:49,075 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:03:48" (1/1) ... [2024-11-22 02:03:49,088 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-22 02:03:49,088 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:03:48" (1/1) ... [2024-11-22 02:03:49,088 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:03:48" (1/1) ... [2024-11-22 02:03:49,091 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:03:48" (1/1) ... [2024-11-22 02:03:49,094 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:03:48" (1/1) ... [2024-11-22 02:03:49,094 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:03:48" (1/1) ... [2024-11-22 02:03:49,095 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:03:48" (1/1) ... [2024-11-22 02:03:49,096 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 02:03:49,097 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 02:03:49,097 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 02:03:49,097 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 02:03:49,098 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:03:48" (1/1) ... [2024-11-22 02:03:49,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 02:03:49,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 02:03:49,144 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-22 02:03:49,151 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-22 02:03:49,185 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 02:03:49,186 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2024-11-22 02:03:49,186 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2024-11-22 02:03:49,186 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-11-22 02:03:49,187 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-11-22 02:03:49,187 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-11-22 02:03:49,187 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-11-22 02:03:49,187 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2024-11-22 02:03:49,187 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2024-11-22 02:03:49,187 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2024-11-22 02:03:49,187 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2024-11-22 02:03:49,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 02:03:49,188 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2024-11-22 02:03:49,188 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2024-11-22 02:03:49,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 02:03:49,188 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 02:03:49,264 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 02:03:49,266 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 02:03:49,461 INFO L? ?]: Removed 36 outVars from TransFormulas that were not future-live. [2024-11-22 02:03:49,461 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 02:03:49,472 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 02:03:49,474 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-22 02:03:49,475 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:03:49 BoogieIcfgContainer [2024-11-22 02:03:49,475 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 02:03:49,477 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 02:03:49,477 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 02:03:49,480 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 02:03:49,480 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 02:03:48" (1/3) ... [2024-11-22 02:03:49,480 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44890bfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 02:03:49, skipping insertion in model container [2024-11-22 02:03:49,480 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:03:48" (2/3) ... [2024-11-22 02:03:49,481 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44890bfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 02:03:49, skipping insertion in model container [2024-11-22 02:03:49,481 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:03:49" (3/3) ... [2024-11-22 02:03:49,482 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec2_product33.cil.c [2024-11-22 02:03:49,493 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 02:03:49,494 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 02:03:49,538 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 02:03:49,543 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;@384e2d2a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 02:03:49,543 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 02:03:49,547 INFO L276 IsEmpty]: Start isEmpty. Operand has 76 states, 59 states have (on average 1.4067796610169492) internal successors, (83), 65 states have internal predecessors, (83), 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-22 02:03:49,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-22 02:03:49,553 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 02:03:49,554 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-22 02:03:49,554 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 02:03:49,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 02:03:49,558 INFO L85 PathProgramCache]: Analyzing trace with hash 233303130, now seen corresponding path program 1 times [2024-11-22 02:03:49,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 02:03:49,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143918750] [2024-11-22 02:03:49,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 02:03:49,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 02:03:49,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 02:03:49,715 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-22 02:03:49,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 02:03:49,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143918750] [2024-11-22 02:03:49,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143918750] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 02:03:49,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 02:03:49,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 02:03:49,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657987051] [2024-11-22 02:03:49,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 02:03:49,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 02:03:49,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 02:03:49,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 02:03:49,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 02:03:49,747 INFO L87 Difference]: Start difference. First operand has 76 states, 59 states have (on average 1.4067796610169492) internal successors, (83), 65 states have internal predecessors, (83), 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-22 02:03:49,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 02:03:49,773 INFO L93 Difference]: Finished difference Result 143 states and 196 transitions. [2024-11-22 02:03:49,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 02:03:49,775 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-22 02:03:49,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 02:03:49,783 INFO L225 Difference]: With dead ends: 143 [2024-11-22 02:03:49,783 INFO L226 Difference]: Without dead ends: 67 [2024-11-22 02:03:49,786 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-22 02:03:49,789 INFO L432 NwaCegarLoop]: 95 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, 95 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-22 02:03:49,790 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 02:03:49,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-22 02:03:49,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-11-22 02:03:49,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 52 states have (on average 1.3269230769230769) internal successors, (69), 57 states have internal predecessors, (69), 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-22 02:03:49,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 86 transitions. [2024-11-22 02:03:49,823 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 86 transitions. Word has length 25 [2024-11-22 02:03:49,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 02:03:49,824 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 86 transitions. [2024-11-22 02:03:49,824 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-22 02:03:49,824 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 86 transitions. [2024-11-22 02:03:49,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-22 02:03:49,826 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 02:03:49,826 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-22 02:03:49,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-22 02:03:49,826 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 02:03:49,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 02:03:49,827 INFO L85 PathProgramCache]: Analyzing trace with hash 724752093, now seen corresponding path program 1 times [2024-11-22 02:03:49,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 02:03:49,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604813491] [2024-11-22 02:03:49,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 02:03:49,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 02:03:49,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 02:03:49,927 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-22 02:03:49,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 02:03:49,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604813491] [2024-11-22 02:03:49,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604813491] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 02:03:49,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 02:03:49,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 02:03:49,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707060995] [2024-11-22 02:03:49,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 02:03:49,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 02:03:49,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 02:03:49,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 02:03:49,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 02:03:49,930 INFO L87 Difference]: Start difference. First operand 67 states and 86 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-22 02:03:49,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 02:03:49,940 INFO L93 Difference]: Finished difference Result 99 states and 127 transitions. [2024-11-22 02:03:49,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 02:03:49,941 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-22 02:03:49,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 02:03:49,942 INFO L225 Difference]: With dead ends: 99 [2024-11-22 02:03:49,942 INFO L226 Difference]: Without dead ends: 58 [2024-11-22 02:03:49,942 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-22 02:03:49,943 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 12 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 130 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-22 02:03:49,944 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 130 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 02:03:49,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-22 02:03:49,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-22 02:03:49,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 51 states have internal predecessors, (62), 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-22 02:03:49,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 74 transitions. [2024-11-22 02:03:49,950 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 74 transitions. Word has length 26 [2024-11-22 02:03:49,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 02:03:49,950 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 74 transitions. [2024-11-22 02:03:49,951 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-22 02:03:49,951 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 74 transitions. [2024-11-22 02:03:49,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-22 02:03:49,951 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 02:03:49,951 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-22 02:03:49,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 02:03:49,952 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 02:03:49,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 02:03:49,952 INFO L85 PathProgramCache]: Analyzing trace with hash 2055382337, now seen corresponding path program 1 times [2024-11-22 02:03:49,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 02:03:49,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844338304] [2024-11-22 02:03:49,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 02:03:49,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 02:03:49,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 02:03:50,042 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-22 02:03:50,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 02:03:50,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844338304] [2024-11-22 02:03:50,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844338304] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 02:03:50,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 02:03:50,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 02:03:50,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710468233] [2024-11-22 02:03:50,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 02:03:50,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 02:03:50,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 02:03:50,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 02:03:50,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 02:03:50,044 INFO L87 Difference]: Start difference. First operand 58 states and 74 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-22 02:03:50,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 02:03:50,060 INFO L93 Difference]: Finished difference Result 108 states and 141 transitions. [2024-11-22 02:03:50,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 02:03:50,063 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-22 02:03:50,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 02:03:50,067 INFO L225 Difference]: With dead ends: 108 [2024-11-22 02:03:50,068 INFO L226 Difference]: Without dead ends: 58 [2024-11-22 02:03:50,068 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-22 02:03:50,069 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 55 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 72 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-22 02:03:50,069 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 72 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 02:03:50,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-22 02:03:50,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-22 02:03:50,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 46 states have (on average 1.326086956521739) internal successors, (61), 51 states have internal predecessors, (61), 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-22 02:03:50,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 73 transitions. [2024-11-22 02:03:50,082 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 73 transitions. Word has length 30 [2024-11-22 02:03:50,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 02:03:50,082 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 73 transitions. [2024-11-22 02:03:50,082 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-22 02:03:50,083 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 73 transitions. [2024-11-22 02:03:50,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-22 02:03:50,083 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 02:03:50,084 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-22 02:03:50,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 02:03:50,085 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 02:03:50,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 02:03:50,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1540812236, now seen corresponding path program 1 times [2024-11-22 02:03:50,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 02:03:50,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975655363] [2024-11-22 02:03:50,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 02:03:50,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 02:03:50,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 02:03:50,144 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-22 02:03:50,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 02:03:50,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975655363] [2024-11-22 02:03:50,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975655363] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 02:03:50,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 02:03:50,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 02:03:50,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430780205] [2024-11-22 02:03:50,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 02:03:50,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 02:03:50,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 02:03:50,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 02:03:50,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 02:03:50,149 INFO L87 Difference]: Start difference. First operand 58 states and 73 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-22 02:03:50,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 02:03:50,182 INFO L93 Difference]: Finished difference Result 147 states and 190 transitions. [2024-11-22 02:03:50,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 02:03:50,183 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-22 02:03:50,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 02:03:50,184 INFO L225 Difference]: With dead ends: 147 [2024-11-22 02:03:50,184 INFO L226 Difference]: Without dead ends: 97 [2024-11-22 02:03:50,185 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-22 02:03:50,185 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 62 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 02:03:50,186 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 137 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 02:03:50,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-22 02:03:50,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2024-11-22 02:03:50,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 74 states have (on average 1.3243243243243243) internal successors, (98), 80 states have internal predecessors, (98), 10 states have call successors, (10), 10 states have call predecessors, (10), 10 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2024-11-22 02:03:50,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 120 transitions. [2024-11-22 02:03:50,222 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 120 transitions. Word has length 35 [2024-11-22 02:03:50,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 02:03:50,223 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 120 transitions. [2024-11-22 02:03:50,223 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-22 02:03:50,223 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 120 transitions. [2024-11-22 02:03:50,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-22 02:03:50,224 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 02:03:50,224 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-22 02:03:50,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 02:03:50,224 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 02:03:50,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 02:03:50,225 INFO L85 PathProgramCache]: Analyzing trace with hash 418627801, now seen corresponding path program 1 times [2024-11-22 02:03:50,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 02:03:50,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692828290] [2024-11-22 02:03:50,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 02:03:50,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 02:03:50,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 02:03:50,299 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-22 02:03:50,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 02:03:50,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692828290] [2024-11-22 02:03:50,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692828290] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 02:03:50,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 02:03:50,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 02:03:50,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889593280] [2024-11-22 02:03:50,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 02:03:50,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 02:03:50,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 02:03:50,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 02:03:50,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 02:03:50,301 INFO L87 Difference]: Start difference. First operand 95 states and 120 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-22 02:03:50,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 02:03:50,344 INFO L93 Difference]: Finished difference Result 259 states and 343 transitions. [2024-11-22 02:03:50,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 02:03:50,346 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-22 02:03:50,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 02:03:50,348 INFO L225 Difference]: With dead ends: 259 [2024-11-22 02:03:50,348 INFO L226 Difference]: Without dead ends: 172 [2024-11-22 02:03:50,349 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-22 02:03:50,349 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 42 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 02:03:50,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 130 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 02:03:50,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-11-22 02:03:50,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 170. [2024-11-22 02:03:50,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 133 states have (on average 1.3233082706766917) internal successors, (176), 141 states have internal predecessors, (176), 19 states have call successors, (19), 19 states have call predecessors, (19), 17 states have return successors, (25), 17 states have call predecessors, (25), 19 states have call successors, (25) [2024-11-22 02:03:50,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 220 transitions. [2024-11-22 02:03:50,375 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 220 transitions. Word has length 39 [2024-11-22 02:03:50,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 02:03:50,375 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 220 transitions. [2024-11-22 02:03:50,376 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-22 02:03:50,376 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 220 transitions. [2024-11-22 02:03:50,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-22 02:03:50,377 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 02:03:50,377 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-22 02:03:50,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-22 02:03:50,377 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 02:03:50,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 02:03:50,377 INFO L85 PathProgramCache]: Analyzing trace with hash 2107571543, now seen corresponding path program 1 times [2024-11-22 02:03:50,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 02:03:50,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395542977] [2024-11-22 02:03:50,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 02:03:50,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 02:03:50,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 02:03:50,460 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-22 02:03:50,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 02:03:50,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395542977] [2024-11-22 02:03:50,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395542977] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 02:03:50,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 02:03:50,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 02:03:50,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514316970] [2024-11-22 02:03:50,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 02:03:50,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 02:03:50,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 02:03:50,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 02:03:50,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 02:03:50,462 INFO L87 Difference]: Start difference. First operand 170 states and 220 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-22 02:03:50,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 02:03:50,495 INFO L93 Difference]: Finished difference Result 338 states and 445 transitions. [2024-11-22 02:03:50,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 02:03:50,496 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-22 02:03:50,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 02:03:50,497 INFO L225 Difference]: With dead ends: 338 [2024-11-22 02:03:50,497 INFO L226 Difference]: Without dead ends: 176 [2024-11-22 02:03:50,498 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-22 02:03:50,498 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 273 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-22 02:03:50,499 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 273 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 02:03:50,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-11-22 02:03:50,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2024-11-22 02:03:50,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 139 states have (on average 1.3093525179856116) internal successors, (182), 147 states have internal predecessors, (182), 19 states have call successors, (19), 19 states have call predecessors, (19), 17 states have return successors, (25), 17 states have call predecessors, (25), 19 states have call successors, (25) [2024-11-22 02:03:50,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 226 transitions. [2024-11-22 02:03:50,517 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 226 transitions. Word has length 39 [2024-11-22 02:03:50,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 02:03:50,517 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 226 transitions. [2024-11-22 02:03:50,517 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-22 02:03:50,517 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 226 transitions. [2024-11-22 02:03:50,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-22 02:03:50,518 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 02:03:50,518 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-22 02:03:50,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-22 02:03:50,519 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 02:03:50,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 02:03:50,519 INFO L85 PathProgramCache]: Analyzing trace with hash 519223641, now seen corresponding path program 1 times [2024-11-22 02:03:50,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 02:03:50,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846002181] [2024-11-22 02:03:50,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 02:03:50,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 02:03:50,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 02:03:50,575 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-22 02:03:50,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 02:03:50,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846002181] [2024-11-22 02:03:50,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846002181] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 02:03:50,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 02:03:50,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 02:03:50,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613167363] [2024-11-22 02:03:50,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 02:03:50,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 02:03:50,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 02:03:50,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 02:03:50,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 02:03:50,577 INFO L87 Difference]: Start difference. First operand 176 states and 226 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-22 02:03:50,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 02:03:50,619 INFO L93 Difference]: Finished difference Result 310 states and 402 transitions. [2024-11-22 02:03:50,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 02:03:50,620 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-22 02:03:50,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 02:03:50,621 INFO L225 Difference]: With dead ends: 310 [2024-11-22 02:03:50,622 INFO L226 Difference]: Without dead ends: 142 [2024-11-22 02:03:50,623 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-22 02:03:50,623 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 57 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 02:03:50,624 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 204 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 02:03:50,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-22 02:03:50,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2024-11-22 02:03:50,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 112 states have (on average 1.2857142857142858) internal successors, (144), 119 states have internal predecessors, (144), 15 states have call successors, (15), 15 states have call predecessors, (15), 14 states have return successors, (17), 14 states have call predecessors, (17), 15 states have call successors, (17) [2024-11-22 02:03:50,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 176 transitions. [2024-11-22 02:03:50,645 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 176 transitions. Word has length 39 [2024-11-22 02:03:50,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 02:03:50,645 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 176 transitions. [2024-11-22 02:03:50,645 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-22 02:03:50,645 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 176 transitions. [2024-11-22 02:03:50,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-22 02:03:50,647 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 02:03:50,648 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 02:03:50,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-22 02:03:50,648 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 02:03:50,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 02:03:50,648 INFO L85 PathProgramCache]: Analyzing trace with hash 554996476, now seen corresponding path program 1 times [2024-11-22 02:03:50,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 02:03:50,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448747569] [2024-11-22 02:03:50,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 02:03:50,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 02:03:50,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 02:03:50,723 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-22 02:03:50,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 02:03:50,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448747569] [2024-11-22 02:03:50,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448747569] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 02:03:50,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 02:03:50,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 02:03:50,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675216103] [2024-11-22 02:03:50,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 02:03:50,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 02:03:50,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 02:03:50,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 02:03:50,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 02:03:50,727 INFO L87 Difference]: Start difference. First operand 142 states and 176 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, (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-22 02:03:50,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 02:03:50,775 INFO L93 Difference]: Finished difference Result 274 states and 343 transitions. [2024-11-22 02:03:50,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 02:03:50,776 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, (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 41 [2024-11-22 02:03:50,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 02:03:50,779 INFO L225 Difference]: With dead ends: 274 [2024-11-22 02:03:50,779 INFO L226 Difference]: Without dead ends: 140 [2024-11-22 02:03:50,779 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-22 02:03:50,780 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 46 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 02:03:50,780 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 253 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 02:03:50,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-22 02:03:50,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2024-11-22 02:03:50,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 110 states have (on average 1.2545454545454546) internal successors, (138), 117 states have internal predecessors, (138), 15 states have call successors, (15), 15 states have call predecessors, (15), 14 states have return successors, (17), 14 states have call predecessors, (17), 15 states have call successors, (17) [2024-11-22 02:03:50,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 170 transitions. [2024-11-22 02:03:50,794 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 170 transitions. Word has length 41 [2024-11-22 02:03:50,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 02:03:50,794 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 170 transitions. [2024-11-22 02:03:50,794 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, (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-22 02:03:50,794 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 170 transitions. [2024-11-22 02:03:50,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-22 02:03:50,795 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 02:03:50,796 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-22 02:03:50,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-22 02:03:50,796 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 02:03:50,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 02:03:50,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1744677185, now seen corresponding path program 1 times [2024-11-22 02:03:50,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 02:03:50,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059036362] [2024-11-22 02:03:50,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 02:03:50,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 02:03:50,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 02:03:50,882 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-22 02:03:50,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 02:03:50,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059036362] [2024-11-22 02:03:50,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059036362] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 02:03:50,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 02:03:50,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 02:03:50,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918121474] [2024-11-22 02:03:50,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 02:03:50,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 02:03:50,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 02:03:50,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 02:03:50,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 02:03:50,884 INFO L87 Difference]: Start difference. First operand 140 states and 170 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-22 02:03:50,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 02:03:50,908 INFO L93 Difference]: Finished difference Result 209 states and 258 transitions. [2024-11-22 02:03:50,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 02:03:50,908 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-22 02:03:50,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 02:03:50,909 INFO L225 Difference]: With dead ends: 209 [2024-11-22 02:03:50,909 INFO L226 Difference]: Without dead ends: 207 [2024-11-22 02:03:50,910 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-22 02:03:50,910 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 39 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 133 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-22 02:03:50,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 133 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 02:03:50,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2024-11-22 02:03:50,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 189. [2024-11-22 02:03:50,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 149 states have (on average 1.2818791946308725) internal successors, (191), 159 states have internal predecessors, (191), 20 states have call successors, (20), 20 states have call predecessors, (20), 19 states have return successors, (26), 19 states have call predecessors, (26), 20 states have call successors, (26) [2024-11-22 02:03:50,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 237 transitions. [2024-11-22 02:03:50,927 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 237 transitions. Word has length 43 [2024-11-22 02:03:50,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 02:03:50,927 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 237 transitions. [2024-11-22 02:03:50,927 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-22 02:03:50,927 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 237 transitions. [2024-11-22 02:03:50,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-22 02:03:50,929 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 02:03:50,929 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-22 02:03:50,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-22 02:03:50,930 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 02:03:50,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 02:03:50,930 INFO L85 PathProgramCache]: Analyzing trace with hash -27164260, now seen corresponding path program 1 times [2024-11-22 02:03:50,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 02:03:50,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949492300] [2024-11-22 02:03:50,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 02:03:50,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 02:03:50,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 02:03:51,042 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-22 02:03:51,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 02:03:51,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949492300] [2024-11-22 02:03:51,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949492300] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 02:03:51,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1949301556] [2024-11-22 02:03:51,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 02:03:51,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 02:03:51,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 02:03:51,047 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-22 02:03:51,049 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-22 02:03:51,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 02:03:51,118 INFO L255 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-22 02:03:51,122 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 02:03:51,242 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-22 02:03:51,244 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 02:03:51,342 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-22 02:03:51,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1949301556] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-22 02:03:51,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-22 02:03:51,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 5] total 10 [2024-11-22 02:03:51,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835923198] [2024-11-22 02:03:51,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 02:03:51,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 02:03:51,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 02:03:51,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 02:03:51,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-22 02:03:51,345 INFO L87 Difference]: Start difference. First operand 189 states and 237 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-22 02:03:51,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 02:03:51,424 INFO L93 Difference]: Finished difference Result 524 states and 676 transitions. [2024-11-22 02:03:51,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 02:03:51,425 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 74 [2024-11-22 02:03:51,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 02:03:51,428 INFO L225 Difference]: With dead ends: 524 [2024-11-22 02:03:51,428 INFO L226 Difference]: Without dead ends: 343 [2024-11-22 02:03:51,429 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 145 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-11-22 02:03:51,430 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 36 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 02:03:51,431 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 321 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 02:03:51,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2024-11-22 02:03:51,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 314. [2024-11-22 02:03:51,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 244 states have (on average 1.2540983606557377) internal successors, (306), 261 states have internal predecessors, (306), 35 states have call successors, (35), 35 states have call predecessors, (35), 34 states have return successors, (47), 33 states have call predecessors, (47), 35 states have call successors, (47) [2024-11-22 02:03:51,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 388 transitions. [2024-11-22 02:03:51,472 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 388 transitions. Word has length 74 [2024-11-22 02:03:51,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 02:03:51,473 INFO L471 AbstractCegarLoop]: Abstraction has 314 states and 388 transitions. [2024-11-22 02:03:51,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-22 02:03:51,473 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 388 transitions. [2024-11-22 02:03:51,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-22 02:03:51,475 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 02:03:51,475 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-22 02:03:51,483 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-22 02:03:51,679 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-22 02:03:51,680 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 02:03:51,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 02:03:51,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1221722552, now seen corresponding path program 1 times [2024-11-22 02:03:51,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 02:03:51,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788859296] [2024-11-22 02:03:51,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 02:03:51,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 02:03:51,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 02:03:51,697 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 02:03:51,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 02:03:51,731 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-22 02:03:51,732 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 02:03:51,732 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-22 02:03:51,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-22 02:03:51,737 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 02:03:51,794 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 02:03:51,796 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 02:03:51 BoogieIcfgContainer [2024-11-22 02:03:51,796 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 02:03:51,797 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 02:03:51,797 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 02:03:51,797 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 02:03:51,798 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:03:49" (3/4) ... [2024-11-22 02:03:51,802 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-22 02:03:51,867 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-22 02:03:51,867 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 02:03:51,867 INFO L158 Benchmark]: Toolchain (without parser) took 3239.46ms. Allocated memory was 192.9MB in the beginning and 251.7MB in the end (delta: 58.7MB). Free memory was 125.1MB in the beginning and 198.1MB in the end (delta: -73.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 02:03:51,868 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 113.2MB. Free memory is still 78.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 02:03:51,868 INFO L158 Benchmark]: CACSL2BoogieTranslator took 363.94ms. Allocated memory is still 192.9MB. Free memory was 124.9MB in the beginning and 103.8MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-22 02:03:51,869 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.70ms. Allocated memory is still 192.9MB. Free memory was 103.6MB in the beginning and 164.4MB in the end (delta: -60.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-22 02:03:51,870 INFO L158 Benchmark]: Boogie Preprocessor took 37.10ms. Allocated memory is still 192.9MB. Free memory was 164.4MB in the beginning and 162.3MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 02:03:51,871 INFO L158 Benchmark]: RCFGBuilder took 377.69ms. Allocated memory is still 192.9MB. Free memory was 161.5MB in the beginning and 145.5MB in the end (delta: 16.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-22 02:03:51,871 INFO L158 Benchmark]: TraceAbstraction took 2319.50ms. Allocated memory was 192.9MB in the beginning and 251.7MB in the end (delta: 58.7MB). Free memory was 144.7MB in the beginning and 205.4MB in the end (delta: -60.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 02:03:51,871 INFO L158 Benchmark]: Witness Printer took 70.01ms. Allocated memory is still 251.7MB. Free memory was 205.4MB in the beginning and 198.1MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-22 02:03:51,873 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.16ms. Allocated memory is still 113.2MB. Free memory is still 78.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 363.94ms. Allocated memory is still 192.9MB. Free memory was 124.9MB in the beginning and 103.8MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.70ms. Allocated memory is still 192.9MB. Free memory was 103.6MB in the beginning and 164.4MB in the end (delta: -60.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.10ms. Allocated memory is still 192.9MB. Free memory was 164.4MB in the beginning and 162.3MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 377.69ms. Allocated memory is still 192.9MB. Free memory was 161.5MB in the beginning and 145.5MB in the end (delta: 16.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 2319.50ms. Allocated memory was 192.9MB in the beginning and 251.7MB in the end (delta: 58.7MB). Free memory was 144.7MB in the beginning and 205.4MB in the end (delta: -60.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 70.01ms. Allocated memory is still 251.7MB. Free memory was 205.4MB in the beginning and 198.1MB in the end (delta: 7.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,"featureselect.i","") [49] - GenericResultAtLocation [Line: 87]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [87] - GenericResultAtLocation [Line: 188]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [188] - GenericResultAtLocation [Line: 289]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [289] - GenericResultAtLocation [Line: 298]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [298] - GenericResultAtLocation [Line: 454]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [454] - GenericResultAtLocation [Line: 519]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [519] - GenericResultAtLocation [Line: 885]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [885] * 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: 294]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L95] int waterLevel = 1; [L96] int methaneLevelCritical = 0; [L189] int cleanupTimeShifts = 4; [L302] int pumpRunning = 0; [L303] int systemActive = 1; [L689] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L886] int methAndRunningLastTime ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L267] int retValue_acc ; [L268] int tmp ; [L272] FCALL select_helpers() [L273] FCALL select_features() [L274] CALL, EXPR valid_product() [L79] int retValue_acc ; [L82] retValue_acc = 1 [L83] return (retValue_acc); VAL [\result=1, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L274] RET, EXPR valid_product() [L274] tmp = valid_product() [L276] COND TRUE \read(tmp) [L278] FCALL setup() [L279] CALL runTest() [L260] CALL __utac_acc__Specification2_spec__1() [L891] methAndRunningLastTime = 0 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L260] RET __utac_acc__Specification2_spec__1() [L261] CALL test() [L456] int splverifierCounter ; [L457] int tmp ; [L458] int tmp___0 ; [L459] int tmp___1 ; [L460] int tmp___2 ; [L463] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L465] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L467] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L473] tmp = __VERIFIER_nondet_int() [L475] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L477] CALL waterRise() VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L113] COND TRUE waterLevel < 2 [L114] waterLevel = waterLevel + 1 VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L477] RET waterRise() VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L483] tmp___0 = __VERIFIER_nondet_int() [L485] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L487] CALL changeMethaneLevel() VAL [\old(methaneLevelCritical)=0, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L125] COND FALSE !(\read(methaneLevelCritical)) [L128] methaneLevelCritical = 1 VAL [\old(methaneLevelCritical)=0, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L487] RET changeMethaneLevel() VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L493] tmp___2 = __VERIFIER_nondet_int() [L495] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L508] 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] [L310] 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] [L317] COND TRUE \read(systemActive) [L319] CALL processEnvironment() [L339] 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] [L342] COND TRUE ! pumpRunning [L344] CALL, EXPR isHighWaterLevel() [L436] int retValue_acc ; [L437] int tmp ; [L438] int tmp___0 ; [L442] CALL, EXPR isHighWaterSensorDry() [L175] 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] [L178] COND FALSE !(waterLevel < 2) [L182] retValue_acc = 0 [L183] 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] [L442] RET, EXPR isHighWaterSensorDry() [L442] tmp = isHighWaterSensorDry() [L444] COND FALSE !(\read(tmp)) [L447] 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] [L449] retValue_acc = tmp___0 [L450] 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] [L344] RET, EXPR isHighWaterLevel() [L344] tmp = isHighWaterLevel() [L346] COND TRUE \read(tmp) [L348] CALL activatePump() [L367] 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] [L348] RET activatePump() [L319] RET processEnvironment() [L325] CALL __utac_acc__Specification2_spec__2() [L896] int tmp ; [L897] 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] [L901] 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] [L134] int retValue_acc ; [L137] retValue_acc = methaneLevelCritical [L138] 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] [L901] 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] [L901] tmp = isMethaneLevelCritical() [L903] COND TRUE \read(tmp) [L905] CALL, EXPR isPumpRunning() [L391] int retValue_acc ; [L394] retValue_acc = pumpRunning [L395] 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] [L905] RET, EXPR isPumpRunning() [L905] tmp___0 = isPumpRunning() [L907] 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] [L908] COND FALSE !(\read(methAndRunningLastTime)) [L913] 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] [L325] RET __utac_acc__Specification2_spec__2() [L508] RET timeShift() VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L465] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L467] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L473] tmp = __VERIFIER_nondet_int() [L475] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L483] tmp___0 = __VERIFIER_nondet_int() [L485] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L493] tmp___2 = __VERIFIER_nondet_int() [L495] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L508] 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] [L310] COND TRUE \read(pumpRunning) [L312] CALL lowerWaterLevel() [L101] COND TRUE waterLevel > 0 [L102] 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] [L312] RET lowerWaterLevel() [L317] COND TRUE \read(systemActive) [L319] CALL processEnvironment() [L339] 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] [L342] 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] [L357] 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] [L319] RET processEnvironment() [L325] CALL __utac_acc__Specification2_spec__2() [L896] int tmp ; [L897] 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] [L901] 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] [L134] int retValue_acc ; [L137] retValue_acc = methaneLevelCritical [L138] 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] [L901] 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] [L901] tmp = isMethaneLevelCritical() [L903] COND TRUE \read(tmp) [L905] CALL, EXPR isPumpRunning() [L391] int retValue_acc ; [L394] retValue_acc = pumpRunning [L395] 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] [L905] RET, EXPR isPumpRunning() [L905] tmp___0 = isPumpRunning() [L907] 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] [L908] COND TRUE \read(methAndRunningLastTime) [L910] CALL __automaton_fail() [L294] 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, 76 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.2s, OverallIterations: 11, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 353 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 349 mSDsluCounter, 1748 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 998 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 114 IncrementalHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 750 mSDtfsCounter, 114 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 195 GetRequests, 166 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=314occurred in iteration=10, InterpolantAutomatonStates: 39, 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, 51 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 543 NumberOfCodeBlocks, 543 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 527 ConstructedInterpolants, 0 QuantifiedInterpolants, 1063 SizeOfPredicates, 1 NumberOfNonLiveVariables, 264 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 12 InterpolantComputations, 10 PerfectInterpolantSequences, 65/69 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-22 02:03:51,896 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