./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product33.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_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-wip.fs.cvc5-61a6796-m [2024-10-14 03:08:06,868 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 03:08:06,936 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 03:08:06,947 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 03:08:06,947 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 03:08:06,968 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 03:08:06,969 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 03:08:06,969 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 03:08:06,970 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 03:08:06,972 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 03:08:06,973 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 03:08:06,973 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 03:08:06,973 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 03:08:06,973 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 03:08:06,974 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 03:08:06,974 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 03:08:06,974 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 03:08:06,974 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 03:08:06,975 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 03:08:06,975 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 03:08:06,975 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 03:08:06,975 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 03:08:06,976 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 03:08:06,976 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 03:08:06,976 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 03:08:06,976 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 03:08:06,976 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 03:08:06,976 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 03:08:06,977 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 03:08:06,977 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 03:08:06,977 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 03:08:06,977 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 03:08:06,977 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:08:06,978 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 03:08:06,978 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 03:08:06,978 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 03:08:06,978 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 03:08:06,978 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 03:08:06,979 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 03:08:06,979 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 03:08:06,979 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 03:08:06,981 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 03:08:06,981 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-10-14 03:08:07,155 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 03:08:07,184 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 03:08:07,186 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 03:08:07,187 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 03:08:07,188 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 03:08:07,189 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product33.cil.c [2024-10-14 03:08:08,761 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 03:08:08,996 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 03:08:08,996 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product33.cil.c [2024-10-14 03:08:09,017 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f052c624/908315952a0f4154836dc04335d3e8a6/FLAGcb12954d9 [2024-10-14 03:08:09,033 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f052c624/908315952a0f4154836dc04335d3e8a6 [2024-10-14 03:08:09,035 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 03:08:09,036 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 03:08:09,036 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 03:08:09,036 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 03:08:09,056 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 03:08:09,057 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:08:09" (1/1) ... [2024-10-14 03:08:09,058 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55382295 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:08:09, skipping insertion in model container [2024-10-14 03:08:09,058 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:08:09" (1/1) ... [2024-10-14 03:08:09,116 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 03:08:09,367 WARN L248 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-10-14 03:08:09,482 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:08:09,491 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 03:08:09,499 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [49] [2024-10-14 03:08:09,503 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [87] [2024-10-14 03:08:09,503 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [188] [2024-10-14 03:08:09,504 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [289] [2024-10-14 03:08:09,504 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [298] [2024-10-14 03:08:09,504 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [454] [2024-10-14 03:08:09,504 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [519] [2024-10-14 03:08:09,504 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [885] [2024-10-14 03:08:09,524 WARN L248 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-10-14 03:08:09,571 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:08:09,597 INFO L204 MainTranslator]: Completed translation [2024-10-14 03:08:09,597 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:08:09 WrapperNode [2024-10-14 03:08:09,597 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 03:08:09,598 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 03:08:09,598 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 03:08:09,598 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 03:08:09,603 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:08:09" (1/1) ... [2024-10-14 03:08:09,617 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:08:09" (1/1) ... [2024-10-14 03:08:09,635 INFO L138 Inliner]: procedures = 53, calls = 94, calls flagged for inlining = 20, calls inlined = 17, statements flattened = 172 [2024-10-14 03:08:09,635 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 03:08:09,636 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 03:08:09,636 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 03:08:09,636 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 03:08:09,648 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:08:09" (1/1) ... [2024-10-14 03:08:09,648 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:08:09" (1/1) ... [2024-10-14 03:08:09,650 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:08:09" (1/1) ... [2024-10-14 03:08:09,662 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-10-14 03:08:09,662 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:08:09" (1/1) ... [2024-10-14 03:08:09,662 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:08:09" (1/1) ... [2024-10-14 03:08:09,665 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:08:09" (1/1) ... [2024-10-14 03:08:09,667 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:08:09" (1/1) ... [2024-10-14 03:08:09,668 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:08:09" (1/1) ... [2024-10-14 03:08:09,669 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:08:09" (1/1) ... [2024-10-14 03:08:09,670 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 03:08:09,671 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 03:08:09,671 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 03:08:09,671 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 03:08:09,673 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:08:09" (1/1) ... [2024-10-14 03:08:09,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:08:09,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:08:09,741 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-10-14 03:08:09,744 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-10-14 03:08:09,783 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 03:08:09,784 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2024-10-14 03:08:09,784 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2024-10-14 03:08:09,784 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-10-14 03:08:09,784 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-10-14 03:08:09,785 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-10-14 03:08:09,785 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-10-14 03:08:09,785 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2024-10-14 03:08:09,785 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2024-10-14 03:08:09,785 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2024-10-14 03:08:09,785 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2024-10-14 03:08:09,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 03:08:09,786 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2024-10-14 03:08:09,786 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2024-10-14 03:08:09,786 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 03:08:09,786 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 03:08:09,849 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 03:08:09,852 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 03:08:10,059 INFO L? ?]: Removed 36 outVars from TransFormulas that were not future-live. [2024-10-14 03:08:10,059 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 03:08:10,105 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 03:08:10,105 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-14 03:08:10,106 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:08:10 BoogieIcfgContainer [2024-10-14 03:08:10,106 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 03:08:10,107 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 03:08:10,108 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 03:08:10,110 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 03:08:10,110 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 03:08:09" (1/3) ... [2024-10-14 03:08:10,111 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2db0d8ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:08:10, skipping insertion in model container [2024-10-14 03:08:10,111 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:08:09" (2/3) ... [2024-10-14 03:08:10,112 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2db0d8ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:08:10, skipping insertion in model container [2024-10-14 03:08:10,112 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:08:10" (3/3) ... [2024-10-14 03:08:10,117 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec2_product33.cil.c [2024-10-14 03:08:10,131 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 03:08:10,131 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 03:08:10,221 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 03:08:10,227 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;@2828ce2b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 03:08:10,228 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 03:08:10,232 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 42 states have (on average 1.5714285714285714) internal successors, (66), 48 states have internal predecessors, (66), 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-10-14 03:08:10,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-14 03:08:10,239 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:08:10,239 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:08:10,240 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:08:10,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:08:10,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1702293081, now seen corresponding path program 1 times [2024-10-14 03:08:10,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:08:10,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524001855] [2024-10-14 03:08:10,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:08:10,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:08:10,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:08:10,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 03:08:10,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:08:10,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:08:10,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:08:10,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524001855] [2024-10-14 03:08:10,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524001855] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:08:10,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:08:10,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 03:08:10,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309529844] [2024-10-14 03:08:10,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:08:10,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 03:08:10,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:08:10,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 03:08:10,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 03:08:10,441 INFO L87 Difference]: Start difference. First operand has 59 states, 42 states have (on average 1.5714285714285714) internal successors, (66), 48 states have internal predecessors, (66), 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 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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-10-14 03:08:10,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:08:10,486 INFO L93 Difference]: Finished difference Result 116 states and 169 transitions. [2024-10-14 03:08:10,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 03:08:10,489 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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 17 [2024-10-14 03:08:10,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:08:10,498 INFO L225 Difference]: With dead ends: 116 [2024-10-14 03:08:10,498 INFO L226 Difference]: Without dead ends: 54 [2024-10-14 03:08:10,501 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 03:08:10,505 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:08:10,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:08:10,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-10-14 03:08:10,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-10-14 03:08:10,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 39 states have (on average 1.435897435897436) internal successors, (56), 44 states have internal predecessors, (56), 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-10-14 03:08:10,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 73 transitions. [2024-10-14 03:08:10,536 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 73 transitions. Word has length 17 [2024-10-14 03:08:10,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:08:10,537 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 73 transitions. [2024-10-14 03:08:10,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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-10-14 03:08:10,537 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 73 transitions. [2024-10-14 03:08:10,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-14 03:08:10,538 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:08:10,538 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:08:10,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 03:08:10,539 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:08:10,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:08:10,540 INFO L85 PathProgramCache]: Analyzing trace with hash -960567338, now seen corresponding path program 1 times [2024-10-14 03:08:10,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:08:10,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871417933] [2024-10-14 03:08:10,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:08:10,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:08:10,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:08:10,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 03:08:10,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:08:10,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:08:10,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:08:10,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871417933] [2024-10-14 03:08:10,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871417933] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:08:10,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:08:10,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:08:10,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181520707] [2024-10-14 03:08:10,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:08:10,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:08:10,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:08:10,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:08:10,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:08:10,625 INFO L87 Difference]: Start difference. First operand 54 states and 73 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-10-14 03:08:10,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:08:10,645 INFO L93 Difference]: Finished difference Result 81 states and 109 transitions. [2024-10-14 03:08:10,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:08:10,645 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 18 [2024-10-14 03:08:10,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:08:10,646 INFO L225 Difference]: With dead ends: 81 [2024-10-14 03:08:10,646 INFO L226 Difference]: Without dead ends: 46 [2024-10-14 03:08:10,647 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:08:10,648 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 11 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 94 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-10-14 03:08:10,648 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 94 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:08:10,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-14 03:08:10,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-10-14 03:08:10,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 39 states have internal predecessors, (50), 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-10-14 03:08:10,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 62 transitions. [2024-10-14 03:08:10,654 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 62 transitions. Word has length 18 [2024-10-14 03:08:10,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:08:10,654 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 62 transitions. [2024-10-14 03:08:10,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-10-14 03:08:10,654 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 62 transitions. [2024-10-14 03:08:10,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-14 03:08:10,655 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:08:10,655 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] [2024-10-14 03:08:10,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 03:08:10,656 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:08:10,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:08:10,656 INFO L85 PathProgramCache]: Analyzing trace with hash -766669739, now seen corresponding path program 1 times [2024-10-14 03:08:10,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:08:10,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377721829] [2024-10-14 03:08:10,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:08:10,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:08:10,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:08:10,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 03:08:10,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:08:10,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:08:10,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:08:10,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377721829] [2024-10-14 03:08:10,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377721829] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:08:10,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:08:10,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:08:10,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686055536] [2024-10-14 03:08:10,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:08:10,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:08:10,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:08:10,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:08:10,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:08:10,758 INFO L87 Difference]: Start difference. First operand 46 states and 62 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-10-14 03:08:10,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:08:10,781 INFO L93 Difference]: Finished difference Result 90 states and 123 transitions. [2024-10-14 03:08:10,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:08:10,782 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 21 [2024-10-14 03:08:10,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:08:10,783 INFO L225 Difference]: With dead ends: 90 [2024-10-14 03:08:10,783 INFO L226 Difference]: Without dead ends: 46 [2024-10-14 03:08:10,785 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-10-14 03:08:10,786 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 50 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:08:10,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 52 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:08:10,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-14 03:08:10,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-10-14 03:08:10,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 34 states have (on average 1.4411764705882353) internal successors, (49), 39 states have internal predecessors, (49), 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-10-14 03:08:10,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 61 transitions. [2024-10-14 03:08:10,801 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 61 transitions. Word has length 21 [2024-10-14 03:08:10,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:08:10,804 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 61 transitions. [2024-10-14 03:08:10,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-10-14 03:08:10,805 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 61 transitions. [2024-10-14 03:08:10,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-14 03:08:10,805 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:08:10,806 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-10-14 03:08:10,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 03:08:10,806 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:08:10,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:08:10,806 INFO L85 PathProgramCache]: Analyzing trace with hash 2002569798, now seen corresponding path program 1 times [2024-10-14 03:08:10,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:08:10,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233202724] [2024-10-14 03:08:10,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:08:10,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:08:10,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:08:10,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 03:08:10,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:08:10,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 03:08:10,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:08:10,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:08:10,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:08:10,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233202724] [2024-10-14 03:08:10,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233202724] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:08:10,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:08:10,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:08:10,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326806118] [2024-10-14 03:08:10,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:08:10,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:08:10,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:08:10,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:08:10,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:08:10,865 INFO L87 Difference]: Start difference. First operand 46 states and 61 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-10-14 03:08:10,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:08:10,919 INFO L93 Difference]: Finished difference Result 125 states and 168 transitions. [2024-10-14 03:08:10,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:08:10,920 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 26 [2024-10-14 03:08:10,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:08:10,922 INFO L225 Difference]: With dead ends: 125 [2024-10-14 03:08:10,923 INFO L226 Difference]: Without dead ends: 81 [2024-10-14 03:08:10,924 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:08:10,926 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 51 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:08:10,927 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 104 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:08:10,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-10-14 03:08:10,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2024-10-14 03:08:10,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 58 states have (on average 1.4137931034482758) internal successors, (82), 64 states have internal predecessors, (82), 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-10-14 03:08:10,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 104 transitions. [2024-10-14 03:08:10,942 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 104 transitions. Word has length 26 [2024-10-14 03:08:10,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:08:10,942 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 104 transitions. [2024-10-14 03:08:10,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-10-14 03:08:10,943 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 104 transitions. [2024-10-14 03:08:10,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-14 03:08:10,944 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:08:10,944 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:08:10,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 03:08:10,944 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:08:10,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:08:10,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1845594651, now seen corresponding path program 1 times [2024-10-14 03:08:10,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:08:10,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631458619] [2024-10-14 03:08:10,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:08:10,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:08:10,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:08:11,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 03:08:11,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:08:11,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:08:11,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:08:11,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631458619] [2024-10-14 03:08:11,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631458619] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:08:11,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:08:11,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:08:11,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100741230] [2024-10-14 03:08:11,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:08:11,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:08:11,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:08:11,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:08:11,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:08:11,028 INFO L87 Difference]: Start difference. First operand 79 states and 104 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 03:08:11,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:08:11,071 INFO L93 Difference]: Finished difference Result 223 states and 307 transitions. [2024-10-14 03:08:11,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:08:11,072 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2024-10-14 03:08:11,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:08:11,074 INFO L225 Difference]: With dead ends: 223 [2024-10-14 03:08:11,074 INFO L226 Difference]: Without dead ends: 146 [2024-10-14 03:08:11,074 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:08:11,075 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 37 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:08:11,076 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 98 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:08:11,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-10-14 03:08:11,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 144. [2024-10-14 03:08:11,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 107 states have (on average 1.4018691588785046) internal successors, (150), 115 states have internal predecessors, (150), 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-10-14 03:08:11,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 194 transitions. [2024-10-14 03:08:11,093 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 194 transitions. Word has length 28 [2024-10-14 03:08:11,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:08:11,094 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 194 transitions. [2024-10-14 03:08:11,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 03:08:11,094 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 194 transitions. [2024-10-14 03:08:11,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-14 03:08:11,095 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:08:11,095 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:08:11,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 03:08:11,095 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:08:11,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:08:11,096 INFO L85 PathProgramCache]: Analyzing trace with hash -565730973, now seen corresponding path program 1 times [2024-10-14 03:08:11,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:08:11,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716417848] [2024-10-14 03:08:11,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:08:11,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:08:11,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:08:11,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 03:08:11,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:08:11,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:08:11,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:08:11,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716417848] [2024-10-14 03:08:11,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716417848] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:08:11,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:08:11,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:08:11,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895497291] [2024-10-14 03:08:11,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:08:11,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:08:11,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:08:11,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:08:11,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:08:11,146 INFO L87 Difference]: Start difference. First operand 144 states and 194 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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-10-14 03:08:11,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:08:11,184 INFO L93 Difference]: Finished difference Result 290 states and 397 transitions. [2024-10-14 03:08:11,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 03:08:11,184 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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 28 [2024-10-14 03:08:11,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:08:11,186 INFO L225 Difference]: With dead ends: 290 [2024-10-14 03:08:11,186 INFO L226 Difference]: Without dead ends: 148 [2024-10-14 03:08:11,186 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:08:11,187 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 0 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:08:11,187 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 151 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:08:11,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-10-14 03:08:11,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2024-10-14 03:08:11,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 111 states have (on average 1.3873873873873874) internal successors, (154), 119 states have internal predecessors, (154), 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-10-14 03:08:11,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 198 transitions. [2024-10-14 03:08:11,200 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 198 transitions. Word has length 28 [2024-10-14 03:08:11,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:08:11,200 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 198 transitions. [2024-10-14 03:08:11,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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-10-14 03:08:11,200 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 198 transitions. [2024-10-14 03:08:11,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-14 03:08:11,201 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:08:11,201 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:08:11,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 03:08:11,201 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:08:11,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:08:11,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1152536987, now seen corresponding path program 1 times [2024-10-14 03:08:11,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:08:11,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612372210] [2024-10-14 03:08:11,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:08:11,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:08:11,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:08:11,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 03:08:11,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:08:11,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:08:11,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:08:11,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612372210] [2024-10-14 03:08:11,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612372210] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:08:11,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:08:11,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 03:08:11,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918658750] [2024-10-14 03:08:11,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:08:11,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:08:11,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:08:11,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:08:11,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:08:11,255 INFO L87 Difference]: Start difference. First operand 148 states and 198 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 03:08:11,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:08:11,305 INFO L93 Difference]: Finished difference Result 266 states and 358 transitions. [2024-10-14 03:08:11,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:08:11,305 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2024-10-14 03:08:11,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:08:11,307 INFO L225 Difference]: With dead ends: 266 [2024-10-14 03:08:11,307 INFO L226 Difference]: Without dead ends: 120 [2024-10-14 03:08:11,307 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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-10-14 03:08:11,308 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 52 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:08:11,308 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 145 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:08:11,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-10-14 03:08:11,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2024-10-14 03:08:11,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 90 states have (on average 1.3555555555555556) internal successors, (122), 97 states have internal predecessors, (122), 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-10-14 03:08:11,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 154 transitions. [2024-10-14 03:08:11,318 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 154 transitions. Word has length 28 [2024-10-14 03:08:11,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:08:11,318 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 154 transitions. [2024-10-14 03:08:11,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 03:08:11,318 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 154 transitions. [2024-10-14 03:08:11,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-14 03:08:11,319 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:08:11,319 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:08:11,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 03:08:11,319 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:08:11,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:08:11,320 INFO L85 PathProgramCache]: Analyzing trace with hash 531670241, now seen corresponding path program 1 times [2024-10-14 03:08:11,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:08:11,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158261274] [2024-10-14 03:08:11,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:08:11,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:08:11,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:08:11,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 03:08:11,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:08:11,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 03:08:11,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:08:11,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:08:11,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:08:11,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158261274] [2024-10-14 03:08:11,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158261274] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:08:11,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:08:11,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:08:11,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780692262] [2024-10-14 03:08:11,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:08:11,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:08:11,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:08:11,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:08:11,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:08:11,362 INFO L87 Difference]: Start difference. First operand 120 states and 154 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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-10-14 03:08:11,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:08:11,397 INFO L93 Difference]: Finished difference Result 236 states and 305 transitions. [2024-10-14 03:08:11,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 03:08:11,398 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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 31 [2024-10-14 03:08:11,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:08:11,399 INFO L225 Difference]: With dead ends: 236 [2024-10-14 03:08:11,399 INFO L226 Difference]: Without dead ends: 118 [2024-10-14 03:08:11,400 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:08:11,400 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 36 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:08:11,401 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 141 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:08:11,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-10-14 03:08:11,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-10-14 03:08:11,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 88 states have (on average 1.3181818181818181) internal successors, (116), 95 states have internal predecessors, (116), 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-10-14 03:08:11,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 148 transitions. [2024-10-14 03:08:11,410 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 148 transitions. Word has length 31 [2024-10-14 03:08:11,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:08:11,410 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 148 transitions. [2024-10-14 03:08:11,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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-10-14 03:08:11,410 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 148 transitions. [2024-10-14 03:08:11,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-14 03:08:11,411 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:08:11,411 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] [2024-10-14 03:08:11,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 03:08:11,411 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:08:11,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:08:11,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1091214643, now seen corresponding path program 1 times [2024-10-14 03:08:11,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:08:11,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699570487] [2024-10-14 03:08:11,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:08:11,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:08:11,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:08:11,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 03:08:11,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:08:11,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 03:08:11,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:08:11,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:08:11,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:08:11,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699570487] [2024-10-14 03:08:11,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699570487] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:08:11,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:08:11,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:08:11,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229544590] [2024-10-14 03:08:11,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:08:11,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:08:11,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:08:11,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:08:11,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:08:11,461 INFO L87 Difference]: Start difference. First operand 118 states and 148 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 03:08:11,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:08:11,655 INFO L93 Difference]: Finished difference Result 246 states and 321 transitions. [2024-10-14 03:08:11,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:08:11,656 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (3), 3 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 32 [2024-10-14 03:08:11,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:08:11,658 INFO L225 Difference]: With dead ends: 246 [2024-10-14 03:08:11,659 INFO L226 Difference]: Without dead ends: 244 [2024-10-14 03:08:11,660 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:08:11,660 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 96 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:08:11,661 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 124 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:08:11,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2024-10-14 03:08:11,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 212. [2024-10-14 03:08:11,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 162 states have (on average 1.345679012345679) internal successors, (218), 178 states have internal predecessors, (218), 26 states have call successors, (26), 20 states have call predecessors, (26), 23 states have return successors, (39), 25 states have call predecessors, (39), 26 states have call successors, (39) [2024-10-14 03:08:11,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 283 transitions. [2024-10-14 03:08:11,697 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 283 transitions. Word has length 32 [2024-10-14 03:08:11,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:08:11,698 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 283 transitions. [2024-10-14 03:08:11,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 03:08:11,698 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 283 transitions. [2024-10-14 03:08:11,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-14 03:08:11,703 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:08:11,704 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-14 03:08:11,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 03:08:11,704 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:08:11,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:08:11,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1731902513, now seen corresponding path program 1 times [2024-10-14 03:08:11,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:08:11,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466964351] [2024-10-14 03:08:11,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:08:11,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:08:11,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:08:11,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 03:08:11,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:08:11,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 03:08:11,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:08:11,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 03:08:11,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:08:11,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 03:08:11,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:08:11,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 03:08:11,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:08:11,841 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 03:08:11,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:08:11,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466964351] [2024-10-14 03:08:11,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466964351] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:08:11,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1383543698] [2024-10-14 03:08:11,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:08:11,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:08:11,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:08:11,846 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-10-14 03:08:11,847 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-10-14 03:08:11,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:08:11,918 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-14 03:08:11,925 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:08:12,055 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-14 03:08:12,056 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:08:12,157 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-14 03:08:12,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1383543698] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-14 03:08:12,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-14 03:08:12,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9, 5] total 13 [2024-10-14 03:08:12,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555348901] [2024-10-14 03:08:12,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:08:12,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:08:12,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:08:12,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:08:12,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-10-14 03:08:12,160 INFO L87 Difference]: Start difference. First operand 212 states and 283 transitions. Second operand has 6 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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-10-14 03:08:12,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:08:12,264 INFO L93 Difference]: Finished difference Result 604 states and 827 transitions. [2024-10-14 03:08:12,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 03:08:12,265 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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 59 [2024-10-14 03:08:12,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:08:12,270 INFO L225 Difference]: With dead ends: 604 [2024-10-14 03:08:12,272 INFO L226 Difference]: Without dead ends: 394 [2024-10-14 03:08:12,273 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 120 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-10-14 03:08:12,274 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 32 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:08:12,274 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 239 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:08:12,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-10-14 03:08:12,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 354. [2024-10-14 03:08:12,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 267 states have (on average 1.299625468164794) internal successors, (347), 294 states have internal predecessors, (347), 45 states have call successors, (45), 35 states have call predecessors, (45), 41 states have return successors, (67), 43 states have call predecessors, (67), 45 states have call successors, (67) [2024-10-14 03:08:12,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 459 transitions. [2024-10-14 03:08:12,303 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 459 transitions. Word has length 59 [2024-10-14 03:08:12,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:08:12,303 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 459 transitions. [2024-10-14 03:08:12,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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-10-14 03:08:12,303 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 459 transitions. [2024-10-14 03:08:12,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-14 03:08:12,305 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:08:12,305 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-14 03:08:12,319 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 03:08:12,505 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-10-14 03:08:12,506 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:08:12,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:08:12,507 INFO L85 PathProgramCache]: Analyzing trace with hash -406126741, now seen corresponding path program 1 times [2024-10-14 03:08:12,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:08:12,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755669720] [2024-10-14 03:08:12,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:08:12,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:08:12,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 03:08:12,518 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 03:08:12,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 03:08:12,542 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 03:08:12,543 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 03:08:12,543 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 03:08:12,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 03:08:12,546 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:08:12,588 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 03:08:12,590 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 03:08:12 BoogieIcfgContainer [2024-10-14 03:08:12,590 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 03:08:12,590 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 03:08:12,591 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 03:08:12,591 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 03:08:12,591 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:08:10" (3/4) ... [2024-10-14 03:08:12,592 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-14 03:08:12,642 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 03:08:12,643 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 03:08:12,643 INFO L158 Benchmark]: Toolchain (without parser) took 3607.42ms. Allocated memory was 184.5MB in the beginning and 262.1MB in the end (delta: 77.6MB). Free memory was 127.2MB in the beginning and 108.5MB in the end (delta: 18.6MB). Peak memory consumption was 96.8MB. Max. memory is 16.1GB. [2024-10-14 03:08:12,643 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 184.5MB. Free memory was 146.5MB in the beginning and 146.2MB in the end (delta: 235.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 03:08:12,643 INFO L158 Benchmark]: CACSL2BoogieTranslator took 561.16ms. Allocated memory is still 184.5MB. Free memory was 126.6MB in the beginning and 106.7MB in the end (delta: 20.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-14 03:08:12,643 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.43ms. Allocated memory is still 184.5MB. Free memory was 106.7MB in the beginning and 104.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 03:08:12,644 INFO L158 Benchmark]: Boogie Preprocessor took 34.58ms. Allocated memory is still 184.5MB. Free memory was 104.6MB in the beginning and 102.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 03:08:12,644 INFO L158 Benchmark]: RCFGBuilder took 434.80ms. Allocated memory is still 184.5MB. Free memory was 102.5MB in the beginning and 81.0MB in the end (delta: 21.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-14 03:08:12,644 INFO L158 Benchmark]: TraceAbstraction took 2482.59ms. Allocated memory was 184.5MB in the beginning and 262.1MB in the end (delta: 77.6MB). Free memory was 80.0MB in the beginning and 114.8MB in the end (delta: -34.8MB). Peak memory consumption was 42.2MB. Max. memory is 16.1GB. [2024-10-14 03:08:12,644 INFO L158 Benchmark]: Witness Printer took 52.12ms. Allocated memory is still 262.1MB. Free memory was 114.8MB in the beginning and 108.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-14 03:08:12,645 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.14ms. Allocated memory is still 184.5MB. Free memory was 146.5MB in the beginning and 146.2MB in the end (delta: 235.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 561.16ms. Allocated memory is still 184.5MB. Free memory was 126.6MB in the beginning and 106.7MB in the end (delta: 20.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.43ms. Allocated memory is still 184.5MB. Free memory was 106.7MB in the beginning and 104.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.58ms. Allocated memory is still 184.5MB. Free memory was 104.6MB in the beginning and 102.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 434.80ms. Allocated memory is still 184.5MB. Free memory was 102.5MB in the beginning and 81.0MB in the end (delta: 21.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 2482.59ms. Allocated memory was 184.5MB in the beginning and 262.1MB in the end (delta: 77.6MB). Free memory was 80.0MB in the beginning and 114.8MB in the end (delta: -34.8MB). Peak memory consumption was 42.2MB. Max. memory is 16.1GB. * Witness Printer took 52.12ms. Allocated memory is still 262.1MB. Free memory was 114.8MB in the beginning and 108.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 49]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"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 ; [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); [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 [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 [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); [L344] RET, EXPR isHighWaterLevel() [L344] tmp = isHighWaterLevel() [L346] COND TRUE \read(tmp) [L348] CALL activatePump() [L367] pumpRunning = 1 [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); [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); [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 [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); [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); [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, 59 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.3s, OverallIterations: 11, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 375 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 365 mSDsluCounter, 1216 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 677 mSDsCounter, 38 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 312 IncrementalHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 38 mSolverCounterUnsat, 539 mSDtfsCounter, 312 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 193 GetRequests, 162 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=354occurred 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, 76 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 410 NumberOfCodeBlocks, 410 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 394 ConstructedInterpolants, 0 QuantifiedInterpolants, 788 SizeOfPredicates, 1 NumberOfNonLiveVariables, 238 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 12 InterpolantComputations, 10 PerfectInterpolantSequences, 57/60 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-10-14 03:08:12,671 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