./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/merge_sort-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/merge_sort-2.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 e47f94c757882803b8e19e21a897c3f5ab1653c3391e3b246153a1c416bdab7c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 18:18:13,028 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 18:18:13,141 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 18:18:13,147 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 18:18:13,147 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 18:18:13,171 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 18:18:13,172 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 18:18:13,172 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 18:18:13,173 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 18:18:13,173 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 18:18:13,173 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 18:18:13,174 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 18:18:13,174 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 18:18:13,175 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 18:18:13,178 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 18:18:13,179 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 18:18:13,179 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 18:18:13,179 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 18:18:13,180 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 18:18:13,180 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 18:18:13,180 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 18:18:13,182 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 18:18:13,182 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 18:18:13,182 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 18:18:13,183 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 18:18:13,183 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 18:18:13,183 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 18:18:13,183 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 18:18:13,184 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 18:18:13,184 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 18:18:13,184 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 18:18:13,185 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 18:18:13,185 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 18:18:13,185 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 18:18:13,186 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 18:18:13,186 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 18:18:13,186 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 18:18:13,187 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 18:18:13,187 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 18:18:13,187 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 18:18:13,188 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 18:18:13,191 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 18:18:13,191 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 -> e47f94c757882803b8e19e21a897c3f5ab1653c3391e3b246153a1c416bdab7c [2024-10-12 18:18:13,464 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 18:18:13,497 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 18:18:13,501 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 18:18:13,502 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 18:18:13,502 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 18:18:13,504 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/merge_sort-2.i [2024-10-12 18:18:15,114 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 18:18:15,361 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 18:18:15,362 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/merge_sort-2.i [2024-10-12 18:18:15,377 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d77df8fdf/67e4c16b14914578be0b6e1daccfc7c2/FLAG86b5e5c94 [2024-10-12 18:18:15,691 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d77df8fdf/67e4c16b14914578be0b6e1daccfc7c2 [2024-10-12 18:18:15,694 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 18:18:15,696 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 18:18:15,697 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 18:18:15,697 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 18:18:15,704 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 18:18:15,705 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 06:18:15" (1/1) ... [2024-10-12 18:18:15,706 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1952c35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:18:15, skipping insertion in model container [2024-10-12 18:18:15,706 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 06:18:15" (1/1) ... [2024-10-12 18:18:15,760 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 18:18:16,241 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/merge_sort-2.i[22632,22645] [2024-10-12 18:18:16,296 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 18:18:16,312 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 18:18:16,361 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/merge_sort-2.i[22632,22645] [2024-10-12 18:18:16,386 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 18:18:16,424 INFO L204 MainTranslator]: Completed translation [2024-10-12 18:18:16,425 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:18:16 WrapperNode [2024-10-12 18:18:16,425 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 18:18:16,426 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 18:18:16,426 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 18:18:16,426 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 18:18:16,434 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:18:16" (1/1) ... [2024-10-12 18:18:16,455 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:18:16" (1/1) ... [2024-10-12 18:18:16,483 INFO L138 Inliner]: procedures = 125, calls = 83, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 288 [2024-10-12 18:18:16,484 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 18:18:16,485 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 18:18:16,485 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 18:18:16,485 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 18:18:16,495 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:18:16" (1/1) ... [2024-10-12 18:18:16,496 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:18:16" (1/1) ... [2024-10-12 18:18:16,502 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:18:16" (1/1) ... [2024-10-12 18:18:16,534 INFO L175 MemorySlicer]: Split 49 memory accesses to 4 slices as follows [2, 10, 3, 34]. 69 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 13 writes are split as follows [0, 3, 2, 8]. [2024-10-12 18:18:16,538 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:18:16" (1/1) ... [2024-10-12 18:18:16,539 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:18:16" (1/1) ... [2024-10-12 18:18:16,550 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:18:16" (1/1) ... [2024-10-12 18:18:16,555 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:18:16" (1/1) ... [2024-10-12 18:18:16,561 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:18:16" (1/1) ... [2024-10-12 18:18:16,564 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:18:16" (1/1) ... [2024-10-12 18:18:16,575 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 18:18:16,576 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 18:18:16,576 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 18:18:16,576 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 18:18:16,577 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:18:16" (1/1) ... [2024-10-12 18:18:16,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 18:18:16,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:18:16,624 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 18:18:16,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 18:18:16,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-12 18:18:16,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-12 18:18:16,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-12 18:18:16,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-12 18:18:16,690 INFO L130 BoogieDeclarations]: Found specification of procedure merge_single_node [2024-10-12 18:18:16,690 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_single_node [2024-10-12 18:18:16,690 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2024-10-12 18:18:16,691 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2024-10-12 18:18:16,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-12 18:18:16,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-12 18:18:16,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-12 18:18:16,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-12 18:18:16,693 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-12 18:18:16,693 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 18:18:16,693 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-12 18:18:16,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-12 18:18:16,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-12 18:18:16,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-12 18:18:16,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-10-12 18:18:16,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-12 18:18:16,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-12 18:18:16,694 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-12 18:18:16,694 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-12 18:18:16,694 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-12 18:18:16,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 18:18:16,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-12 18:18:16,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-12 18:18:16,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-12 18:18:16,694 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 18:18:16,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 18:18:16,856 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 18:18:16,859 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 18:18:17,296 INFO L? ?]: Removed 66 outVars from TransFormulas that were not future-live. [2024-10-12 18:18:17,296 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 18:18:17,335 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 18:18:17,336 INFO L314 CfgBuilder]: Removed 33 assume(true) statements. [2024-10-12 18:18:17,336 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 06:18:17 BoogieIcfgContainer [2024-10-12 18:18:17,337 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 18:18:17,340 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 18:18:17,340 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 18:18:17,345 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 18:18:17,345 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 06:18:15" (1/3) ... [2024-10-12 18:18:17,346 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2704a34c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 06:18:17, skipping insertion in model container [2024-10-12 18:18:17,346 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:18:16" (2/3) ... [2024-10-12 18:18:17,347 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2704a34c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 06:18:17, skipping insertion in model container [2024-10-12 18:18:17,347 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 06:18:17" (3/3) ... [2024-10-12 18:18:17,349 INFO L112 eAbstractionObserver]: Analyzing ICFG merge_sort-2.i [2024-10-12 18:18:17,368 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 18:18:17,369 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 18:18:17,449 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 18:18:17,457 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;@736f456a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 18:18:17,458 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 18:18:17,463 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 70 states have (on average 1.8857142857142857) internal successors, (132), 86 states have internal predecessors, (132), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-12 18:18:17,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-12 18:18:17,472 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:18:17,473 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-12 18:18:17,473 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:18:17,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:18:17,481 INFO L85 PathProgramCache]: Analyzing trace with hash -27349109, now seen corresponding path program 1 times [2024-10-12 18:18:17,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:18:17,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848930435] [2024-10-12 18:18:17,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:18:17,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:18:17,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:18:17,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:18:17,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:18:17,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848930435] [2024-10-12 18:18:17,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848930435] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:18:17,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:18:17,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 18:18:17,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862533653] [2024-10-12 18:18:17,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:18:17,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 18:18:17,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:18:17,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 18:18:17,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 18:18:17,702 INFO L87 Difference]: Start difference. First operand has 89 states, 70 states have (on average 1.8857142857142857) internal successors, (132), 86 states have internal predecessors, (132), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:18:17,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:18:17,790 INFO L93 Difference]: Finished difference Result 176 states and 323 transitions. [2024-10-12 18:18:17,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 18:18:17,793 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-12 18:18:17,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:18:17,805 INFO L225 Difference]: With dead ends: 176 [2024-10-12 18:18:17,805 INFO L226 Difference]: Without dead ends: 82 [2024-10-12 18:18:17,811 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-10-12 18:18:17,818 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 107 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-10-12 18:18:17,819 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 18:18:17,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-10-12 18:18:17,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-10-12 18:18:17,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 65 states have (on average 1.353846153846154) internal successors, (88), 79 states have internal predecessors, (88), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 18:18:17,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 105 transitions. [2024-10-12 18:18:17,871 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 105 transitions. Word has length 6 [2024-10-12 18:18:17,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:18:17,873 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 105 transitions. [2024-10-12 18:18:17,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:18:17,874 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 105 transitions. [2024-10-12 18:18:17,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-12 18:18:17,875 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:18:17,876 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:18:17,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 18:18:17,876 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:18:17,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:18:17,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1471689875, now seen corresponding path program 1 times [2024-10-12 18:18:17,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:18:17,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476084448] [2024-10-12 18:18:17,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:18:17,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:18:17,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:18:17,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:18:17,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:18:17,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476084448] [2024-10-12 18:18:17,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476084448] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:18:17,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:18:17,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 18:18:17,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018072567] [2024-10-12 18:18:17,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:18:17,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 18:18:17,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:18:17,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 18:18:17,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 18:18:17,977 INFO L87 Difference]: Start difference. First operand 82 states and 105 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:18:18,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:18:18,071 INFO L93 Difference]: Finished difference Result 163 states and 209 transitions. [2024-10-12 18:18:18,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 18:18:18,072 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-12 18:18:18,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:18:18,074 INFO L225 Difference]: With dead ends: 163 [2024-10-12 18:18:18,075 INFO L226 Difference]: Without dead ends: 88 [2024-10-12 18:18:18,076 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 18:18:18,078 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 4 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:18:18,078 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 194 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 18:18:18,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-12 18:18:18,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 84. [2024-10-12 18:18:18,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 67 states have (on average 1.3432835820895523) internal successors, (90), 81 states have internal predecessors, (90), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 18:18:18,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 107 transitions. [2024-10-12 18:18:18,099 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 107 transitions. Word has length 7 [2024-10-12 18:18:18,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:18:18,099 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 107 transitions. [2024-10-12 18:18:18,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:18:18,100 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 107 transitions. [2024-10-12 18:18:18,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-12 18:18:18,100 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:18:18,101 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:18:18,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 18:18:18,101 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:18:18,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:18:18,102 INFO L85 PathProgramCache]: Analyzing trace with hash -884179562, now seen corresponding path program 1 times [2024-10-12 18:18:18,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:18:18,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946054675] [2024-10-12 18:18:18,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:18:18,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:18:18,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:18:18,416 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:18:18,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:18:18,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946054675] [2024-10-12 18:18:18,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946054675] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:18:18,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:18:18,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 18:18:18,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176913283] [2024-10-12 18:18:18,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:18:18,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 18:18:18,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:18:18,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 18:18:18,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 18:18:18,419 INFO L87 Difference]: Start difference. First operand 84 states and 107 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:18:18,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:18:18,645 INFO L93 Difference]: Finished difference Result 140 states and 176 transitions. [2024-10-12 18:18:18,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 18:18:18,646 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-12 18:18:18,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:18:18,647 INFO L225 Difference]: With dead ends: 140 [2024-10-12 18:18:18,648 INFO L226 Difference]: Without dead ends: 135 [2024-10-12 18:18:18,648 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-12 18:18:18,650 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 128 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 18:18:18,652 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 288 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 18:18:18,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-10-12 18:18:18,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 87. [2024-10-12 18:18:18,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 71 states have (on average 1.323943661971831) internal successors, (94), 84 states have internal predecessors, (94), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 18:18:18,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 110 transitions. [2024-10-12 18:18:18,668 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 110 transitions. Word has length 13 [2024-10-12 18:18:18,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:18:18,668 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 110 transitions. [2024-10-12 18:18:18,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:18:18,669 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 110 transitions. [2024-10-12 18:18:18,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-12 18:18:18,669 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:18:18,670 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:18:18,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 18:18:18,670 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:18:18,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:18:18,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1873104053, now seen corresponding path program 1 times [2024-10-12 18:18:18,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:18:18,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204105174] [2024-10-12 18:18:18,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:18:18,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:18:18,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:18:18,880 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 18:18:18,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:18:18,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204105174] [2024-10-12 18:18:18,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204105174] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:18:18,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:18:18,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 18:18:18,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83486392] [2024-10-12 18:18:18,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:18:18,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 18:18:18,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:18:18,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 18:18:18,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 18:18:18,883 INFO L87 Difference]: Start difference. First operand 87 states and 110 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:18:19,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:18:19,128 INFO L93 Difference]: Finished difference Result 89 states and 111 transitions. [2024-10-12 18:18:19,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 18:18:19,129 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-10-12 18:18:19,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:18:19,131 INFO L225 Difference]: With dead ends: 89 [2024-10-12 18:18:19,131 INFO L226 Difference]: Without dead ends: 86 [2024-10-12 18:18:19,131 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-12 18:18:19,136 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 12 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 18:18:19,136 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 292 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 18:18:19,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-12 18:18:19,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-10-12 18:18:19,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 71 states have (on average 1.3098591549295775) internal successors, (93), 83 states have internal predecessors, (93), 13 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 18:18:19,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 108 transitions. [2024-10-12 18:18:19,156 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 108 transitions. Word has length 20 [2024-10-12 18:18:19,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:18:19,156 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 108 transitions. [2024-10-12 18:18:19,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:18:19,157 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 108 transitions. [2024-10-12 18:18:19,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-12 18:18:19,157 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:18:19,157 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:18:19,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 18:18:19,158 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:18:19,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:18:19,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1547688063, now seen corresponding path program 1 times [2024-10-12 18:18:19,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:18:19,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778760813] [2024-10-12 18:18:19,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:18:19,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:18:19,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:18:19,337 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 18:18:19,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:18:19,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778760813] [2024-10-12 18:18:19,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778760813] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:18:19,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:18:19,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 18:18:19,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625790157] [2024-10-12 18:18:19,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:18:19,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 18:18:19,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:18:19,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 18:18:19,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 18:18:19,342 INFO L87 Difference]: Start difference. First operand 86 states and 108 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:18:19,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:18:19,565 INFO L93 Difference]: Finished difference Result 88 states and 109 transitions. [2024-10-12 18:18:19,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 18:18:19,566 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-10-12 18:18:19,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:18:19,567 INFO L225 Difference]: With dead ends: 88 [2024-10-12 18:18:19,567 INFO L226 Difference]: Without dead ends: 85 [2024-10-12 18:18:19,568 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-12 18:18:19,569 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 12 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 18:18:19,569 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 286 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 18:18:19,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-12 18:18:19,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-10-12 18:18:19,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 71 states have (on average 1.295774647887324) internal successors, (92), 82 states have internal predecessors, (92), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 18:18:19,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 106 transitions. [2024-10-12 18:18:19,588 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 106 transitions. Word has length 20 [2024-10-12 18:18:19,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:18:19,588 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 106 transitions. [2024-10-12 18:18:19,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:18:19,591 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 106 transitions. [2024-10-12 18:18:19,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-12 18:18:19,593 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:18:19,593 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:18:19,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 18:18:19,594 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:18:19,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:18:19,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1608452687, now seen corresponding path program 1 times [2024-10-12 18:18:19,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:18:19,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771492755] [2024-10-12 18:18:19,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:18:19,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:18:19,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:18:19,813 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:18:19,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:18:19,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771492755] [2024-10-12 18:18:19,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771492755] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:18:19,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:18:19,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 18:18:19,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328634683] [2024-10-12 18:18:19,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:18:19,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 18:18:19,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:18:19,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 18:18:19,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 18:18:19,819 INFO L87 Difference]: Start difference. First operand 85 states and 106 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:18:20,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:18:20,119 INFO L93 Difference]: Finished difference Result 135 states and 164 transitions. [2024-10-12 18:18:20,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 18:18:20,120 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-10-12 18:18:20,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:18:20,122 INFO L225 Difference]: With dead ends: 135 [2024-10-12 18:18:20,122 INFO L226 Difference]: Without dead ends: 132 [2024-10-12 18:18:20,122 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-12 18:18:20,124 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 109 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 18:18:20,124 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 300 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 18:18:20,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-10-12 18:18:20,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 91. [2024-10-12 18:18:20,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 77 states have (on average 1.2727272727272727) internal successors, (98), 88 states have internal predecessors, (98), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 18:18:20,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 112 transitions. [2024-10-12 18:18:20,149 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 112 transitions. Word has length 23 [2024-10-12 18:18:20,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:18:20,150 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 112 transitions. [2024-10-12 18:18:20,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:18:20,150 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 112 transitions. [2024-10-12 18:18:20,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-12 18:18:20,151 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:18:20,152 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:18:20,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 18:18:20,152 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:18:20,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:18:20,153 INFO L85 PathProgramCache]: Analyzing trace with hash -821516206, now seen corresponding path program 1 times [2024-10-12 18:18:20,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:18:20,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679199753] [2024-10-12 18:18:20,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:18:20,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:18:20,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:18:20,341 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:18:20,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:18:20,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679199753] [2024-10-12 18:18:20,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679199753] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:18:20,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:18:20,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 18:18:20,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884796785] [2024-10-12 18:18:20,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:18:20,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 18:18:20,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:18:20,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 18:18:20,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 18:18:20,345 INFO L87 Difference]: Start difference. First operand 91 states and 112 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:18:20,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:18:20,608 INFO L93 Difference]: Finished difference Result 134 states and 162 transitions. [2024-10-12 18:18:20,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 18:18:20,610 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-10-12 18:18:20,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:18:20,611 INFO L225 Difference]: With dead ends: 134 [2024-10-12 18:18:20,611 INFO L226 Difference]: Without dead ends: 131 [2024-10-12 18:18:20,612 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-12 18:18:20,613 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 107 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 18:18:20,613 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 300 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 18:18:20,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-10-12 18:18:20,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 97. [2024-10-12 18:18:20,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 83 states have (on average 1.2530120481927711) internal successors, (104), 94 states have internal predecessors, (104), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 18:18:20,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 118 transitions. [2024-10-12 18:18:20,643 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 118 transitions. Word has length 23 [2024-10-12 18:18:20,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:18:20,643 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 118 transitions. [2024-10-12 18:18:20,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:18:20,644 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 118 transitions. [2024-10-12 18:18:20,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-12 18:18:20,645 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:18:20,645 INFO L215 NwaCegarLoop]: trace histogram [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-10-12 18:18:20,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 18:18:20,645 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:18:20,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:18:20,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1369779320, now seen corresponding path program 1 times [2024-10-12 18:18:20,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:18:20,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106912591] [2024-10-12 18:18:20,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:18:20,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:18:20,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:18:21,058 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:18:21,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:18:21,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106912591] [2024-10-12 18:18:21,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106912591] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:18:21,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:18:21,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 18:18:21,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229948229] [2024-10-12 18:18:21,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:18:21,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 18:18:21,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:18:21,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 18:18:21,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 18:18:21,060 INFO L87 Difference]: Start difference. First operand 97 states and 118 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:18:21,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:18:21,393 INFO L93 Difference]: Finished difference Result 133 states and 160 transitions. [2024-10-12 18:18:21,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 18:18:21,394 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-10-12 18:18:21,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:18:21,395 INFO L225 Difference]: With dead ends: 133 [2024-10-12 18:18:21,395 INFO L226 Difference]: Without dead ends: 130 [2024-10-12 18:18:21,395 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-10-12 18:18:21,396 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 103 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 18:18:21,396 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 351 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 18:18:21,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-10-12 18:18:21,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 100. [2024-10-12 18:18:21,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 86 states have (on average 1.244186046511628) internal successors, (107), 97 states have internal predecessors, (107), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 18:18:21,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 121 transitions. [2024-10-12 18:18:21,412 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 121 transitions. Word has length 26 [2024-10-12 18:18:21,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:18:21,412 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 121 transitions. [2024-10-12 18:18:21,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:18:21,413 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 121 transitions. [2024-10-12 18:18:21,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-12 18:18:21,413 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:18:21,414 INFO L215 NwaCegarLoop]: trace histogram [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-10-12 18:18:21,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 18:18:21,414 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:18:21,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:18:21,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1171618610, now seen corresponding path program 1 times [2024-10-12 18:18:21,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:18:21,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386215285] [2024-10-12 18:18:21,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:18:21,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:18:21,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:18:21,734 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:18:21,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:18:21,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386215285] [2024-10-12 18:18:21,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386215285] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:18:21,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:18:21,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 18:18:21,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524538736] [2024-10-12 18:18:21,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:18:21,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 18:18:21,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:18:21,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 18:18:21,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 18:18:21,737 INFO L87 Difference]: Start difference. First operand 100 states and 121 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:18:22,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:18:22,056 INFO L93 Difference]: Finished difference Result 132 states and 158 transitions. [2024-10-12 18:18:22,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 18:18:22,056 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-10-12 18:18:22,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:18:22,060 INFO L225 Difference]: With dead ends: 132 [2024-10-12 18:18:22,060 INFO L226 Difference]: Without dead ends: 129 [2024-10-12 18:18:22,061 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-10-12 18:18:22,063 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 101 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 18:18:22,063 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 351 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 18:18:22,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-10-12 18:18:22,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 103. [2024-10-12 18:18:22,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 89 states have (on average 1.2359550561797752) internal successors, (110), 100 states have internal predecessors, (110), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 18:18:22,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 124 transitions. [2024-10-12 18:18:22,078 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 124 transitions. Word has length 26 [2024-10-12 18:18:22,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:18:22,079 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 124 transitions. [2024-10-12 18:18:22,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:18:22,079 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 124 transitions. [2024-10-12 18:18:22,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-12 18:18:22,083 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:18:22,083 INFO L215 NwaCegarLoop]: trace histogram [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-10-12 18:18:22,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 18:18:22,084 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:18:22,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:18:22,084 INFO L85 PathProgramCache]: Analyzing trace with hash -966307393, now seen corresponding path program 1 times [2024-10-12 18:18:22,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:18:22,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9523283] [2024-10-12 18:18:22,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:18:22,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:18:22,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:18:22,232 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 18:18:22,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:18:22,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9523283] [2024-10-12 18:18:22,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9523283] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:18:22,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [351695658] [2024-10-12 18:18:22,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:18:22,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:18:22,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:18:22,235 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 18:18:22,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 18:18:22,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:18:22,356 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-12 18:18:22,361 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:18:22,500 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 31 treesize of output 19 [2024-10-12 18:18:22,506 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 25 treesize of output 13 [2024-10-12 18:18:22,532 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 18:18:22,533 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 18:18:22,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [351695658] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:18:22,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 18:18:22,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2024-10-12 18:18:22,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987108874] [2024-10-12 18:18:22,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:18:22,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 18:18:22,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:18:22,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 18:18:22,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 18:18:22,535 INFO L87 Difference]: Start difference. First operand 103 states and 124 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, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:18:22,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:18:22,681 INFO L93 Difference]: Finished difference Result 105 states and 125 transitions. [2024-10-12 18:18:22,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 18:18:22,682 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, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-10-12 18:18:22,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:18:22,683 INFO L225 Difference]: With dead ends: 105 [2024-10-12 18:18:22,683 INFO L226 Difference]: Without dead ends: 101 [2024-10-12 18:18:22,683 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-12 18:18:22,684 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 31 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:18:22,684 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 253 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 18:18:22,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-12 18:18:22,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-10-12 18:18:22,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 89 states have (on average 1.2134831460674158) internal successors, (108), 98 states have internal predecessors, (108), 10 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 18:18:22,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 120 transitions. [2024-10-12 18:18:22,699 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 120 transitions. Word has length 31 [2024-10-12 18:18:22,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:18:22,699 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 120 transitions. [2024-10-12 18:18:22,699 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, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:18:22,700 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 120 transitions. [2024-10-12 18:18:22,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-12 18:18:22,701 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:18:22,702 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:18:22,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-12 18:18:22,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-12 18:18:22,903 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:18:22,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:18:22,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1706939001, now seen corresponding path program 1 times [2024-10-12 18:18:22,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:18:22,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532140120] [2024-10-12 18:18:22,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:18:22,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:18:22,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:18:22,990 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:18:22,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:18:22,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532140120] [2024-10-12 18:18:22,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532140120] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:18:22,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:18:22,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 18:18:22,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237850116] [2024-10-12 18:18:22,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:18:22,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 18:18:22,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:18:22,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 18:18:22,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 18:18:22,992 INFO L87 Difference]: Start difference. First operand 101 states and 120 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:18:23,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:18:23,138 INFO L93 Difference]: Finished difference Result 123 states and 146 transitions. [2024-10-12 18:18:23,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 18:18:23,139 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-10-12 18:18:23,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:18:23,142 INFO L225 Difference]: With dead ends: 123 [2024-10-12 18:18:23,142 INFO L226 Difference]: Without dead ends: 120 [2024-10-12 18:18:23,142 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-12 18:18:23,143 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 101 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:18:23,145 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 335 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 18:18:23,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-10-12 18:18:23,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 105. [2024-10-12 18:18:23,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 93 states have (on average 1.2150537634408602) internal successors, (113), 102 states have internal predecessors, (113), 10 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 18:18:23,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 125 transitions. [2024-10-12 18:18:23,158 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 125 transitions. Word has length 32 [2024-10-12 18:18:23,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:18:23,158 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 125 transitions. [2024-10-12 18:18:23,158 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:18:23,159 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 125 transitions. [2024-10-12 18:18:23,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-12 18:18:23,160 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:18:23,160 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:18:23,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 18:18:23,161 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:18:23,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:18:23,161 INFO L85 PathProgramCache]: Analyzing trace with hash -999493465, now seen corresponding path program 1 times [2024-10-12 18:18:23,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:18:23,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145183550] [2024-10-12 18:18:23,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:18:23,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:18:23,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:18:23,620 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:18:23,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:18:23,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145183550] [2024-10-12 18:18:23,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145183550] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:18:23,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1387378228] [2024-10-12 18:18:23,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:18:23,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:18:23,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:18:23,624 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-10-12 18:18:23,626 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-10-12 18:18:23,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:18:23,746 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-12 18:18:23,750 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:18:23,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-10-12 18:18:23,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-10-12 18:18:24,041 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:18:24,042 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:18:24,239 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:18:24,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1387378228] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 18:18:24,239 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 18:18:24,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 10 [2024-10-12 18:18:24,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325723055] [2024-10-12 18:18:24,240 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 18:18:24,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-12 18:18:24,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:18:24,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-12 18:18:24,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-10-12 18:18:24,241 INFO L87 Difference]: Start difference. First operand 105 states and 125 transitions. Second operand has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 10 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:18:24,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:18:24,584 INFO L93 Difference]: Finished difference Result 189 states and 219 transitions. [2024-10-12 18:18:24,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 18:18:24,584 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 10 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-10-12 18:18:24,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:18:24,586 INFO L225 Difference]: With dead ends: 189 [2024-10-12 18:18:24,586 INFO L226 Difference]: Without dead ends: 186 [2024-10-12 18:18:24,587 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2024-10-12 18:18:24,587 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 49 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 18:18:24,588 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 392 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 18:18:24,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-10-12 18:18:24,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 169. [2024-10-12 18:18:24,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 157 states have (on average 1.178343949044586) internal successors, (185), 166 states have internal predecessors, (185), 10 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 18:18:24,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 197 transitions. [2024-10-12 18:18:24,610 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 197 transitions. Word has length 35 [2024-10-12 18:18:24,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:18:24,611 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 197 transitions. [2024-10-12 18:18:24,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 10 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:18:24,611 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 197 transitions. [2024-10-12 18:18:24,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-12 18:18:24,612 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:18:24,612 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:18:24,634 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-12 18:18:24,812 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,SelfDestructingSolverStorable11 [2024-10-12 18:18:24,813 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:18:24,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:18:24,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1980957507, now seen corresponding path program 1 times [2024-10-12 18:18:24,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:18:24,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887284602] [2024-10-12 18:18:24,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:18:24,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:18:24,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:18:24,900 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:18:24,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:18:24,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887284602] [2024-10-12 18:18:24,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887284602] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:18:24,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:18:24,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 18:18:24,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089141497] [2024-10-12 18:18:24,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:18:24,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 18:18:24,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:18:24,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 18:18:24,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 18:18:24,902 INFO L87 Difference]: Start difference. First operand 169 states and 197 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:18:25,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:18:25,085 INFO L93 Difference]: Finished difference Result 233 states and 285 transitions. [2024-10-12 18:18:25,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 18:18:25,085 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2024-10-12 18:18:25,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:18:25,087 INFO L225 Difference]: With dead ends: 233 [2024-10-12 18:18:25,087 INFO L226 Difference]: Without dead ends: 196 [2024-10-12 18:18:25,087 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-12 18:18:25,088 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 106 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:18:25,088 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 340 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 18:18:25,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-10-12 18:18:25,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 170. [2024-10-12 18:18:25,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 158 states have (on average 1.1772151898734178) internal successors, (186), 167 states have internal predecessors, (186), 10 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 18:18:25,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 198 transitions. [2024-10-12 18:18:25,108 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 198 transitions. Word has length 36 [2024-10-12 18:18:25,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:18:25,108 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 198 transitions. [2024-10-12 18:18:25,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:18:25,109 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 198 transitions. [2024-10-12 18:18:25,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-12 18:18:25,109 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:18:25,110 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] [2024-10-12 18:18:25,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 18:18:25,110 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:18:25,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:18:25,111 INFO L85 PathProgramCache]: Analyzing trace with hash 673228556, now seen corresponding path program 1 times [2024-10-12 18:18:25,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:18:25,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144805252] [2024-10-12 18:18:25,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:18:25,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:18:25,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:18:25,418 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-12 18:18:25,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:18:25,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144805252] [2024-10-12 18:18:25,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144805252] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:18:25,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1130652716] [2024-10-12 18:18:25,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:18:25,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:18:25,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:18:25,421 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-10-12 18:18:25,422 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-10-12 18:18:25,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:18:25,545 INFO L255 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-12 18:18:25,548 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:18:25,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-10-12 18:18:25,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-10-12 18:18:25,675 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-12 18:18:25,675 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:18:25,769 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-12 18:18:25,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1130652716] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 18:18:25,770 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 18:18:25,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 12 [2024-10-12 18:18:25,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667614691] [2024-10-12 18:18:25,770 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 18:18:25,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-12 18:18:25,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:18:25,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-12 18:18:25,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-10-12 18:18:25,772 INFO L87 Difference]: Start difference. First operand 170 states and 198 transitions. Second operand has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 12 states have internal predecessors, (55), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:18:26,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:18:26,188 INFO L93 Difference]: Finished difference Result 234 states and 277 transitions. [2024-10-12 18:18:26,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 18:18:26,189 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 12 states have internal predecessors, (55), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-10-12 18:18:26,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:18:26,190 INFO L225 Difference]: With dead ends: 234 [2024-10-12 18:18:26,190 INFO L226 Difference]: Without dead ends: 149 [2024-10-12 18:18:26,191 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2024-10-12 18:18:26,192 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 49 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 18:18:26,192 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 679 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 18:18:26,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-10-12 18:18:26,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 136. [2024-10-12 18:18:26,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 124 states have (on average 1.1774193548387097) internal successors, (146), 133 states have internal predecessors, (146), 10 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 18:18:26,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 158 transitions. [2024-10-12 18:18:26,203 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 158 transitions. Word has length 37 [2024-10-12 18:18:26,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:18:26,204 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 158 transitions. [2024-10-12 18:18:26,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 12 states have internal predecessors, (55), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:18:26,204 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 158 transitions. [2024-10-12 18:18:26,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-12 18:18:26,205 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:18:26,205 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:18:26,225 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-12 18:18:26,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:18:26,406 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:18:26,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:18:26,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1292117105, now seen corresponding path program 1 times [2024-10-12 18:18:26,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:18:26,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737733231] [2024-10-12 18:18:26,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:18:26,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:18:26,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:18:26,547 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 18:18:26,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:18:26,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737733231] [2024-10-12 18:18:26,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737733231] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:18:26,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:18:26,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 18:18:26,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321113282] [2024-10-12 18:18:26,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:18:26,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 18:18:26,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:18:26,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 18:18:26,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-12 18:18:26,550 INFO L87 Difference]: Start difference. First operand 136 states and 158 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:18:26,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:18:26,752 INFO L93 Difference]: Finished difference Result 232 states and 292 transitions. [2024-10-12 18:18:26,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 18:18:26,753 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-10-12 18:18:26,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:18:26,754 INFO L225 Difference]: With dead ends: 232 [2024-10-12 18:18:26,755 INFO L226 Difference]: Without dead ends: 195 [2024-10-12 18:18:26,756 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-10-12 18:18:26,758 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 154 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 18:18:26,758 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 575 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 18:18:26,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-10-12 18:18:26,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 149. [2024-10-12 18:18:26,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 135 states have (on average 1.2148148148148148) internal successors, (164), 146 states have internal predecessors, (164), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-12 18:18:26,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 180 transitions. [2024-10-12 18:18:26,774 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 180 transitions. Word has length 37 [2024-10-12 18:18:26,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:18:26,774 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 180 transitions. [2024-10-12 18:18:26,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:18:26,775 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 180 transitions. [2024-10-12 18:18:26,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-12 18:18:26,776 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:18:26,776 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:18:26,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 18:18:26,777 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:18:26,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:18:26,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1106335398, now seen corresponding path program 1 times [2024-10-12 18:18:26,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:18:26,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468549466] [2024-10-12 18:18:26,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:18:26,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:18:26,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:18:26,930 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:18:26,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:18:26,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468549466] [2024-10-12 18:18:26,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468549466] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:18:26,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:18:26,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 18:18:26,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673843439] [2024-10-12 18:18:26,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:18:26,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 18:18:26,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:18:26,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 18:18:26,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 18:18:26,933 INFO L87 Difference]: Start difference. First operand 149 states and 180 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:18:27,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:18:27,155 INFO L93 Difference]: Finished difference Result 174 states and 208 transitions. [2024-10-12 18:18:27,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 18:18:27,156 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2024-10-12 18:18:27,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:18:27,157 INFO L225 Difference]: With dead ends: 174 [2024-10-12 18:18:27,158 INFO L226 Difference]: Without dead ends: 171 [2024-10-12 18:18:27,158 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-10-12 18:18:27,159 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 66 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 18:18:27,159 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 356 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 18:18:27,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-10-12 18:18:27,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 159. [2024-10-12 18:18:27,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 145 states have (on average 1.2137931034482758) internal successors, (176), 156 states have internal predecessors, (176), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-12 18:18:27,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 192 transitions. [2024-10-12 18:18:27,173 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 192 transitions. Word has length 38 [2024-10-12 18:18:27,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:18:27,173 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 192 transitions. [2024-10-12 18:18:27,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:18:27,174 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 192 transitions. [2024-10-12 18:18:27,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-12 18:18:27,174 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:18:27,174 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:18:27,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 18:18:27,175 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:18:27,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:18:27,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1970255919, now seen corresponding path program 1 times [2024-10-12 18:18:27,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:18:27,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537792428] [2024-10-12 18:18:27,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:18:27,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:18:27,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:18:27,458 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:18:27,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:18:27,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537792428] [2024-10-12 18:18:27,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537792428] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:18:27,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1057160532] [2024-10-12 18:18:27,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:18:27,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:18:27,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:18:27,463 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-10-12 18:18:27,464 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-10-12 18:18:27,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:18:27,596 INFO L255 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-12 18:18:27,599 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:18:27,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-10-12 18:18:27,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-10-12 18:18:27,784 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:18:27,784 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:18:27,909 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:18:27,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1057160532] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 18:18:27,909 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 18:18:27,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 4] total 9 [2024-10-12 18:18:27,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653262743] [2024-10-12 18:18:27,910 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 18:18:27,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 18:18:27,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:18:27,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 18:18:27,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-10-12 18:18:27,912 INFO L87 Difference]: Start difference. First operand 159 states and 192 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 9 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:18:28,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:18:28,087 INFO L93 Difference]: Finished difference Result 226 states and 282 transitions. [2024-10-12 18:18:28,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 18:18:28,088 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 9 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2024-10-12 18:18:28,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:18:28,089 INFO L225 Difference]: With dead ends: 226 [2024-10-12 18:18:28,089 INFO L226 Difference]: Without dead ends: 171 [2024-10-12 18:18:28,090 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-10-12 18:18:28,090 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 38 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:18:28,091 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 369 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 18:18:28,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-10-12 18:18:28,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 159. [2024-10-12 18:18:28,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 145 states have (on average 1.206896551724138) internal successors, (175), 156 states have internal predecessors, (175), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-12 18:18:28,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 191 transitions. [2024-10-12 18:18:28,107 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 191 transitions. Word has length 40 [2024-10-12 18:18:28,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:18:28,107 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 191 transitions. [2024-10-12 18:18:28,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 9 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:18:28,108 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 191 transitions. [2024-10-12 18:18:28,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-12 18:18:28,108 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:18:28,109 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:18:28,129 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-12 18:18:28,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-12 18:18:28,309 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:18:28,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:18:28,310 INFO L85 PathProgramCache]: Analyzing trace with hash 605961040, now seen corresponding path program 2 times [2024-10-12 18:18:28,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:18:28,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423318246] [2024-10-12 18:18:28,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:18:28,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:18:28,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:18:29,019 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:18:29,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:18:29,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423318246] [2024-10-12 18:18:29,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423318246] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:18:29,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1227278030] [2024-10-12 18:18:29,020 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 18:18:29,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:18:29,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:18:29,022 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-10-12 18:18:29,026 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-10-12 18:18:29,140 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-12 18:18:29,141 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 18:18:29,142 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-12 18:18:29,144 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:18:29,225 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-12 18:18:29,226 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 18:18:29,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1227278030] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:18:29,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 18:18:29,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 16 [2024-10-12 18:18:29,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313514904] [2024-10-12 18:18:29,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:18:29,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 18:18:29,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:18:29,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 18:18:29,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2024-10-12 18:18:29,228 INFO L87 Difference]: Start difference. First operand 159 states and 191 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:18:29,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:18:29,474 INFO L93 Difference]: Finished difference Result 161 states and 192 transitions. [2024-10-12 18:18:29,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 18:18:29,475 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-10-12 18:18:29,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:18:29,476 INFO L225 Difference]: With dead ends: 161 [2024-10-12 18:18:29,476 INFO L226 Difference]: Without dead ends: 158 [2024-10-12 18:18:29,477 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2024-10-12 18:18:29,477 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 25 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 18:18:29,477 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 320 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 18:18:29,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-10-12 18:18:29,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 153. [2024-10-12 18:18:29,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 140 states have (on average 1.2) internal successors, (168), 150 states have internal predecessors, (168), 11 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-12 18:18:29,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 183 transitions. [2024-10-12 18:18:29,519 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 183 transitions. Word has length 41 [2024-10-12 18:18:29,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:18:29,519 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 183 transitions. [2024-10-12 18:18:29,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:18:29,519 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 183 transitions. [2024-10-12 18:18:29,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-12 18:18:29,520 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:18:29,520 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:18:29,539 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-12 18:18:29,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-12 18:18:29,721 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:18:29,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:18:29,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1621748597, now seen corresponding path program 2 times [2024-10-12 18:18:29,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:18:29,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653890646] [2024-10-12 18:18:29,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:18:29,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:18:29,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:18:30,379 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:18:30,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:18:30,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653890646] [2024-10-12 18:18:30,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653890646] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:18:30,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1058029699] [2024-10-12 18:18:30,380 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 18:18:30,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:18:30,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:18:30,383 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-10-12 18:18:30,384 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-10-12 18:18:30,523 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-12 18:18:30,523 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 18:18:30,526 INFO L255 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-10-12 18:18:30,529 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:18:30,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-10-12 18:18:30,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 1 [2024-10-12 18:18:30,636 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-12 18:18:30,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 17 treesize of output 21 [2024-10-12 18:18:30,702 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-10-12 18:18:30,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-10-12 18:18:30,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2024-10-12 18:18:30,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-10-12 18:18:30,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 16 [2024-10-12 18:18:31,065 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-10-12 18:18:31,263 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-12 18:18:31,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 23 [2024-10-12 18:18:31,271 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:18:31,271 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:18:31,410 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~item~0#1.base_20| Int) (v_ArrVal_679 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_20|) 0)) (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~node~1#1.base| v_ArrVal_679))) (store .cse0 |v_ULTIMATE.start_main_~item~0#1.base_20| (store (store (select .cse0 |v_ULTIMATE.start_main_~item~0#1.base_20|) 0 |c_ULTIMATE.start_main_~node~1#1.base|) 4 |c_ULTIMATE.start_main_~data~0#1.base|))) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|) 0)))) is different from false [2024-10-12 18:18:31,507 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:18:31,507 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 44 [2024-10-12 18:18:31,516 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-12 18:18:31,525 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:18:31,526 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 81 treesize of output 81 [2024-10-12 18:18:31,534 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 66 treesize of output 64 [2024-10-12 18:18:31,588 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 76 treesize of output 70 [2024-10-12 18:18:31,847 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-10-12 18:18:31,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1058029699] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 18:18:31,848 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 18:18:31,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 26 [2024-10-12 18:18:31,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773544220] [2024-10-12 18:18:31,848 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 18:18:31,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-12 18:18:31,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:18:31,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-12 18:18:31,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=528, Unknown=1, NotChecked=46, Total=650 [2024-10-12 18:18:31,850 INFO L87 Difference]: Start difference. First operand 153 states and 183 transitions. Second operand has 26 states, 26 states have (on average 4.115384615384615) internal successors, (107), 26 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:18:33,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:18:33,217 INFO L93 Difference]: Finished difference Result 213 states and 249 transitions. [2024-10-12 18:18:33,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 18:18:33,217 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.115384615384615) internal successors, (107), 26 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2024-10-12 18:18:33,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:18:33,219 INFO L225 Difference]: With dead ends: 213 [2024-10-12 18:18:33,219 INFO L226 Difference]: Without dead ends: 210 [2024-10-12 18:18:33,220 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=193, Invalid=1000, Unknown=1, NotChecked=66, Total=1260 [2024-10-12 18:18:33,221 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 391 mSDsluCounter, 1250 mSDsCounter, 0 mSdLazyCounter, 991 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 1351 SdHoareTripleChecker+Invalid, 1175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 991 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 181 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 18:18:33,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 1351 Invalid, 1175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 991 Invalid, 0 Unknown, 181 Unchecked, 0.8s Time] [2024-10-12 18:18:33,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-10-12 18:18:33,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 164. [2024-10-12 18:18:33,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 151 states have (on average 1.1920529801324504) internal successors, (180), 161 states have internal predecessors, (180), 11 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-12 18:18:33,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 195 transitions. [2024-10-12 18:18:33,249 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 195 transitions. Word has length 43 [2024-10-12 18:18:33,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:18:33,249 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 195 transitions. [2024-10-12 18:18:33,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.115384615384615) internal successors, (107), 26 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:18:33,250 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 195 transitions. [2024-10-12 18:18:33,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-12 18:18:33,250 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:18:33,251 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2024-10-12 18:18:33,270 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-12 18:18:33,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:18:33,452 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:18:33,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:18:33,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1886282218, now seen corresponding path program 1 times [2024-10-12 18:18:33,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:18:33,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594499092] [2024-10-12 18:18:33,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:18:33,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:18:33,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:18:34,123 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:18:34,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:18:34,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594499092] [2024-10-12 18:18:34,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594499092] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:18:34,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [914477912] [2024-10-12 18:18:34,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:18:34,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:18:34,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:18:34,126 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-10-12 18:18:34,128 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-10-12 18:18:34,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:18:34,289 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-10-12 18:18:34,293 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:18:34,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-10-12 18:18:34,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 1 [2024-10-12 18:18:34,379 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-12 18:18:34,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 19 treesize of output 16 [2024-10-12 18:18:34,429 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-12 18:18:34,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-12 18:18:34,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2024-10-12 18:18:34,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-10-12 18:18:34,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 16 [2024-10-12 18:18:34,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-10-12 18:18:34,855 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-12 18:18:34,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 19 [2024-10-12 18:18:34,863 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:18:34,864 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:18:35,002 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~item~0#1.base_24| Int) (v_ArrVal_782 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_24|) 0)) (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~node~1#1.base| v_ArrVal_782))) (store .cse0 |v_ULTIMATE.start_main_~item~0#1.base_24| (store (store (select .cse0 |v_ULTIMATE.start_main_~item~0#1.base_24|) 0 |c_ULTIMATE.start_main_~node~1#1.base|) 4 |c_ULTIMATE.start_main_~data~0#1.base|))) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|) 0)))) is different from false [2024-10-12 18:18:35,037 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~node~1#1.base_25| Int) (v_ArrVal_781 Int) (|v_ULTIMATE.start_main_~item~0#1.base_24| Int) (v_ArrVal_782 (Array Int Int))) (or (not (= (select (store |c_#valid| |v_ULTIMATE.start_main_~node~1#1.base_25| v_ArrVal_781) |v_ULTIMATE.start_main_~item~0#1.base_24|) 0)) (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_main_~node~1#1.base_25| v_ArrVal_782))) (store .cse0 |v_ULTIMATE.start_main_~item~0#1.base_24| (store (store (select .cse0 |v_ULTIMATE.start_main_~item~0#1.base_24|) 0 |v_ULTIMATE.start_main_~node~1#1.base_25|) 4 |c_ULTIMATE.start_main_~data~0#1.base|))) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~node~1#1.base_25|) 0)))) is different from false [2024-10-12 18:18:35,066 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:18:35,067 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 44 [2024-10-12 18:18:35,080 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:18:35,083 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 159 treesize of output 157 [2024-10-12 18:18:35,098 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 330 treesize of output 318 [2024-10-12 18:18:35,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 91 treesize of output 85 [2024-10-12 18:18:35,512 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-10-12 18:18:35,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [914477912] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 18:18:35,512 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 18:18:35,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 26 [2024-10-12 18:18:35,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045995919] [2024-10-12 18:18:35,513 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 18:18:35,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-12 18:18:35,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:18:35,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-12 18:18:35,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=485, Unknown=2, NotChecked=90, Total=650 [2024-10-12 18:18:35,514 INFO L87 Difference]: Start difference. First operand 164 states and 195 transitions. Second operand has 26 states, 26 states have (on average 4.115384615384615) internal successors, (107), 26 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:18:36,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:18:36,781 INFO L93 Difference]: Finished difference Result 212 states and 247 transitions. [2024-10-12 18:18:36,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-12 18:18:36,782 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.115384615384615) internal successors, (107), 26 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2024-10-12 18:18:36,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:18:36,783 INFO L225 Difference]: With dead ends: 212 [2024-10-12 18:18:36,783 INFO L226 Difference]: Without dead ends: 209 [2024-10-12 18:18:36,784 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=189, Invalid=1007, Unknown=2, NotChecked=134, Total=1332 [2024-10-12 18:18:36,785 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 380 mSDsluCounter, 1345 mSDsCounter, 0 mSdLazyCounter, 1059 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 1445 SdHoareTripleChecker+Invalid, 1420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1059 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 358 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 18:18:36,785 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 1445 Invalid, 1420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1059 Invalid, 0 Unknown, 358 Unchecked, 0.8s Time] [2024-10-12 18:18:36,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-10-12 18:18:36,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 171. [2024-10-12 18:18:36,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 158 states have (on average 1.1835443037974684) internal successors, (187), 168 states have internal predecessors, (187), 11 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-12 18:18:36,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 202 transitions. [2024-10-12 18:18:36,808 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 202 transitions. Word has length 43 [2024-10-12 18:18:36,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:18:36,808 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 202 transitions. [2024-10-12 18:18:36,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.115384615384615) internal successors, (107), 26 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:18:36,809 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 202 transitions. [2024-10-12 18:18:36,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-12 18:18:36,809 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:18:36,809 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:18:36,829 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-12 18:18:37,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:18:37,014 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:18:37,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:18:37,014 INFO L85 PathProgramCache]: Analyzing trace with hash -319946798, now seen corresponding path program 1 times [2024-10-12 18:18:37,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:18:37,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104004933] [2024-10-12 18:18:37,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:18:37,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:18:37,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:18:37,090 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 18:18:37,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:18:37,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104004933] [2024-10-12 18:18:37,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104004933] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:18:37,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:18:37,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 18:18:37,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609393720] [2024-10-12 18:18:37,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:18:37,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 18:18:37,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:18:37,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 18:18:37,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 18:18:37,092 INFO L87 Difference]: Start difference. First operand 171 states and 202 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:18:37,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:18:37,209 INFO L93 Difference]: Finished difference Result 173 states and 203 transitions. [2024-10-12 18:18:37,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 18:18:37,211 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2024-10-12 18:18:37,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:18:37,212 INFO L225 Difference]: With dead ends: 173 [2024-10-12 18:18:37,212 INFO L226 Difference]: Without dead ends: 137 [2024-10-12 18:18:37,212 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-12 18:18:37,213 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 1 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:18:37,213 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 297 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 18:18:37,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-10-12 18:18:37,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2024-10-12 18:18:37,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 125 states have (on average 1.2) internal successors, (150), 134 states have internal predecessors, (150), 10 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-12 18:18:37,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 164 transitions. [2024-10-12 18:18:37,231 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 164 transitions. Word has length 44 [2024-10-12 18:18:37,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:18:37,231 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 164 transitions. [2024-10-12 18:18:37,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:18:37,232 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 164 transitions. [2024-10-12 18:18:37,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-12 18:18:37,232 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:18:37,233 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:18:37,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-12 18:18:37,233 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:18:37,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:18:37,233 INFO L85 PathProgramCache]: Analyzing trace with hash -741003212, now seen corresponding path program 1 times [2024-10-12 18:18:37,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:18:37,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180466645] [2024-10-12 18:18:37,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:18:37,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:18:37,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:18:38,686 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:18:38,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:18:38,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180466645] [2024-10-12 18:18:38,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180466645] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:18:38,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531671193] [2024-10-12 18:18:38,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:18:38,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:18:38,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:18:38,689 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-10-12 18:18:38,691 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-10-12 18:18:38,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:18:38,847 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-10-12 18:18:38,850 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:18:38,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-10-12 18:18:38,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-10-12 18:18:38,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-10-12 18:18:38,986 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-12 18:18:38,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 19 treesize of output 16 [2024-10-12 18:18:39,046 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 16 treesize of output 11 [2024-10-12 18:18:39,058 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-12 18:18:39,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-12 18:18:39,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-12 18:18:39,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 15 [2024-10-12 18:18:39,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2024-10-12 18:18:39,548 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:18:39,548 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:18:40,076 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:18:40,076 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 45 [2024-10-12 18:18:40,089 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:18:40,089 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 254 treesize of output 246 [2024-10-12 18:18:40,101 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 360 treesize of output 336 [2024-10-12 18:18:40,164 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 173 treesize of output 157 [2024-10-12 18:18:40,428 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:18:40,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 45 [2024-10-12 18:18:40,448 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:18:40,449 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 168 treesize of output 166 [2024-10-12 18:18:40,463 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 224 treesize of output 208 [2024-10-12 18:18:40,522 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 265 treesize of output 245 [2024-10-12 18:18:40,906 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:18:40,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1531671193] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 18:18:40,906 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 18:18:40,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 10] total 31 [2024-10-12 18:18:40,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183377507] [2024-10-12 18:18:40,906 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 18:18:40,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-10-12 18:18:40,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:18:40,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-10-12 18:18:40,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=854, Unknown=2, NotChecked=0, Total=930 [2024-10-12 18:18:40,908 INFO L87 Difference]: Start difference. First operand 137 states and 164 transitions. Second operand has 31 states, 31 states have (on average 3.935483870967742) internal successors, (122), 31 states have internal predecessors, (122), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:18:43,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:18:43,247 INFO L93 Difference]: Finished difference Result 290 states and 347 transitions. [2024-10-12 18:18:43,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-12 18:18:43,248 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 3.935483870967742) internal successors, (122), 31 states have internal predecessors, (122), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2024-10-12 18:18:43,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:18:43,249 INFO L225 Difference]: With dead ends: 290 [2024-10-12 18:18:43,249 INFO L226 Difference]: Without dead ends: 204 [2024-10-12 18:18:43,250 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=289, Invalid=2259, Unknown=2, NotChecked=0, Total=2550 [2024-10-12 18:18:43,251 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 589 mSDsluCounter, 1205 mSDsCounter, 0 mSdLazyCounter, 915 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 589 SdHoareTripleChecker+Valid, 1278 SdHoareTripleChecker+Invalid, 933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-12 18:18:43,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [589 Valid, 1278 Invalid, 933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 915 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 18:18:43,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-10-12 18:18:43,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 165. [2024-10-12 18:18:43,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 153 states have (on average 1.1764705882352942) internal successors, (180), 162 states have internal predecessors, (180), 10 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-12 18:18:43,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 194 transitions. [2024-10-12 18:18:43,277 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 194 transitions. Word has length 46 [2024-10-12 18:18:43,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:18:43,277 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 194 transitions. [2024-10-12 18:18:43,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.935483870967742) internal successors, (122), 31 states have internal predecessors, (122), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:18:43,278 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 194 transitions. [2024-10-12 18:18:43,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-12 18:18:43,278 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:18:43,279 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:18:43,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-12 18:18:43,482 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,SelfDestructingSolverStorable21 [2024-10-12 18:18:43,483 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:18:43,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:18:43,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1012566154, now seen corresponding path program 1 times [2024-10-12 18:18:43,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:18:43,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852211423] [2024-10-12 18:18:43,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:18:43,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:18:43,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:18:44,850 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:18:44,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:18:44,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852211423] [2024-10-12 18:18:44,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852211423] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:18:44,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [427880579] [2024-10-12 18:18:44,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:18:44,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:18:44,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:18:44,853 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-10-12 18:18:44,855 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-10-12 18:18:45,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:18:45,025 INFO L255 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 78 conjuncts are in the unsatisfiable core [2024-10-12 18:18:45,028 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:18:45,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-10-12 18:18:45,062 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-12 18:18:45,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 17 treesize of output 21 [2024-10-12 18:18:45,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-10-12 18:18:45,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-10-12 18:18:45,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 15 [2024-10-12 18:18:45,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2024-10-12 18:18:45,188 INFO L349 Elim1Store]: treesize reduction 52, result has 34.2 percent of original size [2024-10-12 18:18:45,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 36 [2024-10-12 18:18:45,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2024-10-12 18:18:45,266 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-10-12 18:18:45,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 49 [2024-10-12 18:18:45,282 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-10-12 18:18:45,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-10-12 18:18:45,376 INFO L349 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2024-10-12 18:18:45,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 97 treesize of output 52 [2024-10-12 18:18:45,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 47 [2024-10-12 18:18:46,249 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:18:46,250 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:18:59,236 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:18:59,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 9702094 treesize of output 9389241 [2024-10-12 18:19:00,605 INFO L349 Elim1Store]: treesize reduction 214, result has 44.1 percent of original size [2024-10-12 18:19:00,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 12 case distinctions, treesize of input 83909 treesize of output 24657 [2024-10-12 18:19:01,153 INFO L349 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2024-10-12 18:19:01,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 110291 treesize of output 106011 [2024-10-12 18:19:02,500 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:19:02,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 7677 treesize of output 6970 [2024-10-12 18:19:04,212 INFO L349 Elim1Store]: treesize reduction 38, result has 71.0 percent of original size [2024-10-12 18:19:04,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 99021 treesize of output 95395 [2024-10-12 18:19:05,305 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 6919 treesize of output 6427 [2024-10-12 18:19:05,536 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:19:05,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 6876 treesize of output 6648 [2024-10-12 18:19:05,887 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 6366 treesize of output 6266 [2024-10-12 18:19:06,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-10-12 18:19:06,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2024-10-12 18:19:06,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 64