./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-regression/ex3_forlist.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-regression/ex3_forlist.i -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 ddbd4e73adf4663f87721f5aa250c32f7b058621a618ab1d03544a940de1ce0e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 12:58:59,739 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 12:58:59,808 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 12:58:59,822 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 12:58:59,823 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 12:58:59,870 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 12:58:59,871 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 12:58:59,871 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 12:58:59,872 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 12:58:59,873 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 12:58:59,873 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 12:58:59,874 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 12:58:59,876 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 12:58:59,876 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 12:58:59,876 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 12:58:59,876 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 12:58:59,877 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 12:58:59,877 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 12:58:59,877 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 12:58:59,877 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 12:58:59,878 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 12:58:59,879 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 12:58:59,879 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 12:58:59,879 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 12:58:59,879 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 12:58:59,880 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 12:58:59,880 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 12:58:59,880 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 12:58:59,880 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 12:58:59,881 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 12:58:59,881 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 12:58:59,881 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 12:58:59,881 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 12:58:59,882 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 12:58:59,882 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 12:58:59,882 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 12:58:59,883 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 12:58:59,883 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 12:58:59,884 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 12:58:59,884 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 12:58:59,884 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 12:58:59,885 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 12:58:59,885 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 -> ddbd4e73adf4663f87721f5aa250c32f7b058621a618ab1d03544a940de1ce0e [2024-11-18 12:59:00,140 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 12:59:00,164 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 12:59:00,167 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 12:59:00,168 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 12:59:00,169 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 12:59:00,170 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-regression/ex3_forlist.i [2024-11-18 12:59:01,582 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 12:59:01,778 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 12:59:01,779 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/ex3_forlist.i [2024-11-18 12:59:01,787 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e00a412b8/4815cab5797e44f98c6665630a065046/FLAG0ec3ad7d8 [2024-11-18 12:59:01,799 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e00a412b8/4815cab5797e44f98c6665630a065046 [2024-11-18 12:59:01,801 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 12:59:01,802 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 12:59:01,803 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 12:59:01,803 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 12:59:01,808 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 12:59:01,808 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 12:59:01" (1/1) ... [2024-11-18 12:59:01,809 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f200ab5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:59:01, skipping insertion in model container [2024-11-18 12:59:01,809 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 12:59:01" (1/1) ... [2024-11-18 12:59:01,831 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 12:59:01,978 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/ex3_forlist.i[293,306] [2024-11-18 12:59:02,013 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 12:59:02,027 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 12:59:02,039 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/ex3_forlist.i[293,306] [2024-11-18 12:59:02,050 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 12:59:02,071 INFO L204 MainTranslator]: Completed translation [2024-11-18 12:59:02,071 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:59:02 WrapperNode [2024-11-18 12:59:02,071 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 12:59:02,072 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 12:59:02,073 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 12:59:02,073 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 12:59:02,079 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:59:02" (1/1) ... [2024-11-18 12:59:02,086 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:59:02" (1/1) ... [2024-11-18 12:59:02,107 INFO L138 Inliner]: procedures = 19, calls = 29, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 69 [2024-11-18 12:59:02,108 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 12:59:02,110 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 12:59:02,110 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 12:59:02,110 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 12:59:02,119 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:59:02" (1/1) ... [2024-11-18 12:59:02,120 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:59:02" (1/1) ... [2024-11-18 12:59:02,122 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:59:02" (1/1) ... [2024-11-18 12:59:02,148 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 6, 6, 0]. 43 percent of accesses are in the largest equivalence class. The 6 initializations are split as follows [2, 2, 2, 0]. The 5 writes are split as follows [0, 2, 3, 0]. [2024-11-18 12:59:02,148 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:59:02" (1/1) ... [2024-11-18 12:59:02,149 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:59:02" (1/1) ... [2024-11-18 12:59:02,154 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:59:02" (1/1) ... [2024-11-18 12:59:02,162 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:59:02" (1/1) ... [2024-11-18 12:59:02,163 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:59:02" (1/1) ... [2024-11-18 12:59:02,168 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:59:02" (1/1) ... [2024-11-18 12:59:02,170 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 12:59:02,171 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 12:59:02,171 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 12:59:02,172 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 12:59:02,172 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:59:02" (1/1) ... [2024-11-18 12:59:02,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 12:59:02,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 12:59:02,212 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-18 12:59:02,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-18 12:59:02,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-18 12:59:02,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-18 12:59:02,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-18 12:59:02,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-18 12:59:02,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-18 12:59:02,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-18 12:59:02,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-18 12:59:02,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-11-18 12:59:02,269 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 12:59:02,270 INFO L130 BoogieDeclarations]: Found specification of procedure f [2024-11-18 12:59:02,270 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2024-11-18 12:59:02,270 INFO L130 BoogieDeclarations]: Found specification of procedure g [2024-11-18 12:59:02,270 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2024-11-18 12:59:02,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 12:59:02,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-18 12:59:02,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-18 12:59:02,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-18 12:59:02,271 INFO L130 BoogieDeclarations]: Found specification of procedure fake_malloc [2024-11-18 12:59:02,271 INFO L138 BoogieDeclarations]: Found implementation of procedure fake_malloc [2024-11-18 12:59:02,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-18 12:59:02,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-18 12:59:02,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-18 12:59:02,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-18 12:59:02,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-18 12:59:02,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-18 12:59:02,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-18 12:59:02,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-18 12:59:02,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 12:59:02,274 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 12:59:02,275 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-18 12:59:02,275 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-18 12:59:02,275 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-18 12:59:02,275 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-18 12:59:02,397 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 12:59:02,399 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 12:59:02,618 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-11-18 12:59:02,619 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 12:59:02,633 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 12:59:02,635 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-18 12:59:02,636 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:59:02 BoogieIcfgContainer [2024-11-18 12:59:02,636 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 12:59:02,638 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 12:59:02,638 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 12:59:02,641 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 12:59:02,641 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 12:59:01" (1/3) ... [2024-11-18 12:59:02,642 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@331b068f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 12:59:02, skipping insertion in model container [2024-11-18 12:59:02,642 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:59:02" (2/3) ... [2024-11-18 12:59:02,643 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@331b068f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 12:59:02, skipping insertion in model container [2024-11-18 12:59:02,643 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:59:02" (3/3) ... [2024-11-18 12:59:02,644 INFO L112 eAbstractionObserver]: Analyzing ICFG ex3_forlist.i [2024-11-18 12:59:02,660 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 12:59:02,660 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 12:59:02,729 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 12:59:02,736 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;@44a1a3f3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 12:59:02,736 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 12:59:02,741 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 28 states have internal predecessors, (38), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-18 12:59:02,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-18 12:59:02,749 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 12:59:02,749 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-18 12:59:02,750 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 12:59:02,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 12:59:02,755 INFO L85 PathProgramCache]: Analyzing trace with hash -431383929, now seen corresponding path program 1 times [2024-11-18 12:59:02,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 12:59:02,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538603269] [2024-11-18 12:59:02,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 12:59:02,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 12:59:02,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 12:59:02,970 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-18 12:59:02,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 12:59:02,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538603269] [2024-11-18 12:59:02,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538603269] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 12:59:02,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 12:59:02,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 12:59:02,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811455080] [2024-11-18 12:59:02,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 12:59:02,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 12:59:02,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 12:59:03,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 12:59:03,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 12:59:03,051 INFO L87 Difference]: Start difference. First operand has 38 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 28 states have internal predecessors, (38), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-18 12:59:03,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 12:59:03,068 INFO L93 Difference]: Finished difference Result 71 states and 97 transitions. [2024-11-18 12:59:03,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 12:59:03,070 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 31 [2024-11-18 12:59:03,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 12:59:03,078 INFO L225 Difference]: With dead ends: 71 [2024-11-18 12:59:03,079 INFO L226 Difference]: Without dead ends: 33 [2024-11-18 12:59:03,083 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 12:59:03,087 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 12:59:03,089 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 12:59:03,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-18 12:59:03,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-18 12:59:03,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-18 12:59:03,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2024-11-18 12:59:03,133 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 31 [2024-11-18 12:59:03,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 12:59:03,134 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2024-11-18 12:59:03,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-18 12:59:03,134 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2024-11-18 12:59:03,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-18 12:59:03,136 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 12:59:03,137 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-18 12:59:03,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-18 12:59:03,137 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 12:59:03,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 12:59:03,138 INFO L85 PathProgramCache]: Analyzing trace with hash -621686623, now seen corresponding path program 1 times [2024-11-18 12:59:03,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 12:59:03,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661479747] [2024-11-18 12:59:03,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 12:59:03,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 12:59:03,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 12:59:03,259 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-18 12:59:03,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 12:59:03,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661479747] [2024-11-18 12:59:03,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661479747] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 12:59:03,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 12:59:03,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 12:59:03,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733228731] [2024-11-18 12:59:03,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 12:59:03,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 12:59:03,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 12:59:03,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 12:59:03,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 12:59:03,266 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-18 12:59:03,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 12:59:03,291 INFO L93 Difference]: Finished difference Result 64 states and 78 transitions. [2024-11-18 12:59:03,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 12:59:03,291 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 31 [2024-11-18 12:59:03,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 12:59:03,293 INFO L225 Difference]: With dead ends: 64 [2024-11-18 12:59:03,293 INFO L226 Difference]: Without dead ends: 35 [2024-11-18 12:59:03,294 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 12:59:03,295 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 1 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 12:59:03,296 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 73 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 12:59:03,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-18 12:59:03,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2024-11-18 12:59:03,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 24 states have (on average 1.25) internal successors, (30), 25 states have internal predecessors, (30), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-18 12:59:03,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2024-11-18 12:59:03,307 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 31 [2024-11-18 12:59:03,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 12:59:03,307 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2024-11-18 12:59:03,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-18 12:59:03,307 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2024-11-18 12:59:03,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-18 12:59:03,308 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 12:59:03,308 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-18 12:59:03,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 12:59:03,309 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 12:59:03,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 12:59:03,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1110999905, now seen corresponding path program 1 times [2024-11-18 12:59:03,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 12:59:03,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551022932] [2024-11-18 12:59:03,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 12:59:03,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 12:59:03,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 12:59:03,469 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-18 12:59:03,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 12:59:03,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551022932] [2024-11-18 12:59:03,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551022932] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 12:59:03,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1050884944] [2024-11-18 12:59:03,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 12:59:03,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 12:59:03,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 12:59:03,473 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 12:59:03,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-18 12:59:03,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 12:59:03,600 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-18 12:59:03,608 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 12:59:03,644 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-18 12:59:03,645 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 12:59:03,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1050884944] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 12:59:03,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 12:59:03,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-11-18 12:59:03,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65054935] [2024-11-18 12:59:03,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 12:59:03,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 12:59:03,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 12:59:03,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 12:59:03,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-18 12:59:03,647 INFO L87 Difference]: Start difference. First operand 34 states and 41 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, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-18 12:59:03,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 12:59:03,670 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2024-11-18 12:59:03,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 12:59:03,671 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, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 33 [2024-11-18 12:59:03,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 12:59:03,672 INFO L225 Difference]: With dead ends: 56 [2024-11-18 12:59:03,672 INFO L226 Difference]: Without dead ends: 37 [2024-11-18 12:59:03,673 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-18 12:59:03,675 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 2 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 12:59:03,676 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 72 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 12:59:03,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-18 12:59:03,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2024-11-18 12:59:03,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 25 states have (on average 1.24) internal successors, (31), 26 states have internal predecessors, (31), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-18 12:59:03,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2024-11-18 12:59:03,684 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 33 [2024-11-18 12:59:03,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 12:59:03,685 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2024-11-18 12:59:03,685 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, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-18 12:59:03,686 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2024-11-18 12:59:03,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-18 12:59:03,686 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 12:59:03,687 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-18 12:59:03,704 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-18 12:59:03,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 12:59:03,888 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 12:59:03,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 12:59:03,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1230450813, now seen corresponding path program 1 times [2024-11-18 12:59:03,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 12:59:03,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436338782] [2024-11-18 12:59:03,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 12:59:03,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 12:59:03,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 12:59:04,011 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-18 12:59:04,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 12:59:04,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436338782] [2024-11-18 12:59:04,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436338782] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 12:59:04,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1814006132] [2024-11-18 12:59:04,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 12:59:04,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 12:59:04,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 12:59:04,016 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 12:59:04,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-18 12:59:04,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 12:59:04,174 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-18 12:59:04,176 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 12:59:04,214 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-18 12:59:04,215 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 12:59:04,261 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-18 12:59:04,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1814006132] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 12:59:04,262 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 12:59:04,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-11-18 12:59:04,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800049739] [2024-11-18 12:59:04,263 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 12:59:04,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 12:59:04,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 12:59:04,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 12:59:04,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-18 12:59:04,264 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-18 12:59:04,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 12:59:04,295 INFO L93 Difference]: Finished difference Result 67 states and 81 transitions. [2024-11-18 12:59:04,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 12:59:04,296 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 35 [2024-11-18 12:59:04,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 12:59:04,297 INFO L225 Difference]: With dead ends: 67 [2024-11-18 12:59:04,297 INFO L226 Difference]: Without dead ends: 37 [2024-11-18 12:59:04,298 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-18 12:59:04,299 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 1 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 12:59:04,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 143 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 12:59:04,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-18 12:59:04,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-18 12:59:04,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 28 states have internal predecessors, (33), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-18 12:59:04,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2024-11-18 12:59:04,307 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 35 [2024-11-18 12:59:04,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 12:59:04,307 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2024-11-18 12:59:04,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-18 12:59:04,308 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2024-11-18 12:59:04,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-18 12:59:04,308 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 12:59:04,308 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-18 12:59:04,323 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-18 12:59:04,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-18 12:59:04,509 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 12:59:04,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 12:59:04,510 INFO L85 PathProgramCache]: Analyzing trace with hash 828026235, now seen corresponding path program 2 times [2024-11-18 12:59:04,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 12:59:04,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366594070] [2024-11-18 12:59:04,510 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-18 12:59:04,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 12:59:04,561 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-18 12:59:04,561 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 12:59:04,839 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-18 12:59:04,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 12:59:04,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366594070] [2024-11-18 12:59:04,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366594070] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 12:59:04,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 12:59:04,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-18 12:59:04,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261374797] [2024-11-18 12:59:04,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 12:59:04,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-18 12:59:04,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 12:59:04,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-18 12:59:04,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-18 12:59:04,846 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-18 12:59:05,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 12:59:05,054 INFO L93 Difference]: Finished difference Result 77 states and 98 transitions. [2024-11-18 12:59:05,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-18 12:59:05,055 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 37 [2024-11-18 12:59:05,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 12:59:05,060 INFO L225 Difference]: With dead ends: 77 [2024-11-18 12:59:05,061 INFO L226 Difference]: Without dead ends: 66 [2024-11-18 12:59:05,063 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-18 12:59:05,063 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 72 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 12:59:05,064 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 162 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 12:59:05,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-18 12:59:05,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 57. [2024-11-18 12:59:05,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 43 states have internal predecessors, (54), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (10), 8 states have call predecessors, (10), 7 states have call successors, (10) [2024-11-18 12:59:05,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 73 transitions. [2024-11-18 12:59:05,081 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 73 transitions. Word has length 37 [2024-11-18 12:59:05,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 12:59:05,082 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 73 transitions. [2024-11-18 12:59:05,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-18 12:59:05,082 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 73 transitions. [2024-11-18 12:59:05,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-18 12:59:05,083 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 12:59:05,084 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-18 12:59:05,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-18 12:59:05,084 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 12:59:05,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 12:59:05,085 INFO L85 PathProgramCache]: Analyzing trace with hash 2143087823, now seen corresponding path program 1 times [2024-11-18 12:59:05,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 12:59:05,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536972876] [2024-11-18 12:59:05,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 12:59:05,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 12:59:05,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 12:59:05,725 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-18 12:59:05,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 12:59:05,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536972876] [2024-11-18 12:59:05,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536972876] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 12:59:05,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509103089] [2024-11-18 12:59:05,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 12:59:05,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 12:59:05,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 12:59:05,729 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 12:59:05,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-18 12:59:05,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 12:59:05,872 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-18 12:59:05,875 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 12:59:06,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-18 12:59:06,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-18 12:59:06,366 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-18 12:59:06,367 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 12:59:06,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2024-11-18 12:59:06,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2024-11-18 12:59:06,895 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-18 12:59:06,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [509103089] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 12:59:06,896 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 12:59:06,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 37 [2024-11-18 12:59:06,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261340239] [2024-11-18 12:59:06,897 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 12:59:06,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-11-18 12:59:06,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 12:59:06,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-18 12:59:06,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1190, Unknown=0, NotChecked=0, Total=1332 [2024-11-18 12:59:06,901 INFO L87 Difference]: Start difference. First operand 57 states and 73 transitions. Second operand has 37 states, 34 states have (on average 1.911764705882353) internal successors, (65), 26 states have internal predecessors, (65), 9 states have call successors, (11), 9 states have call predecessors, (11), 11 states have return successors, (11), 8 states have call predecessors, (11), 8 states have call successors, (11) [2024-11-18 12:59:07,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 12:59:07,723 INFO L93 Difference]: Finished difference Result 113 states and 140 transitions. [2024-11-18 12:59:07,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-18 12:59:07,724 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 34 states have (on average 1.911764705882353) internal successors, (65), 26 states have internal predecessors, (65), 9 states have call successors, (11), 9 states have call predecessors, (11), 11 states have return successors, (11), 8 states have call predecessors, (11), 8 states have call successors, (11) Word has length 40 [2024-11-18 12:59:07,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 12:59:07,725 INFO L225 Difference]: With dead ends: 113 [2024-11-18 12:59:07,725 INFO L226 Difference]: Without dead ends: 89 [2024-11-18 12:59:07,726 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 548 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=364, Invalid=2186, Unknown=0, NotChecked=0, Total=2550 [2024-11-18 12:59:07,727 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 258 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-18 12:59:07,727 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 108 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-18 12:59:07,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-18 12:59:07,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 82. [2024-11-18 12:59:07,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 60 states have (on average 1.3) internal successors, (78), 63 states have internal predecessors, (78), 12 states have call successors, (12), 7 states have call predecessors, (12), 9 states have return successors, (13), 11 states have call predecessors, (13), 8 states have call successors, (13) [2024-11-18 12:59:07,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 103 transitions. [2024-11-18 12:59:07,742 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 103 transitions. Word has length 40 [2024-11-18 12:59:07,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 12:59:07,743 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 103 transitions. [2024-11-18 12:59:07,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 34 states have (on average 1.911764705882353) internal successors, (65), 26 states have internal predecessors, (65), 9 states have call successors, (11), 9 states have call predecessors, (11), 11 states have return successors, (11), 8 states have call predecessors, (11), 8 states have call successors, (11) [2024-11-18 12:59:07,744 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 103 transitions. [2024-11-18 12:59:07,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-18 12:59:07,745 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 12:59:07,745 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-18 12:59:07,762 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-18 12:59:07,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 12:59:07,950 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 12:59:07,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 12:59:07,950 INFO L85 PathProgramCache]: Analyzing trace with hash -309149075, now seen corresponding path program 1 times [2024-11-18 12:59:07,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 12:59:07,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081472661] [2024-11-18 12:59:07,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 12:59:07,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 12:59:07,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 12:59:08,025 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-18 12:59:08,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 12:59:08,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081472661] [2024-11-18 12:59:08,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081472661] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 12:59:08,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1390046658] [2024-11-18 12:59:08,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 12:59:08,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 12:59:08,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 12:59:08,028 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 12:59:08,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-18 12:59:08,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 12:59:08,140 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-18 12:59:08,142 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 12:59:08,164 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-18 12:59:08,165 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 12:59:08,195 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-18 12:59:08,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1390046658] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 12:59:08,197 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 12:59:08,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-11-18 12:59:08,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903821169] [2024-11-18 12:59:08,197 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 12:59:08,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 12:59:08,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 12:59:08,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 12:59:08,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-18 12:59:08,199 INFO L87 Difference]: Start difference. First operand 82 states and 103 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-18 12:59:08,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 12:59:08,225 INFO L93 Difference]: Finished difference Result 142 states and 182 transitions. [2024-11-18 12:59:08,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 12:59:08,228 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 41 [2024-11-18 12:59:08,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 12:59:08,229 INFO L225 Difference]: With dead ends: 142 [2024-11-18 12:59:08,229 INFO L226 Difference]: Without dead ends: 86 [2024-11-18 12:59:08,230 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 79 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-18 12:59:08,231 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 2 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 12:59:08,231 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 106 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 12:59:08,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-18 12:59:08,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-18 12:59:08,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 64 states have (on average 1.28125) internal successors, (82), 67 states have internal predecessors, (82), 12 states have call successors, (12), 7 states have call predecessors, (12), 9 states have return successors, (13), 11 states have call predecessors, (13), 8 states have call successors, (13) [2024-11-18 12:59:08,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 107 transitions. [2024-11-18 12:59:08,246 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 107 transitions. Word has length 41 [2024-11-18 12:59:08,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 12:59:08,246 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 107 transitions. [2024-11-18 12:59:08,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-18 12:59:08,247 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 107 transitions. [2024-11-18 12:59:08,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-18 12:59:08,248 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 12:59:08,248 INFO L215 NwaCegarLoop]: trace histogram [3, 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] [2024-11-18 12:59:08,268 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-18 12:59:08,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 12:59:08,449 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 12:59:08,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 12:59:08,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1965354537, now seen corresponding path program 1 times [2024-11-18 12:59:08,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 12:59:08,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142242564] [2024-11-18 12:59:08,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 12:59:08,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 12:59:08,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 12:59:09,701 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-18 12:59:09,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 12:59:09,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142242564] [2024-11-18 12:59:09,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142242564] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 12:59:09,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366449727] [2024-11-18 12:59:09,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 12:59:09,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 12:59:09,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 12:59:09,706 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 12:59:09,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-18 12:59:09,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 12:59:09,827 INFO L255 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-11-18 12:59:09,830 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 12:59:10,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-18 12:59:10,433 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-18 12:59:10,434 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 12:59:10,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2024-11-18 12:59:10,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2024-11-18 12:59:10,980 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-18 12:59:10,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [366449727] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 12:59:10,981 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 12:59:10,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 17, 17] total 53 [2024-11-18 12:59:10,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352811317] [2024-11-18 12:59:10,981 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 12:59:10,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2024-11-18 12:59:10,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 12:59:10,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2024-11-18 12:59:10,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=2591, Unknown=0, NotChecked=0, Total=2756 [2024-11-18 12:59:10,984 INFO L87 Difference]: Start difference. First operand 86 states and 107 transitions. Second operand has 53 states, 46 states have (on average 1.826086956521739) internal successors, (84), 36 states have internal predecessors, (84), 12 states have call successors, (15), 9 states have call predecessors, (15), 11 states have return successors, (12), 12 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-18 12:59:13,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 12:59:13,495 INFO L93 Difference]: Finished difference Result 198 states and 247 transitions. [2024-11-18 12:59:13,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-11-18 12:59:13,496 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 46 states have (on average 1.826086956521739) internal successors, (84), 36 states have internal predecessors, (84), 12 states have call successors, (15), 9 states have call predecessors, (15), 11 states have return successors, (12), 12 states have call predecessors, (12), 9 states have call successors, (12) Word has length 43 [2024-11-18 12:59:13,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 12:59:13,498 INFO L225 Difference]: With dead ends: 198 [2024-11-18 12:59:13,499 INFO L226 Difference]: Without dead ends: 156 [2024-11-18 12:59:13,505 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1546 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=619, Invalid=6353, Unknown=0, NotChecked=0, Total=6972 [2024-11-18 12:59:13,506 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 236 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 2381 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 2455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 2381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-18 12:59:13,507 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 199 Invalid, 2455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 2381 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-18 12:59:13,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-18 12:59:13,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 136. [2024-11-18 12:59:13,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 108 states have (on average 1.287037037037037) internal successors, (139), 113 states have internal predecessors, (139), 13 states have call successors, (13), 10 states have call predecessors, (13), 14 states have return successors, (18), 12 states have call predecessors, (18), 10 states have call successors, (18) [2024-11-18 12:59:13,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 170 transitions. [2024-11-18 12:59:13,544 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 170 transitions. Word has length 43 [2024-11-18 12:59:13,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 12:59:13,545 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 170 transitions. [2024-11-18 12:59:13,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 46 states have (on average 1.826086956521739) internal successors, (84), 36 states have internal predecessors, (84), 12 states have call successors, (15), 9 states have call predecessors, (15), 11 states have return successors, (12), 12 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-18 12:59:13,545 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 170 transitions. [2024-11-18 12:59:13,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-18 12:59:13,546 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 12:59:13,546 INFO L215 NwaCegarLoop]: trace histogram [3, 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] [2024-11-18 12:59:13,570 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-18 12:59:13,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 12:59:13,747 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 12:59:13,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 12:59:13,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1392073365, now seen corresponding path program 2 times [2024-11-18 12:59:13,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 12:59:13,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308850452] [2024-11-18 12:59:13,748 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-18 12:59:13,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 12:59:13,786 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-18 12:59:13,786 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 12:59:14,413 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-18 12:59:14,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 12:59:14,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308850452] [2024-11-18 12:59:14,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308850452] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 12:59:14,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1421533283] [2024-11-18 12:59:14,414 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-18 12:59:14,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 12:59:14,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 12:59:14,416 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 12:59:14,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-18 12:59:14,537 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-18 12:59:14,537 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 12:59:14,543 INFO L255 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-18 12:59:14,549 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 12:59:14,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-18 12:59:14,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-18 12:59:14,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 12:59:14,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-18 12:59:14,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 12:59:14,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-18 12:59:14,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-18 12:59:14,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-18 12:59:14,928 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-18 12:59:14,928 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 12:59:15,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2024-11-18 12:59:15,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 38 [2024-11-18 12:59:15,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2024-11-18 12:59:15,448 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-18 12:59:15,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1421533283] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 12:59:15,449 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 12:59:15,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 10] total 32 [2024-11-18 12:59:15,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341354535] [2024-11-18 12:59:15,449 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 12:59:15,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-18 12:59:15,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 12:59:15,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-18 12:59:15,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=877, Unknown=0, NotChecked=0, Total=992 [2024-11-18 12:59:15,451 INFO L87 Difference]: Start difference. First operand 136 states and 170 transitions. Second operand has 32 states, 32 states have (on average 2.5625) internal successors, (82), 28 states have internal predecessors, (82), 5 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2024-11-18 12:59:16,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 12:59:16,632 INFO L93 Difference]: Finished difference Result 225 states and 282 transitions. [2024-11-18 12:59:16,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-18 12:59:16,632 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.5625) internal successors, (82), 28 states have internal predecessors, (82), 5 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) Word has length 43 [2024-11-18 12:59:16,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 12:59:16,633 INFO L225 Difference]: With dead ends: 225 [2024-11-18 12:59:16,633 INFO L226 Difference]: Without dead ends: 156 [2024-11-18 12:59:16,635 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 677 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=463, Invalid=2617, Unknown=0, NotChecked=0, Total=3080 [2024-11-18 12:59:16,635 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 217 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 662 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-18 12:59:16,636 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 175 Invalid, 715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 662 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-18 12:59:16,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-18 12:59:16,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 124. [2024-11-18 12:59:16,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 101 states have (on average 1.297029702970297) internal successors, (131), 104 states have internal predecessors, (131), 11 states have call successors, (11), 9 states have call predecessors, (11), 11 states have return successors, (12), 10 states have call predecessors, (12), 7 states have call successors, (12) [2024-11-18 12:59:16,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 154 transitions. [2024-11-18 12:59:16,655 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 154 transitions. Word has length 43 [2024-11-18 12:59:16,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 12:59:16,655 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 154 transitions. [2024-11-18 12:59:16,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.5625) internal successors, (82), 28 states have internal predecessors, (82), 5 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2024-11-18 12:59:16,655 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 154 transitions. [2024-11-18 12:59:16,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-18 12:59:16,656 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 12:59:16,656 INFO L215 NwaCegarLoop]: trace histogram [3, 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] [2024-11-18 12:59:16,675 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-18 12:59:16,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 12:59:16,858 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 12:59:16,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 12:59:16,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1285134251, now seen corresponding path program 1 times [2024-11-18 12:59:16,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 12:59:16,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076560415] [2024-11-18 12:59:16,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 12:59:16,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 12:59:16,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 12:59:17,740 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-18 12:59:17,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 12:59:17,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076560415] [2024-11-18 12:59:17,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076560415] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 12:59:17,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1846171983] [2024-11-18 12:59:17,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 12:59:17,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 12:59:17,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 12:59:17,742 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 12:59:17,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-18 12:59:17,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 12:59:17,862 INFO L255 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-18 12:59:17,866 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 12:59:17,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-18 12:59:18,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-18 12:59:18,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 12:59:18,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-18 12:59:18,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-18 12:59:18,635 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-18 12:59:18,635 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 12:59:19,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2024-11-18 12:59:19,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2024-11-18 12:59:19,257 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-18 12:59:19,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1846171983] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 12:59:19,257 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 12:59:19,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 16] total 50 [2024-11-18 12:59:19,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662027771] [2024-11-18 12:59:19,258 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 12:59:19,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-18 12:59:19,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 12:59:19,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-18 12:59:19,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=2242, Unknown=19, NotChecked=0, Total=2450 [2024-11-18 12:59:19,260 INFO L87 Difference]: Start difference. First operand 124 states and 154 transitions. Second operand has 50 states, 50 states have (on average 2.04) internal successors, (102), 42 states have internal predecessors, (102), 7 states have call successors, (15), 10 states have call predecessors, (15), 10 states have return successors, (12), 8 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-18 12:59:20,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 12:59:20,583 INFO L93 Difference]: Finished difference Result 159 states and 196 transitions. [2024-11-18 12:59:20,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-18 12:59:20,583 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.04) internal successors, (102), 42 states have internal predecessors, (102), 7 states have call successors, (15), 10 states have call predecessors, (15), 10 states have return successors, (12), 8 states have call predecessors, (12), 6 states have call successors, (12) Word has length 47 [2024-11-18 12:59:20,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 12:59:20,584 INFO L225 Difference]: With dead ends: 159 [2024-11-18 12:59:20,584 INFO L226 Difference]: Without dead ends: 83 [2024-11-18 12:59:20,586 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1296 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=472, Invalid=4201, Unknown=19, NotChecked=0, Total=4692 [2024-11-18 12:59:20,586 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 78 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 1008 mSolverCounterSat, 42 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 1062 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1008 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-18 12:59:20,586 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 104 Invalid, 1062 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1008 Invalid, 12 Unknown, 0 Unchecked, 0.6s Time] [2024-11-18 12:59:20,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-18 12:59:20,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 74. [2024-11-18 12:59:20,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 60 states have (on average 1.1833333333333333) internal successors, (71), 60 states have internal predecessors, (71), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-18 12:59:20,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 84 transitions. [2024-11-18 12:59:20,602 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 84 transitions. Word has length 47 [2024-11-18 12:59:20,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 12:59:20,603 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 84 transitions. [2024-11-18 12:59:20,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.04) internal successors, (102), 42 states have internal predecessors, (102), 7 states have call successors, (15), 10 states have call predecessors, (15), 10 states have return successors, (12), 8 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-18 12:59:20,603 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 84 transitions. [2024-11-18 12:59:20,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-18 12:59:20,604 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 12:59:20,604 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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] [2024-11-18 12:59:20,622 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-18 12:59:20,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 12:59:20,809 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 12:59:20,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 12:59:20,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1844444388, now seen corresponding path program 1 times [2024-11-18 12:59:20,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 12:59:20,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888435273] [2024-11-18 12:59:20,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 12:59:20,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 12:59:20,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 12:59:20,895 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-18 12:59:20,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 12:59:20,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888435273] [2024-11-18 12:59:20,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888435273] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 12:59:20,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181278679] [2024-11-18 12:59:20,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 12:59:20,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 12:59:20,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 12:59:20,898 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 12:59:20,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-18 12:59:21,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 12:59:21,037 INFO L255 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-18 12:59:21,039 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 12:59:21,060 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-18 12:59:21,060 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 12:59:21,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1181278679] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 12:59:21,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 12:59:21,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2024-11-18 12:59:21,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309116233] [2024-11-18 12:59:21,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 12:59:21,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 12:59:21,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 12:59:21,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 12:59:21,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-18 12:59:21,063 INFO L87 Difference]: Start difference. First operand 74 states and 84 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-18 12:59:21,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 12:59:21,102 INFO L93 Difference]: Finished difference Result 93 states and 106 transitions. [2024-11-18 12:59:21,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 12:59:21,102 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 48 [2024-11-18 12:59:21,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 12:59:21,103 INFO L225 Difference]: With dead ends: 93 [2024-11-18 12:59:21,103 INFO L226 Difference]: Without dead ends: 54 [2024-11-18 12:59:21,104 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-18 12:59:21,104 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 6 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 12:59:21,104 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 73 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 12:59:21,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-18 12:59:21,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-11-18 12:59:21,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-18 12:59:21,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2024-11-18 12:59:21,115 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 48 [2024-11-18 12:59:21,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 12:59:21,116 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2024-11-18 12:59:21,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-18 12:59:21,116 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2024-11-18 12:59:21,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-18 12:59:21,116 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 12:59:21,117 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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-11-18 12:59:21,136 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-18 12:59:21,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-18 12:59:21,318 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 12:59:21,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 12:59:21,320 INFO L85 PathProgramCache]: Analyzing trace with hash 278730410, now seen corresponding path program 1 times [2024-11-18 12:59:21,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 12:59:21,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885772528] [2024-11-18 12:59:21,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 12:59:21,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 12:59:21,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 12:59:22,080 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-18 12:59:22,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 12:59:22,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885772528] [2024-11-18 12:59:22,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885772528] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 12:59:22,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1644545721] [2024-11-18 12:59:22,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 12:59:22,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 12:59:22,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 12:59:22,083 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 12:59:22,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-18 12:59:22,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 12:59:22,222 INFO L255 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-18 12:59:22,224 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 12:59:22,754 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-18 12:59:22,754 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 12:59:22,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-18 12:59:23,003 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 12:59:23,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 16 [2024-11-18 12:59:23,223 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-18 12:59:23,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1644545721] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 12:59:23,223 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 12:59:23,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16, 16] total 47 [2024-11-18 12:59:23,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072160138] [2024-11-18 12:59:23,224 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 12:59:23,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-11-18 12:59:23,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 12:59:23,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-11-18 12:59:23,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1998, Unknown=0, NotChecked=0, Total=2162 [2024-11-18 12:59:23,226 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand has 47 states, 41 states have (on average 2.073170731707317) internal successors, (85), 32 states have internal predecessors, (85), 11 states have call successors, (18), 8 states have call predecessors, (18), 10 states have return successors, (15), 12 states have call predecessors, (15), 8 states have call successors, (15) [2024-11-18 12:59:23,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 12:59:23,993 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2024-11-18 12:59:23,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-18 12:59:23,994 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 41 states have (on average 2.073170731707317) internal successors, (85), 32 states have internal predecessors, (85), 11 states have call successors, (18), 8 states have call predecessors, (18), 10 states have return successors, (15), 12 states have call predecessors, (15), 8 states have call successors, (15) Word has length 53 [2024-11-18 12:59:23,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 12:59:23,995 INFO L225 Difference]: With dead ends: 54 [2024-11-18 12:59:23,995 INFO L226 Difference]: Without dead ends: 0 [2024-11-18 12:59:23,996 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 763 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=330, Invalid=3092, Unknown=0, NotChecked=0, Total=3422 [2024-11-18 12:59:23,996 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 57 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 923 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 923 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-18 12:59:23,997 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 177 Invalid, 945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 923 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-18 12:59:23,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-18 12:59:23,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-18 12:59:23,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 12:59:23,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-18 12:59:23,998 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 53 [2024-11-18 12:59:23,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 12:59:23,998 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-18 12:59:23,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 41 states have (on average 2.073170731707317) internal successors, (85), 32 states have internal predecessors, (85), 11 states have call successors, (18), 8 states have call predecessors, (18), 10 states have return successors, (15), 12 states have call predecessors, (15), 8 states have call successors, (15) [2024-11-18 12:59:23,999 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-18 12:59:23,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-18 12:59:24,002 INFO L782 garLoopResultBuilder]: Registering result SAFE for location gErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-18 12:59:24,019 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-18 12:59:24,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 12:59:24,209 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 12:59:24,212 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-18 12:59:25,852 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-18 12:59:25,860 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalArgumentException: unknown symbol (@diff (Array Int Int) (Array Int Int) Int) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.getBinaryOperator(Term2Expression.java:587) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:280) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translateStore(Term2Expression.java:355) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:173) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:173) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:173) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:173) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:401) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.lib.translation.DefaultTranslator.translateExpressionWithContext(DefaultTranslator.java:166) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionWithContext(ModelTranslationContainer.java:102) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionWithContextToString(ModelTranslationContainer.java:92) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.BacktranslationService.translateExpressionWithContextToString(BacktranslationService.java:105) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.(InvariantResult.java:57) at de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.FloydHoareUtils.createInvariantResults(FloydHoareUtils.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-18 12:59:25,863 INFO L158 Benchmark]: Toolchain (without parser) took 24061.53ms. Allocated memory was 140.5MB in the beginning and 308.3MB in the end (delta: 167.8MB). Free memory was 85.6MB in the beginning and 108.1MB in the end (delta: -22.5MB). Peak memory consumption was 149.6MB. Max. memory is 16.1GB. [2024-11-18 12:59:25,864 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 140.5MB. Free memory is still 110.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 12:59:25,864 INFO L158 Benchmark]: CACSL2BoogieTranslator took 268.41ms. Allocated memory is still 140.5MB. Free memory was 85.6MB in the beginning and 72.9MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-18 12:59:25,864 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.23ms. Allocated memory is still 140.5MB. Free memory was 72.9MB in the beginning and 71.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 12:59:25,864 INFO L158 Benchmark]: Boogie Preprocessor took 61.01ms. Allocated memory is still 140.5MB. Free memory was 71.5MB in the beginning and 68.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 12:59:25,864 INFO L158 Benchmark]: RCFGBuilder took 464.59ms. Allocated memory is still 140.5MB. Free memory was 68.8MB in the beginning and 52.7MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-18 12:59:25,865 INFO L158 Benchmark]: TraceAbstraction took 23225.00ms. Allocated memory was 140.5MB in the beginning and 308.3MB in the end (delta: 167.8MB). Free memory was 52.1MB in the beginning and 108.1MB in the end (delta: -56.0MB). Peak memory consumption was 116.1MB. Max. memory is 16.1GB. [2024-11-18 12:59:25,866 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.18ms. Allocated memory is still 140.5MB. Free memory is still 110.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 268.41ms. Allocated memory is still 140.5MB. Free memory was 85.6MB in the beginning and 72.9MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.23ms. Allocated memory is still 140.5MB. Free memory was 72.9MB in the beginning and 71.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.01ms. Allocated memory is still 140.5MB. Free memory was 71.5MB in the beginning and 68.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 464.59ms. Allocated memory is still 140.5MB. Free memory was 68.8MB in the beginning and 52.7MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 23225.00ms. Allocated memory was 140.5MB in the beginning and 308.3MB in the end (delta: 167.8MB). Free memory was 52.1MB in the beginning and 108.1MB in the end (delta: -56.0MB). Peak memory consumption was 116.1MB. Max. memory is 16.1GB. * 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 - PositiveResult [Line: 8]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 38 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 21.5s, OverallIterations: 12, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 7.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 12 mSolverCounterUnknown, 934 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 930 mSDsluCounter, 1437 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1106 mSDsCounter, 295 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5790 IncrementalHoareTripleChecker+Invalid, 6097 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 295 mSolverCounterUnsat, 331 mSDtfsCounter, 5790 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 912 GetRequests, 572 SyntacticMatches, 8 SemanticMatches, 332 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4841 ImplicationChecksByTransitivity, 7.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=136occurred in iteration=8, InterpolantAutomatonStates: 149, 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, 12 MinimizatonAttempts, 80 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 10.5s InterpolantComputationTime, 865 NumberOfCodeBlocks, 850 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1139 ConstructedInterpolants, 6 QuantifiedInterpolants, 6773 SizeOfPredicates, 45 NumberOfNonLiveVariables, 2690 ConjunctsInSsa, 209 ConjunctsInUnsatCore, 28 InterpolantComputations, 5 PerfectInterpolantSequences, 305/474 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ExceptionOrErrorResult: IllegalArgumentException: unknown symbol (@diff (Array Int Int) (Array Int Int) Int) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: unknown symbol (@diff (Array Int Int) (Array Int Int) Int): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.getBinaryOperator(Term2Expression.java:587) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-11-18 12:59:25,907 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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-regression/ex3_forlist.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 ddbd4e73adf4663f87721f5aa250c32f7b058621a618ab1d03544a940de1ce0e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 12:59:28,151 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 12:59:28,227 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-18 12:59:28,232 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 12:59:28,233 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 12:59:28,264 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 12:59:28,265 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 12:59:28,265 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 12:59:28,265 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 12:59:28,266 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 12:59:28,266 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 12:59:28,266 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 12:59:28,267 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 12:59:28,267 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 12:59:28,268 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 12:59:28,268 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 12:59:28,268 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 12:59:28,269 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 12:59:28,269 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 12:59:28,269 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 12:59:28,269 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 12:59:28,271 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 12:59:28,271 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 12:59:28,271 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-18 12:59:28,272 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-18 12:59:28,272 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 12:59:28,272 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-18 12:59:28,272 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 12:59:28,273 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 12:59:28,273 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 12:59:28,273 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 12:59:28,274 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 12:59:28,274 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 12:59:28,278 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 12:59:28,278 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 12:59:28,279 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 12:59:28,279 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 12:59:28,280 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 12:59:28,280 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-18 12:59:28,280 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-18 12:59:28,280 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 12:59:28,281 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 12:59:28,281 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 12:59:28,282 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 12:59:28,282 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 -> ddbd4e73adf4663f87721f5aa250c32f7b058621a618ab1d03544a940de1ce0e [2024-11-18 12:59:28,607 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 12:59:28,632 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 12:59:28,635 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 12:59:28,637 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 12:59:28,637 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 12:59:28,638 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-regression/ex3_forlist.i [2024-11-18 12:59:30,146 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 12:59:30,354 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 12:59:30,354 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/ex3_forlist.i [2024-11-18 12:59:30,360 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b60bf4aaa/a85dfe03428247adae670d5db930f9e8/FLAG6dd6ba4f7 [2024-11-18 12:59:30,719 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b60bf4aaa/a85dfe03428247adae670d5db930f9e8 [2024-11-18 12:59:30,721 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 12:59:30,722 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 12:59:30,723 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 12:59:30,723 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 12:59:30,728 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 12:59:30,729 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 12:59:30" (1/1) ... [2024-11-18 12:59:30,730 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f57934 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:59:30, skipping insertion in model container [2024-11-18 12:59:30,730 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 12:59:30" (1/1) ... [2024-11-18 12:59:30,751 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 12:59:30,909 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/ex3_forlist.i[293,306] [2024-11-18 12:59:30,942 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 12:59:30,956 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 12:59:30,967 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/ex3_forlist.i[293,306] [2024-11-18 12:59:30,983 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 12:59:31,006 INFO L204 MainTranslator]: Completed translation [2024-11-18 12:59:31,006 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:59:31 WrapperNode [2024-11-18 12:59:31,006 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 12:59:31,007 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 12:59:31,007 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 12:59:31,007 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 12:59:31,013 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:59:31" (1/1) ... [2024-11-18 12:59:31,027 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:59:31" (1/1) ... [2024-11-18 12:59:31,050 INFO L138 Inliner]: procedures = 22, calls = 29, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 69 [2024-11-18 12:59:31,050 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 12:59:31,052 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 12:59:31,052 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 12:59:31,052 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 12:59:31,062 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:59:31" (1/1) ... [2024-11-18 12:59:31,062 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:59:31" (1/1) ... [2024-11-18 12:59:31,066 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:59:31" (1/1) ... [2024-11-18 12:59:31,090 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 6, 0, 6]. 43 percent of accesses are in the largest equivalence class. The 6 initializations are split as follows [2, 2, 0, 2]. The 5 writes are split as follows [0, 2, 0, 3]. [2024-11-18 12:59:31,091 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:59:31" (1/1) ... [2024-11-18 12:59:31,091 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:59:31" (1/1) ... [2024-11-18 12:59:31,105 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:59:31" (1/1) ... [2024-11-18 12:59:31,112 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:59:31" (1/1) ... [2024-11-18 12:59:31,113 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:59:31" (1/1) ... [2024-11-18 12:59:31,119 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:59:31" (1/1) ... [2024-11-18 12:59:31,122 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 12:59:31,127 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 12:59:31,127 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 12:59:31,127 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 12:59:31,128 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:59:31" (1/1) ... [2024-11-18 12:59:31,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 12:59:31,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 12:59:31,173 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-18 12:59:31,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-18 12:59:31,230 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-18 12:59:31,230 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-18 12:59:31,230 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-18 12:59:31,231 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-18 12:59:31,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-18 12:59:31,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-18 12:59:31,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-18 12:59:31,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-11-18 12:59:31,231 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 12:59:31,232 INFO L130 BoogieDeclarations]: Found specification of procedure f [2024-11-18 12:59:31,232 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2024-11-18 12:59:31,232 INFO L130 BoogieDeclarations]: Found specification of procedure g [2024-11-18 12:59:31,232 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2024-11-18 12:59:31,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-18 12:59:31,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-18 12:59:31,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-18 12:59:31,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-18 12:59:31,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-18 12:59:31,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-18 12:59:31,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-18 12:59:31,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-18 12:59:31,234 INFO L130 BoogieDeclarations]: Found specification of procedure fake_malloc [2024-11-18 12:59:31,234 INFO L138 BoogieDeclarations]: Found implementation of procedure fake_malloc [2024-11-18 12:59:31,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-18 12:59:31,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-18 12:59:31,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-18 12:59:31,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-18 12:59:31,234 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-18 12:59:31,234 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-18 12:59:31,235 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-18 12:59:31,235 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-18 12:59:31,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 12:59:31,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 12:59:31,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-18 12:59:31,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-18 12:59:31,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-18 12:59:31,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-18 12:59:31,372 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 12:59:31,375 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 12:59:31,695 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-11-18 12:59:31,695 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 12:59:31,708 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 12:59:31,710 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-18 12:59:31,710 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:59:31 BoogieIcfgContainer [2024-11-18 12:59:31,710 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 12:59:31,713 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 12:59:31,713 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 12:59:31,716 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 12:59:31,716 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 12:59:30" (1/3) ... [2024-11-18 12:59:31,717 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42454e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 12:59:31, skipping insertion in model container [2024-11-18 12:59:31,717 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:59:31" (2/3) ... [2024-11-18 12:59:31,717 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42454e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 12:59:31, skipping insertion in model container [2024-11-18 12:59:31,718 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:59:31" (3/3) ... [2024-11-18 12:59:31,719 INFO L112 eAbstractionObserver]: Analyzing ICFG ex3_forlist.i [2024-11-18 12:59:31,735 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 12:59:31,735 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 12:59:31,807 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 12:59:31,813 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;@72914ef3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 12:59:31,813 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 12:59:31,817 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 28 states have internal predecessors, (38), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-18 12:59:31,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-18 12:59:31,825 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 12:59:31,826 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-18 12:59:31,826 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 12:59:31,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 12:59:31,832 INFO L85 PathProgramCache]: Analyzing trace with hash -431383929, now seen corresponding path program 1 times [2024-11-18 12:59:31,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 12:59:31,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1213359194] [2024-11-18 12:59:31,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 12:59:31,845 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 12:59:31,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 12:59:31,847 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 12:59:31,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-18 12:59:32,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 12:59:32,015 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-18 12:59:32,020 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 12:59:32,043 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-18 12:59:32,043 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 12:59:32,044 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 12:59:32,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1213359194] [2024-11-18 12:59:32,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1213359194] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 12:59:32,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 12:59:32,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 12:59:32,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500372359] [2024-11-18 12:59:32,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 12:59:32,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 12:59:32,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 12:59:32,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 12:59:32,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 12:59:32,074 INFO L87 Difference]: Start difference. First operand has 38 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 28 states have internal predecessors, (38), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-18 12:59:32,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 12:59:32,098 INFO L93 Difference]: Finished difference Result 71 states and 97 transitions. [2024-11-18 12:59:32,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 12:59:32,101 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 31 [2024-11-18 12:59:32,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 12:59:32,108 INFO L225 Difference]: With dead ends: 71 [2024-11-18 12:59:32,108 INFO L226 Difference]: Without dead ends: 33 [2024-11-18 12:59:32,112 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 12:59:32,118 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 12:59:32,119 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 12:59:32,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-18 12:59:32,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-18 12:59:32,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-18 12:59:32,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2024-11-18 12:59:32,160 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 31 [2024-11-18 12:59:32,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 12:59:32,161 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2024-11-18 12:59:32,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-18 12:59:32,162 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2024-11-18 12:59:32,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-18 12:59:32,164 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 12:59:32,164 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-18 12:59:32,170 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-18 12:59:32,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 12:59:32,369 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 12:59:32,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 12:59:32,369 INFO L85 PathProgramCache]: Analyzing trace with hash -621686623, now seen corresponding path program 1 times [2024-11-18 12:59:32,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 12:59:32,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [968661842] [2024-11-18 12:59:32,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 12:59:32,371 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 12:59:32,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 12:59:32,374 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 12:59:32,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-18 12:59:32,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 12:59:32,474 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-18 12:59:32,477 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 12:59:32,501 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-18 12:59:32,502 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 12:59:32,502 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 12:59:32,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [968661842] [2024-11-18 12:59:32,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [968661842] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 12:59:32,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 12:59:32,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 12:59:32,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121607890] [2024-11-18 12:59:32,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 12:59:32,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 12:59:32,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 12:59:32,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 12:59:32,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 12:59:32,505 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-18 12:59:32,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 12:59:32,580 INFO L93 Difference]: Finished difference Result 64 states and 78 transitions. [2024-11-18 12:59:32,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 12:59:32,581 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 31 [2024-11-18 12:59:32,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 12:59:32,583 INFO L225 Difference]: With dead ends: 64 [2024-11-18 12:59:32,583 INFO L226 Difference]: Without dead ends: 35 [2024-11-18 12:59:32,584 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 12:59:32,585 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 1 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 12:59:32,585 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 73 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 12:59:32,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-18 12:59:32,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2024-11-18 12:59:32,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 24 states have (on average 1.25) internal successors, (30), 25 states have internal predecessors, (30), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-18 12:59:32,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2024-11-18 12:59:32,598 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 31 [2024-11-18 12:59:32,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 12:59:32,598 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2024-11-18 12:59:32,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-18 12:59:32,599 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2024-11-18 12:59:32,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-18 12:59:32,600 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 12:59:32,600 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-18 12:59:32,605 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-18 12:59:32,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 12:59:32,803 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 12:59:32,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 12:59:32,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1110999905, now seen corresponding path program 1 times [2024-11-18 12:59:32,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 12:59:32,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [350650655] [2024-11-18 12:59:32,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 12:59:32,805 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 12:59:32,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 12:59:32,809 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 12:59:32,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-18 12:59:32,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 12:59:32,937 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-18 12:59:32,939 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 12:59:32,971 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-18 12:59:32,971 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 12:59:33,029 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-18 12:59:33,030 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 12:59:33,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [350650655] [2024-11-18 12:59:33,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [350650655] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 12:59:33,032 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-18 12:59:33,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-18 12:59:33,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280185182] [2024-11-18 12:59:33,032 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-18 12:59:33,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 12:59:33,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 12:59:33,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 12:59:33,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-18 12:59:33,036 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-18 12:59:33,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 12:59:33,272 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2024-11-18 12:59:33,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 12:59:33,273 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 33 [2024-11-18 12:59:33,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 12:59:33,275 INFO L225 Difference]: With dead ends: 66 [2024-11-18 12:59:33,275 INFO L226 Difference]: Without dead ends: 37 [2024-11-18 12:59:33,276 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-18 12:59:33,278 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 1 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 12:59:33,279 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 178 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 12:59:33,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-18 12:59:33,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2024-11-18 12:59:33,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-18 12:59:33,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2024-11-18 12:59:33,291 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 33 [2024-11-18 12:59:33,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 12:59:33,292 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2024-11-18 12:59:33,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-18 12:59:33,292 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2024-11-18 12:59:33,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-18 12:59:33,293 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 12:59:33,293 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-18 12:59:33,298 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-18 12:59:33,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 12:59:33,494 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 12:59:33,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 12:59:33,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1105338653, now seen corresponding path program 2 times [2024-11-18 12:59:33,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 12:59:33,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1214996371] [2024-11-18 12:59:33,496 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-18 12:59:33,496 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 12:59:33,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 12:59:33,499 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 12:59:33,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-18 12:59:33,593 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-18 12:59:33,593 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 12:59:33,595 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-18 12:59:33,596 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 12:59:33,615 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-18 12:59:33,615 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 12:59:33,615 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 12:59:33,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1214996371] [2024-11-18 12:59:33,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1214996371] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 12:59:33,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 12:59:33,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 12:59:33,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145412342] [2024-11-18 12:59:33,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 12:59:33,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 12:59:33,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 12:59:33,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 12:59:33,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 12:59:33,621 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-18 12:59:33,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 12:59:33,722 INFO L93 Difference]: Finished difference Result 58 states and 73 transitions. [2024-11-18 12:59:33,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 12:59:33,724 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 35 [2024-11-18 12:59:33,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 12:59:33,727 INFO L225 Difference]: With dead ends: 58 [2024-11-18 12:59:33,727 INFO L226 Difference]: Without dead ends: 39 [2024-11-18 12:59:33,727 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 12:59:33,728 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 2 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 12:59:33,728 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 72 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 12:59:33,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-18 12:59:33,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2024-11-18 12:59:33,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 28 states have internal predecessors, (33), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-18 12:59:33,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2024-11-18 12:59:33,742 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 35 [2024-11-18 12:59:33,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 12:59:33,743 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2024-11-18 12:59:33,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-18 12:59:33,744 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2024-11-18 12:59:33,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-18 12:59:33,744 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 12:59:33,745 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-18 12:59:33,752 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-18 12:59:33,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 12:59:33,945 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 12:59:33,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 12:59:33,946 INFO L85 PathProgramCache]: Analyzing trace with hash 828026235, now seen corresponding path program 1 times [2024-11-18 12:59:33,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 12:59:33,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [94533380] [2024-11-18 12:59:33,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 12:59:33,947 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 12:59:33,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 12:59:33,950 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 12:59:33,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-18 12:59:34,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 12:59:34,082 INFO L255 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-18 12:59:34,086 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 12:59:34,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-18 12:59:34,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-18 12:59:34,589 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-18 12:59:34,589 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 12:59:34,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2024-11-18 12:59:34,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2024-11-18 12:59:35,199 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-18 12:59:35,199 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 12:59:35,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [94533380] [2024-11-18 12:59:35,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [94533380] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 12:59:35,200 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-18 12:59:35,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 27 [2024-11-18 12:59:35,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245923312] [2024-11-18 12:59:35,200 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-18 12:59:35,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-18 12:59:35,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 12:59:35,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-18 12:59:35,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=613, Unknown=0, NotChecked=0, Total=702 [2024-11-18 12:59:35,203 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand has 27 states, 25 states have (on average 1.88) internal successors, (47), 19 states have internal predecessors, (47), 7 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2024-11-18 12:59:37,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 12:59:37,217 INFO L93 Difference]: Finished difference Result 82 states and 99 transitions. [2024-11-18 12:59:37,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-18 12:59:37,218 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 1.88) internal successors, (47), 19 states have internal predecessors, (47), 7 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) Word has length 37 [2024-11-18 12:59:37,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 12:59:37,220 INFO L225 Difference]: With dead ends: 82 [2024-11-18 12:59:37,220 INFO L226 Difference]: Without dead ends: 68 [2024-11-18 12:59:37,221 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=244, Invalid=1396, Unknown=0, NotChecked=0, Total=1640 [2024-11-18 12:59:37,222 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 116 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-18 12:59:37,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 94 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-18 12:59:37,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-18 12:59:37,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 54. [2024-11-18 12:59:37,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 42 states have internal predecessors, (48), 7 states have call successors, (7), 5 states have call predecessors, (7), 7 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) [2024-11-18 12:59:37,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 66 transitions. [2024-11-18 12:59:37,243 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 66 transitions. Word has length 37 [2024-11-18 12:59:37,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 12:59:37,243 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 66 transitions. [2024-11-18 12:59:37,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 1.88) internal successors, (47), 19 states have internal predecessors, (47), 7 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2024-11-18 12:59:37,244 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 66 transitions. [2024-11-18 12:59:37,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-18 12:59:37,244 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 12:59:37,245 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-18 12:59:37,252 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-18 12:59:37,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 12:59:37,451 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 12:59:37,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 12:59:37,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1366753428, now seen corresponding path program 1 times [2024-11-18 12:59:37,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 12:59:37,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [545474239] [2024-11-18 12:59:37,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 12:59:37,452 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 12:59:37,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 12:59:37,455 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 12:59:37,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-18 12:59:37,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 12:59:37,563 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-18 12:59:37,565 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 12:59:37,599 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-18 12:59:37,599 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 12:59:37,649 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-18 12:59:37,650 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 12:59:37,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [545474239] [2024-11-18 12:59:37,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [545474239] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 12:59:37,650 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-18 12:59:37,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-18 12:59:37,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422803706] [2024-11-18 12:59:37,650 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-18 12:59:37,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 12:59:37,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 12:59:37,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 12:59:37,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-18 12:59:37,654 INFO L87 Difference]: Start difference. First operand 54 states and 66 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-18 12:59:37,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 12:59:37,840 INFO L93 Difference]: Finished difference Result 89 states and 112 transitions. [2024-11-18 12:59:37,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 12:59:37,841 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 39 [2024-11-18 12:59:37,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 12:59:37,843 INFO L225 Difference]: With dead ends: 89 [2024-11-18 12:59:37,843 INFO L226 Difference]: Without dead ends: 62 [2024-11-18 12:59:37,843 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-18 12:59:37,844 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 5 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 12:59:37,844 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 108 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 12:59:37,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-18 12:59:37,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 58. [2024-11-18 12:59:37,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 43 states have (on average 1.2093023255813953) internal successors, (52), 46 states have internal predecessors, (52), 7 states have call successors, (7), 5 states have call predecessors, (7), 7 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) [2024-11-18 12:59:37,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 70 transitions. [2024-11-18 12:59:37,860 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 70 transitions. Word has length 39 [2024-11-18 12:59:37,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 12:59:37,861 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 70 transitions. [2024-11-18 12:59:37,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-18 12:59:37,861 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 70 transitions. [2024-11-18 12:59:37,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-18 12:59:37,862 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 12:59:37,862 INFO L215 NwaCegarLoop]: trace histogram [3, 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] [2024-11-18 12:59:37,869 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-18 12:59:38,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 12:59:38,063 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 12:59:38,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 12:59:38,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1706015329, now seen corresponding path program 1 times [2024-11-18 12:59:38,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 12:59:38,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1072712966] [2024-11-18 12:59:38,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 12:59:38,064 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 12:59:38,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 12:59:38,066 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 12:59:38,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-18 12:59:38,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 12:59:38,243 INFO L255 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-18 12:59:38,247 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 12:59:38,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-18 12:59:38,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-18 12:59:38,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-18 12:59:38,502 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-18 12:59:38,502 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 12:59:38,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2024-11-18 12:59:38,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2024-11-18 12:59:38,867 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-18 12:59:38,867 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 12:59:38,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1072712966] [2024-11-18 12:59:38,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1072712966] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 12:59:38,867 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-18 12:59:38,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2024-11-18 12:59:38,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747546215] [2024-11-18 12:59:38,868 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-18 12:59:38,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-18 12:59:38,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 12:59:38,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-18 12:59:38,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2024-11-18 12:59:38,869 INFO L87 Difference]: Start difference. First operand 58 states and 70 transitions. Second operand has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 16 states have internal predecessors, (52), 4 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-18 12:59:41,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 12:59:41,079 INFO L93 Difference]: Finished difference Result 117 states and 149 transitions. [2024-11-18 12:59:41,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-18 12:59:41,080 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 16 states have internal predecessors, (52), 4 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 40 [2024-11-18 12:59:41,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 12:59:41,082 INFO L225 Difference]: With dead ends: 117 [2024-11-18 12:59:41,082 INFO L226 Difference]: Without dead ends: 106 [2024-11-18 12:59:41,083 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=200, Invalid=556, Unknown=0, NotChecked=0, Total=756 [2024-11-18 12:59:41,083 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 129 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-18 12:59:41,084 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 284 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-18 12:59:41,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-18 12:59:41,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 72. [2024-11-18 12:59:41,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 57 states have internal predecessors, (68), 9 states have call successors, (9), 6 states have call predecessors, (9), 8 states have return successors, (11), 8 states have call predecessors, (11), 7 states have call successors, (11) [2024-11-18 12:59:41,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 88 transitions. [2024-11-18 12:59:41,106 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 88 transitions. Word has length 40 [2024-11-18 12:59:41,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 12:59:41,106 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 88 transitions. [2024-11-18 12:59:41,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 16 states have internal predecessors, (52), 4 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-18 12:59:41,107 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 88 transitions. [2024-11-18 12:59:41,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-18 12:59:41,108 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 12:59:41,108 INFO L215 NwaCegarLoop]: trace histogram [3, 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] [2024-11-18 12:59:41,116 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-18 12:59:41,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 12:59:41,309 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 12:59:41,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 12:59:41,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1965354537, now seen corresponding path program 1 times [2024-11-18 12:59:41,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 12:59:41,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [528216776] [2024-11-18 12:59:41,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 12:59:41,310 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 12:59:41,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 12:59:41,311 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 12:59:41,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-18 12:59:41,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 12:59:41,439 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-18 12:59:41,441 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 12:59:41,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-18 12:59:41,955 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-18 12:59:41,956 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 12:59:42,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2024-11-18 12:59:42,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2024-11-18 12:59:42,532 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-18 12:59:42,533 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 12:59:42,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [528216776] [2024-11-18 12:59:42,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [528216776] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 12:59:42,533 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-18 12:59:42,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 31 [2024-11-18 12:59:42,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536326819] [2024-11-18 12:59:42,533 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-18 12:59:42,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-18 12:59:42,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 12:59:42,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-18 12:59:42,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=857, Unknown=0, NotChecked=0, Total=930 [2024-11-18 12:59:42,535 INFO L87 Difference]: Start difference. First operand 72 states and 88 transitions. Second operand has 31 states, 27 states have (on average 2.111111111111111) internal successors, (57), 22 states have internal predecessors, (57), 8 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2024-11-18 12:59:45,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 12:59:45,332 INFO L93 Difference]: Finished difference Result 152 states and 195 transitions. [2024-11-18 12:59:45,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-18 12:59:45,333 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 27 states have (on average 2.111111111111111) internal successors, (57), 22 states have internal predecessors, (57), 8 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) Word has length 43 [2024-11-18 12:59:45,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 12:59:45,334 INFO L225 Difference]: With dead ends: 152 [2024-11-18 12:59:45,334 INFO L226 Difference]: Without dead ends: 126 [2024-11-18 12:59:45,335 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=141, Invalid=1581, Unknown=0, NotChecked=0, Total=1722 [2024-11-18 12:59:45,336 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 86 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 1094 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 1111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1094 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-18 12:59:45,336 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 173 Invalid, 1111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1094 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-18 12:59:45,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-18 12:59:45,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 115. [2024-11-18 12:59:45,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 90 states have (on average 1.288888888888889) internal successors, (116), 96 states have internal predecessors, (116), 11 states have call successors, (11), 8 states have call predecessors, (11), 13 states have return successors, (18), 10 states have call predecessors, (18), 9 states have call successors, (18) [2024-11-18 12:59:45,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 145 transitions. [2024-11-18 12:59:45,384 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 145 transitions. Word has length 43 [2024-11-18 12:59:45,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 12:59:45,384 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 145 transitions. [2024-11-18 12:59:45,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 27 states have (on average 2.111111111111111) internal successors, (57), 22 states have internal predecessors, (57), 8 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2024-11-18 12:59:45,386 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 145 transitions. [2024-11-18 12:59:45,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-18 12:59:45,387 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 12:59:45,387 INFO L215 NwaCegarLoop]: trace histogram [3, 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] [2024-11-18 12:59:45,393 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-18 12:59:45,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 12:59:45,589 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 12:59:45,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 12:59:45,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1392073365, now seen corresponding path program 2 times [2024-11-18 12:59:45,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 12:59:45,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [834467505] [2024-11-18 12:59:45,590 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-18 12:59:45,590 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 12:59:45,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 12:59:45,591 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 12:59:45,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-18 12:59:45,727 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-18 12:59:45,727 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 12:59:45,732 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-18 12:59:45,734 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 12:59:45,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-18 12:59:45,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-18 12:59:45,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-18 12:59:46,041 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-18 12:59:46,041 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 12:59:46,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2024-11-18 12:59:46,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2024-11-18 12:59:46,328 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-18 12:59:46,329 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 12:59:46,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [834467505] [2024-11-18 12:59:46,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [834467505] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 12:59:46,329 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-18 12:59:46,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2024-11-18 12:59:46,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215787299] [2024-11-18 12:59:46,329 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-18 12:59:46,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-18 12:59:46,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 12:59:46,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-18 12:59:46,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2024-11-18 12:59:46,332 INFO L87 Difference]: Start difference. First operand 115 states and 145 transitions. Second operand has 19 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 18 states have internal predecessors, (58), 4 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-18 12:59:48,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 12:59:48,664 INFO L93 Difference]: Finished difference Result 245 states and 319 transitions. [2024-11-18 12:59:48,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-18 12:59:48,665 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 18 states have internal predecessors, (58), 4 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 43 [2024-11-18 12:59:48,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 12:59:48,667 INFO L225 Difference]: With dead ends: 245 [2024-11-18 12:59:48,667 INFO L226 Difference]: Without dead ends: 219 [2024-11-18 12:59:48,668 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=236, Invalid=820, Unknown=0, NotChecked=0, Total=1056 [2024-11-18 12:59:48,668 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 189 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-18 12:59:48,669 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 343 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-18 12:59:48,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-11-18 12:59:48,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 173. [2024-11-18 12:59:48,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 136 states have (on average 1.3235294117647058) internal successors, (180), 146 states have internal predecessors, (180), 16 states have call successors, (16), 11 states have call predecessors, (16), 20 states have return successors, (29), 15 states have call predecessors, (29), 12 states have call successors, (29) [2024-11-18 12:59:48,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 225 transitions. [2024-11-18 12:59:48,706 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 225 transitions. Word has length 43 [2024-11-18 12:59:48,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 12:59:48,707 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 225 transitions. [2024-11-18 12:59:48,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 18 states have internal predecessors, (58), 4 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-18 12:59:48,707 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 225 transitions. [2024-11-18 12:59:48,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-18 12:59:48,708 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 12:59:48,708 INFO L215 NwaCegarLoop]: trace histogram [4, 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] [2024-11-18 12:59:48,717 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-11-18 12:59:48,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 12:59:48,909 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 12:59:48,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 12:59:48,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1829145859, now seen corresponding path program 2 times [2024-11-18 12:59:48,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 12:59:48,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [977341031] [2024-11-18 12:59:48,910 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-18 12:59:48,910 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 12:59:48,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 12:59:48,913 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 12:59:48,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-18 12:59:49,044 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-18 12:59:49,044 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 12:59:49,048 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-18 12:59:49,052 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 12:59:49,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-18 12:59:49,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-18 12:59:49,288 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-18 12:59:49,288 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 12:59:49,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2024-11-18 12:59:49,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2024-11-18 12:59:49,902 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-18 12:59:49,902 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 12:59:49,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [977341031] [2024-11-18 12:59:49,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [977341031] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 12:59:49,902 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-18 12:59:49,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 29 [2024-11-18 12:59:49,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974223150] [2024-11-18 12:59:49,903 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-18 12:59:49,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-18 12:59:49,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 12:59:49,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-18 12:59:49,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=730, Unknown=0, NotChecked=0, Total=812 [2024-11-18 12:59:49,904 INFO L87 Difference]: Start difference. First operand 173 states and 225 transitions. Second operand has 29 states, 27 states have (on average 2.074074074074074) internal successors, (56), 21 states have internal predecessors, (56), 7 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2024-11-18 12:59:52,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 12:59:52,934 INFO L93 Difference]: Finished difference Result 303 states and 387 transitions. [2024-11-18 12:59:52,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-18 12:59:52,935 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 27 states have (on average 2.074074074074074) internal successors, (56), 21 states have internal predecessors, (56), 7 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) Word has length 43 [2024-11-18 12:59:52,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 12:59:52,937 INFO L225 Difference]: With dead ends: 303 [2024-11-18 12:59:52,937 INFO L226 Difference]: Without dead ends: 229 [2024-11-18 12:59:52,938 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=279, Invalid=1883, Unknown=0, NotChecked=0, Total=2162 [2024-11-18 12:59:52,939 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 108 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 1167 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 1205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-18 12:59:52,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 197 Invalid, 1205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1167 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-18 12:59:52,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-11-18 12:59:52,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 212. [2024-11-18 12:59:52,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 169 states have (on average 1.3254437869822486) internal successors, (224), 178 states have internal predecessors, (224), 20 states have call successors, (20), 14 states have call predecessors, (20), 22 states have return successors, (31), 19 states have call predecessors, (31), 13 states have call successors, (31) [2024-11-18 12:59:52,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 275 transitions. [2024-11-18 12:59:52,971 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 275 transitions. Word has length 43 [2024-11-18 12:59:52,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 12:59:52,971 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 275 transitions. [2024-11-18 12:59:52,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 27 states have (on average 2.074074074074074) internal successors, (56), 21 states have internal predecessors, (56), 7 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2024-11-18 12:59:52,972 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 275 transitions. [2024-11-18 12:59:52,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-18 12:59:52,973 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 12:59:52,973 INFO L215 NwaCegarLoop]: trace histogram [3, 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] [2024-11-18 12:59:52,982 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-18 12:59:53,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 12:59:53,173 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 12:59:53,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 12:59:53,174 INFO L85 PathProgramCache]: Analyzing trace with hash 2069113328, now seen corresponding path program 1 times [2024-11-18 12:59:53,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 12:59:53,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [234543284] [2024-11-18 12:59:53,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 12:59:53,174 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 12:59:53,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 12:59:53,176 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 12:59:53,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-18 12:59:53,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 12:59:53,284 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-18 12:59:53,287 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 12:59:53,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-18 12:59:53,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-18 12:59:53,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-18 12:59:53,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-18 12:59:53,660 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-18 12:59:53,661 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 12:59:53,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2024-11-18 12:59:53,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2024-11-18 12:59:53,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2024-11-18 12:59:53,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2024-11-18 12:59:54,055 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-18 12:59:54,055 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 12:59:54,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [234543284] [2024-11-18 12:59:54,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [234543284] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 12:59:54,055 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-18 12:59:54,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 20 [2024-11-18 12:59:54,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089554087] [2024-11-18 12:59:54,056 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-18 12:59:54,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-18 12:59:54,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 12:59:54,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-18 12:59:54,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2024-11-18 12:59:54,057 INFO L87 Difference]: Start difference. First operand 212 states and 275 transitions. Second operand has 20 states, 18 states have (on average 2.888888888888889) internal successors, (52), 14 states have internal predecessors, (52), 5 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2024-11-18 12:59:55,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 12:59:55,404 INFO L93 Difference]: Finished difference Result 259 states and 332 transitions. [2024-11-18 12:59:55,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-18 12:59:55,405 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 2.888888888888889) internal successors, (52), 14 states have internal predecessors, (52), 5 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 45 [2024-11-18 12:59:55,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 12:59:55,407 INFO L225 Difference]: With dead ends: 259 [2024-11-18 12:59:55,407 INFO L226 Difference]: Without dead ends: 233 [2024-11-18 12:59:55,408 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=106, Invalid=650, Unknown=0, NotChecked=0, Total=756 [2024-11-18 12:59:55,408 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 93 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 593 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-18 12:59:55,408 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 164 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 593 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-18 12:59:55,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2024-11-18 12:59:55,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 226. [2024-11-18 12:59:55,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 180 states have (on average 1.3222222222222222) internal successors, (238), 190 states have internal predecessors, (238), 21 states have call successors, (21), 15 states have call predecessors, (21), 24 states have return successors, (33), 20 states have call predecessors, (33), 14 states have call successors, (33) [2024-11-18 12:59:55,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 292 transitions. [2024-11-18 12:59:55,448 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 292 transitions. Word has length 45 [2024-11-18 12:59:55,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 12:59:55,448 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 292 transitions. [2024-11-18 12:59:55,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 2.888888888888889) internal successors, (52), 14 states have internal predecessors, (52), 5 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2024-11-18 12:59:55,449 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 292 transitions. [2024-11-18 12:59:55,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-18 12:59:55,449 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 12:59:55,450 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 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] [2024-11-18 12:59:55,456 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-18 12:59:55,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 12:59:55,651 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 12:59:55,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 12:59:55,652 INFO L85 PathProgramCache]: Analyzing trace with hash -965055082, now seen corresponding path program 2 times [2024-11-18 12:59:55,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 12:59:55,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [579636032] [2024-11-18 12:59:55,654 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-18 12:59:55,654 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 12:59:55,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 12:59:55,657 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 12:59:55,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-18 12:59:55,783 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-18 12:59:55,783 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 12:59:55,787 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-18 12:59:55,790 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 12:59:55,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-18 12:59:55,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-18 12:59:55,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-18 12:59:56,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-18 12:59:56,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-18 12:59:56,191 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-18 12:59:56,192 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 12:59:56,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2024-11-18 12:59:56,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 66 [2024-11-18 12:59:56,828 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-18 12:59:56,828 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 12:59:56,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [579636032] [2024-11-18 12:59:56,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [579636032] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 12:59:56,829 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-18 12:59:56,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 34 [2024-11-18 12:59:56,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646394027] [2024-11-18 12:59:56,829 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-18 12:59:56,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-18 12:59:56,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 12:59:56,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-18 12:59:56,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=998, Unknown=0, NotChecked=0, Total=1122 [2024-11-18 12:59:56,830 INFO L87 Difference]: Start difference. First operand 226 states and 292 transitions. Second operand has 34 states, 34 states have (on average 1.8529411764705883) internal successors, (63), 28 states have internal predecessors, (63), 4 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-18 13:00:01,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:00:01,007 INFO L93 Difference]: Finished difference Result 502 states and 657 transitions. [2024-11-18 13:00:01,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-18 13:00:01,008 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.8529411764705883) internal successors, (63), 28 states have internal predecessors, (63), 4 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 45 [2024-11-18 13:00:01,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:00:01,010 INFO L225 Difference]: With dead ends: 502 [2024-11-18 13:00:01,010 INFO L226 Difference]: Without dead ends: 405 [2024-11-18 13:00:01,012 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 841 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=446, Invalid=2976, Unknown=0, NotChecked=0, Total=3422 [2024-11-18 13:00:01,013 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 169 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 1179 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 1236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-18 13:00:01,013 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 118 Invalid, 1236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1179 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-18 13:00:01,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2024-11-18 13:00:01,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 341. [2024-11-18 13:00:01,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 279 states have (on average 1.3440860215053763) internal successors, (375), 292 states have internal predecessors, (375), 27 states have call successors, (27), 22 states have call predecessors, (27), 34 states have return successors, (45), 26 states have call predecessors, (45), 18 states have call successors, (45) [2024-11-18 13:00:01,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 447 transitions. [2024-11-18 13:00:01,086 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 447 transitions. Word has length 45 [2024-11-18 13:00:01,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:00:01,087 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 447 transitions. [2024-11-18 13:00:01,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.8529411764705883) internal successors, (63), 28 states have internal predecessors, (63), 4 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-18 13:00:01,087 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 447 transitions. [2024-11-18 13:00:01,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-18 13:00:01,088 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:00:01,088 INFO L215 NwaCegarLoop]: trace histogram [3, 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] [2024-11-18 13:00:01,095 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-18 13:00:01,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 13:00:01,289 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:00:01,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:00:01,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1758947250, now seen corresponding path program 2 times [2024-11-18 13:00:01,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 13:00:01,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1578022241] [2024-11-18 13:00:01,289 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-18 13:00:01,290 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 13:00:01,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 13:00:01,291 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 13:00:01,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-18 13:00:01,418 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-18 13:00:01,418 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 13:00:01,421 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-18 13:00:01,423 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:00:01,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-18 13:00:01,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-18 13:00:01,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-18 13:00:01,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-18 13:00:01,739 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-18 13:00:01,739 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 13:00:02,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2024-11-18 13:00:02,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2024-11-18 13:00:02,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2024-11-18 13:00:02,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2024-11-18 13:00:02,161 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-18 13:00:02,162 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 13:00:02,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1578022241] [2024-11-18 13:00:02,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1578022241] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 13:00:02,162 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-18 13:00:02,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2024-11-18 13:00:02,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240121457] [2024-11-18 13:00:02,162 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-18 13:00:02,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-18 13:00:02,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 13:00:02,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-18 13:00:02,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2024-11-18 13:00:02,163 INFO L87 Difference]: Start difference. First operand 341 states and 447 transitions. Second operand has 19 states, 19 states have (on average 3.1052631578947367) internal successors, (59), 17 states have internal predecessors, (59), 3 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-18 13:00:03,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:00:03,586 INFO L93 Difference]: Finished difference Result 423 states and 545 transitions. [2024-11-18 13:00:03,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-18 13:00:03,586 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.1052631578947367) internal successors, (59), 17 states have internal predecessors, (59), 3 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 45 [2024-11-18 13:00:03,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:00:03,588 INFO L225 Difference]: With dead ends: 423 [2024-11-18 13:00:03,588 INFO L226 Difference]: Without dead ends: 235 [2024-11-18 13:00:03,589 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=174, Invalid=638, Unknown=0, NotChecked=0, Total=812 [2024-11-18 13:00:03,589 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 46 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-18 13:00:03,589 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 122 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-18 13:00:03,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2024-11-18 13:00:03,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 209. [2024-11-18 13:00:03,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 173 states have (on average 1.30635838150289) internal successors, (226), 177 states have internal predecessors, (226), 17 states have call successors, (17), 15 states have call predecessors, (17), 18 states have return successors, (18), 16 states have call predecessors, (18), 9 states have call successors, (18) [2024-11-18 13:00:03,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 261 transitions. [2024-11-18 13:00:03,623 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 261 transitions. Word has length 45 [2024-11-18 13:00:03,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:00:03,624 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 261 transitions. [2024-11-18 13:00:03,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.1052631578947367) internal successors, (59), 17 states have internal predecessors, (59), 3 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-18 13:00:03,624 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 261 transitions. [2024-11-18 13:00:03,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-18 13:00:03,625 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:00:03,625 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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] [2024-11-18 13:00:03,631 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-11-18 13:00:03,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 13:00:03,826 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:00:03,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:00:03,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1293534561, now seen corresponding path program 3 times [2024-11-18 13:00:03,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 13:00:03,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [929961462] [2024-11-18 13:00:03,827 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-18 13:00:03,827 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 13:00:03,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 13:00:03,828 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 13:00:03,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-18 13:00:03,969 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-18 13:00:03,970 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 13:00:03,974 INFO L255 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-18 13:00:03,976 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:00:04,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-18 13:00:04,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-18 13:00:04,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-18 13:00:04,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-18 13:00:04,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-18 13:00:04,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-18 13:00:04,433 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-18 13:00:04,433 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 13:00:05,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2024-11-18 13:00:05,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2024-11-18 13:00:05,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2024-11-18 13:00:05,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2024-11-18 13:00:05,086 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-18 13:00:05,086 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 13:00:05,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [929961462] [2024-11-18 13:00:05,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [929961462] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 13:00:05,087 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-18 13:00:05,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11] total 25 [2024-11-18 13:00:05,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529760536] [2024-11-18 13:00:05,087 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-18 13:00:05,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-18 13:00:05,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 13:00:05,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-18 13:00:05,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=533, Unknown=0, NotChecked=0, Total=600 [2024-11-18 13:00:05,088 INFO L87 Difference]: Start difference. First operand 209 states and 261 transitions. Second operand has 25 states, 23 states have (on average 2.391304347826087) internal successors, (55), 18 states have internal predecessors, (55), 5 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2024-11-18 13:00:08,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:00:08,483 INFO L93 Difference]: Finished difference Result 247 states and 305 transitions. [2024-11-18 13:00:08,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-18 13:00:08,484 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 2.391304347826087) internal successors, (55), 18 states have internal predecessors, (55), 5 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 46 [2024-11-18 13:00:08,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:00:08,486 INFO L225 Difference]: With dead ends: 247 [2024-11-18 13:00:08,486 INFO L226 Difference]: Without dead ends: 200 [2024-11-18 13:00:08,487 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=196, Invalid=1210, Unknown=0, NotChecked=0, Total=1406 [2024-11-18 13:00:08,487 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 107 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 783 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-18 13:00:08,487 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 174 Invalid, 799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 783 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-18 13:00:08,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-11-18 13:00:08,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 193. [2024-11-18 13:00:08,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 159 states have (on average 1.3018867924528301) internal successors, (207), 163 states have internal predecessors, (207), 16 states have call successors, (16), 14 states have call predecessors, (16), 17 states have return successors, (17), 15 states have call predecessors, (17), 9 states have call successors, (17) [2024-11-18 13:00:08,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 240 transitions. [2024-11-18 13:00:08,523 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 240 transitions. Word has length 46 [2024-11-18 13:00:08,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:00:08,523 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 240 transitions. [2024-11-18 13:00:08,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 2.391304347826087) internal successors, (55), 18 states have internal predecessors, (55), 5 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2024-11-18 13:00:08,523 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 240 transitions. [2024-11-18 13:00:08,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-18 13:00:08,524 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:00:08,524 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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] [2024-11-18 13:00:08,533 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-18 13:00:08,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 13:00:08,725 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:00:08,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:00:08,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1357295327, now seen corresponding path program 4 times [2024-11-18 13:00:08,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 13:00:08,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1822174508] [2024-11-18 13:00:08,726 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-18 13:00:08,726 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 13:00:08,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 13:00:08,727 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 13:00:08,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-18 13:00:08,839 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-18 13:00:08,839 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 13:00:08,842 INFO L255 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-18 13:00:08,844 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:00:08,863 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-18 13:00:08,863 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 13:00:08,911 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-18 13:00:08,911 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 13:00:08,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1822174508] [2024-11-18 13:00:08,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1822174508] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 13:00:08,911 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-18 13:00:08,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-18 13:00:08,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21070909] [2024-11-18 13:00:08,912 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-18 13:00:08,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-18 13:00:08,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 13:00:08,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-18 13:00:08,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-18 13:00:08,913 INFO L87 Difference]: Start difference. First operand 193 states and 240 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-18 13:00:08,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:00:08,992 INFO L93 Difference]: Finished difference Result 316 states and 397 transitions. [2024-11-18 13:00:08,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 13:00:08,992 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 46 [2024-11-18 13:00:08,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:00:08,994 INFO L225 Difference]: With dead ends: 316 [2024-11-18 13:00:08,994 INFO L226 Difference]: Without dead ends: 183 [2024-11-18 13:00:08,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-18 13:00:08,995 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 10 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 13:00:08,995 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 209 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 13:00:08,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-18 13:00:09,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 178. [2024-11-18 13:00:09,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 147 states have (on average 1.1768707482993197) internal successors, (173), 149 states have internal predecessors, (173), 15 states have call successors, (15), 14 states have call predecessors, (15), 15 states have return successors, (15), 14 states have call predecessors, (15), 9 states have call successors, (15) [2024-11-18 13:00:09,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 203 transitions. [2024-11-18 13:00:09,025 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 203 transitions. Word has length 46 [2024-11-18 13:00:09,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:00:09,025 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 203 transitions. [2024-11-18 13:00:09,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-18 13:00:09,026 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 203 transitions. [2024-11-18 13:00:09,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-18 13:00:09,026 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:00:09,026 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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-11-18 13:00:09,033 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-18 13:00:09,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 13:00:09,227 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:00:09,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:00:09,227 INFO L85 PathProgramCache]: Analyzing trace with hash 278730410, now seen corresponding path program 1 times [2024-11-18 13:00:09,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 13:00:09,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1197644731] [2024-11-18 13:00:09,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:00:09,228 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 13:00:09,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 13:00:09,229 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 13:00:09,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-18 13:00:09,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:00:09,368 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-18 13:00:09,370 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:00:09,788 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-18 13:00:09,789 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 13:00:09,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-18 13:00:10,017 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:00:10,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 18 [2024-11-18 13:00:10,394 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-18 13:00:10,394 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 13:00:10,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1197644731] [2024-11-18 13:00:10,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1197644731] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 13:00:10,394 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-18 13:00:10,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 32 [2024-11-18 13:00:10,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968594492] [2024-11-18 13:00:10,394 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-18 13:00:10,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-18 13:00:10,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 13:00:10,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-18 13:00:10,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=897, Unknown=0, NotChecked=0, Total=992 [2024-11-18 13:00:10,396 INFO L87 Difference]: Start difference. First operand 178 states and 203 transitions. Second operand has 32 states, 28 states have (on average 2.357142857142857) internal successors, (66), 22 states have internal predecessors, (66), 8 states have call successors, (12), 6 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 6 states have call successors, (10) [2024-11-18 13:00:12,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:00:12,730 INFO L93 Difference]: Finished difference Result 293 states and 325 transitions. [2024-11-18 13:00:12,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-18 13:00:12,730 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 28 states have (on average 2.357142857142857) internal successors, (66), 22 states have internal predecessors, (66), 8 states have call successors, (12), 6 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 6 states have call successors, (10) Word has length 53 [2024-11-18 13:00:12,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:00:12,732 INFO L225 Difference]: With dead ends: 293 [2024-11-18 13:00:12,732 INFO L226 Difference]: Without dead ends: 191 [2024-11-18 13:00:12,733 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=198, Invalid=1608, Unknown=0, NotChecked=0, Total=1806 [2024-11-18 13:00:12,734 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 112 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 1122 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 1140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-18 13:00:12,735 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 150 Invalid, 1140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1122 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-18 13:00:12,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-11-18 13:00:12,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 166. [2024-11-18 13:00:12,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 139 states have (on average 1.1798561151079137) internal successors, (164), 141 states have internal predecessors, (164), 13 states have call successors, (13), 12 states have call predecessors, (13), 13 states have return successors, (13), 12 states have call predecessors, (13), 7 states have call successors, (13) [2024-11-18 13:00:12,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 190 transitions. [2024-11-18 13:00:12,757 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 190 transitions. Word has length 53 [2024-11-18 13:00:12,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:00:12,757 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 190 transitions. [2024-11-18 13:00:12,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 28 states have (on average 2.357142857142857) internal successors, (66), 22 states have internal predecessors, (66), 8 states have call successors, (12), 6 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 6 states have call successors, (10) [2024-11-18 13:00:12,757 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 190 transitions. [2024-11-18 13:00:12,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-18 13:00:12,758 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:00:12,758 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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-11-18 13:00:12,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2024-11-18 13:00:12,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 13:00:12,959 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:00:12,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:00:12,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1212935490, now seen corresponding path program 2 times [2024-11-18 13:00:12,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 13:00:12,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1470697011] [2024-11-18 13:00:12,960 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-18 13:00:12,960 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 13:00:12,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 13:00:12,961 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 13:00:12,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-18 13:00:13,117 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-18 13:00:13,117 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 13:00:13,122 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-18 13:00:13,125 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:00:13,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-18 13:00:13,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-18 13:00:13,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-18 13:00:13,356 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-18 13:00:13,356 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 13:00:13,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2024-11-18 13:00:13,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2024-11-18 13:00:13,602 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-18 13:00:13,602 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 13:00:13,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1470697011] [2024-11-18 13:00:13,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1470697011] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 13:00:13,603 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-18 13:00:13,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2024-11-18 13:00:13,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868024118] [2024-11-18 13:00:13,603 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-18 13:00:13,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-18 13:00:13,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 13:00:13,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-18 13:00:13,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2024-11-18 13:00:13,604 INFO L87 Difference]: Start difference. First operand 166 states and 190 transitions. Second operand has 17 states, 17 states have (on average 4.235294117647059) internal successors, (72), 16 states have internal predecessors, (72), 4 states have call successors, (12), 6 states have call predecessors, (12), 6 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2024-11-18 13:00:14,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:00:14,998 INFO L93 Difference]: Finished difference Result 183 states and 203 transitions. [2024-11-18 13:00:14,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-18 13:00:14,999 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.235294117647059) internal successors, (72), 16 states have internal predecessors, (72), 4 states have call successors, (12), 6 states have call predecessors, (12), 6 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 53 [2024-11-18 13:00:14,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:00:15,000 INFO L225 Difference]: With dead ends: 183 [2024-11-18 13:00:15,000 INFO L226 Difference]: Without dead ends: 181 [2024-11-18 13:00:15,001 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=204, Invalid=608, Unknown=0, NotChecked=0, Total=812 [2024-11-18 13:00:15,001 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 99 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-18 13:00:15,001 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 237 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-18 13:00:15,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-11-18 13:00:15,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 166. [2024-11-18 13:00:15,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 139 states have (on average 1.1726618705035972) internal successors, (163), 141 states have internal predecessors, (163), 13 states have call successors, (13), 12 states have call predecessors, (13), 13 states have return successors, (13), 12 states have call predecessors, (13), 7 states have call successors, (13) [2024-11-18 13:00:15,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 189 transitions. [2024-11-18 13:00:15,034 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 189 transitions. Word has length 53 [2024-11-18 13:00:15,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:00:15,035 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 189 transitions. [2024-11-18 13:00:15,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.235294117647059) internal successors, (72), 16 states have internal predecessors, (72), 4 states have call successors, (12), 6 states have call predecessors, (12), 6 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2024-11-18 13:00:15,035 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 189 transitions. [2024-11-18 13:00:15,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-18 13:00:15,036 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:00:15,036 INFO L215 NwaCegarLoop]: trace histogram [7, 5, 5, 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] [2024-11-18 13:00:15,043 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-11-18 13:00:15,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 13:00:15,237 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:00:15,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:00:15,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1362669345, now seen corresponding path program 3 times [2024-11-18 13:00:15,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 13:00:15,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [174351584] [2024-11-18 13:00:15,238 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-18 13:00:15,238 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 13:00:15,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 13:00:15,239 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 13:00:15,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-11-18 13:00:15,401 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-18 13:00:15,402 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 13:00:15,406 INFO L255 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-18 13:00:15,409 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:00:15,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-18 13:00:15,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-18 13:00:15,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-18 13:00:15,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-18 13:00:15,886 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2024-11-18 13:00:15,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 17 [2024-11-18 13:00:15,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-18 13:00:15,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-18 13:00:16,325 INFO L349 Elim1Store]: treesize reduction 36, result has 56.6 percent of original size [2024-11-18 13:00:16,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 77 [2024-11-18 13:00:16,369 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2024-11-18 13:00:16,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 31