./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a31fd051 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.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.graphml --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 a38de44f112a10364737c35b840e673503a211a020b9f494a50e4a32c8fe31c0 --- Real Ultimate output --- This is Ultimate 0.2.2-?-a31fd05 [2023-02-15 10:27:27,456 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 10:27:27,464 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 10:27:27,486 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 10:27:27,491 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 10:27:27,493 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 10:27:27,494 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 10:27:27,496 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 10:27:27,498 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 10:27:27,499 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 10:27:27,500 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 10:27:27,501 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 10:27:27,502 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 10:27:27,505 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 10:27:27,506 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 10:27:27,506 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 10:27:27,507 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 10:27:27,508 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 10:27:27,509 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 10:27:27,511 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 10:27:27,512 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 10:27:27,513 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 10:27:27,514 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 10:27:27,515 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 10:27:27,520 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 10:27:27,521 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 10:27:27,521 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 10:27:27,522 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 10:27:27,523 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 10:27:27,523 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 10:27:27,524 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 10:27:27,524 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 10:27:27,525 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 10:27:27,526 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 10:27:27,526 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 10:27:27,527 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 10:27:27,527 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 10:27:27,527 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 10:27:27,527 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 10:27:27,528 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 10:27:27,529 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 10:27:27,530 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-15 10:27:27,551 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 10:27:27,551 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 10:27:27,552 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 10:27:27,552 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 10:27:27,553 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 10:27:27,553 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 10:27:27,553 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 10:27:27,554 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 10:27:27,554 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 10:27:27,554 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 10:27:27,555 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 10:27:27,555 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 10:27:27,555 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 10:27:27,555 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 10:27:27,556 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-15 10:27:27,556 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 10:27:27,556 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-15 10:27:27,556 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 10:27:27,556 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 10:27:27,557 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 10:27:27,557 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-15 10:27:27,557 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 10:27:27,557 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 10:27:27,557 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 10:27:27,557 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 10:27:27,558 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 10:27:27,558 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 10:27:27,558 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-15 10:27:27,558 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 10:27:27,559 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 10:27:27,559 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 10:27:27,559 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-15 10:27:27,559 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 10:27:27,559 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 10:27:27,559 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 10:27:27,560 INFO L138 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.graphml 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 -> a38de44f112a10364737c35b840e673503a211a020b9f494a50e4a32c8fe31c0 [2023-02-15 10:27:27,772 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 10:27:27,799 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 10:27:27,801 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 10:27:27,802 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 10:27:27,803 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 10:27:27,804 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i [2023-02-15 10:27:28,736 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 10:27:28,990 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 10:27:28,991 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i [2023-02-15 10:27:29,005 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4326271ed/8205c4d6e67340828872f8ac409530b5/FLAG9c4df31d0 [2023-02-15 10:27:29,015 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4326271ed/8205c4d6e67340828872f8ac409530b5 [2023-02-15 10:27:29,018 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 10:27:29,019 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 10:27:29,020 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 10:27:29,020 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 10:27:29,022 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 10:27:29,023 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:27:29" (1/1) ... [2023-02-15 10:27:29,025 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@305b27f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:27:29, skipping insertion in model container [2023-02-15 10:27:29,025 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:27:29" (1/1) ... [2023-02-15 10:27:29,032 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 10:27:29,081 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 10:27:29,339 WARN L237 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/bubble_sort_linux-1.i[33822,33835] [2023-02-15 10:27:29,377 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 10:27:29,387 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 10:27:29,418 WARN L237 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/bubble_sort_linux-1.i[33822,33835] [2023-02-15 10:27:29,428 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 10:27:29,458 INFO L208 MainTranslator]: Completed translation [2023-02-15 10:27:29,459 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:27:29 WrapperNode [2023-02-15 10:27:29,459 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 10:27:29,460 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 10:27:29,460 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 10:27:29,460 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 10:27:29,468 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:27:29" (1/1) ... [2023-02-15 10:27:29,487 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:27:29" (1/1) ... [2023-02-15 10:27:29,518 INFO L138 Inliner]: procedures = 232, calls = 75, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 116 [2023-02-15 10:27:29,519 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 10:27:29,520 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 10:27:29,520 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 10:27:29,520 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 10:27:29,526 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:27:29" (1/1) ... [2023-02-15 10:27:29,527 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:27:29" (1/1) ... [2023-02-15 10:27:29,543 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:27:29" (1/1) ... [2023-02-15 10:27:29,550 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:27:29" (1/1) ... [2023-02-15 10:27:29,557 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:27:29" (1/1) ... [2023-02-15 10:27:29,564 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:27:29" (1/1) ... [2023-02-15 10:27:29,566 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:27:29" (1/1) ... [2023-02-15 10:27:29,567 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:27:29" (1/1) ... [2023-02-15 10:27:29,569 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 10:27:29,570 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 10:27:29,570 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 10:27:29,570 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 10:27:29,570 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:27:29" (1/1) ... [2023-02-15 10:27:29,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 10:27:29,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:27:29,597 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-15 10:27:29,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-15 10:27:29,622 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 10:27:29,622 INFO L130 BoogieDeclarations]: Found specification of procedure inspect [2023-02-15 10:27:29,622 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect [2023-02-15 10:27:29,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 10:27:29,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-15 10:27:29,623 INFO L130 BoogieDeclarations]: Found specification of procedure val_from_node [2023-02-15 10:27:29,623 INFO L138 BoogieDeclarations]: Found implementation of procedure val_from_node [2023-02-15 10:27:29,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-15 10:27:29,623 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2023-02-15 10:27:29,623 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2023-02-15 10:27:29,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-15 10:27:29,624 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 10:27:29,624 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 10:27:29,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 10:27:29,624 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2023-02-15 10:27:29,624 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2023-02-15 10:27:29,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 10:27:29,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 10:27:29,625 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 10:27:29,749 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 10:27:29,750 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 10:27:30,007 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 10:27:30,012 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 10:27:30,018 INFO L300 CfgBuilder]: Removed 41 assume(true) statements. [2023-02-15 10:27:30,020 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:27:30 BoogieIcfgContainer [2023-02-15 10:27:30,024 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 10:27:30,025 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 10:27:30,026 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 10:27:30,028 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 10:27:30,028 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 10:27:29" (1/3) ... [2023-02-15 10:27:30,028 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1526b6c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:27:30, skipping insertion in model container [2023-02-15 10:27:30,029 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:27:29" (2/3) ... [2023-02-15 10:27:30,029 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1526b6c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:27:30, skipping insertion in model container [2023-02-15 10:27:30,029 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:27:30" (3/3) ... [2023-02-15 10:27:30,030 INFO L112 eAbstractionObserver]: Analyzing ICFG bubble_sort_linux-1.i [2023-02-15 10:27:30,043 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 10:27:30,043 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-15 10:27:30,079 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 10:27:30,083 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@6f44419f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 10:27:30,083 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-15 10:27:30,086 INFO L276 IsEmpty]: Start isEmpty. Operand has 118 states, 89 states have (on average 1.7415730337078652) internal successors, (155), 108 states have internal predecessors, (155), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-02-15 10:27:30,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-15 10:27:30,090 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:27:30,091 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:27:30,091 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:27:30,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:27:30,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1761516263, now seen corresponding path program 1 times [2023-02-15 10:27:30,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:27:30,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809815973] [2023-02-15 10:27:30,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:27:30,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:27:30,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:27:30,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:27:30,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:27:30,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809815973] [2023-02-15 10:27:30,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809815973] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:27:30,186 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:27:30,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 10:27:30,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690469689] [2023-02-15 10:27:30,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:27:30,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-15 10:27:30,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:27:30,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-15 10:27:30,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 10:27:30,224 INFO L87 Difference]: Start difference. First operand has 118 states, 89 states have (on average 1.7415730337078652) internal successors, (155), 108 states have internal predecessors, (155), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:27:30,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:27:30,279 INFO L93 Difference]: Finished difference Result 230 states and 397 transitions. [2023-02-15 10:27:30,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-15 10:27:30,281 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-02-15 10:27:30,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:27:30,291 INFO L225 Difference]: With dead ends: 230 [2023-02-15 10:27:30,291 INFO L226 Difference]: Without dead ends: 107 [2023-02-15 10:27:30,298 INFO L412 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 [2023-02-15 10:27:30,300 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:27:30,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:27:30,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-02-15 10:27:30,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2023-02-15 10:27:30,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 82 states have (on average 1.2439024390243902) internal successors, (102), 97 states have internal predecessors, (102), 21 states have call successors, (21), 4 states have call predecessors, (21), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-15 10:27:30,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 128 transitions. [2023-02-15 10:27:30,342 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 128 transitions. Word has length 9 [2023-02-15 10:27:30,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:27:30,343 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 128 transitions. [2023-02-15 10:27:30,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:27:30,344 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 128 transitions. [2023-02-15 10:27:30,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-15 10:27:30,346 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:27:30,346 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:27:30,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 10:27:30,347 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:27:30,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:27:30,347 INFO L85 PathProgramCache]: Analyzing trace with hash 849043181, now seen corresponding path program 1 times [2023-02-15 10:27:30,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:27:30,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502767194] [2023-02-15 10:27:30,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:27:30,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:27:30,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:27:30,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-15 10:27:30,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:27:30,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:27:30,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:27:30,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502767194] [2023-02-15 10:27:30,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502767194] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:27:30,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:27:30,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 10:27:30,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029286511] [2023-02-15 10:27:30,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:27:30,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 10:27:30,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:27:30,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 10:27:30,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 10:27:30,614 INFO L87 Difference]: Start difference. First operand 107 states and 128 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 10:27:30,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:27:30,869 INFO L93 Difference]: Finished difference Result 109 states and 129 transitions. [2023-02-15 10:27:30,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 10:27:30,871 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2023-02-15 10:27:30,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:27:30,874 INFO L225 Difference]: With dead ends: 109 [2023-02-15 10:27:30,874 INFO L226 Difference]: Without dead ends: 106 [2023-02-15 10:27:30,877 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-02-15 10:27:30,879 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 242 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 10:27:30,879 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 133 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 10:27:30,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-02-15 10:27:30,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2023-02-15 10:27:30,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 82 states have (on average 1.2317073170731707) internal successors, (101), 96 states have internal predecessors, (101), 20 states have call successors, (20), 4 states have call predecessors, (20), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-15 10:27:30,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 126 transitions. [2023-02-15 10:27:30,898 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 126 transitions. Word has length 21 [2023-02-15 10:27:30,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:27:30,900 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 126 transitions. [2023-02-15 10:27:30,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 10:27:30,900 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 126 transitions. [2023-02-15 10:27:30,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-15 10:27:30,901 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:27:30,901 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:27:30,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 10:27:30,901 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:27:30,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:27:30,902 INFO L85 PathProgramCache]: Analyzing trace with hash 502050183, now seen corresponding path program 1 times [2023-02-15 10:27:30,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:27:30,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575498777] [2023-02-15 10:27:30,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:27:30,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:27:30,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:27:31,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-15 10:27:31,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:27:31,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:27:31,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:27:31,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575498777] [2023-02-15 10:27:31,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575498777] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:27:31,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:27:31,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-15 10:27:31,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54008736] [2023-02-15 10:27:31,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:27:31,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 10:27:31,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:27:31,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 10:27:31,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-02-15 10:27:31,420 INFO L87 Difference]: Start difference. First operand 106 states and 126 transitions. Second operand has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 10:27:32,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:27:32,124 INFO L93 Difference]: Finished difference Result 198 states and 235 transitions. [2023-02-15 10:27:32,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 10:27:32,125 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2023-02-15 10:27:32,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:27:32,127 INFO L225 Difference]: With dead ends: 198 [2023-02-15 10:27:32,127 INFO L226 Difference]: Without dead ends: 192 [2023-02-15 10:27:32,128 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2023-02-15 10:27:32,129 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 533 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 850 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-15 10:27:32,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [533 Valid, 157 Invalid, 969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 850 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-15 10:27:32,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2023-02-15 10:27:32,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 172. [2023-02-15 10:27:32,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 144 states have (on average 1.2430555555555556) internal successors, (179), 158 states have internal predecessors, (179), 23 states have call successors, (23), 6 states have call predecessors, (23), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-15 10:27:32,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 209 transitions. [2023-02-15 10:27:32,152 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 209 transitions. Word has length 24 [2023-02-15 10:27:32,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:27:32,153 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 209 transitions. [2023-02-15 10:27:32,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 10:27:32,153 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 209 transitions. [2023-02-15 10:27:32,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-15 10:27:32,153 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:27:32,153 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:27:32,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-15 10:27:32,154 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:27:32,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:27:32,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1234303898, now seen corresponding path program 1 times [2023-02-15 10:27:32,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:27:32,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843732054] [2023-02-15 10:27:32,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:27:32,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:27:32,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:27:32,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-15 10:27:32,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:27:32,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:27:32,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:27:32,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843732054] [2023-02-15 10:27:32,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843732054] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:27:32,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:27:32,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-15 10:27:32,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086747481] [2023-02-15 10:27:32,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:27:32,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 10:27:32,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:27:32,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 10:27:32,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-02-15 10:27:32,907 INFO L87 Difference]: Start difference. First operand 172 states and 209 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 10:27:33,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:27:33,538 INFO L93 Difference]: Finished difference Result 274 states and 329 transitions. [2023-02-15 10:27:33,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-15 10:27:33,538 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2023-02-15 10:27:33,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:27:33,540 INFO L225 Difference]: With dead ends: 274 [2023-02-15 10:27:33,540 INFO L226 Difference]: Without dead ends: 271 [2023-02-15 10:27:33,540 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2023-02-15 10:27:33,541 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 322 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 951 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-15 10:27:33,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 225 Invalid, 998 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 951 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-15 10:27:33,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2023-02-15 10:27:33,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 253. [2023-02-15 10:27:33,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 218 states have (on average 1.238532110091743) internal successors, (270), 233 states have internal predecessors, (270), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-02-15 10:27:33,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 309 transitions. [2023-02-15 10:27:33,563 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 309 transitions. Word has length 27 [2023-02-15 10:27:33,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:27:33,563 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 309 transitions. [2023-02-15 10:27:33,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 10:27:33,564 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 309 transitions. [2023-02-15 10:27:33,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-15 10:27:33,565 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:27:33,565 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:27:33,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-15 10:27:33,565 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:27:33,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:27:33,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1680148119, now seen corresponding path program 1 times [2023-02-15 10:27:33,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:27:33,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631629535] [2023-02-15 10:27:33,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:27:33,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:27:33,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:27:34,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-15 10:27:34,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:27:34,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:27:34,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:27:34,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631629535] [2023-02-15 10:27:34,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631629535] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:27:34,305 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:27:34,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-02-15 10:27:34,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972351386] [2023-02-15 10:27:34,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:27:34,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-15 10:27:34,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:27:34,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-15 10:27:34,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2023-02-15 10:27:34,307 INFO L87 Difference]: Start difference. First operand 253 states and 309 transitions. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 9 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 10:27:35,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:27:35,076 INFO L93 Difference]: Finished difference Result 273 states and 327 transitions. [2023-02-15 10:27:35,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-15 10:27:35,079 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 9 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2023-02-15 10:27:35,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:27:35,080 INFO L225 Difference]: With dead ends: 273 [2023-02-15 10:27:35,080 INFO L226 Difference]: Without dead ends: 270 [2023-02-15 10:27:35,080 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2023-02-15 10:27:35,081 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 352 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 1191 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 1233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-15 10:27:35,081 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 295 Invalid, 1233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1191 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-15 10:27:35,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2023-02-15 10:27:35,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 253. [2023-02-15 10:27:35,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 218 states have (on average 1.2339449541284404) internal successors, (269), 233 states have internal predecessors, (269), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-02-15 10:27:35,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 308 transitions. [2023-02-15 10:27:35,099 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 308 transitions. Word has length 30 [2023-02-15 10:27:35,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:27:35,099 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 308 transitions. [2023-02-15 10:27:35,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 9 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 10:27:35,099 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 308 transitions. [2023-02-15 10:27:35,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-15 10:27:35,100 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:27:35,100 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:27:35,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-15 10:27:35,100 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:27:35,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:27:35,101 INFO L85 PathProgramCache]: Analyzing trace with hash -493122043, now seen corresponding path program 1 times [2023-02-15 10:27:35,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:27:35,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476441984] [2023-02-15 10:27:35,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:27:35,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:27:35,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:27:35,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-15 10:27:35,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:27:36,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:27:36,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:27:36,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476441984] [2023-02-15 10:27:36,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476441984] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:27:36,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:27:36,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-02-15 10:27:36,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470856693] [2023-02-15 10:27:36,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:27:36,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-15 10:27:36,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:27:36,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-15 10:27:36,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2023-02-15 10:27:36,050 INFO L87 Difference]: Start difference. First operand 253 states and 308 transitions. Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 10 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 10:27:36,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:27:36,891 INFO L93 Difference]: Finished difference Result 272 states and 325 transitions. [2023-02-15 10:27:36,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-15 10:27:36,892 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 10 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2023-02-15 10:27:36,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:27:36,893 INFO L225 Difference]: With dead ends: 272 [2023-02-15 10:27:36,893 INFO L226 Difference]: Without dead ends: 269 [2023-02-15 10:27:36,893 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2023-02-15 10:27:36,894 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 352 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 1090 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 1130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1090 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-15 10:27:36,894 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 271 Invalid, 1130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1090 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-15 10:27:36,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2023-02-15 10:27:36,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 253. [2023-02-15 10:27:36,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 218 states have (on average 1.2293577981651376) internal successors, (268), 233 states have internal predecessors, (268), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-02-15 10:27:36,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 307 transitions. [2023-02-15 10:27:36,912 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 307 transitions. Word has length 33 [2023-02-15 10:27:36,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:27:36,912 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 307 transitions. [2023-02-15 10:27:36,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 10 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 10:27:36,912 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 307 transitions. [2023-02-15 10:27:36,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-15 10:27:36,916 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:27:36,917 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:27:36,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-15 10:27:36,917 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:27:36,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:27:36,918 INFO L85 PathProgramCache]: Analyzing trace with hash -2033122620, now seen corresponding path program 1 times [2023-02-15 10:27:36,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:27:36,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987257574] [2023-02-15 10:27:36,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:27:36,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:27:36,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:27:37,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-15 10:27:37,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:27:37,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:27:37,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:27:37,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987257574] [2023-02-15 10:27:37,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987257574] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:27:37,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:27:37,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-02-15 10:27:37,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450350153] [2023-02-15 10:27:37,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:27:37,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-15 10:27:37,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:27:37,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-15 10:27:37,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2023-02-15 10:27:38,000 INFO L87 Difference]: Start difference. First operand 253 states and 307 transitions. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 8 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 10:27:38,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:27:38,821 INFO L93 Difference]: Finished difference Result 271 states and 323 transitions. [2023-02-15 10:27:38,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-15 10:27:38,821 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 8 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2023-02-15 10:27:38,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:27:38,822 INFO L225 Difference]: With dead ends: 271 [2023-02-15 10:27:38,822 INFO L226 Difference]: Without dead ends: 268 [2023-02-15 10:27:38,823 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2023-02-15 10:27:38,823 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 348 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 1054 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 1095 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1054 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-15 10:27:38,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 249 Invalid, 1095 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1054 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-15 10:27:38,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2023-02-15 10:27:38,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 253. [2023-02-15 10:27:38,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 218 states have (on average 1.224770642201835) internal successors, (267), 233 states have internal predecessors, (267), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-02-15 10:27:38,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 306 transitions. [2023-02-15 10:27:38,850 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 306 transitions. Word has length 36 [2023-02-15 10:27:38,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:27:38,850 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 306 transitions. [2023-02-15 10:27:38,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 8 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 10:27:38,850 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 306 transitions. [2023-02-15 10:27:38,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-15 10:27:38,855 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:27:38,855 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:27:38,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-15 10:27:38,855 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:27:38,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:27:38,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1335339115, now seen corresponding path program 1 times [2023-02-15 10:27:38,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:27:38,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403496864] [2023-02-15 10:27:38,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:27:38,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:27:38,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:27:39,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-15 10:27:39,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:27:39,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:27:39,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:27:39,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403496864] [2023-02-15 10:27:39,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403496864] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:27:39,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:27:39,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-02-15 10:27:39,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775086639] [2023-02-15 10:27:39,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:27:39,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-15 10:27:39,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:27:39,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-15 10:27:39,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2023-02-15 10:27:39,604 INFO L87 Difference]: Start difference. First operand 253 states and 306 transitions. Second operand has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 8 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 10:27:40,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:27:40,380 INFO L93 Difference]: Finished difference Result 270 states and 321 transitions. [2023-02-15 10:27:40,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-15 10:27:40,381 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 8 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2023-02-15 10:27:40,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:27:40,382 INFO L225 Difference]: With dead ends: 270 [2023-02-15 10:27:40,382 INFO L226 Difference]: Without dead ends: 267 [2023-02-15 10:27:40,382 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=448, Unknown=0, NotChecked=0, Total=552 [2023-02-15 10:27:40,383 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 424 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 992 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 992 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-15 10:27:40,383 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 250 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 992 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-15 10:27:40,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2023-02-15 10:27:40,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 253. [2023-02-15 10:27:40,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 218 states have (on average 1.2201834862385321) internal successors, (266), 233 states have internal predecessors, (266), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-02-15 10:27:40,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 305 transitions. [2023-02-15 10:27:40,405 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 305 transitions. Word has length 39 [2023-02-15 10:27:40,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:27:40,408 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 305 transitions. [2023-02-15 10:27:40,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 8 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 10:27:40,408 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 305 transitions. [2023-02-15 10:27:40,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-15 10:27:40,411 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:27:40,411 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:27:40,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-15 10:27:40,411 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:27:40,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:27:40,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1154705564, now seen corresponding path program 1 times [2023-02-15 10:27:40,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:27:40,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450459510] [2023-02-15 10:27:40,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:27:40,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:27:40,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:27:41,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-15 10:27:41,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:27:41,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 10:27:41,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:27:41,562 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 10:27:41,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:27:41,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450459510] [2023-02-15 10:27:41,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450459510] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:27:41,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1610923141] [2023-02-15 10:27:41,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:27:41,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:27:41,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:27:41,565 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) [2023-02-15 10:27:41,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-15 10:27:41,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:27:41,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 142 conjunts are in the unsatisfiable core [2023-02-15 10:27:41,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:27:41,855 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 10:27:41,856 INFO L350 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 [2023-02-15 10:27:41,927 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 10:27:41,928 INFO L350 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 1 case distinctions, treesize of input 14 treesize of output 20 [2023-02-15 10:27:41,937 INFO L350 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 5 treesize of output 3 [2023-02-15 10:27:41,952 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 10:27:41,952 INFO L350 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 1 case distinctions, treesize of input 21 treesize of output 21 [2023-02-15 10:27:41,984 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 10:27:41,991 INFO L350 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 [2023-02-15 10:27:42,135 INFO L321 Elim1Store]: treesize reduction 77, result has 3.8 percent of original size [2023-02-15 10:27:42,136 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 61 treesize of output 82 [2023-02-15 10:27:42,145 INFO L350 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 133 treesize of output 105 [2023-02-15 10:27:42,148 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 78 [2023-02-15 10:27:42,203 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:27:42,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:27:42,206 INFO L350 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 26 treesize of output 28 [2023-02-15 10:27:42,209 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 26 treesize of output 24 [2023-02-15 10:27:42,275 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 10:27:42,275 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 11 [2023-02-15 10:27:42,315 INFO L350 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 28 treesize of output 26 [2023-02-15 10:27:42,328 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 22 treesize of output 8 [2023-02-15 10:27:42,431 INFO L321 Elim1Store]: treesize reduction 177, result has 36.1 percent of original size [2023-02-15 10:27:42,432 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 258 treesize of output 397 [2023-02-15 10:27:42,440 INFO L350 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 8 treesize of output 7 [2023-02-15 10:27:42,449 INFO L350 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 8 treesize of output 7 [2023-02-15 10:27:42,459 INFO L350 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 8 treesize of output 7 [2023-02-15 10:27:42,644 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:27:42,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:27:42,799 INFO L321 Elim1Store]: treesize reduction 137, result has 8.1 percent of original size [2023-02-15 10:27:42,800 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 507 treesize of output 523 [2023-02-15 10:27:42,885 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:27:42,904 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:27:42,905 INFO L350 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 11 [2023-02-15 10:27:42,919 INFO L350 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 5 treesize of output 3 [2023-02-15 10:27:43,381 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_old(#memory_$Pointer$.base)| |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset|))) (and (exists ((v_ArrVal_1015 (Array Int Int)) (v_ArrVal_1025 (Array Int Int)) (v_ArrVal_1017 Int) (|list_add___list_add_~next#1.offset| Int)) (= (let ((.cse0 (store |c_old(#memory_$Pointer$.base)| .cse1 (store (select |c_old(#memory_$Pointer$.base)| .cse1) (+ |list_add___list_add_~next#1.offset| 4) |c_list_add_#in~new#1.base|)))) (store (store .cse0 |c_list_add_#in~new#1.base| v_ArrVal_1025) |c_list_add_#in~head#1.base| (store (select (store .cse0 |c_list_add_#in~new#1.base| v_ArrVal_1015) |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| v_ArrVal_1017))) |c_#memory_$Pointer$.base|)) (= 3 |c_~#gl_list~0.base|) (let ((.cse6 (= |c_list_add_#in~head#1.base| .cse1)) (.cse3 (select |c_#memory_$Pointer$.offset| .cse1)) (.cse2 (= |c_list_add_#in~new#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset|))) (.cse7 (= |c_list_add_#in~head#1.base| |c_list_add_#in~new#1.base|))) (or (and (or .cse2 (and (exists ((v_DerPreprocessor_16 (Array Int Int)) (v_DerPreprocessor_17 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (let ((.cse5 (store (store (store (store (store (store (store (store (store (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_DerPreprocessor_16) |c_list_add_#in~new#1.base| v_DerPreprocessor_17) |c_list_add_#in~head#1.base| v_DerPreprocessor_18) .cse1 v_DerPreprocessor_16) |c_list_add_#in~new#1.base| v_DerPreprocessor_17) |c_list_add_#in~head#1.base| v_DerPreprocessor_18) .cse1 v_DerPreprocessor_16) |c_list_add_#in~new#1.base| v_DerPreprocessor_17) |c_list_add_#in~head#1.base| v_DerPreprocessor_18) .cse1 v_DerPreprocessor_16) |c_list_add_#in~new#1.base| v_DerPreprocessor_17) |c_list_add_#in~head#1.base| v_DerPreprocessor_18))) (let ((.cse4 (select .cse5 .cse1))) (and (= |c_list_add_#in~new#1.offset| (select v_DerPreprocessor_18 |c_list_add_#in~head#1.offset|)) (= .cse3 .cse4) (= (select |c_#memory_$Pointer$.offset| |c_list_add_#in~new#1.base|) (select .cse5 |c_list_add_#in~new#1.base|)) (= v_DerPreprocessor_16 .cse4))))) .cse2 (not .cse6))) (not .cse7)) (and (let ((.cse8 (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse39 (store (store (store (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_DerPreprocessor_10) |c_list_add_#in~new#1.base| v_DerPreprocessor_11) |c_list_add_#in~head#1.base| v_DerPreprocessor_12) .cse1 v_DerPreprocessor_10) |c_list_add_#in~new#1.base| v_DerPreprocessor_11) |c_list_add_#in~head#1.base| v_DerPreprocessor_12))) (and (= (select .cse39 .cse1) v_DerPreprocessor_10) (= v_DerPreprocessor_11 (select .cse39 |c_list_add_#in~new#1.base|)) (= |c_list_add_#in~new#1.offset| (select v_DerPreprocessor_12 |c_list_add_#in~head#1.offset|))))))) (or (and .cse6 .cse8 (exists ((v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse9 (store (store (store (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_DerPreprocessor_13) |c_list_add_#in~new#1.base| v_DerPreprocessor_14) |c_list_add_#in~head#1.base| v_DerPreprocessor_15) .cse1 v_DerPreprocessor_13) |c_list_add_#in~new#1.base| v_DerPreprocessor_14) |c_list_add_#in~head#1.base| v_DerPreprocessor_15))) (let ((.cse10 (select .cse9 .cse1))) (and (= v_DerPreprocessor_14 (select .cse9 |c_list_add_#in~new#1.base|)) (= .cse3 .cse10) (= v_DerPreprocessor_13 .cse10)))))) (exists ((v_DerPreprocessor_15 (Array Int Int))) (and (exists ((v_DerPreprocessor_13 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse11 (store (store (store (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_DerPreprocessor_13) |c_list_add_#in~new#1.base| v_DerPreprocessor_14) |c_list_add_#in~head#1.base| v_DerPreprocessor_15) .cse1 v_DerPreprocessor_13) |c_list_add_#in~new#1.base| v_DerPreprocessor_14) |c_list_add_#in~head#1.base| v_DerPreprocessor_15))) (let ((.cse12 (select .cse11 .cse1))) (and (= v_DerPreprocessor_14 (select .cse11 |c_list_add_#in~new#1.base|)) (= .cse3 .cse12) (exists ((v_prenex_35 (Array Int Int)) (v_prenex_34 (Array Int Int)) (v_prenex_33 (Array Int Int))) (let ((.cse14 (store (store (store (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_prenex_33) |c_list_add_#in~new#1.base| v_prenex_34) |c_list_add_#in~head#1.base| v_prenex_35) .cse1 v_prenex_33) |c_list_add_#in~new#1.base| v_prenex_34) |c_list_add_#in~head#1.base| v_prenex_35))) (let ((.cse13 (select .cse14 .cse1))) (and (= .cse13 v_prenex_33) (= |c_list_add_#in~new#1.offset| (select v_prenex_35 |c_list_add_#in~head#1.offset|)) (= .cse13 .cse12) (= (select .cse14 |c_list_add_#in~new#1.base|) v_prenex_34))))) (= v_DerPreprocessor_13 .cse12))))) (= |c_list_add_#in~new#1.offset| (select v_DerPreprocessor_15 |c_list_add_#in~head#1.offset|)))) (and .cse6 (exists ((v_prenex_41 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_DerPreprocessor_15 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse18 (store (store (store (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_prenex_39) |c_list_add_#in~new#1.base| v_prenex_40) |c_list_add_#in~head#1.base| v_prenex_41) .cse1 v_prenex_39) |c_list_add_#in~new#1.base| v_prenex_40) |c_list_add_#in~head#1.base| v_prenex_41)) (.cse19 (store (store (store (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_DerPreprocessor_13) |c_list_add_#in~new#1.base| v_DerPreprocessor_14) |c_list_add_#in~head#1.base| v_DerPreprocessor_15) .cse1 v_DerPreprocessor_13) |c_list_add_#in~new#1.base| v_DerPreprocessor_14) |c_list_add_#in~head#1.base| v_DerPreprocessor_15))) (let ((.cse15 (select .cse19 |c_list_add_#in~new#1.base|)) (.cse16 (select .cse19 .cse1)) (.cse17 (select .cse18 |c_list_add_#in~new#1.base|))) (and (= v_DerPreprocessor_14 .cse15) (= .cse3 .cse16) (= .cse17 .cse15) (= v_DerPreprocessor_13 .cse16) (= .cse17 v_prenex_40) (= v_prenex_39 (select .cse18 .cse1))))))) (and .cse6 (or (exists ((v_DerPreprocessor_15 (Array Int Int))) (and (= |c_list_add_#in~new#1.offset| (select v_DerPreprocessor_15 |c_list_add_#in~head#1.offset|)) (exists ((v_DerPreprocessor_13 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse20 (store (store (store (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_DerPreprocessor_13) |c_list_add_#in~new#1.base| v_DerPreprocessor_14) |c_list_add_#in~head#1.base| v_DerPreprocessor_15) .cse1 v_DerPreprocessor_13) |c_list_add_#in~new#1.base| v_DerPreprocessor_14) |c_list_add_#in~head#1.base| v_DerPreprocessor_15))) (let ((.cse22 (select .cse20 .cse1))) (and (= v_DerPreprocessor_14 (select .cse20 |c_list_add_#in~new#1.base|)) (exists ((v_prenex_36 (Array Int Int)) (v_prenex_38 (Array Int Int)) (v_prenex_37 (Array Int Int))) (let ((.cse23 (store (store (store (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_prenex_36) |c_list_add_#in~new#1.base| v_prenex_37) |c_list_add_#in~head#1.base| v_prenex_38) .cse1 v_prenex_36) |c_list_add_#in~new#1.base| v_prenex_37) |c_list_add_#in~head#1.base| v_prenex_38))) (let ((.cse21 (select .cse23 .cse1))) (and (= .cse21 v_prenex_36) (= .cse21 .cse22) (= (select .cse23 |c_list_add_#in~new#1.base|) v_prenex_37))))) (= v_DerPreprocessor_13 .cse22))))))) (exists ((v_DerPreprocessor_15 (Array Int Int))) (and (exists ((v_DerPreprocessor_13 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse27 (store (store (store (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_DerPreprocessor_13) |c_list_add_#in~new#1.base| v_DerPreprocessor_14) |c_list_add_#in~head#1.base| v_DerPreprocessor_15) .cse1 v_DerPreprocessor_13) |c_list_add_#in~new#1.base| v_DerPreprocessor_14) |c_list_add_#in~head#1.base| v_DerPreprocessor_15))) (let ((.cse25 (select .cse27 .cse1))) (and (exists ((v_prenex_35 (Array Int Int)) (v_prenex_34 (Array Int Int)) (v_prenex_33 (Array Int Int))) (let ((.cse26 (store (store (store (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_prenex_33) |c_list_add_#in~new#1.base| v_prenex_34) |c_list_add_#in~head#1.base| v_prenex_35) .cse1 v_prenex_33) |c_list_add_#in~new#1.base| v_prenex_34) |c_list_add_#in~head#1.base| v_prenex_35))) (let ((.cse24 (select .cse26 .cse1))) (and (= .cse24 v_prenex_33) (= .cse24 .cse25) (= (select .cse26 |c_list_add_#in~new#1.base|) v_prenex_34))))) (= v_DerPreprocessor_14 (select .cse27 |c_list_add_#in~new#1.base|)) (= v_DerPreprocessor_13 .cse25))))) (= |c_list_add_#in~new#1.offset| (select v_DerPreprocessor_15 |c_list_add_#in~head#1.offset|)))) (exists ((v_DerPreprocessor_15 (Array Int Int))) (and (= |c_list_add_#in~new#1.offset| (select v_DerPreprocessor_15 |c_list_add_#in~head#1.offset|)) (exists ((v_prenex_41 (Array Int Int)) (v_prenex_40 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse31 (store (store (store (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_prenex_39) |c_list_add_#in~new#1.base| v_prenex_40) |c_list_add_#in~head#1.base| v_prenex_41) .cse1 v_prenex_39) |c_list_add_#in~new#1.base| v_prenex_40) |c_list_add_#in~head#1.base| v_prenex_41)) (.cse30 (store (store (store (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_DerPreprocessor_13) |c_list_add_#in~new#1.base| v_DerPreprocessor_14) |c_list_add_#in~head#1.base| v_DerPreprocessor_15) .cse1 v_DerPreprocessor_13) |c_list_add_#in~new#1.base| v_DerPreprocessor_14) |c_list_add_#in~head#1.base| v_DerPreprocessor_15))) (let ((.cse28 (select .cse30 |c_list_add_#in~new#1.base|)) (.cse29 (select .cse31 |c_list_add_#in~new#1.base|))) (and (= v_DerPreprocessor_14 .cse28) (= .cse29 .cse28) (= v_DerPreprocessor_13 (select .cse30 .cse1)) (= .cse29 v_prenex_40) (= v_prenex_39 (select .cse31 .cse1)))))))) (and .cse8 (exists ((v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse32 (store (store (store (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_DerPreprocessor_13) |c_list_add_#in~new#1.base| v_DerPreprocessor_14) |c_list_add_#in~head#1.base| v_DerPreprocessor_15) .cse1 v_DerPreprocessor_13) |c_list_add_#in~new#1.base| v_DerPreprocessor_14) |c_list_add_#in~head#1.base| v_DerPreprocessor_15))) (and (= v_DerPreprocessor_14 (select .cse32 |c_list_add_#in~new#1.base|)) (= |c_list_add_#in~new#1.offset| (select v_DerPreprocessor_15 |c_list_add_#in~head#1.offset|)) (= v_DerPreprocessor_13 (select .cse32 .cse1)))))))) (exists ((v_DerPreprocessor_15 (Array Int Int))) (and (= |c_list_add_#in~new#1.offset| (select v_DerPreprocessor_15 |c_list_add_#in~head#1.offset|)) (exists ((v_DerPreprocessor_13 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse38 (store (store (store (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_DerPreprocessor_13) |c_list_add_#in~new#1.base| v_DerPreprocessor_14) |c_list_add_#in~head#1.base| v_DerPreprocessor_15) .cse1 v_DerPreprocessor_13) |c_list_add_#in~new#1.base| v_DerPreprocessor_14) |c_list_add_#in~head#1.base| v_DerPreprocessor_15))) (let ((.cse34 (select .cse38 .cse1)) (.cse33 (select .cse38 |c_list_add_#in~new#1.base|))) (and (= v_DerPreprocessor_14 .cse33) (= .cse3 .cse34) (= v_DerPreprocessor_13 .cse34) (exists ((v_prenex_36 (Array Int Int)) (v_prenex_38 (Array Int Int)) (v_prenex_37 (Array Int Int))) (let ((.cse37 (store (store (store (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_prenex_36) |c_list_add_#in~new#1.base| v_prenex_37) |c_list_add_#in~head#1.base| v_prenex_38) .cse1 v_prenex_36) |c_list_add_#in~new#1.base| v_prenex_37) |c_list_add_#in~head#1.base| v_prenex_38))) (let ((.cse35 (select .cse37 .cse1)) (.cse36 (select .cse37 |c_list_add_#in~new#1.base|))) (and (= .cse35 v_prenex_36) (= .cse35 .cse34) (= .cse36 .cse33) (= .cse36 v_prenex_37))))))))))))) .cse2 .cse7))) (<= 0 |c_~#gl_list~0.offset|) (<= |c_~#gl_list~0.offset| 0))) is different from true [2023-02-15 10:27:44,227 INFO L321 Elim1Store]: treesize reduction 54, result has 23.9 percent of original size [2023-02-15 10:27:44,228 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 520 treesize of output 366 [2023-02-15 10:27:44,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:27:44,250 INFO L321 Elim1Store]: treesize reduction 38, result has 19.1 percent of original size [2023-02-15 10:27:44,250 INFO L350 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 564 treesize of output 499 [2023-02-15 10:27:44,266 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 488 treesize of output 346 [2023-02-15 10:27:44,296 INFO L350 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 7 treesize of output 3 [2023-02-15 10:27:44,349 INFO L350 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 14 treesize of output 16 [2023-02-15 10:27:44,359 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-02-15 10:27:44,360 INFO L350 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 42 treesize of output 50 [2023-02-15 10:27:44,371 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:27:44,526 INFO L350 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 [2023-02-15 10:27:44,569 INFO L350 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 20 treesize of output 8 [2023-02-15 10:27:44,597 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-02-15 10:27:44,598 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:27:45,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1610923141] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:27:45,029 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 10:27:45,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18] total 30 [2023-02-15 10:27:45,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886597478] [2023-02-15 10:27:45,029 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 10:27:45,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-02-15 10:27:45,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:27:45,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-02-15 10:27:45,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1145, Unknown=14, NotChecked=68, Total=1332 [2023-02-15 10:27:45,030 INFO L87 Difference]: Start difference. First operand 253 states and 305 transitions. Second operand has 31 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 21 states have internal predecessors, (65), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 10:27:49,473 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 10:27:54,493 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 10:27:55,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:27:55,922 INFO L93 Difference]: Finished difference Result 303 states and 360 transitions. [2023-02-15 10:27:55,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-02-15 10:27:55,923 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 21 states have internal predecessors, (65), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 40 [2023-02-15 10:27:55,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:27:55,924 INFO L225 Difference]: With dead ends: 303 [2023-02-15 10:27:55,924 INFO L226 Difference]: Without dead ends: 300 [2023-02-15 10:27:55,925 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 487 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=357, Invalid=2483, Unknown=26, NotChecked=104, Total=2970 [2023-02-15 10:27:55,926 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 883 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 2877 mSolverCounterSat, 192 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 883 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 3299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 192 IncrementalHoareTripleChecker+Valid, 2877 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 215 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2023-02-15 10:27:55,926 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [883 Valid, 570 Invalid, 3299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [192 Valid, 2877 Invalid, 15 Unknown, 215 Unchecked, 7.8s Time] [2023-02-15 10:27:55,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2023-02-15 10:27:55,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 257. [2023-02-15 10:27:55,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 221 states have (on average 1.2126696832579185) internal successors, (268), 236 states have internal predecessors, (268), 28 states have call successors, (28), 9 states have call predecessors, (28), 7 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-02-15 10:27:55,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 307 transitions. [2023-02-15 10:27:55,950 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 307 transitions. Word has length 40 [2023-02-15 10:27:55,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:27:55,950 INFO L495 AbstractCegarLoop]: Abstraction has 257 states and 307 transitions. [2023-02-15 10:27:55,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 21 states have internal predecessors, (65), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 10:27:55,950 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 307 transitions. [2023-02-15 10:27:55,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-15 10:27:55,952 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:27:55,952 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:27:55,958 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-15 10:27:56,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:27:56,159 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:27:56,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:27:56,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1293265745, now seen corresponding path program 1 times [2023-02-15 10:27:56,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:27:56,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231015139] [2023-02-15 10:27:56,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:27:56,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:27:56,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:27:56,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-15 10:27:56,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:27:57,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:27:57,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:27:57,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231015139] [2023-02-15 10:27:57,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231015139] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:27:57,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:27:57,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-02-15 10:27:57,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503060678] [2023-02-15 10:27:57,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:27:57,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-15 10:27:57,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:27:57,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-15 10:27:57,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2023-02-15 10:27:57,079 INFO L87 Difference]: Start difference. First operand 257 states and 307 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 9 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 10:27:58,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:27:58,045 INFO L93 Difference]: Finished difference Result 273 states and 321 transitions. [2023-02-15 10:27:58,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-15 10:27:58,045 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 9 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2023-02-15 10:27:58,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:27:58,047 INFO L225 Difference]: With dead ends: 273 [2023-02-15 10:27:58,047 INFO L226 Difference]: Without dead ends: 270 [2023-02-15 10:27:58,047 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2023-02-15 10:27:58,047 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 379 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 1192 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 1232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-15 10:27:58,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 295 Invalid, 1232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1192 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-15 10:27:58,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2023-02-15 10:27:58,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 257. [2023-02-15 10:27:58,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 221 states have (on average 1.2081447963800904) internal successors, (267), 236 states have internal predecessors, (267), 28 states have call successors, (28), 9 states have call predecessors, (28), 7 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-02-15 10:27:58,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 306 transitions. [2023-02-15 10:27:58,087 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 306 transitions. Word has length 42 [2023-02-15 10:27:58,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:27:58,088 INFO L495 AbstractCegarLoop]: Abstraction has 257 states and 306 transitions. [2023-02-15 10:27:58,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 9 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 10:27:58,088 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 306 transitions. [2023-02-15 10:27:58,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-15 10:27:58,089 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:27:58,089 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:27:58,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-15 10:27:58,090 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:27:58,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:27:58,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1188127317, now seen corresponding path program 1 times [2023-02-15 10:27:58,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:27:58,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243189656] [2023-02-15 10:27:58,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:27:58,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:27:58,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:27:58,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-15 10:27:58,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:27:59,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 10:27:59,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:27:59,125 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 10:27:59,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:27:59,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243189656] [2023-02-15 10:27:59,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243189656] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:27:59,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [148025798] [2023-02-15 10:27:59,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:27:59,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:27:59,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:27:59,127 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) [2023-02-15 10:27:59,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-15 10:27:59,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:27:59,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 167 conjunts are in the unsatisfiable core [2023-02-15 10:27:59,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:27:59,371 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 10:27:59,372 INFO L350 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 [2023-02-15 10:27:59,415 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2023-02-15 10:27:59,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:27:59,426 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 17 treesize of output 7 [2023-02-15 10:27:59,483 INFO L321 Elim1Store]: treesize reduction 69, result has 33.0 percent of original size [2023-02-15 10:27:59,483 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 100 [2023-02-15 10:27:59,491 INFO L350 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 91 [2023-02-15 10:27:59,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:27:59,628 INFO L321 Elim1Store]: treesize reduction 44, result has 38.0 percent of original size [2023-02-15 10:27:59,628 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 153 treesize of output 121 [2023-02-15 10:27:59,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:27:59,635 INFO L350 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 50 treesize of output 43 [2023-02-15 10:27:59,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:27:59,659 INFO L321 Elim1Store]: treesize reduction 30, result has 40.0 percent of original size [2023-02-15 10:27:59,659 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 55 [2023-02-15 10:28:00,069 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 10:28:00,070 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 124 [2023-02-15 10:28:00,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:28:00,078 INFO L350 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 79 treesize of output 79 [2023-02-15 10:28:00,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:28:00,082 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 20 [2023-02-15 10:28:00,097 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-02-15 10:28:00,098 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 26 [2023-02-15 10:28:00,193 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 10:28:00,193 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 11 [2023-02-15 10:28:00,259 INFO L350 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 48 treesize of output 44 [2023-02-15 10:28:00,263 INFO L350 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 40 treesize of output 42 [2023-02-15 10:28:00,277 INFO L350 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 33 treesize of output 27 [2023-02-15 10:28:00,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:28:00,281 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 36 treesize of output 16 [2023-02-15 10:28:00,424 INFO L321 Elim1Store]: treesize reduction 61, result has 19.7 percent of original size [2023-02-15 10:28:00,424 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 137 treesize of output 148 [2023-02-15 10:28:00,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:28:00,432 INFO L321 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2023-02-15 10:28:00,432 INFO L350 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 3 case distinctions, treesize of input 162 treesize of output 113 [2023-02-15 10:28:00,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:28:00,436 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 100 treesize of output 84 [2023-02-15 10:28:00,439 INFO L350 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 59 [2023-02-15 10:28:00,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:28:00,452 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 10:28:00,452 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 57 [2023-02-15 10:28:00,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:28:00,457 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 36 treesize of output 40 [2023-02-15 10:28:00,542 INFO L350 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 61 treesize of output 59 [2023-02-15 10:28:00,553 INFO L321 Elim1Store]: treesize reduction 37, result has 36.2 percent of original size [2023-02-15 10:28:00,554 INFO L350 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 79 [2023-02-15 10:28:00,803 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 30 treesize of output 18 [2023-02-15 10:28:00,805 INFO L350 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 19 treesize of output 11 [2023-02-15 10:28:00,833 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:28:00,833 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:28:01,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [148025798] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:28:01,382 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 10:28:01,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 28 [2023-02-15 10:28:01,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440082302] [2023-02-15 10:28:01,382 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 10:28:01,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-02-15 10:28:01,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:28:01,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-02-15 10:28:01,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1058, Unknown=15, NotChecked=0, Total=1190 [2023-02-15 10:28:01,384 INFO L87 Difference]: Start difference. First operand 257 states and 306 transitions. Second operand has 29 states, 29 states have (on average 2.5172413793103448) internal successors, (73), 19 states have internal predecessors, (73), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 10:28:04,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:28:04,664 INFO L93 Difference]: Finished difference Result 311 states and 365 transitions. [2023-02-15 10:28:04,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-15 10:28:04,673 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.5172413793103448) internal successors, (73), 19 states have internal predecessors, (73), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 43 [2023-02-15 10:28:04,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:28:04,676 INFO L225 Difference]: With dead ends: 311 [2023-02-15 10:28:04,677 INFO L226 Difference]: Without dead ends: 308 [2023-02-15 10:28:04,678 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 436 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=364, Invalid=2372, Unknown=20, NotChecked=0, Total=2756 [2023-02-15 10:28:04,678 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 1643 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 2491 mSolverCounterSat, 303 mSolverCounterUnsat, 73 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1643 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 2867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 303 IncrementalHoareTripleChecker+Valid, 2491 IncrementalHoareTripleChecker+Invalid, 73 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:28:04,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1643 Valid, 480 Invalid, 2867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [303 Valid, 2491 Invalid, 73 Unknown, 0 Unchecked, 2.1s Time] [2023-02-15 10:28:04,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2023-02-15 10:28:04,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 257. [2023-02-15 10:28:04,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 221 states have (on average 1.2036199095022624) internal successors, (266), 236 states have internal predecessors, (266), 28 states have call successors, (28), 9 states have call predecessors, (28), 7 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-02-15 10:28:04,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 305 transitions. [2023-02-15 10:28:04,723 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 305 transitions. Word has length 43 [2023-02-15 10:28:04,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:28:04,724 INFO L495 AbstractCegarLoop]: Abstraction has 257 states and 305 transitions. [2023-02-15 10:28:04,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.5172413793103448) internal successors, (73), 19 states have internal predecessors, (73), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 10:28:04,724 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 305 transitions. [2023-02-15 10:28:04,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-15 10:28:04,724 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:28:04,724 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:28:04,730 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-02-15 10:28:04,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-02-15 10:28:04,932 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:28:04,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:28:04,933 INFO L85 PathProgramCache]: Analyzing trace with hash -2001574846, now seen corresponding path program 1 times [2023-02-15 10:28:04,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:28:04,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180574313] [2023-02-15 10:28:04,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:28:04,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:28:04,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:28:05,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-15 10:28:05,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:28:05,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:28:05,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:28:05,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180574313] [2023-02-15 10:28:05,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180574313] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:28:05,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:28:05,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-02-15 10:28:05,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083236208] [2023-02-15 10:28:05,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:28:05,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-15 10:28:05,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:28:05,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-15 10:28:05,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2023-02-15 10:28:05,742 INFO L87 Difference]: Start difference. First operand 257 states and 305 transitions. Second operand has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 9 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 10:28:06,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:28:06,739 INFO L93 Difference]: Finished difference Result 272 states and 318 transitions. [2023-02-15 10:28:06,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-15 10:28:06,742 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 9 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2023-02-15 10:28:06,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:28:06,743 INFO L225 Difference]: With dead ends: 272 [2023-02-15 10:28:06,743 INFO L226 Difference]: Without dead ends: 269 [2023-02-15 10:28:06,744 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2023-02-15 10:28:06,744 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 371 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 1192 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 1230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-15 10:28:06,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 295 Invalid, 1230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1192 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-15 10:28:06,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2023-02-15 10:28:06,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 257. [2023-02-15 10:28:06,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 221 states have (on average 1.1990950226244343) internal successors, (265), 236 states have internal predecessors, (265), 28 states have call successors, (28), 9 states have call predecessors, (28), 7 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-02-15 10:28:06,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 304 transitions. [2023-02-15 10:28:06,777 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 304 transitions. Word has length 45 [2023-02-15 10:28:06,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:28:06,777 INFO L495 AbstractCegarLoop]: Abstraction has 257 states and 304 transitions. [2023-02-15 10:28:06,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 9 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 10:28:06,777 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 304 transitions. [2023-02-15 10:28:06,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-15 10:28:06,778 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:28:06,778 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:28:06,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-15 10:28:06,778 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:28:06,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:28:06,779 INFO L85 PathProgramCache]: Analyzing trace with hash 438546823, now seen corresponding path program 1 times [2023-02-15 10:28:06,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:28:06,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64609585] [2023-02-15 10:28:06,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:28:06,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:28:06,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:28:07,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-15 10:28:07,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:28:08,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 10:28:08,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:28:08,424 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 10:28:08,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:28:08,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64609585] [2023-02-15 10:28:08,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64609585] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:28:08,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1876716160] [2023-02-15 10:28:08,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:28:08,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:28:08,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:28:08,426 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) [2023-02-15 10:28:08,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-15 10:28:08,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:28:08,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 199 conjunts are in the unsatisfiable core [2023-02-15 10:28:08,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:28:08,695 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 10:28:08,695 INFO L350 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 [2023-02-15 10:28:08,770 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2023-02-15 10:28:08,782 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2023-02-15 10:28:08,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:28:08,793 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 17 treesize of output 7 [2023-02-15 10:28:08,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:28:08,799 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 17 treesize of output 7 [2023-02-15 10:28:08,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:28:08,953 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:28:08,957 INFO L321 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2023-02-15 10:28:08,957 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 166 treesize of output 115 [2023-02-15 10:28:08,961 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 88 [2023-02-15 10:28:08,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:28:08,966 INFO L350 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 33 treesize of output 28 [2023-02-15 10:28:08,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:28:08,970 INFO L350 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 38 [2023-02-15 10:28:08,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:28:08,984 INFO L321 Elim1Store]: treesize reduction 48, result has 18.6 percent of original size [2023-02-15 10:28:08,984 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 52 [2023-02-15 10:28:08,992 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 15 treesize of output 19 [2023-02-15 10:28:08,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:28:09,000 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2023-02-15 10:28:09,087 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 10:28:09,087 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 68 [2023-02-15 10:28:09,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:28:09,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:28:09,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:28:09,095 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:28:09,097 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-15 10:28:09,097 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 63 [2023-02-15 10:28:09,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:28:09,227 INFO L321 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-02-15 10:28:09,227 INFO L350 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 20 treesize of output 22 [2023-02-15 10:28:09,294 INFO L350 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 72 treesize of output 62 [2023-02-15 10:28:09,302 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-15 10:28:09,302 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 47 [2023-02-15 10:28:09,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:28:09,316 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 58 treesize of output 32 [2023-02-15 10:28:09,318 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:28:09,326 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 10:28:09,326 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 38 treesize of output 20 [2023-02-15 10:28:09,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:28:09,506 INFO L321 Elim1Store]: treesize reduction 54, result has 23.9 percent of original size [2023-02-15 10:28:09,507 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 172 treesize of output 118 [2023-02-15 10:28:09,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:28:09,524 INFO L321 Elim1Store]: treesize reduction 42, result has 10.6 percent of original size [2023-02-15 10:28:09,524 INFO L350 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 146 treesize of output 127 [2023-02-15 10:28:09,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:28:09,529 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 98 [2023-02-15 10:28:09,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:28:09,539 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:28:09,587 INFO L321 Elim1Store]: treesize reduction 124, result has 38.6 percent of original size [2023-02-15 10:28:09,588 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 123 treesize of output 125 [2023-02-15 10:28:09,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:28:09,606 INFO L321 Elim1Store]: treesize reduction 50, result has 18.0 percent of original size [2023-02-15 10:28:09,607 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 75 [2023-02-15 10:28:09,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:28:09,642 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 20 [2023-02-15 10:28:09,778 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-15 10:28:09,778 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 339 treesize of output 268 [2023-02-15 10:28:09,786 INFO L321 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2023-02-15 10:28:09,786 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 316 treesize of output 209 [2023-02-15 10:28:11,094 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:28:11,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:28:11,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:28:11,132 INFO L321 Elim1Store]: treesize reduction 55, result has 43.3 percent of original size [2023-02-15 10:28:11,132 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 10 disjoint index pairs (out of 28 index pairs), introduced 9 new quantified variables, introduced 27 case distinctions, treesize of input 291 treesize of output 193 [2023-02-15 10:28:11,182 INFO L321 Elim1Store]: treesize reduction 37, result has 50.7 percent of original size [2023-02-15 10:28:11,183 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 8 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 156 treesize of output 119 [2023-02-15 10:28:11,929 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:28:11,929 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:28:12,164 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2006 (Array Int Int)) (v_ArrVal_2005 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_2006)) (.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_2005)) (.cse4 (+ |c_~#gl_list~0.offset| 4))) (let ((.cse1 (select (select .cse3 |c_~#gl_list~0.base|) .cse4)) (.cse2 (select (select .cse0 |c_~#gl_list~0.base|) .cse4))) (or (not (= (select (select .cse0 .cse1) .cse2) .cse2)) (not (= .cse1 (select (select .cse3 .cse1) .cse2))))))) is different from false [2023-02-15 10:28:14,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1876716160] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:28:14,388 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 10:28:14,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 30 [2023-02-15 10:28:14,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011839593] [2023-02-15 10:28:14,388 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 10:28:14,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-02-15 10:28:14,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:28:14,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-02-15 10:28:14,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1188, Unknown=34, NotChecked=70, Total=1406 [2023-02-15 10:28:14,390 INFO L87 Difference]: Start difference. First operand 257 states and 304 transitions. Second operand has 31 states, 31 states have (on average 2.5483870967741935) internal successors, (79), 21 states have internal predecessors, (79), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 10:28:22,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:28:22,715 INFO L93 Difference]: Finished difference Result 369 states and 430 transitions. [2023-02-15 10:28:22,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-02-15 10:28:22,716 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.5483870967741935) internal successors, (79), 21 states have internal predecessors, (79), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 46 [2023-02-15 10:28:22,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:28:22,721 INFO L225 Difference]: With dead ends: 369 [2023-02-15 10:28:22,721 INFO L226 Difference]: Without dead ends: 366 [2023-02-15 10:28:22,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 513 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=339, Invalid=2706, Unknown=39, NotChecked=108, Total=3192 [2023-02-15 10:28:22,722 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 1084 mSDsluCounter, 943 mSDsCounter, 0 mSdLazyCounter, 4382 mSolverCounterSat, 154 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1084 SdHoareTripleChecker+Valid, 997 SdHoareTripleChecker+Invalid, 4550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 4382 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2023-02-15 10:28:22,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1084 Valid, 997 Invalid, 4550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 4382 Invalid, 14 Unknown, 0 Unchecked, 4.3s Time] [2023-02-15 10:28:22,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2023-02-15 10:28:22,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 342. [2023-02-15 10:28:22,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 298 states have (on average 1.1979865771812082) internal successors, (357), 314 states have internal predecessors, (357), 33 states have call successors, (33), 12 states have call predecessors, (33), 10 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-02-15 10:28:22,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 405 transitions. [2023-02-15 10:28:22,763 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 405 transitions. Word has length 46 [2023-02-15 10:28:22,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:28:22,763 INFO L495 AbstractCegarLoop]: Abstraction has 342 states and 405 transitions. [2023-02-15 10:28:22,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.5483870967741935) internal successors, (79), 21 states have internal predecessors, (79), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 10:28:22,764 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 405 transitions. [2023-02-15 10:28:22,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-02-15 10:28:22,764 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:28:22,764 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:28:22,773 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-15 10:28:22,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:28:22,970 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:28:22,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:28:22,971 INFO L85 PathProgramCache]: Analyzing trace with hash -2049301828, now seen corresponding path program 1 times [2023-02-15 10:28:22,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:28:22,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115581462] [2023-02-15 10:28:22,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:28:22,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:28:22,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:28:23,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-15 10:28:23,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:28:23,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:28:23,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:28:23,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115581462] [2023-02-15 10:28:23,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115581462] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:28:23,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:28:23,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 10:28:23,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603057462] [2023-02-15 10:28:23,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:28:23,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 10:28:23,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:28:23,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 10:28:23,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 10:28:23,021 INFO L87 Difference]: Start difference. First operand 342 states and 405 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 10:28:23,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:28:23,287 INFO L93 Difference]: Finished difference Result 344 states and 406 transitions. [2023-02-15 10:28:23,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 10:28:23,288 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2023-02-15 10:28:23,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:28:23,290 INFO L225 Difference]: With dead ends: 344 [2023-02-15 10:28:23,291 INFO L226 Difference]: Without dead ends: 341 [2023-02-15 10:28:23,291 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-02-15 10:28:23,291 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 106 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 10:28:23,292 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 174 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 10:28:23,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2023-02-15 10:28:23,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 341. [2023-02-15 10:28:23,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 298 states have (on average 1.1845637583892616) internal successors, (353), 313 states have internal predecessors, (353), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-02-15 10:28:23,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 400 transitions. [2023-02-15 10:28:23,332 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 400 transitions. Word has length 48 [2023-02-15 10:28:23,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:28:23,332 INFO L495 AbstractCegarLoop]: Abstraction has 341 states and 400 transitions. [2023-02-15 10:28:23,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 10:28:23,332 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 400 transitions. [2023-02-15 10:28:23,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-02-15 10:28:23,333 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:28:23,333 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:28:23,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-02-15 10:28:23,333 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:28:23,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:28:23,334 INFO L85 PathProgramCache]: Analyzing trace with hash -764602366, now seen corresponding path program 1 times [2023-02-15 10:28:23,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:28:23,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846366008] [2023-02-15 10:28:23,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:28:23,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:28:23,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:28:24,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-15 10:28:24,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:28:24,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 10:28:24,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:28:25,207 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 10:28:25,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:28:25,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846366008] [2023-02-15 10:28:25,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846366008] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:28:25,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [38007319] [2023-02-15 10:28:25,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:28:25,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:28:25,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:28:25,209 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) [2023-02-15 10:28:25,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-15 10:28:25,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:28:25,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 178 conjunts are in the unsatisfiable core [2023-02-15 10:28:25,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:28:25,474 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 10:28:25,474 INFO L350 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 [2023-02-15 10:28:25,534 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2023-02-15 10:28:25,540 INFO L350 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 18 [2023-02-15 10:28:25,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:28:25,554 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 17 treesize of output 7 [2023-02-15 10:28:25,558 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-02-15 10:28:25,711 INFO L321 Elim1Store]: treesize reduction 73, result has 3.9 percent of original size [2023-02-15 10:28:25,711 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 101 treesize of output 116 [2023-02-15 10:28:25,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:28:25,737 INFO L321 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2023-02-15 10:28:25,738 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 92 treesize of output 94 [2023-02-15 10:28:25,745 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 54 [2023-02-15 10:28:25,761 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-02-15 10:28:25,761 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 58 [2023-02-15 10:28:26,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:28:26,017 INFO L350 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 113 treesize of output 113 [2023-02-15 10:28:26,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:28:26,021 INFO L350 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 85 treesize of output 85 [2023-02-15 10:28:26,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:28:26,024 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 82 [2023-02-15 10:28:26,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:28:26,027 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 83 [2023-02-15 10:28:26,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:28:26,031 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 78 [2023-02-15 10:28:26,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:28:26,036 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 69 treesize of output 73 [2023-02-15 10:28:26,068 INFO L350 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 7 treesize of output 5 [2023-02-15 10:28:26,086 INFO L350 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 34 treesize of output 26 [2023-02-15 10:28:26,113 INFO L350 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 5 treesize of output 3 [2023-02-15 10:28:26,124 INFO L350 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 5 treesize of output 3 [2023-02-15 10:28:26,277 INFO L321 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2023-02-15 10:28:26,278 INFO L350 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 102 treesize of output 98 [2023-02-15 10:28:26,392 INFO L350 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 88 treesize of output 80 [2023-02-15 10:28:26,397 INFO L350 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 80 treesize of output 76 [2023-02-15 10:28:26,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:28:26,423 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 17 treesize of output 7 [2023-02-15 10:28:26,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:28:26,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 18 treesize of output 8 [2023-02-15 10:28:26,426 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:28:26,427 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:28:26,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:28:26,560 INFO L321 Elim1Store]: treesize reduction 70, result has 19.5 percent of original size [2023-02-15 10:28:26,560 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 174 treesize of output 126 [2023-02-15 10:28:26,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:28:26,573 INFO L321 Elim1Store]: treesize reduction 42, result has 10.6 percent of original size [2023-02-15 10:28:26,573 INFO L350 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 144 treesize of output 131 [2023-02-15 10:28:26,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:28:26,577 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 120 treesize of output 106 [2023-02-15 10:28:26,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:28:26,594 INFO L321 Elim1Store]: treesize reduction 34, result has 24.4 percent of original size [2023-02-15 10:28:26,594 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 117 treesize of output 150 [2023-02-15 10:28:26,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:28:26,600 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 73 treesize of output 67 [2023-02-15 10:28:26,604 INFO L350 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 8 treesize of output 7 [2023-02-15 10:28:26,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:28:26,628 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 16 [2023-02-15 10:28:26,630 INFO L350 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 5 treesize of output 3 [2023-02-15 10:28:26,742 INFO L321 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2023-02-15 10:28:26,742 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 85 treesize of output 94 [2023-02-15 10:28:26,750 INFO L350 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 90 treesize of output 88 [2023-02-15 10:28:29,437 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 22 treesize of output 10 [2023-02-15 10:28:29,517 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-15 10:28:29,517 INFO L350 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 51 treesize of output 25 [2023-02-15 10:28:29,552 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:28:29,552 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:28:29,886 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_~#gl_list~0.offset| 4))) (and (forall ((v_ArrVal_2488 (Array Int Int)) (v_ArrVal_2487 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_2488))) (let ((.cse0 (select (select .cse1 |c_~#gl_list~0.base|) .cse2))) (or (= .cse0 |c_~#gl_list~0.base|) (not (= .cse0 (select (select .cse1 .cse0) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_2487) |c_~#gl_list~0.base|) .cse2) 4)))))))) (forall ((v_ArrVal_2488 (Array Int Int)) (v_ArrVal_2487 (Array Int Int))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_2487) |c_~#gl_list~0.base|) .cse2))) (or (= |c_~#gl_list~0.offset| .cse3) (not (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_2488))) (let ((.cse4 (select (select .cse5 |c_~#gl_list~0.base|) .cse2))) (= .cse4 (select (select .cse5 .cse4) (+ .cse3 4))))))))))) is different from false [2023-02-15 10:28:30,125 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))) (let ((.cse6 (+ |c_ULTIMATE.start_gl_insert_~node~1#1.offset| 4)) (.cse3 (+ |c_~#gl_list~0.offset| 4)) (.cse4 (store |c_#memory_$Pointer$.base| .cse5 (store (select |c_#memory_$Pointer$.base| .cse5) (+ (select (select |c_#memory_$Pointer$.offset| |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|) 4) |c_ULTIMATE.start_gl_insert_~node~1#1.base|)))) (and (forall ((v_ArrVal_2517 (Array Int Int)) (v_ArrVal_2516 (Array Int Int)) (v_ArrVal_2515 (Array Int Int)) (v_ArrVal_2513 (Array Int Int)) (v_ArrVal_2512 (Array Int Int)) (v_ArrVal_2488 (Array Int Int)) (v_ArrVal_2487 (Array Int Int)) (v_ArrVal_2514 Int) (v_ArrVal_2518 (Array Int Int))) (let ((.cse0 (select (select (store (store (store (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_2518) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_2515) |c_~#gl_list~0.base| (store (select (store (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_2516) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_2512) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| .cse6)) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_2487) |c_~#gl_list~0.base|) .cse3))) (or (= |c_~#gl_list~0.offset| .cse0) (not (let ((.cse1 (store (store (store .cse4 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_2513) |c_~#gl_list~0.base| (store (select (store .cse4 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_2517) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| v_ArrVal_2514)) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_2488))) (let ((.cse2 (select (select .cse1 |c_~#gl_list~0.base|) .cse3))) (= (select (select .cse1 .cse2) (+ .cse0 4)) .cse2))))))) (forall ((v_ArrVal_2517 (Array Int Int)) (v_ArrVal_2516 (Array Int Int)) (v_ArrVal_2515 (Array Int Int)) (v_ArrVal_2513 (Array Int Int)) (v_ArrVal_2512 (Array Int Int)) (v_ArrVal_2488 (Array Int Int)) (v_ArrVal_2487 (Array Int Int)) (v_ArrVal_2514 Int) (v_ArrVal_2518 (Array Int Int))) (let ((.cse8 (store (store (store .cse4 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_2513) |c_~#gl_list~0.base| (store (select (store .cse4 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_2517) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| v_ArrVal_2514)) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_2488))) (let ((.cse7 (select (select .cse8 |c_~#gl_list~0.base|) .cse3))) (or (= .cse7 |c_~#gl_list~0.base|) (not (= (select (select .cse8 .cse7) (+ (select (select (store (store (store (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_2518) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_2515) |c_~#gl_list~0.base| (store (select (store (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_2516) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_2512) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| .cse6)) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_2487) |c_~#gl_list~0.base|) .cse3) 4)) .cse7))))))))) is different from false [2023-02-15 10:28:30,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [38007319] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:28:30,127 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 10:28:30,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18] total 32 [2023-02-15 10:28:30,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751497042] [2023-02-15 10:28:30,127 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 10:28:30,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-02-15 10:28:30,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:28:30,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-02-15 10:28:30,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1440, Unknown=8, NotChecked=154, Total=1722 [2023-02-15 10:28:30,129 INFO L87 Difference]: Start difference. First operand 341 states and 400 transitions. Second operand has 33 states, 33 states have (on average 2.5757575757575757) internal successors, (85), 23 states have internal predecessors, (85), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 10:28:35,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:28:35,434 INFO L93 Difference]: Finished difference Result 365 states and 421 transitions. [2023-02-15 10:28:35,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-02-15 10:28:35,434 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.5757575757575757) internal successors, (85), 23 states have internal predecessors, (85), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 49 [2023-02-15 10:28:35,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:28:35,436 INFO L225 Difference]: With dead ends: 365 [2023-02-15 10:28:35,436 INFO L226 Difference]: Without dead ends: 362 [2023-02-15 10:28:35,436 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 467 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=293, Invalid=2894, Unknown=13, NotChecked=222, Total=3422 [2023-02-15 10:28:35,437 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 882 mSDsluCounter, 970 mSDsCounter, 0 mSdLazyCounter, 4647 mSolverCounterSat, 133 mSolverCounterUnsat, 92 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 882 SdHoareTripleChecker+Valid, 1024 SdHoareTripleChecker+Invalid, 4872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 4647 IncrementalHoareTripleChecker+Invalid, 92 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2023-02-15 10:28:35,437 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [882 Valid, 1024 Invalid, 4872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 4647 Invalid, 92 Unknown, 0 Unchecked, 3.8s Time] [2023-02-15 10:28:35,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2023-02-15 10:28:35,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 341. [2023-02-15 10:28:35,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 298 states have (on average 1.1812080536912752) internal successors, (352), 313 states have internal predecessors, (352), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-02-15 10:28:35,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 399 transitions. [2023-02-15 10:28:35,481 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 399 transitions. Word has length 49 [2023-02-15 10:28:35,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:28:35,481 INFO L495 AbstractCegarLoop]: Abstraction has 341 states and 399 transitions. [2023-02-15 10:28:35,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.5757575757575757) internal successors, (85), 23 states have internal predecessors, (85), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 10:28:35,481 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 399 transitions. [2023-02-15 10:28:35,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-15 10:28:35,482 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:28:35,482 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:28:35,490 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-15 10:28:35,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-02-15 10:28:35,688 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:28:35,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:28:35,688 INFO L85 PathProgramCache]: Analyzing trace with hash 2059695343, now seen corresponding path program 1 times [2023-02-15 10:28:35,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:28:35,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471070477] [2023-02-15 10:28:35,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:28:35,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:28:35,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:28:35,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-15 10:28:35,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:28:35,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:28:35,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:28:35,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471070477] [2023-02-15 10:28:35,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471070477] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:28:35,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:28:35,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-15 10:28:35,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050052565] [2023-02-15 10:28:35,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:28:35,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-15 10:28:35,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:28:35,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 10:28:35,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-02-15 10:28:35,833 INFO L87 Difference]: Start difference. First operand 341 states and 399 transitions. Second operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 10:28:36,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:28:36,269 INFO L93 Difference]: Finished difference Result 343 states and 400 transitions. [2023-02-15 10:28:36,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 10:28:36,270 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2023-02-15 10:28:36,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:28:36,271 INFO L225 Difference]: With dead ends: 343 [2023-02-15 10:28:36,271 INFO L226 Difference]: Without dead ends: 340 [2023-02-15 10:28:36,272 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2023-02-15 10:28:36,272 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 163 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 606 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 10:28:36,272 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 306 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 606 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 10:28:36,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2023-02-15 10:28:36,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2023-02-15 10:28:36,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 298 states have (on average 1.167785234899329) internal successors, (348), 312 states have internal predecessors, (348), 31 states have call successors, (31), 12 states have call predecessors, (31), 10 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-02-15 10:28:36,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 394 transitions. [2023-02-15 10:28:36,315 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 394 transitions. Word has length 51 [2023-02-15 10:28:36,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:28:36,315 INFO L495 AbstractCegarLoop]: Abstraction has 340 states and 394 transitions. [2023-02-15 10:28:36,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 10:28:36,315 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 394 transitions. [2023-02-15 10:28:36,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-02-15 10:28:36,316 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:28:36,316 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:28:36,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-02-15 10:28:36,316 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:28:36,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:28:36,316 INFO L85 PathProgramCache]: Analyzing trace with hash 2029277591, now seen corresponding path program 1 times [2023-02-15 10:28:36,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:28:36,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474307103] [2023-02-15 10:28:36,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:28:36,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:28:36,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:28:37,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-15 10:28:37,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:28:37,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 10:28:37,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:28:37,721 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 10:28:37,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:28:37,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474307103] [2023-02-15 10:28:37,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474307103] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:28:37,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [214880997] [2023-02-15 10:28:37,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:28:37,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:28:37,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:28:37,723 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) [2023-02-15 10:28:37,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-15 10:28:37,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:28:37,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 132 conjunts are in the unsatisfiable core [2023-02-15 10:28:37,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:28:37,995 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 10:28:37,996 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 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 [2023-02-15 10:28:38,038 INFO L350 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 14 treesize of output 16 [2023-02-15 10:28:38,044 INFO L350 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 14 treesize of output 16 [2023-02-15 10:28:38,057 INFO L350 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 [2023-02-15 10:28:38,059 INFO L350 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 [2023-02-15 10:28:38,152 INFO L321 Elim1Store]: treesize reduction 77, result has 3.8 percent of original size [2023-02-15 10:28:38,152 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 54 treesize of output 68 [2023-02-15 10:28:38,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:28:38,163 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 43 [2023-02-15 10:28:38,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:28:38,167 INFO L350 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 49 treesize of output 25 [2023-02-15 10:28:38,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:28:38,169 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 25 treesize of output 27 [2023-02-15 10:28:38,171 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2023-02-15 10:28:38,209 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 10:28:38,210 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 37 [2023-02-15 10:28:38,287 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 10:28:38,287 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 11 [2023-02-15 10:28:38,333 INFO L350 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 36 treesize of output 32 [2023-02-15 10:28:38,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:28:38,345 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 30 treesize of output 12 [2023-02-15 10:28:38,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:28:38,450 INFO L321 Elim1Store]: treesize reduction 54, result has 23.9 percent of original size [2023-02-15 10:28:38,450 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 83 treesize of output 57 [2023-02-15 10:28:38,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:28:38,476 INFO L321 Elim1Store]: treesize reduction 38, result has 19.1 percent of original size [2023-02-15 10:28:38,476 INFO L350 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 57 treesize of output 56 [2023-02-15 10:28:38,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:28:38,480 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 43 treesize of output 37 [2023-02-15 10:28:38,488 INFO L350 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 7 treesize of output 3 [2023-02-15 10:28:38,550 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-02-15 10:28:38,550 INFO L350 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 52 treesize of output 58 [2023-02-15 10:28:38,562 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:28:38,725 INFO L350 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 24 treesize of output 12 [2023-02-15 10:28:38,728 INFO L350 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 [2023-02-15 10:28:38,786 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:28:38,786 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:28:38,863 INFO L350 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 19 treesize of output 7 [2023-02-15 10:28:38,949 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2949 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_2949) |c_~#gl_list~0.base|) (+ |c_~#gl_list~0.offset| 4)) 0))) is different from false [2023-02-15 10:28:39,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [214880997] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:28:39,114 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 10:28:39,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 30 [2023-02-15 10:28:39,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283952849] [2023-02-15 10:28:39,114 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 10:28:39,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-02-15 10:28:39,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:28:39,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-02-15 10:28:39,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1127, Unknown=10, NotChecked=68, Total=1332 [2023-02-15 10:28:39,117 INFO L87 Difference]: Start difference. First operand 340 states and 394 transitions. Second operand has 31 states, 31 states have (on average 2.935483870967742) internal successors, (91), 21 states have internal predecessors, (91), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 10:28:42,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:28:42,198 INFO L93 Difference]: Finished difference Result 361 states and 412 transitions. [2023-02-15 10:28:42,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-02-15 10:28:42,198 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.935483870967742) internal successors, (91), 21 states have internal predecessors, (91), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 52 [2023-02-15 10:28:42,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:28:42,199 INFO L225 Difference]: With dead ends: 361 [2023-02-15 10:28:42,199 INFO L226 Difference]: Without dead ends: 358 [2023-02-15 10:28:42,200 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 844 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=448, Invalid=2955, Unknown=23, NotChecked=114, Total=3540 [2023-02-15 10:28:42,200 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 1362 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 2275 mSolverCounterSat, 191 mSolverCounterUnsat, 83 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1365 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 2549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 2275 IncrementalHoareTripleChecker+Invalid, 83 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-02-15 10:28:42,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1365 Valid, 468 Invalid, 2549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 2275 Invalid, 83 Unknown, 0 Unchecked, 1.9s Time] [2023-02-15 10:28:42,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2023-02-15 10:28:42,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 340. [2023-02-15 10:28:42,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 298 states have (on average 1.1610738255033557) internal successors, (346), 312 states have internal predecessors, (346), 31 states have call successors, (31), 12 states have call predecessors, (31), 10 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-02-15 10:28:42,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 392 transitions. [2023-02-15 10:28:42,244 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 392 transitions. Word has length 52 [2023-02-15 10:28:42,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:28:42,244 INFO L495 AbstractCegarLoop]: Abstraction has 340 states and 392 transitions. [2023-02-15 10:28:42,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.935483870967742) internal successors, (91), 21 states have internal predecessors, (91), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 10:28:42,244 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 392 transitions. [2023-02-15 10:28:42,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-02-15 10:28:42,245 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:28:42,245 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:28:42,255 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-15 10:28:42,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-02-15 10:28:42,452 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:28:42,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:28:42,452 INFO L85 PathProgramCache]: Analyzing trace with hash -617053959, now seen corresponding path program 1 times [2023-02-15 10:28:42,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:28:42,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235664548] [2023-02-15 10:28:42,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:28:42,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:28:42,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:28:42,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-15 10:28:42,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:28:42,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:28:42,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:28:42,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235664548] [2023-02-15 10:28:42,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235664548] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:28:42,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:28:42,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 10:28:42,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752921466] [2023-02-15 10:28:42,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:28:42,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 10:28:42,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:28:42,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 10:28:42,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 10:28:42,490 INFO L87 Difference]: Start difference. First operand 340 states and 392 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 10:28:42,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:28:42,635 INFO L93 Difference]: Finished difference Result 342 states and 393 transitions. [2023-02-15 10:28:42,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 10:28:42,636 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2023-02-15 10:28:42,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:28:42,637 INFO L225 Difference]: With dead ends: 342 [2023-02-15 10:28:42,637 INFO L226 Difference]: Without dead ends: 339 [2023-02-15 10:28:42,638 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 10:28:42,638 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 92 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:28:42,638 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 108 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 10:28:42,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2023-02-15 10:28:42,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 339. [2023-02-15 10:28:42,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 298 states have (on average 1.1476510067114094) internal successors, (342), 311 states have internal predecessors, (342), 30 states have call successors, (30), 12 states have call predecessors, (30), 10 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-02-15 10:28:42,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 387 transitions. [2023-02-15 10:28:42,682 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 387 transitions. Word has length 53 [2023-02-15 10:28:42,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:28:42,682 INFO L495 AbstractCegarLoop]: Abstraction has 339 states and 387 transitions. [2023-02-15 10:28:42,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 10:28:42,683 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 387 transitions. [2023-02-15 10:28:42,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-02-15 10:28:42,683 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:28:42,683 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:28:42,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-02-15 10:28:42,683 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:28:42,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:28:42,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1943731347, now seen corresponding path program 1 times [2023-02-15 10:28:42,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:28:42,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990259583] [2023-02-15 10:28:42,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:28:42,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:28:42,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:28:44,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-15 10:28:44,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:28:44,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 10:28:44,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:28:44,775 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 10:28:44,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:28:44,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990259583] [2023-02-15 10:28:44,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990259583] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:28:44,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [908369601] [2023-02-15 10:28:44,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:28:44,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:28:44,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:28:44,777 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) [2023-02-15 10:28:44,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-15 10:28:45,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:28:45,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 196 conjunts are in the unsatisfiable core [2023-02-15 10:28:45,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:28:45,077 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 10:28:45,077 INFO L350 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 [2023-02-15 10:28:45,136 INFO L350 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 18 [2023-02-15 10:28:45,149 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2023-02-15 10:28:45,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:28:45,163 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 17 treesize of output 7 [2023-02-15 10:28:45,170 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-02-15 10:28:45,330 INFO L321 Elim1Store]: treesize reduction 73, result has 3.9 percent of original size [2023-02-15 10:28:45,331 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 116 treesize of output 120 [2023-02-15 10:28:45,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:28:45,357 INFO L321 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2023-02-15 10:28:45,357 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 96 treesize of output 100 [2023-02-15 10:28:45,371 INFO L321 Elim1Store]: treesize reduction 17, result has 43.3 percent of original size [2023-02-15 10:28:45,371 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 45 [2023-02-15 10:28:45,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:28:45,375 INFO L350 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 39 treesize of output 34 [2023-02-15 10:28:45,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:28:45,379 INFO L350 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 64 treesize of output 38 [2023-02-15 10:28:45,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:28:45,392 INFO L321 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2023-02-15 10:28:45,393 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 44 [2023-02-15 10:28:45,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:28:45,408 INFO L321 Elim1Store]: treesize reduction 30, result has 40.0 percent of original size [2023-02-15 10:28:45,409 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 55 [2023-02-15 10:28:45,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:28:45,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:28:45,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:28:45,525 INFO L350 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 84 [2023-02-15 10:28:45,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:28:45,530 INFO L350 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 73 treesize of output 73 [2023-02-15 10:28:45,714 INFO L321 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-02-15 10:28:45,714 INFO L350 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 20 treesize of output 22 [2023-02-15 10:28:45,828 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 10:28:45,828 INFO L350 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 103 treesize of output 95 [2023-02-15 10:28:45,840 INFO L350 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 79 treesize of output 74 [2023-02-15 10:28:45,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:28:45,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:28:45,862 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:28:45,862 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 89 treesize of output 52 [2023-02-15 10:28:45,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:28:45,865 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 25 [2023-02-15 10:28:46,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:28:46,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:28:46,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:28:46,056 INFO L321 Elim1Store]: treesize reduction 54, result has 23.9 percent of original size [2023-02-15 10:28:46,057 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 192 treesize of output 135 [2023-02-15 10:28:46,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:28:46,075 INFO L321 Elim1Store]: treesize reduction 42, result has 10.6 percent of original size [2023-02-15 10:28:46,075 INFO L350 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 166 treesize of output 141 [2023-02-15 10:28:46,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:28:46,080 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 134 treesize of output 112 [2023-02-15 10:28:46,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:28:46,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:28:46,085 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 83 [2023-02-15 10:28:46,089 INFO L350 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 78 treesize of output 72 [2023-02-15 10:28:46,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:28:46,095 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 54 treesize of output 50 [2023-02-15 10:28:46,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:28:46,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:28:46,103 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 21 treesize of output 30 [2023-02-15 10:28:46,295 INFO L321 Elim1Store]: treesize reduction 78, result has 21.2 percent of original size [2023-02-15 10:28:46,295 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 5 case distinctions, treesize of input 192 treesize of output 180 [2023-02-15 10:28:46,317 INFO L321 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2023-02-15 10:28:46,318 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 179 treesize of output 170 [2023-02-15 10:28:46,372 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:28:47,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:28:47,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:28:47,874 INFO L321 Elim1Store]: treesize reduction 24, result has 11.1 percent of original size [2023-02-15 10:28:47,874 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 27 [2023-02-15 10:28:47,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:28:47,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:28:47,882 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:28:47,887 INFO L321 Elim1Store]: treesize reduction 18, result has 14.3 percent of original size [2023-02-15 10:28:47,887 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 28 [2023-02-15 10:28:47,935 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:28:47,935 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:28:48,267 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_~#gl_list~0.offset| 4))) (and (forall ((v_ArrVal_3421 (Array Int Int)) (v_ArrVal_3422 (Array Int Int))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3421) |c_~#gl_list~0.base|) .cse3))) (or (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3422))) (let ((.cse0 (+ (select (select .cse1 |c_~#gl_list~0.base|) .cse3) 8))) (= .cse0 (select (select .cse1 .cse2) .cse0)))) (= .cse2 |c_~#gl_list~0.base|)))) (forall ((v_ArrVal_3421 (Array Int Int)) (v_ArrVal_3422 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3422))) (let ((.cse6 (select (select .cse5 |c_~#gl_list~0.base|) .cse3))) (or (let ((.cse4 (+ .cse6 8))) (= .cse4 (select (select .cse5 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3421) |c_~#gl_list~0.base|) .cse3)) .cse4))) (= |c_~#gl_list~0.offset| .cse6))))) (forall ((v_ArrVal_3421 (Array Int Int)) (v_ArrVal_3422 (Array Int Int))) (let ((.cse9 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3422) |c_~#gl_list~0.base|) .cse3))) (or (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3421))) (let ((.cse7 (select (select .cse8 |c_~#gl_list~0.base|) .cse3))) (= .cse7 (select (select .cse8 .cse7) (+ .cse9 8))))) (= |c_~#gl_list~0.offset| .cse9)))) (forall ((v_ArrVal_3421 (Array Int Int)) (v_ArrVal_3422 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3421))) (let ((.cse10 (select (select .cse11 |c_~#gl_list~0.base|) .cse3))) (or (= .cse10 |c_~#gl_list~0.base|) (= .cse10 (select (select .cse11 .cse10) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3422) |c_~#gl_list~0.base|) .cse3) 8))))))))) is different from false [2023-02-15 10:28:48,613 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))) (let ((.cse8 (select |c_#memory_$Pointer$.offset| .cse5)) (.cse9 (+ |c_ULTIMATE.start_gl_insert_~node~1#1.offset| 4)) (.cse6 (select |c_#memory_$Pointer$.base| .cse5)) (.cse3 (+ |c_~#gl_list~0.offset| 4)) (.cse10 (select (select |c_#memory_$Pointer$.offset| |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))) (and (forall ((|v_list_add___list_add_~next#1.offset_20| Int)) (or (forall ((v_ArrVal_3450 (Array Int Int)) (v_ArrVal_3451 (Array Int Int)) (v_ArrVal_3452 (Array Int Int)) (v_ArrVal_3447 Int) (v_ArrVal_3421 (Array Int Int)) (v_ArrVal_3422 (Array Int Int)) (v_ArrVal_3448 (Array Int Int)) (v_ArrVal_3449 (Array Int Int))) (let ((.cse7 (+ |v_list_add___list_add_~next#1.offset_20| 4))) (let ((.cse2 (select (select (store (store (store (store |c_#memory_$Pointer$.offset| .cse5 (store .cse8 .cse7 .cse9)) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3450) |c_~#gl_list~0.base| (store (select (store (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_3451) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3449) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| .cse9)) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3422) |c_~#gl_list~0.base|) .cse3))) (or (let ((.cse1 (store (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse5 (store .cse6 .cse7 |c_ULTIMATE.start_gl_insert_~node~1#1.base|)))) (store (store .cse4 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3448) |c_~#gl_list~0.base| (store (select (store .cse4 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3452) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| v_ArrVal_3447))) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3421))) (let ((.cse0 (select (select .cse1 |c_~#gl_list~0.base|) .cse3))) (= .cse0 (select (select .cse1 .cse0) (+ .cse2 8))))) (= |c_~#gl_list~0.offset| .cse2))))) (< .cse10 |v_list_add___list_add_~next#1.offset_20|))) (forall ((|v_list_add___list_add_~next#1.offset_20| Int)) (or (forall ((v_ArrVal_3450 (Array Int Int)) (v_ArrVal_3451 (Array Int Int)) (v_ArrVal_3452 (Array Int Int)) (v_ArrVal_3447 Int) (v_ArrVal_3421 (Array Int Int)) (v_ArrVal_3422 (Array Int Int)) (v_ArrVal_3448 (Array Int Int)) (v_ArrVal_3449 (Array Int Int))) (let ((.cse13 (+ |v_list_add___list_add_~next#1.offset_20| 4))) (let ((.cse12 (store (let ((.cse14 (store |c_#memory_$Pointer$.base| .cse5 (store .cse6 .cse13 |c_ULTIMATE.start_gl_insert_~node~1#1.base|)))) (store (store .cse14 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3448) |c_~#gl_list~0.base| (store (select (store .cse14 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3452) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| v_ArrVal_3447))) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3421))) (let ((.cse11 (select (select .cse12 |c_~#gl_list~0.base|) .cse3))) (or (= .cse11 (select (select .cse12 .cse11) (+ (select (select (store (store (store (store |c_#memory_$Pointer$.offset| .cse5 (store .cse8 .cse13 .cse9)) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3450) |c_~#gl_list~0.base| (store (select (store (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_3451) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3449) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| .cse9)) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3422) |c_~#gl_list~0.base|) .cse3) 8))) (= .cse11 |c_~#gl_list~0.base|)))))) (< .cse10 |v_list_add___list_add_~next#1.offset_20|))) (forall ((|v_list_add___list_add_~next#1.offset_20| Int)) (or (forall ((v_ArrVal_3450 (Array Int Int)) (v_ArrVal_3451 (Array Int Int)) (v_ArrVal_3452 (Array Int Int)) (v_ArrVal_3447 Int) (v_ArrVal_3421 (Array Int Int)) (v_ArrVal_3422 (Array Int Int)) (v_ArrVal_3448 (Array Int Int)) (v_ArrVal_3449 (Array Int Int))) (let ((.cse17 (+ |v_list_add___list_add_~next#1.offset_20| 4))) (let ((.cse15 (store (store (store (store |c_#memory_$Pointer$.offset| .cse5 (store .cse8 .cse17 .cse9)) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3450) |c_~#gl_list~0.base| (store (select (store (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_3451) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3449) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| .cse9)) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3422))) (let ((.cse19 (select (select .cse15 |c_~#gl_list~0.base|) .cse3))) (or (let ((.cse18 (+ .cse19 8))) (= (select (select .cse15 (select (select (store (let ((.cse16 (store |c_#memory_$Pointer$.base| .cse5 (store .cse6 .cse17 |c_ULTIMATE.start_gl_insert_~node~1#1.base|)))) (store (store .cse16 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3448) |c_~#gl_list~0.base| (store (select (store .cse16 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3452) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| v_ArrVal_3447))) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3421) |c_~#gl_list~0.base|) .cse3)) .cse18) .cse18)) (= |c_~#gl_list~0.offset| .cse19)))))) (< .cse10 |v_list_add___list_add_~next#1.offset_20|))) (forall ((|v_list_add___list_add_~next#1.offset_20| Int)) (or (forall ((v_ArrVal_3450 (Array Int Int)) (v_ArrVal_3451 (Array Int Int)) (v_ArrVal_3452 (Array Int Int)) (v_ArrVal_3447 Int) (v_ArrVal_3421 (Array Int Int)) (v_ArrVal_3422 (Array Int Int)) (v_ArrVal_3448 (Array Int Int)) (v_ArrVal_3449 (Array Int Int))) (let ((.cse23 (+ |v_list_add___list_add_~next#1.offset_20| 4))) (let ((.cse21 (select (select (store (let ((.cse24 (store |c_#memory_$Pointer$.base| .cse5 (store .cse6 .cse23 |c_ULTIMATE.start_gl_insert_~node~1#1.base|)))) (store (store .cse24 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3448) |c_~#gl_list~0.base| (store (select (store .cse24 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3452) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| v_ArrVal_3447))) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3421) |c_~#gl_list~0.base|) .cse3))) (or (let ((.cse20 (store (store (store (store |c_#memory_$Pointer$.offset| .cse5 (store .cse8 .cse23 .cse9)) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3450) |c_~#gl_list~0.base| (store (select (store (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_3451) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3449) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| .cse9)) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3422))) (let ((.cse22 (+ (select (select .cse20 |c_~#gl_list~0.base|) .cse3) 8))) (= (select (select .cse20 .cse21) .cse22) .cse22))) (= .cse21 |c_~#gl_list~0.base|))))) (< .cse10 |v_list_add___list_add_~next#1.offset_20|)))))) is different from false [2023-02-15 10:28:48,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [908369601] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:28:48,621 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 10:28:48,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19] total 34 [2023-02-15 10:28:48,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371529385] [2023-02-15 10:28:48,622 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 10:28:48,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-02-15 10:28:48,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:28:48,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-02-15 10:28:48,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1370, Unknown=4, NotChecked=150, Total=1640 [2023-02-15 10:28:48,623 INFO L87 Difference]: Start difference. First operand 339 states and 387 transitions. Second operand has 35 states, 35 states have (on average 2.7714285714285714) internal successors, (97), 25 states have internal predecessors, (97), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 10:28:55,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:28:55,568 INFO L93 Difference]: Finished difference Result 357 states and 402 transitions. [2023-02-15 10:28:55,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-02-15 10:28:55,569 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.7714285714285714) internal successors, (97), 25 states have internal predecessors, (97), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 55 [2023-02-15 10:28:55,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:28:55,570 INFO L225 Difference]: With dead ends: 357 [2023-02-15 10:28:55,570 INFO L226 Difference]: Without dead ends: 353 [2023-02-15 10:28:55,571 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 755 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=461, Invalid=3828, Unknown=9, NotChecked=258, Total=4556 [2023-02-15 10:28:55,571 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 1065 mSDsluCounter, 862 mSDsCounter, 0 mSdLazyCounter, 3879 mSolverCounterSat, 112 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1065 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 4005 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 3879 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2023-02-15 10:28:55,571 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1065 Valid, 916 Invalid, 4005 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 3879 Invalid, 14 Unknown, 0 Unchecked, 3.7s Time] [2023-02-15 10:28:55,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2023-02-15 10:28:55,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 339. [2023-02-15 10:28:55,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 298 states have (on average 1.1409395973154361) internal successors, (340), 311 states have internal predecessors, (340), 30 states have call successors, (30), 12 states have call predecessors, (30), 10 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-02-15 10:28:55,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 385 transitions. [2023-02-15 10:28:55,615 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 385 transitions. Word has length 55 [2023-02-15 10:28:55,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:28:55,616 INFO L495 AbstractCegarLoop]: Abstraction has 339 states and 385 transitions. [2023-02-15 10:28:55,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.7714285714285714) internal successors, (97), 25 states have internal predecessors, (97), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 10:28:55,616 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 385 transitions. [2023-02-15 10:28:55,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-02-15 10:28:55,616 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:28:55,617 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:28:55,630 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-15 10:28:55,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:28:55,831 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:28:55,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:28:55,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1129884476, now seen corresponding path program 1 times [2023-02-15 10:28:55,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:28:55,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578793684] [2023-02-15 10:28:55,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:28:55,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:28:55,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:28:57,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-15 10:28:57,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:28:57,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 10:28:57,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:28:58,275 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 10:28:58,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:28:58,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578793684] [2023-02-15 10:28:58,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578793684] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:28:58,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1556642824] [2023-02-15 10:28:58,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:28:58,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:28:58,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:28:58,277 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) [2023-02-15 10:28:58,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-15 10:28:58,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:28:58,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 201 conjunts are in the unsatisfiable core [2023-02-15 10:28:58,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:28:58,573 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 10:28:58,574 INFO L350 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 [2023-02-15 10:28:58,626 INFO L350 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 18 [2023-02-15 10:28:58,631 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2023-02-15 10:28:58,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:28:58,648 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 17 treesize of output 7 [2023-02-15 10:28:58,653 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-02-15 10:28:58,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:28:58,836 INFO L321 Elim1Store]: treesize reduction 44, result has 38.0 percent of original size [2023-02-15 10:28:58,837 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 114 treesize of output 94 [2023-02-15 10:28:58,843 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 56 [2023-02-15 10:28:58,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:28:58,850 INFO L350 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 50 treesize of output 43 [2023-02-15 10:28:58,864 INFO L321 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2023-02-15 10:28:58,864 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 60 [2023-02-15 10:28:58,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:28:58,882 INFO L321 Elim1Store]: treesize reduction 30, result has 40.0 percent of original size [2023-02-15 10:28:58,882 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 55 [2023-02-15 10:28:59,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:28:59,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:28:59,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:28:59,057 INFO L321 Elim1Store]: treesize reduction 77, result has 10.5 percent of original size [2023-02-15 10:28:59,058 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 191 treesize of output 149 [2023-02-15 10:28:59,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:28:59,067 INFO L350 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 98 [2023-02-15 10:28:59,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:28:59,072 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 20 [2023-02-15 10:28:59,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:28:59,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:28:59,089 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-02-15 10:28:59,089 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 38 [2023-02-15 10:28:59,099 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 15 treesize of output 23 [2023-02-15 10:28:59,250 INFO L321 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-02-15 10:28:59,251 INFO L350 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 20 treesize of output 22 [2023-02-15 10:28:59,343 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 10:28:59,344 INFO L350 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 106 treesize of output 100 [2023-02-15 10:28:59,349 INFO L350 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 75 treesize of output 74 [2023-02-15 10:28:59,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:28:59,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:28:59,374 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:28:59,375 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 92 treesize of output 59 [2023-02-15 10:28:59,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:28:59,378 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 25 [2023-02-15 10:28:59,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:28:59,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:28:59,550 INFO L321 Elim1Store]: treesize reduction 70, result has 25.5 percent of original size [2023-02-15 10:28:59,550 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 206 treesize of output 149 [2023-02-15 10:28:59,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:28:59,564 INFO L321 Elim1Store]: treesize reduction 42, result has 10.6 percent of original size [2023-02-15 10:28:59,565 INFO L350 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 180 treesize of output 155 [2023-02-15 10:28:59,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:28:59,568 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 148 treesize of output 126 [2023-02-15 10:28:59,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:28:59,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:28:59,573 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 89 [2023-02-15 10:28:59,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:28:59,581 INFO L350 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 91 treesize of output 81 [2023-02-15 10:28:59,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:28:59,586 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 59 treesize of output 53 [2023-02-15 10:28:59,743 INFO L321 Elim1Store]: treesize reduction 78, result has 21.2 percent of original size [2023-02-15 10:28:59,743 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 5 case distinctions, treesize of input 172 treesize of output 170 [2023-02-15 10:28:59,762 INFO L321 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2023-02-15 10:28:59,762 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 161 treesize of output 154 [2023-02-15 10:28:59,794 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:29:01,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:29:01,090 INFO L321 Elim1Store]: treesize reduction 16, result has 15.8 percent of original size [2023-02-15 10:29:01,090 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 24 [2023-02-15 10:29:01,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:29:01,108 INFO L321 Elim1Store]: treesize reduction 34, result has 35.8 percent of original size [2023-02-15 10:29:01,108 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 43 [2023-02-15 10:29:01,165 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:29:01,165 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:29:01,510 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_~#gl_list~0.offset| 4))) (and (forall ((v_ArrVal_3816 (Array Int Int)) (v_ArrVal_3817 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3817))) (let ((.cse0 (select (select .cse1 |c_~#gl_list~0.base|) .cse2))) (or (= (+ .cse0 8) (select (select .cse1 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3816) |c_~#gl_list~0.base|) .cse2)) (+ .cse0 12))) (= |c_~#gl_list~0.offset| .cse0))))) (forall ((v_ArrVal_3816 (Array Int Int)) (v_ArrVal_3817 (Array Int Int))) (let ((.cse5 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3816) |c_~#gl_list~0.base|) .cse2))) (or (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3817))) (let ((.cse3 (select (select .cse4 |c_~#gl_list~0.base|) .cse2))) (= (+ .cse3 8) (select (select .cse4 .cse5) (+ .cse3 12))))) (= .cse5 |c_~#gl_list~0.base|)))) (forall ((v_ArrVal_3816 (Array Int Int)) (v_ArrVal_3817 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3816))) (let ((.cse7 (select (select .cse6 |c_~#gl_list~0.base|) .cse2))) (or (= (select (select .cse6 .cse7) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3817) |c_~#gl_list~0.base|) .cse2) 12)) .cse7) (= .cse7 |c_~#gl_list~0.base|))))) (forall ((v_ArrVal_3816 (Array Int Int)) (v_ArrVal_3817 (Array Int Int))) (let ((.cse10 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3817) |c_~#gl_list~0.base|) .cse2))) (or (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3816))) (let ((.cse9 (select (select .cse8 |c_~#gl_list~0.base|) .cse2))) (= (select (select .cse8 .cse9) (+ .cse10 12)) .cse9))) (= |c_~#gl_list~0.offset| .cse10)))))) is different from false [2023-02-15 10:29:01,886 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)) (.cse10 (select |c_#memory_$Pointer$.base| .cse5)) (.cse6 (select |c_#memory_$Pointer$.offset| .cse5)) (.cse4 (+ |c_ULTIMATE.start_gl_insert_~node~1#1.offset| 4)) (.cse8 (+ |c_~#gl_list~0.offset| 4))) (and (forall ((|v_list_add___list_add_~next#1.offset_23| Int)) (or (< .cse0 |v_list_add___list_add_~next#1.offset_23|) (forall ((v_ArrVal_3816 (Array Int Int)) (v_ArrVal_3817 (Array Int Int)) (v_ArrVal_3844 Int) (v_ArrVal_3845 (Array Int Int)) (v_ArrVal_3846 (Array Int Int)) (v_ArrVal_3847 (Array Int Int)) (v_ArrVal_3848 (Array Int Int))) (let ((.cse7 (+ |v_list_add___list_add_~next#1.offset_23| 4))) (let ((.cse1 (store (let ((.cse9 (store |c_#memory_$Pointer$.base| .cse5 (store .cse10 .cse7 |c_ULTIMATE.start_gl_insert_~node~1#1.base|)))) (store (store .cse9 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3845) |c_~#gl_list~0.base| (store (select (store .cse9 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3848) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| v_ArrVal_3844))) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3816))) (let ((.cse2 (select (select .cse1 |c_~#gl_list~0.base|) .cse8))) (or (= (select (select .cse1 .cse2) (+ (select (select (store (let ((.cse3 (store |c_#memory_$Pointer$.offset| .cse5 (store .cse6 .cse7 .cse4)))) (store (store .cse3 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3846) |c_~#gl_list~0.base| (store (select (store .cse3 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3847) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| .cse4))) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3817) |c_~#gl_list~0.base|) .cse8) 12)) .cse2) (= .cse2 |c_~#gl_list~0.base|)))))))) (forall ((|v_list_add___list_add_~next#1.offset_23| Int)) (or (< .cse0 |v_list_add___list_add_~next#1.offset_23|) (forall ((v_ArrVal_3816 (Array Int Int)) (v_ArrVal_3817 (Array Int Int)) (v_ArrVal_3844 Int) (v_ArrVal_3845 (Array Int Int)) (v_ArrVal_3846 (Array Int Int)) (v_ArrVal_3847 (Array Int Int)) (v_ArrVal_3848 (Array Int Int))) (let ((.cse14 (+ |v_list_add___list_add_~next#1.offset_23| 4))) (let ((.cse12 (store (let ((.cse15 (store |c_#memory_$Pointer$.offset| .cse5 (store .cse6 .cse14 .cse4)))) (store (store .cse15 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3846) |c_~#gl_list~0.base| (store (select (store .cse15 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3847) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| .cse4))) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3817))) (let ((.cse11 (select (select .cse12 |c_~#gl_list~0.base|) .cse8))) (or (= |c_~#gl_list~0.offset| .cse11) (= (select (select .cse12 (select (select (store (let ((.cse13 (store |c_#memory_$Pointer$.base| .cse5 (store .cse10 .cse14 |c_ULTIMATE.start_gl_insert_~node~1#1.base|)))) (store (store .cse13 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3845) |c_~#gl_list~0.base| (store (select (store .cse13 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3848) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| v_ArrVal_3844))) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3816) |c_~#gl_list~0.base|) .cse8)) (+ .cse11 12)) (+ .cse11 8))))))))) (forall ((|v_list_add___list_add_~next#1.offset_23| Int)) (or (< .cse0 |v_list_add___list_add_~next#1.offset_23|) (forall ((v_ArrVal_3816 (Array Int Int)) (v_ArrVal_3817 (Array Int Int)) (v_ArrVal_3844 Int) (v_ArrVal_3845 (Array Int Int)) (v_ArrVal_3846 (Array Int Int)) (v_ArrVal_3847 (Array Int Int)) (v_ArrVal_3848 (Array Int Int))) (let ((.cse20 (+ |v_list_add___list_add_~next#1.offset_23| 4))) (let ((.cse16 (select (select (store (let ((.cse21 (store |c_#memory_$Pointer$.base| .cse5 (store .cse10 .cse20 |c_ULTIMATE.start_gl_insert_~node~1#1.base|)))) (store (store .cse21 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3845) |c_~#gl_list~0.base| (store (select (store .cse21 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3848) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| v_ArrVal_3844))) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3816) |c_~#gl_list~0.base|) .cse8))) (or (= .cse16 |c_~#gl_list~0.base|) (let ((.cse17 (store (let ((.cse19 (store |c_#memory_$Pointer$.offset| .cse5 (store .cse6 .cse20 .cse4)))) (store (store .cse19 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3846) |c_~#gl_list~0.base| (store (select (store .cse19 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3847) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| .cse4))) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3817))) (let ((.cse18 (select (select .cse17 |c_~#gl_list~0.base|) .cse8))) (= (select (select .cse17 .cse16) (+ .cse18 12)) (+ .cse18 8)))))))))) (forall ((|v_list_add___list_add_~next#1.offset_23| Int)) (or (< .cse0 |v_list_add___list_add_~next#1.offset_23|) (forall ((v_ArrVal_3816 (Array Int Int)) (v_ArrVal_3817 (Array Int Int)) (v_ArrVal_3844 Int) (v_ArrVal_3845 (Array Int Int)) (v_ArrVal_3846 (Array Int Int)) (v_ArrVal_3847 (Array Int Int)) (v_ArrVal_3848 (Array Int Int))) (let ((.cse26 (+ |v_list_add___list_add_~next#1.offset_23| 4))) (let ((.cse24 (select (select (store (let ((.cse27 (store |c_#memory_$Pointer$.offset| .cse5 (store .cse6 .cse26 .cse4)))) (store (store .cse27 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3846) |c_~#gl_list~0.base| (store (select (store .cse27 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3847) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| .cse4))) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3817) |c_~#gl_list~0.base|) .cse8))) (or (let ((.cse22 (store (let ((.cse25 (store |c_#memory_$Pointer$.base| .cse5 (store .cse10 .cse26 |c_ULTIMATE.start_gl_insert_~node~1#1.base|)))) (store (store .cse25 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3845) |c_~#gl_list~0.base| (store (select (store .cse25 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3848) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| v_ArrVal_3844))) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3816))) (let ((.cse23 (select (select .cse22 |c_~#gl_list~0.base|) .cse8))) (= (select (select .cse22 .cse23) (+ .cse24 12)) .cse23))) (= |c_~#gl_list~0.offset| .cse24)))))))))) is different from false [2023-02-15 10:29:01,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1556642824] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:29:01,895 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 10:29:01,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19] total 34 [2023-02-15 10:29:01,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283290930] [2023-02-15 10:29:01,895 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 10:29:01,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-02-15 10:29:01,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:29:01,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-02-15 10:29:01,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1367, Unknown=7, NotChecked=150, Total=1640 [2023-02-15 10:29:01,896 INFO L87 Difference]: Start difference. First operand 339 states and 385 transitions. Second operand has 35 states, 35 states have (on average 2.942857142857143) internal successors, (103), 25 states have internal predecessors, (103), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 10:29:09,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:29:09,581 INFO L93 Difference]: Finished difference Result 355 states and 398 transitions. [2023-02-15 10:29:09,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-02-15 10:29:09,582 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.942857142857143) internal successors, (103), 25 states have internal predecessors, (103), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 58 [2023-02-15 10:29:09,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:29:09,583 INFO L225 Difference]: With dead ends: 355 [2023-02-15 10:29:09,583 INFO L226 Difference]: Without dead ends: 352 [2023-02-15 10:29:09,584 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 755 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=461, Invalid=3828, Unknown=9, NotChecked=258, Total=4556 [2023-02-15 10:29:09,585 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 1062 mSDsluCounter, 944 mSDsCounter, 0 mSdLazyCounter, 4252 mSolverCounterSat, 112 mSolverCounterUnsat, 23 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1062 SdHoareTripleChecker+Valid, 998 SdHoareTripleChecker+Invalid, 4387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 4252 IncrementalHoareTripleChecker+Invalid, 23 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2023-02-15 10:29:09,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1062 Valid, 998 Invalid, 4387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 4252 Invalid, 23 Unknown, 0 Unchecked, 4.4s Time] [2023-02-15 10:29:09,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2023-02-15 10:29:09,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 339. [2023-02-15 10:29:09,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 298 states have (on average 1.1375838926174497) internal successors, (339), 311 states have internal predecessors, (339), 30 states have call successors, (30), 12 states have call predecessors, (30), 10 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-02-15 10:29:09,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 384 transitions. [2023-02-15 10:29:09,640 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 384 transitions. Word has length 58 [2023-02-15 10:29:09,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:29:09,640 INFO L495 AbstractCegarLoop]: Abstraction has 339 states and 384 transitions. [2023-02-15 10:29:09,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.942857142857143) internal successors, (103), 25 states have internal predecessors, (103), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 10:29:09,641 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 384 transitions. [2023-02-15 10:29:09,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-02-15 10:29:09,641 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:29:09,641 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:29:09,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-15 10:29:09,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:29:09,847 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:29:09,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:29:09,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1691144517, now seen corresponding path program 2 times [2023-02-15 10:29:09,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:29:09,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198561539] [2023-02-15 10:29:09,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:29:09,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:29:09,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:29:12,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-15 10:29:12,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:29:12,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 10:29:12,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:29:12,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 10:29:12,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:29:13,096 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 10:29:13,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:29:13,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198561539] [2023-02-15 10:29:13,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198561539] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:29:13,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1080714487] [2023-02-15 10:29:13,096 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 10:29:13,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:29:13,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:29:13,097 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) [2023-02-15 10:29:13,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-15 10:29:13,518 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 10:29:13,518 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 10:29:13,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 613 conjuncts, 274 conjunts are in the unsatisfiable core [2023-02-15 10:29:13,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:29:13,596 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 10:29:13,596 INFO L350 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 [2023-02-15 10:29:13,650 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2023-02-15 10:29:13,657 INFO L350 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 18 [2023-02-15 10:29:13,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:29:13,663 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 17 treesize of output 7 [2023-02-15 10:29:13,669 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-02-15 10:29:13,868 INFO L321 Elim1Store]: treesize reduction 87, result has 3.3 percent of original size [2023-02-15 10:29:13,868 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 137 treesize of output 123 [2023-02-15 10:29:13,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:29:13,897 INFO L321 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2023-02-15 10:29:13,897 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 104 treesize of output 108 [2023-02-15 10:29:13,902 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 56 [2023-02-15 10:29:13,921 INFO L321 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2023-02-15 10:29:13,921 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 60 [2023-02-15 10:29:13,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:29:13,926 INFO L350 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 53 [2023-02-15 10:29:13,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:29:13,957 INFO L321 Elim1Store]: treesize reduction 30, result has 40.0 percent of original size [2023-02-15 10:29:13,957 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 55 [2023-02-15 10:29:14,022 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 15 treesize of output 19 [2023-02-15 10:29:14,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:29:14,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:29:14,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:29:14,131 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:29:14,155 INFO L321 Elim1Store]: treesize reduction 97, result has 8.5 percent of original size [2023-02-15 10:29:14,155 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 186 treesize of output 151 [2023-02-15 10:29:14,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:29:14,163 INFO L350 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 92 treesize of output 92 [2023-02-15 10:29:14,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:29:14,167 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 20 [2023-02-15 10:29:14,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:29:14,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:29:14,183 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-02-15 10:29:14,183 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 38 [2023-02-15 10:29:14,335 INFO L321 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2023-02-15 10:29:14,335 INFO L350 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 26 treesize of output 41 [2023-02-15 10:29:14,435 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 10:29:14,435 INFO L350 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 100 treesize of output 96 [2023-02-15 10:29:14,442 INFO L350 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 64 treesize of output 60 [2023-02-15 10:29:14,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:29:14,473 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:29:14,475 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 10:29:14,475 INFO L350 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 2 case distinctions, treesize of input 94 treesize of output 61 [2023-02-15 10:29:14,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:29:14,479 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 41 treesize of output 21 [2023-02-15 10:29:14,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:29:14,698 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:29:14,721 INFO L321 Elim1Store]: treesize reduction 78, result has 23.5 percent of original size [2023-02-15 10:29:14,722 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 200 treesize of output 147 [2023-02-15 10:29:14,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:29:14,736 INFO L321 Elim1Store]: treesize reduction 42, result has 10.6 percent of original size [2023-02-15 10:29:14,736 INFO L350 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 174 treesize of output 151 [2023-02-15 10:29:14,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:29:14,740 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 124 [2023-02-15 10:29:14,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:29:14,745 INFO L350 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 0 case distinctions, treesize of input 98 treesize of output 79 [2023-02-15 10:29:14,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:29:14,750 INFO L350 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 84 treesize of output 76 [2023-02-15 10:29:14,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:29:14,757 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 59 treesize of output 53 [2023-02-15 10:29:15,003 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2023-02-15 10:29:15,003 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 202 treesize of output 184 [2023-02-15 10:29:15,036 INFO L321 Elim1Store]: treesize reduction 90, result has 21.7 percent of original size [2023-02-15 10:29:15,036 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 5 case distinctions, treesize of input 178 treesize of output 190 [2023-02-15 10:29:15,099 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:29:15,149 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:29:15,466 INFO L321 Elim1Store]: treesize reduction 41, result has 62.4 percent of original size [2023-02-15 10:29:15,467 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 184 treesize of output 231 [2023-02-15 10:29:15,944 INFO L321 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2023-02-15 10:29:15,945 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 185 treesize of output 168 [2023-02-15 10:29:15,961 INFO L321 Elim1Store]: treesize reduction 47, result has 16.1 percent of original size [2023-02-15 10:29:15,961 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 162 treesize of output 170 [2023-02-15 10:29:16,029 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:29:16,060 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:29:16,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:29:16,088 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:29:16,149 INFO L321 Elim1Store]: treesize reduction 52, result has 59.7 percent of original size [2023-02-15 10:29:16,149 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 179 treesize of output 172 [2023-02-15 10:29:16,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:29:16,198 INFO L321 Elim1Store]: treesize reduction 8, result has 87.7 percent of original size [2023-02-15 10:29:16,198 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 88 treesize of output 116 [2023-02-15 10:29:17,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:29:17,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:29:17,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:29:17,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:29:17,325 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:29:17,380 INFO L321 Elim1Store]: treesize reduction 184, result has 14.4 percent of original size [2023-02-15 10:29:17,380 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 16 case distinctions, treesize of input 286 treesize of output 223 [2023-02-15 10:29:17,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:29:17,446 INFO L321 Elim1Store]: treesize reduction 120, result has 26.4 percent of original size [2023-02-15 10:29:17,446 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 275 treesize of output 272 [2023-02-15 10:29:17,494 INFO L321 Elim1Store]: treesize reduction 247, result has 11.2 percent of original size [2023-02-15 10:29:17,495 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 196 treesize of output 234 [2023-02-15 10:29:17,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:29:17,558 INFO L321 Elim1Store]: treesize reduction 135, result has 32.5 percent of original size [2023-02-15 10:29:17,558 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 213 treesize of output 229 [2023-02-15 10:29:17,781 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:29:17,875 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:29:18,346 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:29:18,401 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:29:18,753 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:29:18,758 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:29:18,762 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:29:18,768 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:29:18,778 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:29:18,904 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:29:18,908 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:29:18,912 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:29:18,916 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:29:18,919 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:29:19,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:29:19,125 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 34 treesize of output 34 [2023-02-15 10:29:19,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:29:19,146 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 34 treesize of output 34 [2023-02-15 10:29:19,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:29:19,164 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 34 treesize of output 34 [2023-02-15 10:29:19,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:29:19,193 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 34 treesize of output 34 [2023-02-15 10:29:19,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:29:19,247 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 34 treesize of output 34 [2023-02-15 10:29:19,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:29:19,271 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 34 treesize of output 34 [2023-02-15 10:29:19,281 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:29:19,284 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:29:19,287 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:29:19,298 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:29:19,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:29:19,567 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 101 [2023-02-15 10:29:19,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:29:19,711 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 108 [2023-02-15 10:29:19,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:29:19,747 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 110 treesize of output 84 [2023-02-15 10:29:19,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:29:19,784 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 62 treesize of output 52 [2023-02-15 10:29:19,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:29:19,867 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 69 [2023-02-15 10:29:20,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:29:20,076 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 75 [2023-02-15 10:29:20,754 INFO L321 Elim1Store]: treesize reduction 116, result has 26.1 percent of original size [2023-02-15 10:29:20,754 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 14 case distinctions, treesize of input 245 treesize of output 234 [2023-02-15 10:29:20,782 INFO L321 Elim1Store]: treesize reduction 78, result has 21.2 percent of original size [2023-02-15 10:29:20,782 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 5 case distinctions, treesize of input 215 treesize of output 225 [2023-02-15 10:29:20,829 INFO L350 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 206 treesize of output 204 [2023-02-15 10:29:20,853 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:29:21,017 INFO L350 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 11 treesize of output 7 [2023-02-15 10:29:21,018 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:29:21,029 INFO L350 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 23 treesize of output 19 [2023-02-15 10:29:21,031 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:29:22,141 INFO L321 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2023-02-15 10:29:22,142 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 248 treesize of output 256 [2023-02-15 10:29:22,962 INFO L321 Elim1Store]: treesize reduction 136, result has 52.3 percent of original size [2023-02-15 10:29:22,962 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 3 disjoint index pairs (out of 36 index pairs), introduced 12 new quantified variables, introduced 35 case distinctions, treesize of input 229 treesize of output 242 [2023-02-15 10:29:24,588 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 1 proven. 35 refuted. 3 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:29:24,588 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:29:24,615 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4396 (Array Int Int)) (v_ArrVal_4397 (Array Int Int))) (not (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_4396)) (.cse2 (+ |c_~#gl_list~0.offset| 4))) (let ((.cse0 (select (select .cse1 |c_~#gl_list~0.base|) .cse2))) (= .cse0 (select (select .cse1 .cse0) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_4397) |c_~#gl_list~0.base|) .cse2))))))) is different from false [2023-02-15 10:29:25,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1080714487] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:29:25,006 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 10:29:25,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 39 [2023-02-15 10:29:25,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735509693] [2023-02-15 10:29:25,006 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 10:29:25,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-02-15 10:29:25,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:29:25,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-02-15 10:29:25,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1483, Unknown=24, NotChecked=78, Total=1722 [2023-02-15 10:29:25,008 INFO L87 Difference]: Start difference. First operand 339 states and 384 transitions. Second operand has 40 states, 40 states have (on average 2.525) internal successors, (101), 27 states have internal predecessors, (101), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 10:29:37,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:29:37,531 INFO L93 Difference]: Finished difference Result 459 states and 511 transitions. [2023-02-15 10:29:37,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-02-15 10:29:37,531 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.525) internal successors, (101), 27 states have internal predecessors, (101), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 59 [2023-02-15 10:29:37,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:29:37,533 INFO L225 Difference]: With dead ends: 459 [2023-02-15 10:29:37,533 INFO L226 Difference]: Without dead ends: 456 [2023-02-15 10:29:37,534 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1486 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=545, Invalid=5131, Unknown=28, NotChecked=148, Total=5852 [2023-02-15 10:29:37,534 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 1913 mSDsluCounter, 1113 mSDsCounter, 0 mSdLazyCounter, 6102 mSolverCounterSat, 261 mSolverCounterUnsat, 27 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1916 SdHoareTripleChecker+Valid, 1187 SdHoareTripleChecker+Invalid, 6390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 261 IncrementalHoareTripleChecker+Valid, 6102 IncrementalHoareTripleChecker+Invalid, 27 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2023-02-15 10:29:37,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1916 Valid, 1187 Invalid, 6390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [261 Valid, 6102 Invalid, 27 Unknown, 0 Unchecked, 6.8s Time] [2023-02-15 10:29:37,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2023-02-15 10:29:37,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 343. [2023-02-15 10:29:37,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 301 states have (on average 1.132890365448505) internal successors, (341), 314 states have internal predecessors, (341), 30 states have call successors, (30), 13 states have call predecessors, (30), 11 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-02-15 10:29:37,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 386 transitions. [2023-02-15 10:29:37,594 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 386 transitions. Word has length 59 [2023-02-15 10:29:37,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:29:37,594 INFO L495 AbstractCegarLoop]: Abstraction has 343 states and 386 transitions. [2023-02-15 10:29:37,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.525) internal successors, (101), 27 states have internal predecessors, (101), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 10:29:37,594 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 386 transitions. [2023-02-15 10:29:37,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-02-15 10:29:37,595 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:29:37,595 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:29:37,604 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-15 10:29:37,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-02-15 10:29:37,803 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:29:37,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:29:37,804 INFO L85 PathProgramCache]: Analyzing trace with hash -678154033, now seen corresponding path program 1 times [2023-02-15 10:29:37,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:29:37,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570440314] [2023-02-15 10:29:37,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:29:37,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:29:37,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:29:38,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-15 10:29:38,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:29:38,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:29:38,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:29:38,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570440314] [2023-02-15 10:29:38,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570440314] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:29:38,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:29:38,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-02-15 10:29:38,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004001878] [2023-02-15 10:29:38,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:29:38,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-15 10:29:38,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:29:38,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-15 10:29:38,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2023-02-15 10:29:38,881 INFO L87 Difference]: Start difference. First operand 343 states and 386 transitions. Second operand has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 9 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 10:29:39,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:29:39,800 INFO L93 Difference]: Finished difference Result 357 states and 400 transitions. [2023-02-15 10:29:39,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-15 10:29:39,800 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 9 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 60 [2023-02-15 10:29:39,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:29:39,801 INFO L225 Difference]: With dead ends: 357 [2023-02-15 10:29:39,801 INFO L226 Difference]: Without dead ends: 354 [2023-02-15 10:29:39,801 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2023-02-15 10:29:39,802 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 319 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 1088 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 1120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1088 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-15 10:29:39,802 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 267 Invalid, 1120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1088 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-15 10:29:39,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2023-02-15 10:29:39,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 343. [2023-02-15 10:29:39,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 301 states have (on average 1.1295681063122924) internal successors, (340), 314 states have internal predecessors, (340), 30 states have call successors, (30), 13 states have call predecessors, (30), 11 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-02-15 10:29:39,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 385 transitions. [2023-02-15 10:29:39,858 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 385 transitions. Word has length 60 [2023-02-15 10:29:39,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:29:39,858 INFO L495 AbstractCegarLoop]: Abstraction has 343 states and 385 transitions. [2023-02-15 10:29:39,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 9 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 10:29:39,858 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 385 transitions. [2023-02-15 10:29:39,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-02-15 10:29:39,859 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:29:39,859 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-02-15 10:29:39,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-02-15 10:29:39,859 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:29:39,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:29:39,859 INFO L85 PathProgramCache]: Analyzing trace with hash 697431940, now seen corresponding path program 2 times [2023-02-15 10:29:39,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:29:39,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565195168] [2023-02-15 10:29:39,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:29:39,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:29:39,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:29:42,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-15 10:29:42,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:29:42,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 10:29:42,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:29:42,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 10:29:42,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:29:43,413 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 10:29:43,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:29:43,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565195168] [2023-02-15 10:29:43,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565195168] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:29:43,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1417940841] [2023-02-15 10:29:43,414 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 10:29:43,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:29:43,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:29:43,415 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) [2023-02-15 10:29:43,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-15 10:29:43,941 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 10:29:43,941 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 10:29:43,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 619 conjuncts, 258 conjunts are in the unsatisfiable core [2023-02-15 10:29:43,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:29:44,009 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 10:29:44,009 INFO L350 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 [2023-02-15 10:29:44,073 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2023-02-15 10:29:44,078 INFO L350 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 18 [2023-02-15 10:29:44,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:29:44,090 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 17 treesize of output 7 [2023-02-15 10:29:44,095 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-02-15 10:29:44,241 INFO L321 Elim1Store]: treesize reduction 73, result has 3.9 percent of original size [2023-02-15 10:29:44,241 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 101 treesize of output 107 [2023-02-15 10:29:44,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:29:44,264 INFO L321 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2023-02-15 10:29:44,265 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 83 treesize of output 89 [2023-02-15 10:29:44,268 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 54 [2023-02-15 10:29:44,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:29:44,272 INFO L350 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 64 treesize of output 38 [2023-02-15 10:29:44,286 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-02-15 10:29:44,286 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 58 [2023-02-15 10:29:44,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:29:44,306 INFO L321 Elim1Store]: treesize reduction 30, result has 40.0 percent of original size [2023-02-15 10:29:44,307 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 55 [2023-02-15 10:29:44,455 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 10:29:44,455 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 157 treesize of output 138 [2023-02-15 10:29:44,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:29:44,460 INFO L350 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 86 treesize of output 86 [2023-02-15 10:29:44,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:29:44,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:29:44,470 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2023-02-15 10:29:44,470 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 32 [2023-02-15 10:29:44,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:29:44,492 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 20 [2023-02-15 10:29:44,664 INFO L321 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2023-02-15 10:29:44,664 INFO L350 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 26 treesize of output 41 [2023-02-15 10:29:44,760 INFO L350 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 89 treesize of output 81 [2023-02-15 10:29:44,765 INFO L350 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 64 treesize of output 60 [2023-02-15 10:29:44,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:29:44,789 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 83 treesize of output 55 [2023-02-15 10:29:44,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:29:44,792 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 41 treesize of output 21 [2023-02-15 10:29:44,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:29:44,987 INFO L321 Elim1Store]: treesize reduction 32, result has 13.5 percent of original size [2023-02-15 10:29:44,987 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 236 treesize of output 190 [2023-02-15 10:29:45,003 INFO L321 Elim1Store]: treesize reduction 80, result has 5.9 percent of original size [2023-02-15 10:29:45,004 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 210 treesize of output 219 [2023-02-15 10:29:45,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:29:45,010 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 172 treesize of output 150 [2023-02-15 10:29:45,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:29:45,016 INFO L350 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 91 [2023-02-15 10:29:45,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:29:45,021 INFO L350 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 97 treesize of output 87 [2023-02-15 10:29:45,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:29:45,025 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 79 treesize of output 71 [2023-02-15 10:29:45,030 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2023-02-15 10:29:45,035 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 9 [2023-02-15 10:29:45,077 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:29:45,359 INFO L321 Elim1Store]: treesize reduction 96, result has 22.6 percent of original size [2023-02-15 10:29:45,360 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 5834 treesize of output 4658 [2023-02-15 10:29:45,399 INFO L321 Elim1Store]: treesize reduction 90, result has 21.7 percent of original size [2023-02-15 10:29:45,400 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 5 case distinctions, treesize of input 5763 treesize of output 5777 [2023-02-15 10:29:45,495 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:29:45,499 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:29:45,538 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:29:45,544 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:29:45,552 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:29:45,559 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:29:45,565 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:29:45,572 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:29:45,594 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:29:45,602 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:29:45,619 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:29:45,626 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:29:45,642 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:29:45,649 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:29:45,656 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:29:45,658 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:29:45,662 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:29:45,669 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:29:45,672 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:29:45,683 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:29:45,691 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:29:45,696 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:29:45,698 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:29:45,701 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:29:45,707 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:29:45,708 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:29:45,712 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:29:45,717 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:29:45,719 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:29:45,727 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:29:45,739 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:29:45,749 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:29:45,758 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:29:45,768 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:29:45,776 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:29:45,781 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:29:45,783 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:29:45,792 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:29:45,802 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:29:45,812 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:29:46,207 INFO L350 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 9 treesize of output 7 [2023-02-15 10:29:46,472 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:29:46,479 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:29:46,483 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:29:46,484 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:29:46,489 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:29:46,493 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:29:46,494 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:29:46,499 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:29:46,515 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:29:46,521 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:29:46,525 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:29:46,527 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:29:46,530 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:29:46,534 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:29:46,535 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:29:46,540 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:29:46,544 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:29:46,546 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:29:46,559 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:29:46,563 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:29:46,594 INFO L350 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 9 treesize of output 7 [2023-02-15 10:29:46,604 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 15 treesize of output 23 [2023-02-15 10:29:46,694 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 15 treesize of output 23 [2023-02-15 10:29:47,065 INFO L321 Elim1Store]: treesize reduction 41, result has 62.4 percent of original size [2023-02-15 10:29:47,065 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 150 treesize of output 197 [2023-02-15 10:29:47,307 INFO L321 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2023-02-15 10:29:47,308 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 151 treesize of output 144 [2023-02-15 10:29:47,323 INFO L321 Elim1Store]: treesize reduction 47, result has 16.1 percent of original size [2023-02-15 10:29:47,323 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 123 treesize of output 133 [2023-02-15 10:29:47,339 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:29:47,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:29:47,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:29:47,406 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:29:47,406 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 145 treesize of output 88 [2023-02-15 10:29:47,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:29:47,418 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:29:47,418 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 53 [2023-02-15 10:29:47,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:29:47,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:29:47,655 INFO L321 Elim1Store]: treesize reduction 102, result has 27.7 percent of original size [2023-02-15 10:29:47,656 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 229 treesize of output 170 [2023-02-15 10:29:47,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:29:47,715 INFO L321 Elim1Store]: treesize reduction 120, result has 26.4 percent of original size [2023-02-15 10:29:47,715 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 218 treesize of output 227 [2023-02-15 10:29:47,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:29:47,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:29:47,767 INFO L321 Elim1Store]: treesize reduction 113, result has 32.7 percent of original size [2023-02-15 10:29:47,767 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 110 treesize of output 153 [2023-02-15 10:29:48,244 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:29:48,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:29:48,277 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 20 [2023-02-15 10:29:48,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:29:48,350 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 143 treesize of output 143 [2023-02-15 10:29:48,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:29:48,407 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 20 [2023-02-15 10:29:48,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:29:48,444 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 62 treesize of output 52 [2023-02-15 10:29:48,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:29:48,462 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 89 treesize of output 71 [2023-02-15 10:29:48,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:29:48,664 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 82 treesize of output 60 [2023-02-15 10:29:48,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:29:48,680 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 117 treesize of output 83 [2023-02-15 10:29:49,148 INFO L321 Elim1Store]: treesize reduction 116, result has 26.1 percent of original size [2023-02-15 10:29:49,149 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 14 case distinctions, treesize of input 203 treesize of output 206 [2023-02-15 10:29:49,173 INFO L321 Elim1Store]: treesize reduction 78, result has 21.2 percent of original size [2023-02-15 10:29:49,173 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 5 case distinctions, treesize of input 179 treesize of output 185 [2023-02-15 10:29:49,279 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:29:49,575 INFO L350 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 56 treesize of output 48 [2023-02-15 10:29:49,908 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2023-02-15 10:29:51,405 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 13 [2023-02-15 10:29:51,534 INFO L321 Elim1Store]: treesize reduction 42, result has 6.7 percent of original size [2023-02-15 10:29:51,534 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 117 treesize of output 40 [2023-02-15 10:29:51,581 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 1 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:29:51,582 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:29:52,025 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_~#gl_list~0.offset| 4))) (and (forall ((v_ArrVal_5066 (Array Int Int)) (v_ArrVal_5067 (Array Int Int))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_5066) |c_~#gl_list~0.base|) .cse3))) (or (not (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_5067))) (let ((.cse1 (select (select .cse0 |c_~#gl_list~0.base|) .cse3))) (= (select (select .cse0 .cse1) (+ .cse2 4)) .cse1)))) (= |c_~#gl_list~0.offset| .cse2)))) (forall ((v_ArrVal_5066 (Array Int Int)) (v_ArrVal_5067 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_5067))) (let ((.cse5 (select (select .cse4 |c_~#gl_list~0.base|) .cse3))) (or (not (= (select (select .cse4 .cse5) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_5066) |c_~#gl_list~0.base|) .cse3) 4)) .cse5)) (= .cse5 |c_~#gl_list~0.base|))))))) is different from false [2023-02-15 10:29:53,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1417940841] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:29:53,275 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 10:29:53,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 23] total 41 [2023-02-15 10:29:53,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162641114] [2023-02-15 10:29:53,276 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 10:29:53,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-02-15 10:29:53,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:29:53,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-02-15 10:29:53,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=2246, Unknown=40, NotChecked=96, Total=2550 [2023-02-15 10:29:53,277 INFO L87 Difference]: Start difference. First operand 343 states and 385 transitions. Second operand has 42 states, 42 states have (on average 2.5476190476190474) internal successors, (107), 29 states have internal predecessors, (107), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 10:29:59,325 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 10:30:04,114 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 10:30:10,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:30:10,294 INFO L93 Difference]: Finished difference Result 538 states and 600 transitions. [2023-02-15 10:30:10,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-02-15 10:30:10,295 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.5476190476190474) internal successors, (107), 29 states have internal predecessors, (107), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 62 [2023-02-15 10:30:10,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:30:10,296 INFO L225 Difference]: With dead ends: 538 [2023-02-15 10:30:10,296 INFO L226 Difference]: Without dead ends: 535 [2023-02-15 10:30:10,298 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1404 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=595, Invalid=5998, Unknown=53, NotChecked=160, Total=6806 [2023-02-15 10:30:10,298 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 1796 mSDsluCounter, 1328 mSDsCounter, 0 mSdLazyCounter, 6504 mSolverCounterSat, 235 mSolverCounterUnsat, 48 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1802 SdHoareTripleChecker+Valid, 1403 SdHoareTripleChecker+Invalid, 6787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 235 IncrementalHoareTripleChecker+Valid, 6504 IncrementalHoareTripleChecker+Invalid, 48 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.7s IncrementalHoareTripleChecker+Time [2023-02-15 10:30:10,298 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1802 Valid, 1403 Invalid, 6787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [235 Valid, 6504 Invalid, 48 Unknown, 0 Unchecked, 10.7s Time] [2023-02-15 10:30:10,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2023-02-15 10:30:10,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 437. [2023-02-15 10:30:10,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 386 states have (on average 1.1295336787564767) internal successors, (436), 400 states have internal predecessors, (436), 36 states have call successors, (36), 16 states have call predecessors, (36), 14 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-02-15 10:30:10,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 492 transitions. [2023-02-15 10:30:10,381 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 492 transitions. Word has length 62 [2023-02-15 10:30:10,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:30:10,381 INFO L495 AbstractCegarLoop]: Abstraction has 437 states and 492 transitions. [2023-02-15 10:30:10,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.5476190476190474) internal successors, (107), 29 states have internal predecessors, (107), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 10:30:10,381 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 492 transitions. [2023-02-15 10:30:10,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-02-15 10:30:10,384 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:30:10,384 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:30:10,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-02-15 10:30:10,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:30:10,591 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:30:10,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:30:10,591 INFO L85 PathProgramCache]: Analyzing trace with hash 558719418, now seen corresponding path program 1 times [2023-02-15 10:30:10,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:30:10,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911317873] [2023-02-15 10:30:10,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:30:10,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:30:10,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:30:11,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-15 10:30:11,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:30:11,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:30:11,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:30:11,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911317873] [2023-02-15 10:30:11,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911317873] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:30:11,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:30:11,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-02-15 10:30:11,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771540108] [2023-02-15 10:30:11,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:30:11,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-15 10:30:11,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:30:11,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-15 10:30:11,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2023-02-15 10:30:11,819 INFO L87 Difference]: Start difference. First operand 437 states and 492 transitions. Second operand has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 9 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 10:30:12,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:30:12,863 INFO L93 Difference]: Finished difference Result 443 states and 496 transitions. [2023-02-15 10:30:12,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-15 10:30:12,863 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 9 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 63 [2023-02-15 10:30:12,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:30:12,865 INFO L225 Difference]: With dead ends: 443 [2023-02-15 10:30:12,865 INFO L226 Difference]: Without dead ends: 440 [2023-02-15 10:30:12,865 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2023-02-15 10:30:12,866 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 310 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 1087 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 1112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1087 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-15 10:30:12,866 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 273 Invalid, 1112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1087 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-15 10:30:12,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2023-02-15 10:30:12,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 437. [2023-02-15 10:30:12,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 386 states have (on average 1.1269430051813472) internal successors, (435), 400 states have internal predecessors, (435), 36 states have call successors, (36), 16 states have call predecessors, (36), 14 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-02-15 10:30:12,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 491 transitions. [2023-02-15 10:30:12,941 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 491 transitions. Word has length 63 [2023-02-15 10:30:12,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:30:12,941 INFO L495 AbstractCegarLoop]: Abstraction has 437 states and 491 transitions. [2023-02-15 10:30:12,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 9 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 10:30:12,941 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 491 transitions. [2023-02-15 10:30:12,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-02-15 10:30:12,941 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:30:12,942 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-02-15 10:30:12,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-02-15 10:30:12,942 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:30:12,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:30:12,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1657846127, now seen corresponding path program 2 times [2023-02-15 10:30:12,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:30:12,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086409102] [2023-02-15 10:30:12,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:30:12,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:30:13,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:30:16,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-15 10:30:16,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:30:16,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 10:30:16,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:30:17,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 10:30:17,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:30:18,103 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 10:30:18,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:30:18,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086409102] [2023-02-15 10:30:18,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086409102] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:30:18,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2110060306] [2023-02-15 10:30:18,104 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 10:30:18,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:30:18,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:30:18,105 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:30:18,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-02-15 10:30:18,530 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 10:30:18,530 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 10:30:18,534 INFO L263 TraceCheckSpWp]: Trace formula consists of 628 conjuncts, 271 conjunts are in the unsatisfiable core [2023-02-15 10:30:18,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:30:18,599 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 10:30:18,599 INFO L350 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 [2023-02-15 10:30:18,680 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2023-02-15 10:30:18,689 INFO L350 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 18 [2023-02-15 10:30:18,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:30:18,700 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 17 treesize of output 7 [2023-02-15 10:30:18,703 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-02-15 10:30:18,863 INFO L321 Elim1Store]: treesize reduction 73, result has 3.9 percent of original size [2023-02-15 10:30:18,864 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 118 treesize of output 131 [2023-02-15 10:30:18,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:30:18,892 INFO L321 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2023-02-15 10:30:18,892 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 107 [2023-02-15 10:30:18,905 INFO L321 Elim1Store]: treesize reduction 17, result has 43.3 percent of original size [2023-02-15 10:30:18,905 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 47 [2023-02-15 10:30:18,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:30:18,909 INFO L350 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 41 treesize of output 36 [2023-02-15 10:30:18,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:30:18,923 INFO L321 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2023-02-15 10:30:18,923 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 40 [2023-02-15 10:30:19,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:30:19,107 INFO L350 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 74 [2023-02-15 10:30:19,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:30:19,112 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 65 [2023-02-15 10:30:19,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:30:19,116 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 66 [2023-02-15 10:30:19,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:30:19,120 INFO L350 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 81 treesize of output 81 [2023-02-15 10:30:19,126 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 15 treesize of output 21 [2023-02-15 10:30:19,140 INFO L350 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 7 treesize of output 5 [2023-02-15 10:30:19,160 INFO L350 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 43 treesize of output 31 [2023-02-15 10:30:19,344 INFO L321 Elim1Store]: treesize reduction 60, result has 31.0 percent of original size [2023-02-15 10:30:19,344 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 146 treesize of output 155 [2023-02-15 10:30:19,495 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 10:30:19,495 INFO L350 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 144 treesize of output 122 [2023-02-15 10:30:19,502 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-15 10:30:19,502 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 143 treesize of output 138 [2023-02-15 10:30:19,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:30:19,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:30:19,546 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:30:19,546 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 129 treesize of output 69 [2023-02-15 10:30:19,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:30:19,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:30:19,551 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:30:19,551 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 73 treesize of output 49 [2023-02-15 10:30:19,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:30:19,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:30:19,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:30:19,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:30:19,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:30:19,723 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:30:19,724 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 245 treesize of output 160 [2023-02-15 10:30:19,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:30:19,768 INFO L321 Elim1Store]: treesize reduction 42, result has 10.6 percent of original size [2023-02-15 10:30:19,768 INFO L350 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 215 treesize of output 176 [2023-02-15 10:30:19,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:30:19,772 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 141 [2023-02-15 10:30:19,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:30:19,783 INFO L321 Elim1Store]: treesize reduction 30, result has 14.3 percent of original size [2023-02-15 10:30:19,783 INFO L350 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 170 treesize of output 145 [2023-02-15 10:30:19,795 INFO L321 Elim1Store]: treesize reduction 48, result has 9.4 percent of original size [2023-02-15 10:30:19,795 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 152 treesize of output 174 [2023-02-15 10:30:19,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:30:19,802 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 90 treesize of output 92 [2023-02-15 10:30:19,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:30:19,808 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 117 treesize of output 111 [2023-02-15 10:30:19,814 INFO L350 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 12 treesize of output 11 [2023-02-15 10:30:19,881 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 98 [2023-02-15 10:30:19,884 INFO L350 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 9 treesize of output 7 [2023-02-15 10:30:20,077 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2023-02-15 10:30:20,077 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 205 treesize of output 185 [2023-02-15 10:30:20,099 INFO L321 Elim1Store]: treesize reduction 90, result has 21.7 percent of original size [2023-02-15 10:30:20,099 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 5 case distinctions, treesize of input 183 treesize of output 187 [2023-02-15 10:30:20,476 INFO L321 Elim1Store]: treesize reduction 19, result has 71.6 percent of original size [2023-02-15 10:30:20,476 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 187 treesize of output 220 [2023-02-15 10:30:20,728 INFO L321 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2023-02-15 10:30:20,729 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 189 treesize of output 170 [2023-02-15 10:30:20,745 INFO L321 Elim1Store]: treesize reduction 47, result has 16.1 percent of original size [2023-02-15 10:30:20,745 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 167 treesize of output 167 [2023-02-15 10:30:20,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:30:20,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:30:20,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:30:20,930 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:30:20,930 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 183 treesize of output 112 [2023-02-15 10:30:20,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:30:20,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:30:20,944 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:30:20,944 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 84 treesize of output 73 [2023-02-15 10:30:21,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:30:21,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:30:21,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:30:21,365 INFO L321 Elim1Store]: treesize reduction 150, result has 28.9 percent of original size [2023-02-15 10:30:21,365 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 20 case distinctions, treesize of input 289 treesize of output 222 [2023-02-15 10:30:21,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:30:21,434 INFO L321 Elim1Store]: treesize reduction 108, result has 33.7 percent of original size [2023-02-15 10:30:21,435 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 293 treesize of output 296 [2023-02-15 10:30:21,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:30:21,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:30:21,522 INFO L321 Elim1Store]: treesize reduction 140, result has 28.9 percent of original size [2023-02-15 10:30:21,522 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 166 treesize of output 178 [2023-02-15 10:30:21,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:30:21,585 INFO L321 Elim1Store]: treesize reduction 87, result has 45.6 percent of original size [2023-02-15 10:30:21,585 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 172 treesize of output 219 [2023-02-15 10:30:22,011 INFO L350 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 7 treesize of output 3 [2023-02-15 10:30:22,043 INFO L350 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 7 treesize of output 3 [2023-02-15 10:30:22,116 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:30:22,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:30:22,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:30:22,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:30:22,377 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 135 [2023-02-15 10:30:22,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:30:22,493 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 20 [2023-02-15 10:30:22,522 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:30:22,585 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:30:22,593 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:30:22,758 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:30:22,758 INFO L350 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 423 treesize of output 427 [2023-02-15 10:30:22,988 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:30:22,997 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:30:23,599 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:30:23,717 INFO L350 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 7 treesize of output 3 [2023-02-15 10:30:23,778 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:30:24,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:30:24,076 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 20 [2023-02-15 10:30:24,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:30:24,126 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 20 [2023-02-15 10:30:24,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:30:24,136 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 1081 treesize of output 781 [2023-02-15 10:30:24,937 INFO L321 Elim1Store]: treesize reduction 126, result has 41.7 percent of original size [2023-02-15 10:30:24,937 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 20 case distinctions, treesize of input 406 treesize of output 414 [2023-02-15 10:30:25,040 INFO L321 Elim1Store]: treesize reduction 190, result has 43.3 percent of original size [2023-02-15 10:30:25,041 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 19 case distinctions, treesize of input 366 treesize of output 453