./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-properties/list_flag-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e19ca921 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/list-properties/list_flag-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.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 4547628201bbb61f481f84914c46868091db8c6a3d0c4d8890951b495ae3c7da --- Real Ultimate output --- This is Ultimate 0.2.2-dev-e19ca92 [2021-12-22 10:26:36,115 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-22 10:26:36,116 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-22 10:26:36,166 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-22 10:26:36,167 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-22 10:26:36,167 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-22 10:26:36,168 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-22 10:26:36,169 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-22 10:26:36,170 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-22 10:26:36,171 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-22 10:26:36,172 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-22 10:26:36,172 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-22 10:26:36,173 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-22 10:26:36,173 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-22 10:26:36,174 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-22 10:26:36,175 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-22 10:26:36,175 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-22 10:26:36,176 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-22 10:26:36,177 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-22 10:26:36,178 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-22 10:26:36,179 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-22 10:26:36,179 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-22 10:26:36,180 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-22 10:26:36,181 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-22 10:26:36,182 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-22 10:26:36,182 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-22 10:26:36,183 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-22 10:26:36,183 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-22 10:26:36,184 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-22 10:26:36,184 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-22 10:26:36,184 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-22 10:26:36,185 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-22 10:26:36,186 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-22 10:26:36,186 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-22 10:26:36,187 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-22 10:26:36,187 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-22 10:26:36,188 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-22 10:26:36,188 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-22 10:26:36,188 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-22 10:26:36,189 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-22 10:26:36,189 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-22 10:26:36,190 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-22 10:26:36,203 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-22 10:26:36,203 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-22 10:26:36,204 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-22 10:26:36,204 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-22 10:26:36,204 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-22 10:26:36,204 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-22 10:26:36,205 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-22 10:26:36,205 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-22 10:26:36,205 INFO L138 SettingsManager]: * Use SBE=true [2021-12-22 10:26:36,205 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-22 10:26:36,206 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-22 10:26:36,206 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-22 10:26:36,206 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-22 10:26:36,206 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-22 10:26:36,206 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-22 10:26:36,207 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-22 10:26:36,207 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-22 10:26:36,207 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-22 10:26:36,207 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-22 10:26:36,207 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-22 10:26:36,208 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-22 10:26:36,208 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-22 10:26:36,208 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-22 10:26:36,208 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-22 10:26:36,208 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-22 10:26:36,209 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-22 10:26:36,209 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-22 10:26:36,209 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-22 10:26:36,209 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-22 10:26:36,209 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-22 10:26:36,210 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-22 10:26:36,210 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-22 10:26:36,210 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-22 10:26:36,210 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-22 10:26:36,210 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> 4547628201bbb61f481f84914c46868091db8c6a3d0c4d8890951b495ae3c7da [2021-12-22 10:26:36,399 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-22 10:26:36,419 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-22 10:26:36,421 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-22 10:26:36,422 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-22 10:26:36,422 INFO L275 PluginConnector]: CDTParser initialized [2021-12-22 10:26:36,423 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-properties/list_flag-2.i [2021-12-22 10:26:36,479 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff8c62c69/5807c710175547979998c27201800ed0/FLAG41f73268b [2021-12-22 10:26:36,873 INFO L306 CDTParser]: Found 1 translation units. [2021-12-22 10:26:36,876 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list_flag-2.i [2021-12-22 10:26:36,887 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff8c62c69/5807c710175547979998c27201800ed0/FLAG41f73268b [2021-12-22 10:26:36,895 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff8c62c69/5807c710175547979998c27201800ed0 [2021-12-22 10:26:36,897 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-22 10:26:36,898 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-22 10:26:36,899 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-22 10:26:36,899 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-22 10:26:36,901 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-22 10:26:36,902 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 10:26:36" (1/1) ... [2021-12-22 10:26:36,903 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26206e96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:26:36, skipping insertion in model container [2021-12-22 10:26:36,903 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 10:26:36" (1/1) ... [2021-12-22 10:26:36,907 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-22 10:26:36,941 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-22 10:26:37,172 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list_flag-2.i[23375,23388] [2021-12-22 10:26:37,175 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 10:26:37,180 INFO L203 MainTranslator]: Completed pre-run [2021-12-22 10:26:37,220 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list_flag-2.i[23375,23388] [2021-12-22 10:26:37,223 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 10:26:37,243 INFO L208 MainTranslator]: Completed translation [2021-12-22 10:26:37,244 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:26:37 WrapperNode [2021-12-22 10:26:37,244 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-22 10:26:37,245 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-22 10:26:37,245 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-22 10:26:37,245 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-22 10:26:37,249 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:26:37" (1/1) ... [2021-12-22 10:26:37,264 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:26:37" (1/1) ... [2021-12-22 10:26:37,276 INFO L137 Inliner]: procedures = 124, calls = 20, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 70 [2021-12-22 10:26:37,277 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-22 10:26:37,278 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-22 10:26:37,278 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-22 10:26:37,278 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-22 10:26:37,283 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:26:37" (1/1) ... [2021-12-22 10:26:37,283 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:26:37" (1/1) ... [2021-12-22 10:26:37,290 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:26:37" (1/1) ... [2021-12-22 10:26:37,291 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:26:37" (1/1) ... [2021-12-22 10:26:37,295 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:26:37" (1/1) ... [2021-12-22 10:26:37,303 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:26:37" (1/1) ... [2021-12-22 10:26:37,304 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:26:37" (1/1) ... [2021-12-22 10:26:37,305 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-22 10:26:37,306 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-22 10:26:37,306 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-22 10:26:37,306 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-22 10:26:37,307 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:26:37" (1/1) ... [2021-12-22 10:26:37,311 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-22 10:26:37,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 10:26:37,328 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) [2021-12-22 10:26:37,341 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 [2021-12-22 10:26:37,362 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2021-12-22 10:26:37,363 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2021-12-22 10:26:37,363 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-22 10:26:37,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-22 10:26:37,363 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-22 10:26:37,363 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-22 10:26:37,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-22 10:26:37,363 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-22 10:26:37,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-22 10:26:37,364 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-22 10:26:37,364 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-22 10:26:37,458 INFO L234 CfgBuilder]: Building ICFG [2021-12-22 10:26:37,459 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-22 10:26:37,544 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2021-12-22 10:26:37,672 INFO L275 CfgBuilder]: Performing block encoding [2021-12-22 10:26:37,676 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-22 10:26:37,677 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2021-12-22 10:26:37,678 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 10:26:37 BoogieIcfgContainer [2021-12-22 10:26:37,678 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-22 10:26:37,679 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-22 10:26:37,686 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-22 10:26:37,688 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-22 10:26:37,689 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.12 10:26:36" (1/3) ... [2021-12-22 10:26:37,689 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d427076 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 10:26:37, skipping insertion in model container [2021-12-22 10:26:37,690 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:26:37" (2/3) ... [2021-12-22 10:26:37,690 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d427076 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 10:26:37, skipping insertion in model container [2021-12-22 10:26:37,690 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 10:26:37" (3/3) ... [2021-12-22 10:26:37,691 INFO L111 eAbstractionObserver]: Analyzing ICFG list_flag-2.i [2021-12-22 10:26:37,695 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-22 10:26:37,695 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-22 10:26:37,737 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-22 10:26:37,743 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-22 10:26:37,743 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-22 10:26:37,763 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 25 states have internal predecessors, (35), 2 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) [2021-12-22 10:26:37,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-22 10:26:37,767 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 10:26:37,768 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 10:26:37,768 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 10:26:37,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 10:26:37,772 INFO L85 PathProgramCache]: Analyzing trace with hash 943582971, now seen corresponding path program 1 times [2021-12-22 10:26:37,778 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 10:26:37,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031833985] [2021-12-22 10:26:37,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 10:26:37,779 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 10:26:37,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 10:26:37,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 10:26:37,887 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 10:26:37,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031833985] [2021-12-22 10:26:37,888 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031833985] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 10:26:37,888 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 10:26:37,888 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-22 10:26:37,889 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464751971] [2021-12-22 10:26:37,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 10:26:37,892 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-22 10:26:37,893 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 10:26:37,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-22 10:26:37,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-22 10:26:37,911 INFO L87 Difference]: Start difference. First operand has 27 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 25 states have internal predecessors, (35), 2 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) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 10:26:37,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 10:26:37,923 INFO L93 Difference]: Finished difference Result 40 states and 55 transitions. [2021-12-22 10:26:37,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-22 10:26:37,925 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-12-22 10:26:37,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 10:26:37,929 INFO L225 Difference]: With dead ends: 40 [2021-12-22 10:26:37,929 INFO L226 Difference]: Without dead ends: 20 [2021-12-22 10:26:37,931 INFO L932 BasicCegarLoop]: 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 [2021-12-22 10:26:37,935 INFO L933 BasicCegarLoop]: 33 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, 33 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 [2021-12-22 10:26:37,939 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 10:26:37,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-12-22 10:26:37,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2021-12-22 10:26:37,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 10:26:37,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2021-12-22 10:26:37,958 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 11 [2021-12-22 10:26:37,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 10:26:37,958 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2021-12-22 10:26:37,959 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 10:26:37,959 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2021-12-22 10:26:37,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-22 10:26:37,959 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 10:26:37,960 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 10:26:37,960 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-22 10:26:37,960 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 10:26:37,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 10:26:37,961 INFO L85 PathProgramCache]: Analyzing trace with hash 267820561, now seen corresponding path program 1 times [2021-12-22 10:26:37,961 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 10:26:37,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692946751] [2021-12-22 10:26:37,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 10:26:37,962 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 10:26:37,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 10:26:38,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 10:26:38,042 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 10:26:38,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692946751] [2021-12-22 10:26:38,042 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692946751] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 10:26:38,043 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 10:26:38,043 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-22 10:26:38,043 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283804642] [2021-12-22 10:26:38,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 10:26:38,044 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 10:26:38,044 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 10:26:38,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 10:26:38,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-22 10:26:38,045 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 10:26:38,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 10:26:38,102 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2021-12-22 10:26:38,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-22 10:26:38,102 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-12-22 10:26:38,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 10:26:38,103 INFO L225 Difference]: With dead ends: 44 [2021-12-22 10:26:38,103 INFO L226 Difference]: Without dead ends: 40 [2021-12-22 10:26:38,104 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-22 10:26:38,105 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 25 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 10:26:38,105 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 57 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 10:26:38,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2021-12-22 10:26:38,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 28. [2021-12-22 10:26:38,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 10:26:38,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2021-12-22 10:26:38,109 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 13 [2021-12-22 10:26:38,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 10:26:38,109 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2021-12-22 10:26:38,110 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 10:26:38,110 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2021-12-22 10:26:38,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-22 10:26:38,110 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 10:26:38,110 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 10:26:38,111 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-22 10:26:38,111 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 10:26:38,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 10:26:38,111 INFO L85 PathProgramCache]: Analyzing trace with hash -273802420, now seen corresponding path program 1 times [2021-12-22 10:26:38,111 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 10:26:38,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164626638] [2021-12-22 10:26:38,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 10:26:38,112 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 10:26:38,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 10:26:38,155 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 10:26:38,155 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 10:26:38,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164626638] [2021-12-22 10:26:38,155 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164626638] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 10:26:38,156 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 10:26:38,156 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-22 10:26:38,156 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252366507] [2021-12-22 10:26:38,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 10:26:38,156 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 10:26:38,157 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 10:26:38,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 10:26:38,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-22 10:26:38,157 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 10:26:38,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 10:26:38,220 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2021-12-22 10:26:38,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-22 10:26:38,221 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-12-22 10:26:38,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 10:26:38,223 INFO L225 Difference]: With dead ends: 46 [2021-12-22 10:26:38,223 INFO L226 Difference]: Without dead ends: 38 [2021-12-22 10:26:38,224 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-22 10:26:38,227 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 21 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 10:26:38,228 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 61 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 10:26:38,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2021-12-22 10:26:38,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 26. [2021-12-22 10:26:38,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 10:26:38,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2021-12-22 10:26:38,236 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 15 [2021-12-22 10:26:38,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 10:26:38,236 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2021-12-22 10:26:38,237 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 10:26:38,237 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2021-12-22 10:26:38,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-22 10:26:38,238 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 10:26:38,238 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 10:26:38,238 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-22 10:26:38,239 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 10:26:38,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 10:26:38,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1517543941, now seen corresponding path program 1 times [2021-12-22 10:26:38,240 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 10:26:38,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539065730] [2021-12-22 10:26:38,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 10:26:38,241 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 10:26:38,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 10:26:38,287 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 10:26:38,288 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 10:26:38,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539065730] [2021-12-22 10:26:38,288 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539065730] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 10:26:38,288 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 10:26:38,288 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-22 10:26:38,289 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138943096] [2021-12-22 10:26:38,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 10:26:38,289 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 10:26:38,289 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 10:26:38,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 10:26:38,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-22 10:26:38,290 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 10:26:38,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 10:26:38,347 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2021-12-22 10:26:38,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-22 10:26:38,347 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-12-22 10:26:38,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 10:26:38,350 INFO L225 Difference]: With dead ends: 50 [2021-12-22 10:26:38,350 INFO L226 Difference]: Without dead ends: 40 [2021-12-22 10:26:38,350 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-22 10:26:38,356 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 21 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 10:26:38,357 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 56 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 10:26:38,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2021-12-22 10:26:38,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 22. [2021-12-22 10:26:38,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 10:26:38,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2021-12-22 10:26:38,368 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 15 [2021-12-22 10:26:38,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 10:26:38,369 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2021-12-22 10:26:38,369 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 10:26:38,369 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2021-12-22 10:26:38,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-22 10:26:38,369 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 10:26:38,370 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 10:26:38,370 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-22 10:26:38,370 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 10:26:38,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 10:26:38,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1906655974, now seen corresponding path program 1 times [2021-12-22 10:26:38,372 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 10:26:38,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836404312] [2021-12-22 10:26:38,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 10:26:38,373 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 10:26:38,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 10:26:38,438 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 10:26:38,438 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 10:26:38,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836404312] [2021-12-22 10:26:38,439 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836404312] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 10:26:38,439 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 10:26:38,440 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-22 10:26:38,440 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257726475] [2021-12-22 10:26:38,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 10:26:38,440 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 10:26:38,441 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 10:26:38,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 10:26:38,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 10:26:38,442 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 10:26:38,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 10:26:38,453 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2021-12-22 10:26:38,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 10:26:38,453 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-12-22 10:26:38,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 10:26:38,454 INFO L225 Difference]: With dead ends: 50 [2021-12-22 10:26:38,454 INFO L226 Difference]: Without dead ends: 34 [2021-12-22 10:26:38,454 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 10:26:38,457 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 8 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 10:26:38,457 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 41 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 10:26:38,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2021-12-22 10:26:38,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2021-12-22 10:26:38,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 10:26:38,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2021-12-22 10:26:38,460 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 19 [2021-12-22 10:26:38,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 10:26:38,460 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2021-12-22 10:26:38,460 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 10:26:38,461 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2021-12-22 10:26:38,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-22 10:26:38,461 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 10:26:38,461 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 10:26:38,461 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-22 10:26:38,462 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 10:26:38,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 10:26:38,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1462919029, now seen corresponding path program 1 times [2021-12-22 10:26:38,462 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 10:26:38,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006818101] [2021-12-22 10:26:38,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 10:26:38,463 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 10:26:38,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 10:26:38,573 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 10:26:38,573 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 10:26:38,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006818101] [2021-12-22 10:26:38,573 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006818101] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 10:26:38,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1930449093] [2021-12-22 10:26:38,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 10:26:38,574 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 10:26:38,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 10:26:38,580 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) [2021-12-22 10:26:38,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-22 10:26:38,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 10:26:38,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 31 conjunts are in the unsatisfiable core [2021-12-22 10:26:38,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 10:26:38,748 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-22 10:26:38,846 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-22 10:26:38,928 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-22 10:26:38,928 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-22 10:26:38,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 10:26:38,993 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 21 treesize of output 20 [2021-12-22 10:26:39,050 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-22 10:26:39,087 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-22 10:26:39,094 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 10:26:39,094 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 10:26:39,116 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_106 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_106) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2021-12-22 10:26:39,136 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_104 Int) (v_ArrVal_106 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_104)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_106) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2021-12-22 10:26:39,188 INFO L353 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2021-12-22 10:26:39,188 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2021-12-22 10:26:39,197 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 10:26:39,197 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 33 [2021-12-22 10:26:39,202 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-22 10:26:39,319 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-12-22 10:26:39,320 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1930449093] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 10:26:39,320 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 10:26:39,320 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2021-12-22 10:26:39,320 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496923958] [2021-12-22 10:26:39,321 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 10:26:39,321 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-22 10:26:39,321 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 10:26:39,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-22 10:26:39,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=240, Unknown=2, NotChecked=66, Total=380 [2021-12-22 10:26:39,322 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 20 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 10:26:39,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 10:26:39,438 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2021-12-22 10:26:39,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-22 10:26:39,438 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-12-22 10:26:39,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 10:26:39,439 INFO L225 Difference]: With dead ends: 50 [2021-12-22 10:26:39,439 INFO L226 Difference]: Without dead ends: 46 [2021-12-22 10:26:39,439 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=329, Unknown=2, NotChecked=78, Total=506 [2021-12-22 10:26:39,440 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 21 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 83 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 10:26:39,440 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 133 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 97 Invalid, 0 Unknown, 83 Unchecked, 0.1s Time] [2021-12-22 10:26:39,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2021-12-22 10:26:39,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 40. [2021-12-22 10:26:39,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.205128205128205) internal successors, (47), 39 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 10:26:39,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2021-12-22 10:26:39,443 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 19 [2021-12-22 10:26:39,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 10:26:39,443 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2021-12-22 10:26:39,444 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 10:26:39,444 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2021-12-22 10:26:39,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-22 10:26:39,444 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 10:26:39,444 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 10:26:39,464 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-22 10:26:39,664 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-12-22 10:26:39,665 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 10:26:39,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 10:26:39,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1319849960, now seen corresponding path program 1 times [2021-12-22 10:26:39,666 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 10:26:39,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391522946] [2021-12-22 10:26:39,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 10:26:39,666 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 10:26:39,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 10:26:39,772 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 10:26:39,772 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 10:26:39,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391522946] [2021-12-22 10:26:39,773 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391522946] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 10:26:39,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [141382210] [2021-12-22 10:26:39,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 10:26:39,773 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 10:26:39,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 10:26:39,774 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) [2021-12-22 10:26:39,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-22 10:26:39,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 10:26:39,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 31 conjunts are in the unsatisfiable core [2021-12-22 10:26:39,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 10:26:39,833 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-22 10:26:39,886 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-22 10:26:39,915 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-22 10:26:39,915 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-22 10:26:39,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 10:26:39,964 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 21 treesize of output 20 [2021-12-22 10:26:39,997 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-22 10:26:40,016 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-22 10:26:40,021 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 10:26:40,021 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 10:26:40,034 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_158 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_158) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) is different from false [2021-12-22 10:26:40,044 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_155 Int) (v_ArrVal_158 (Array Int Int))) (= 2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_155)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_158) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) is different from false [2021-12-22 10:26:40,083 INFO L353 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2021-12-22 10:26:40,084 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2021-12-22 10:26:40,091 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 10:26:40,091 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 33 [2021-12-22 10:26:40,095 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-22 10:26:40,195 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-12-22 10:26:40,195 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [141382210] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 10:26:40,196 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 10:26:40,196 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2021-12-22 10:26:40,196 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105516322] [2021-12-22 10:26:40,196 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 10:26:40,196 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-22 10:26:40,197 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 10:26:40,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-22 10:26:40,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=240, Unknown=3, NotChecked=66, Total=380 [2021-12-22 10:26:40,197 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand has 20 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 10:26:44,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 10:26:44,381 INFO L93 Difference]: Finished difference Result 85 states and 97 transitions. [2021-12-22 10:26:44,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-22 10:26:44,382 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-12-22 10:26:44,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 10:26:44,382 INFO L225 Difference]: With dead ends: 85 [2021-12-22 10:26:44,383 INFO L226 Difference]: Without dead ends: 81 [2021-12-22 10:26:44,383 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=108, Invalid=317, Unknown=3, NotChecked=78, Total=506 [2021-12-22 10:26:44,383 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 78 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 108 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 10:26:44,383 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 191 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 161 Invalid, 0 Unknown, 108 Unchecked, 0.1s Time] [2021-12-22 10:26:44,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2021-12-22 10:26:44,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 49. [2021-12-22 10:26:44,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.2083333333333333) internal successors, (58), 48 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 10:26:44,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 58 transitions. [2021-12-22 10:26:44,388 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 58 transitions. Word has length 19 [2021-12-22 10:26:44,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 10:26:44,388 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 58 transitions. [2021-12-22 10:26:44,388 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 10:26:44,389 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2021-12-22 10:26:44,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-22 10:26:44,389 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 10:26:44,389 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 10:26:44,445 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-22 10:26:44,603 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2021-12-22 10:26:44,603 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 10:26:44,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 10:26:44,604 INFO L85 PathProgramCache]: Analyzing trace with hash 876113015, now seen corresponding path program 1 times [2021-12-22 10:26:44,604 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 10:26:44,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683714923] [2021-12-22 10:26:44,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 10:26:44,604 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 10:26:44,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 10:26:44,632 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 10:26:44,632 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 10:26:44,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683714923] [2021-12-22 10:26:44,633 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683714923] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 10:26:44,633 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 10:26:44,633 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-22 10:26:44,633 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667956145] [2021-12-22 10:26:44,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 10:26:44,633 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 10:26:44,633 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 10:26:44,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 10:26:44,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 10:26:44,634 INFO L87 Difference]: Start difference. First operand 49 states and 58 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 10:26:44,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 10:26:44,643 INFO L93 Difference]: Finished difference Result 67 states and 76 transitions. [2021-12-22 10:26:44,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 10:26:44,644 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-12-22 10:26:44,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 10:26:44,644 INFO L225 Difference]: With dead ends: 67 [2021-12-22 10:26:44,645 INFO L226 Difference]: Without dead ends: 53 [2021-12-22 10:26:44,645 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 10:26:44,646 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 8 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 10:26:44,646 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 49 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 10:26:44,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2021-12-22 10:26:44,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 49. [2021-12-22 10:26:44,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 48 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 10:26:44,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2021-12-22 10:26:44,652 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 19 [2021-12-22 10:26:44,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 10:26:44,652 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2021-12-22 10:26:44,652 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 10:26:44,653 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2021-12-22 10:26:44,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-22 10:26:44,653 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 10:26:44,653 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 10:26:44,654 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-22 10:26:44,654 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 10:26:44,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 10:26:44,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1445257616, now seen corresponding path program 1 times [2021-12-22 10:26:44,654 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 10:26:44,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283214259] [2021-12-22 10:26:44,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 10:26:44,655 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 10:26:44,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 10:26:44,766 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 10:26:44,766 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 10:26:44,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283214259] [2021-12-22 10:26:44,767 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283214259] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 10:26:44,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1284382359] [2021-12-22 10:26:44,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 10:26:44,767 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 10:26:44,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 10:26:44,784 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) [2021-12-22 10:26:44,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-22 10:26:44,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 10:26:44,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 38 conjunts are in the unsatisfiable core [2021-12-22 10:26:44,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 10:26:44,878 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-22 10:26:44,925 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-22 10:26:44,925 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-22 10:26:44,968 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-22 10:26:44,973 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-22 10:26:45,018 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-22 10:26:45,019 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 64 treesize of output 61 [2021-12-22 10:26:45,023 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 42 treesize of output 44 [2021-12-22 10:26:45,026 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2021-12-22 10:26:45,056 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 21 [2021-12-22 10:26:45,059 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-12-22 10:26:45,072 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-22 10:26:45,074 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 10:26:45,075 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 10:26:45,100 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 79 treesize of output 57 [2021-12-22 10:26:45,105 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_231 (Array Int Int))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_231) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (forall ((v_ArrVal_233 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_233) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~p~0#1.base|))) is different from false [2021-12-22 10:26:45,125 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 10:26:45,125 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2021-12-22 10:26:45,132 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 10:26:45,132 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 35 [2021-12-22 10:26:45,135 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-22 10:26:45,157 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-22 10:26:45,158 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2021-12-22 10:26:45,246 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-12-22 10:26:45,246 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1284382359] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 10:26:45,247 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 10:26:45,247 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2021-12-22 10:26:45,247 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828534771] [2021-12-22 10:26:45,247 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 10:26:45,247 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-12-22 10:26:45,247 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 10:26:45,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-12-22 10:26:45,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=226, Unknown=1, NotChecked=30, Total=306 [2021-12-22 10:26:45,248 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand has 18 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 18 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 10:26:45,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 10:26:45,411 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2021-12-22 10:26:45,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-22 10:26:45,411 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 18 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-12-22 10:26:45,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 10:26:45,412 INFO L225 Difference]: With dead ends: 65 [2021-12-22 10:26:45,412 INFO L226 Difference]: Without dead ends: 61 [2021-12-22 10:26:45,412 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=381, Unknown=1, NotChecked=40, Total=506 [2021-12-22 10:26:45,412 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 49 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 53 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 10:26:45,412 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 135 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 204 Invalid, 0 Unknown, 53 Unchecked, 0.1s Time] [2021-12-22 10:26:45,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2021-12-22 10:26:45,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 53. [2021-12-22 10:26:45,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.1346153846153846) internal successors, (59), 52 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 10:26:45,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2021-12-22 10:26:45,415 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 21 [2021-12-22 10:26:45,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 10:26:45,416 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2021-12-22 10:26:45,416 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 18 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 10:26:45,416 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2021-12-22 10:26:45,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-22 10:26:45,416 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 10:26:45,416 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 10:26:45,433 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-22 10:26:45,627 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 10:26:45,628 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 10:26:45,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 10:26:45,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1652508907, now seen corresponding path program 2 times [2021-12-22 10:26:45,628 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 10:26:45,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656321273] [2021-12-22 10:26:45,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 10:26:45,628 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 10:26:45,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 10:26:45,762 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 10:26:45,762 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 10:26:45,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656321273] [2021-12-22 10:26:45,762 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656321273] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 10:26:45,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [812629940] [2021-12-22 10:26:45,762 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-22 10:26:45,763 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 10:26:45,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 10:26:45,780 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) [2021-12-22 10:26:45,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-22 10:26:45,841 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-22 10:26:45,841 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-22 10:26:45,843 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 37 conjunts are in the unsatisfiable core [2021-12-22 10:26:45,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 10:26:45,848 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-22 10:26:45,896 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-22 10:26:45,897 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-22 10:26:45,923 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-22 10:26:45,927 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-22 10:26:45,963 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-22 10:26:45,963 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 64 treesize of output 61 [2021-12-22 10:26:45,966 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 42 treesize of output 44 [2021-12-22 10:26:45,968 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2021-12-22 10:26:46,013 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 21 [2021-12-22 10:26:46,016 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-12-22 10:26:46,029 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-22 10:26:46,042 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 10:26:46,043 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 10:26:46,108 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 52 treesize of output 30 [2021-12-22 10:26:46,112 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_284 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_284) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~p~0#1.offset|)) (forall ((v_ArrVal_286 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~p~0#1.base|))) is different from false [2021-12-22 10:26:46,127 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 10:26:46,128 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2021-12-22 10:26:46,134 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 10:26:46,134 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 35 [2021-12-22 10:26:46,137 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-22 10:26:46,157 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-22 10:26:46,157 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2021-12-22 10:26:46,259 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-12-22 10:26:46,260 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [812629940] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 10:26:46,260 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 10:26:46,260 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2021-12-22 10:26:46,260 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750579146] [2021-12-22 10:26:46,260 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 10:26:46,261 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-12-22 10:26:46,261 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 10:26:46,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-12-22 10:26:46,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=362, Unknown=1, NotChecked=38, Total=462 [2021-12-22 10:26:46,262 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand has 22 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 22 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 10:26:46,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 10:26:46,671 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2021-12-22 10:26:46,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-22 10:26:46,672 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 22 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-12-22 10:26:46,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 10:26:46,672 INFO L225 Difference]: With dead ends: 67 [2021-12-22 10:26:46,672 INFO L226 Difference]: Without dead ends: 55 [2021-12-22 10:26:46,673 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=150, Invalid=783, Unknown=1, NotChecked=58, Total=992 [2021-12-22 10:26:46,673 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 38 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 60 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 10:26:46,673 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 191 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 317 Invalid, 0 Unknown, 60 Unchecked, 0.2s Time] [2021-12-22 10:26:46,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2021-12-22 10:26:46,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 47. [2021-12-22 10:26:46,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.1304347826086956) internal successors, (52), 46 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 10:26:46,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2021-12-22 10:26:46,676 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 23 [2021-12-22 10:26:46,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 10:26:46,676 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2021-12-22 10:26:46,676 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 22 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 10:26:46,676 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2021-12-22 10:26:46,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-22 10:26:46,676 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 10:26:46,676 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 10:26:46,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-22 10:26:46,893 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 10:26:46,894 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 10:26:46,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 10:26:46,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1313154078, now seen corresponding path program 1 times [2021-12-22 10:26:46,894 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 10:26:46,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175494041] [2021-12-22 10:26:46,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 10:26:46,894 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 10:26:46,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 10:26:47,005 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 10:26:47,006 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 10:26:47,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175494041] [2021-12-22 10:26:47,006 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175494041] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 10:26:47,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [850112101] [2021-12-22 10:26:47,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 10:26:47,006 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 10:26:47,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 10:26:47,008 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) [2021-12-22 10:26:47,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-22 10:26:47,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 10:26:47,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 37 conjunts are in the unsatisfiable core [2021-12-22 10:26:47,083 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 10:26:47,087 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-22 10:26:47,140 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-22 10:26:47,141 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-22 10:26:47,169 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-22 10:26:47,175 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-22 10:26:47,216 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-22 10:26:47,217 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 64 treesize of output 61 [2021-12-22 10:26:47,219 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2021-12-22 10:26:47,221 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 32 treesize of output 34 [2021-12-22 10:26:47,251 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 21 [2021-12-22 10:26:47,268 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-12-22 10:26:47,283 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-22 10:26:47,305 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 10:26:47,305 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 10:26:47,368 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 52 treesize of output 30 [2021-12-22 10:26:47,373 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_336 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_336) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~p~0#1.offset|)) (forall ((v_ArrVal_338 (Array Int Int))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_338) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))) is different from false [2021-12-22 10:26:47,391 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 10:26:47,392 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2021-12-22 10:26:47,398 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 10:26:47,398 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 35 [2021-12-22 10:26:47,401 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-22 10:26:47,422 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-22 10:26:47,422 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2021-12-22 10:26:47,521 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-12-22 10:26:47,522 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [850112101] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 10:26:47,522 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 10:26:47,522 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2021-12-22 10:26:47,522 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251410644] [2021-12-22 10:26:47,522 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 10:26:47,523 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-12-22 10:26:47,523 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 10:26:47,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-12-22 10:26:47,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=362, Unknown=1, NotChecked=38, Total=462 [2021-12-22 10:26:47,523 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand has 22 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 22 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 10:26:47,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 10:26:47,812 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2021-12-22 10:26:47,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-22 10:26:47,812 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 22 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-12-22 10:26:47,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 10:26:47,813 INFO L225 Difference]: With dead ends: 61 [2021-12-22 10:26:47,813 INFO L226 Difference]: Without dead ends: 49 [2021-12-22 10:26:47,813 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=150, Invalid=783, Unknown=1, NotChecked=58, Total=992 [2021-12-22 10:26:47,813 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 34 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 55 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 10:26:47,814 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 191 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 206 Invalid, 0 Unknown, 55 Unchecked, 0.1s Time] [2021-12-22 10:26:47,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2021-12-22 10:26:47,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 41. [2021-12-22 10:26:47,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 10:26:47,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2021-12-22 10:26:47,816 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 23 [2021-12-22 10:26:47,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 10:26:47,816 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2021-12-22 10:26:47,816 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 22 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 10:26:47,816 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2021-12-22 10:26:47,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-22 10:26:47,816 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 10:26:47,819 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 10:26:47,839 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-22 10:26:48,020 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-12-22 10:26:48,020 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 10:26:48,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 10:26:48,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1075490678, now seen corresponding path program 2 times [2021-12-22 10:26:48,021 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 10:26:48,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497245520] [2021-12-22 10:26:48,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 10:26:48,021 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 10:26:48,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 10:26:48,134 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 10:26:48,135 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 10:26:48,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497245520] [2021-12-22 10:26:48,135 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497245520] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 10:26:48,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [645118766] [2021-12-22 10:26:48,135 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-22 10:26:48,135 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 10:26:48,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 10:26:48,136 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) [2021-12-22 10:26:48,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-22 10:26:48,198 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-22 10:26:48,198 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-22 10:26:48,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 47 conjunts are in the unsatisfiable core [2021-12-22 10:26:48,201 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 10:26:48,208 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-22 10:26:48,271 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-22 10:26:48,308 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-22 10:26:48,309 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-22 10:26:48,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 10:26:48,350 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 21 treesize of output 20 [2021-12-22 10:26:48,376 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-22 10:26:48,427 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-22 10:26:48,471 INFO L353 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-12-22 10:26:48,471 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2021-12-22 10:26:48,592 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-22 10:26:48,604 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 10:26:48,605 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 10:26:49,814 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~p~0#1.base| Int)) (let ((.cse0 (select (select (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 1) (= 3 .cse0)))) is different from false [2021-12-22 10:26:49,858 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.base_60| Int) (v_ArrVal_420 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_420))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_60| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_60|) |c_ULTIMATE.start_main_~t~0#1.offset| 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= 3 .cse0) (= .cse0 1)))) is different from false [2021-12-22 10:26:49,872 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.base_60| Int) (v_ArrVal_420 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_420))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_60| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_60|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 1) (= .cse0 3)))) is different from false [2021-12-22 10:26:49,895 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.base_60| Int) (v_ArrVal_415 Int) (v_ArrVal_420 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_415)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_420))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_60| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_60|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 1) (= 3 .cse0)))) is different from false [2021-12-22 10:26:49,975 INFO L353 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2021-12-22 10:26:49,975 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 61 [2021-12-22 10:26:49,996 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 10:26:49,998 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 267 treesize of output 273 [2021-12-22 10:26:50,008 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 257 treesize of output 241 [2021-12-22 10:26:50,711 WARN L234 Elim1Store]: Array PQE input equivalent to true [2021-12-22 10:26:50,780 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 6 treesize of output 4 [2021-12-22 10:26:50,791 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 10:26:50,791 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 27 treesize of output 29 [2021-12-22 10:26:50,889 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2021-12-22 10:26:50,890 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [645118766] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 10:26:50,890 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 10:26:50,890 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 13] total 32 [2021-12-22 10:26:50,890 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339172634] [2021-12-22 10:26:50,890 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 10:26:50,891 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-12-22 10:26:50,891 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 10:26:50,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-12-22 10:26:50,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=645, Unknown=5, NotChecked=220, Total=992 [2021-12-22 10:26:50,892 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand has 32 states, 32 states have (on average 2.1875) internal successors, (70), 32 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 10:26:50,964 WARN L838 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base|) 1) (not (= |c_ULTIMATE.start_main_~t~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_60| Int) (v_ArrVal_420 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_420))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_60| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_60|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 1) (= .cse0 3))))) is different from false [2021-12-22 10:26:50,969 WARN L838 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base|) 1) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_60| Int) (v_ArrVal_420 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_420))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_60| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_60|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 1) (= .cse0 3))))) is different from false [2021-12-22 10:26:50,972 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~p~0#1.base_60| Int) (v_ArrVal_420 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_420))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_60| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_60|) |c_ULTIMATE.start_main_~t~0#1.offset| 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= 3 .cse0) (= .cse0 1)))) (not (= |c_ULTIMATE.start_main_~t~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~t~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) is different from false [2021-12-22 10:26:52,037 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~p~0#1.base| Int)) (let ((.cse0 (select (select (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 1) (= 3 .cse0)))) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= |c_ULTIMATE.start_main_~p~0#1.offset| 0)) is different from false [2021-12-22 10:26:52,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 10:26:52,083 INFO L93 Difference]: Finished difference Result 55 states and 60 transitions. [2021-12-22 10:26:52,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-22 10:26:52,083 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.1875) internal successors, (70), 32 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-12-22 10:26:52,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 10:26:52,084 INFO L225 Difference]: With dead ends: 55 [2021-12-22 10:26:52,084 INFO L226 Difference]: Without dead ends: 51 [2021-12-22 10:26:52,085 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=160, Invalid=793, Unknown=9, NotChecked=520, Total=1482 [2021-12-22 10:26:52,085 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 17 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 133 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 10:26:52,085 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 201 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 156 Invalid, 0 Unknown, 133 Unchecked, 0.1s Time] [2021-12-22 10:26:52,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2021-12-22 10:26:52,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2021-12-22 10:26:52,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.12) internal successors, (56), 50 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 10:26:52,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2021-12-22 10:26:52,088 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 25 [2021-12-22 10:26:52,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 10:26:52,088 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2021-12-22 10:26:52,091 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.1875) internal successors, (70), 32 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 10:26:52,091 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2021-12-22 10:26:52,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-22 10:26:52,091 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 10:26:52,092 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 10:26:52,109 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-22 10:26:52,297 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 10:26:52,298 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 10:26:52,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 10:26:52,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1387463807, now seen corresponding path program 2 times [2021-12-22 10:26:52,298 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 10:26:52,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288586678] [2021-12-22 10:26:52,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 10:26:52,298 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 10:26:52,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 10:26:52,441 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 10:26:52,441 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 10:26:52,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288586678] [2021-12-22 10:26:52,441 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288586678] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 10:26:52,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [485381836] [2021-12-22 10:26:52,442 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-22 10:26:52,442 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 10:26:52,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 10:26:52,443 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) [2021-12-22 10:26:52,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-22 10:26:52,512 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-22 10:26:52,512 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-22 10:26:52,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 47 conjunts are in the unsatisfiable core [2021-12-22 10:26:52,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 10:26:52,520 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-22 10:26:52,570 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-22 10:26:52,601 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-22 10:26:52,601 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-22 10:26:52,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 10:26:52,645 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 21 treesize of output 20 [2021-12-22 10:26:52,680 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-22 10:26:52,723 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-22 10:26:52,764 INFO L353 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-12-22 10:26:52,765 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2021-12-22 10:26:52,896 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-22 10:26:52,912 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 10:26:52,912 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 10:26:53,916 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~p~0#1.base| Int)) (let ((.cse0 (select (select (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= 2 .cse0) (= 3 .cse0)))) is different from false [2021-12-22 10:26:53,934 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_507 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_69| Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_507))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_69| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_69|) |c_ULTIMATE.start_main_~t~0#1.offset| 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= 3 .cse0) (= 2 .cse0)))) is different from false [2021-12-22 10:26:53,947 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_507 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_69| Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_507))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_69| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_69|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 3) (= .cse0 2)))) is different from false [2021-12-22 10:26:53,975 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_500 Int) (v_ArrVal_507 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_69| Int)) (let ((.cse0 (select (select (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_500)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_507))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_69| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_69|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= 2 .cse0) (= 3 .cse0)))) is different from false [2021-12-22 10:26:54,044 INFO L353 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2021-12-22 10:26:54,044 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 61 [2021-12-22 10:26:54,056 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 10:26:54,056 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 267 treesize of output 273 [2021-12-22 10:26:54,074 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 257 treesize of output 241 [2021-12-22 10:26:54,601 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 6 treesize of output 4 [2021-12-22 10:26:54,666 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 6 treesize of output 4 [2021-12-22 10:26:54,696 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 10:26:54,696 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 31 treesize of output 33 [2021-12-22 10:26:54,741 WARN L234 Elim1Store]: Array PQE input equivalent to true [2021-12-22 10:26:54,746 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-12-22 10:26:54,833 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2021-12-22 10:26:54,834 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [485381836] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 10:26:54,834 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 10:26:54,834 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 13] total 32 [2021-12-22 10:26:54,835 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146385750] [2021-12-22 10:26:54,835 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 10:26:54,835 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-12-22 10:26:54,835 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 10:26:54,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-12-22 10:26:54,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=645, Unknown=5, NotChecked=220, Total=992 [2021-12-22 10:26:54,836 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand has 32 states, 32 states have (on average 2.1875) internal successors, (70), 32 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 10:26:54,920 WARN L838 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base|) 1) (not (= |c_ULTIMATE.start_main_~t~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_ArrVal_507 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_69| Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_507))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_69| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_69|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 3) (= .cse0 2)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= 2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) is different from false [2021-12-22 10:26:54,923 WARN L838 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base|) 1) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_ArrVal_507 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_69| Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_507))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_69| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_69|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 3) (= .cse0 2)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= 2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) is different from false [2021-12-22 10:26:54,928 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_507 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_69| Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_507))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_69| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_69|) |c_ULTIMATE.start_main_~t~0#1.offset| 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= 3 .cse0) (= 2 .cse0)))) (not (= |c_ULTIMATE.start_main_~t~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~t~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= 2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) is different from false [2021-12-22 10:26:56,931 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= |c_ULTIMATE.start_main_~p~0#1.offset| 0) (forall ((|ULTIMATE.start_main_~p~0#1.base| Int)) (let ((.cse0 (select (select (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= 2 .cse0) (= 3 .cse0)))) (= 2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) is different from false [2021-12-22 10:26:56,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 10:26:56,986 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2021-12-22 10:26:56,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-22 10:26:56,987 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.1875) internal successors, (70), 32 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-12-22 10:26:56,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 10:26:56,987 INFO L225 Difference]: With dead ends: 75 [2021-12-22 10:26:56,987 INFO L226 Difference]: Without dead ends: 71 [2021-12-22 10:26:56,988 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=160, Invalid=793, Unknown=9, NotChecked=520, Total=1482 [2021-12-22 10:26:56,988 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 65 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 173 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 10:26:56,989 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 211 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 195 Invalid, 0 Unknown, 173 Unchecked, 0.1s Time] [2021-12-22 10:26:56,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-12-22 10:26:56,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 61. [2021-12-22 10:26:56,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.1166666666666667) internal successors, (67), 60 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 10:26:56,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2021-12-22 10:26:56,994 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 67 transitions. Word has length 25 [2021-12-22 10:26:56,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 10:26:56,994 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 67 transitions. [2021-12-22 10:26:56,994 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.1875) internal successors, (70), 32 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 10:26:56,994 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2021-12-22 10:26:56,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-22 10:26:56,995 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 10:26:56,995 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 10:26:57,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-22 10:26:57,202 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 10:26:57,203 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 10:26:57,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 10:26:57,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1574953317, now seen corresponding path program 3 times [2021-12-22 10:26:57,204 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 10:26:57,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237948927] [2021-12-22 10:26:57,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 10:26:57,204 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 10:26:57,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 10:26:57,532 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 10:26:57,532 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 10:26:57,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237948927] [2021-12-22 10:26:57,533 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237948927] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 10:26:57,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541661154] [2021-12-22 10:26:57,533 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-22 10:26:57,533 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 10:26:57,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 10:26:57,534 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) [2021-12-22 10:26:57,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-22 10:26:57,618 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-12-22 10:26:57,618 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-22 10:26:57,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 66 conjunts are in the unsatisfiable core [2021-12-22 10:26:57,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 10:26:57,641 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-22 10:26:57,688 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-22 10:26:57,689 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-22 10:26:57,731 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-22 10:26:57,736 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-22 10:26:57,795 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-22 10:26:57,795 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2021-12-22 10:26:57,800 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-22 10:26:57,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 10:26:57,805 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 21 treesize of output 21 [2021-12-22 10:26:57,895 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-22 10:26:57,895 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 101 treesize of output 92 [2021-12-22 10:26:57,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 10:26:57,900 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 36 [2021-12-22 10:26:57,903 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 65 treesize of output 51 [2021-12-22 10:26:57,980 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-22 10:26:57,981 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 72 [2021-12-22 10:26:58,000 INFO L353 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2021-12-22 10:26:58,000 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 65 treesize of output 70 [2021-12-22 10:26:58,013 INFO L353 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2021-12-22 10:26:58,014 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 29 treesize of output 34 [2021-12-22 10:26:58,100 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 11 [2021-12-22 10:26:58,126 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-12-22 10:26:58,160 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 47 treesize of output 39 [2021-12-22 10:26:58,198 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-12-22 10:26:58,299 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 38 treesize of output 30 [2021-12-22 10:26:58,334 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 54 treesize of output 46 [2021-12-22 10:26:59,171 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 131 treesize of output 103 [2021-12-22 10:26:59,209 INFO L353 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2021-12-22 10:26:59,209 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 110 treesize of output 87 [2021-12-22 10:26:59,502 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-22 10:26:59,502 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 14 [2021-12-22 10:26:59,521 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 10:26:59,521 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 10:27:01,691 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~p~0#1.base| Int)) (or (forall ((v_ArrVal_597 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse0 (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)) (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))))) (or (= .cse0 1) (= .cse0 3)))) (not (= (select (select (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) is different from false [2021-12-22 10:27:01,756 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_592 Int) (v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_80| Int) (v_ArrVal_598 (Array Int Int))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse0 (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) .cse3 v_ArrVal_592)))) (store .cse4 |v_ULTIMATE.start_main_~p~0#1.base_80| (store (select .cse4 |v_ULTIMATE.start_main_~p~0#1.base_80|) |c_ULTIMATE.start_main_~t~0#1.offset| 3))))) (let ((.cse1 (let ((.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_80| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse3 |c_ULTIMATE.start_main_~t~0#1.offset|)) |v_ULTIMATE.start_main_~p~0#1.base_80| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (or (not (= (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) (= 3 .cse1) (= .cse1 1)))))) is different from false [2021-12-22 10:27:01,827 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_592 Int) (v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_80| Int) (v_ArrVal_598 (Array Int Int))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse0 (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) .cse3 v_ArrVal_592)))) (store .cse4 |v_ULTIMATE.start_main_~p~0#1.base_80| (store (select .cse4 |v_ULTIMATE.start_main_~p~0#1.base_80|) 0 3))))) (let ((.cse1 (let ((.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_80| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse3 0)) |v_ULTIMATE.start_main_~p~0#1.base_80| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (or (not (= (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) (= 3 .cse1) (= .cse1 1)))))) is different from false [2021-12-22 10:27:01,852 INFO L353 Elim1Store]: treesize reduction 4, result has 90.0 percent of original size [2021-12-22 10:27:01,853 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1963 treesize of output 1863 [2021-12-22 10:27:01,873 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 10:27:01,873 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 1294 treesize of output 1137 [2021-12-22 10:27:05,064 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 8 treesize of output 4 [2021-12-22 10:27:05,542 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 8 treesize of output 4 [2021-12-22 10:27:05,731 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 8 treesize of output 4 [2021-12-22 10:27:06,278 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 8 treesize of output 4 [2021-12-22 10:27:09,412 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_11 (Array Int Int)) (v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_80| Int) (v_ArrVal_598 (Array Int Int))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_80| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) (.cse1 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_80| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (and (= .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (and (= .cse1 0) (= |v_ULTIMATE.start_main_~p~0#1.base_80| .cse0)) (let ((.cse2 (and (= |v_ULTIMATE.start_main_~p~0#1.base_80| |c_ULTIMATE.start_main_~a~0#1.base|) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)))) (and (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse0) .cse2) (or (= .cse1 |c_ULTIMATE.start_main_~p~0#1.offset|) .cse2))))))) is different from false [2021-12-22 10:27:10,382 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 8 treesize of output 4 [2021-12-22 10:27:10,940 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 8 treesize of output 4 [2021-12-22 10:27:11,089 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 8 treesize of output 4 [2021-12-22 10:27:11,413 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 8 treesize of output 4 [2021-12-22 10:27:15,030 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 8 treesize of output 4 [2021-12-22 10:27:15,537 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 8 treesize of output 4 [2021-12-22 10:27:15,717 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 8 treesize of output 4 [2021-12-22 10:27:16,225 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 8 treesize of output 4 [2021-12-22 10:27:19,126 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 10:27:19,127 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 170 treesize of output 150 [2021-12-22 10:27:19,134 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 10:27:19,134 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 140 treesize of output 120 [2021-12-22 10:27:19,145 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 10:27:19,145 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 464 treesize of output 437 [2021-12-22 10:27:19,154 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 418 treesize of output 370 [2021-12-22 10:27:19,166 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 10:27:19,166 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 378 treesize of output 362 [2021-12-22 10:27:19,182 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 10:27:19,183 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 490 treesize of output 481 [2021-12-22 10:27:19,193 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 462 treesize of output 438 [2021-12-22 10:27:19,200 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 438 treesize of output 426 [2021-12-22 10:27:20,489 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2021-12-22 10:27:20,489 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1541661154] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 10:27:20,489 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 10:27:20,490 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 15] total 36 [2021-12-22 10:27:20,490 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506506111] [2021-12-22 10:27:20,490 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 10:27:20,490 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2021-12-22 10:27:20,490 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 10:27:20,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-12-22 10:27:20,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=891, Unknown=4, NotChecked=252, Total=1260 [2021-12-22 10:27:20,491 INFO L87 Difference]: Start difference. First operand 61 states and 67 transitions. Second operand has 36 states, 36 states have (on average 1.9444444444444444) internal successors, (70), 36 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 10:27:20,872 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~a~0#1.base|) 4)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~a~0#1.base|) 4))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~p~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base|) 1) (not (= .cse0 |c_ULTIMATE.start_main_~a~0#1.base|)) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~t~0#1.base|)) (= .cse1 0) (= .cse0 |c_ULTIMATE.start_main_~p~0#1.base|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|) 1) (= |c_ULTIMATE.start_main_~t~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_ArrVal_592 Int) (v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_80| Int) (v_ArrVal_598 (Array Int Int))) (let ((.cse5 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse2 (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) .cse5 v_ArrVal_592)))) (store .cse6 |v_ULTIMATE.start_main_~p~0#1.base_80| (store (select .cse6 |v_ULTIMATE.start_main_~p~0#1.base_80|) |c_ULTIMATE.start_main_~t~0#1.offset| 3))))) (let ((.cse3 (let ((.cse4 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select .cse2 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_80| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse5 |c_ULTIMATE.start_main_~t~0#1.offset|)) |v_ULTIMATE.start_main_~p~0#1.base_80| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))))) (or (not (= (select (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) (= 3 .cse3) (= .cse3 1)))))) (= |c_ULTIMATE.start_main_~t~0#1.offset| |c_ULTIMATE.start_main_~a~0#1.offset|) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= .cse1 |c_ULTIMATE.start_main_~p~0#1.offset|))) is different from false [2021-12-22 10:27:20,893 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~a~0#1.base|) 4)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~a~0#1.base|) 4))) (and (not (= .cse0 |c_ULTIMATE.start_main_~a~0#1.base|)) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~t~0#1.base|)) (= .cse1 0) (= .cse0 |c_ULTIMATE.start_main_~p~0#1.base|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|) 1) (= |c_ULTIMATE.start_main_~t~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_ArrVal_592 Int) (v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_80| Int) (v_ArrVal_598 (Array Int Int))) (let ((.cse5 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse2 (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) .cse5 v_ArrVal_592)))) (store .cse6 |v_ULTIMATE.start_main_~p~0#1.base_80| (store (select .cse6 |v_ULTIMATE.start_main_~p~0#1.base_80|) |c_ULTIMATE.start_main_~t~0#1.offset| 3))))) (let ((.cse3 (let ((.cse4 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select .cse2 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_80| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse5 |c_ULTIMATE.start_main_~t~0#1.offset|)) |v_ULTIMATE.start_main_~p~0#1.base_80| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))))) (or (not (= (select (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) (= 3 .cse3) (= .cse3 1)))))) (= |c_ULTIMATE.start_main_~t~0#1.offset| |c_ULTIMATE.start_main_~a~0#1.offset|) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= .cse1 |c_ULTIMATE.start_main_~p~0#1.offset|))) is different from false [2021-12-22 10:27:22,897 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~a~0#1.base|) 4)) (.cse6 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~a~0#1.base|) 4))) (let ((.cse2 (= (select (select |c_#memory_int| .cse1) .cse6) 1)) (.cse3 (select (select |c_#memory_$Pointer$.offset| .cse1) (+ .cse6 4)))) (and (let ((.cse0 (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (or (and (= |c_ULTIMATE.start_main_~p~0#1.offset| |c_ULTIMATE.start_main_~a~0#1.offset|) .cse0) (and (not (= .cse1 |c_ULTIMATE.start_main_~p~0#1.base|)) (not .cse0) .cse2))) (not (= .cse1 |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse3 0) (forall ((|ULTIMATE.start_main_~p~0#1.base| Int)) (or (forall ((v_ArrVal_597 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse4 (let ((.cse5 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)) (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5)) (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))))) (or (= .cse4 1) (= .cse4 3)))) (not (= (select (select (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (= .cse6 0) .cse2 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse3)))) is different from false [2021-12-22 10:27:23,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 10:27:23,115 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2021-12-22 10:27:23,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-22 10:27:23,115 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.9444444444444444) internal successors, (70), 36 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-12-22 10:27:23,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 10:27:23,116 INFO L225 Difference]: With dead ends: 77 [2021-12-22 10:27:23,116 INFO L226 Difference]: Without dead ends: 73 [2021-12-22 10:27:23,117 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=222, Invalid=1683, Unknown=15, NotChecked=630, Total=2550 [2021-12-22 10:27:23,117 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 46 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 265 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 10:27:23,117 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 298 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 306 Invalid, 0 Unknown, 265 Unchecked, 0.2s Time] [2021-12-22 10:27:23,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-12-22 10:27:23,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 63. [2021-12-22 10:27:23,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.1129032258064515) internal successors, (69), 62 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 10:27:23,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2021-12-22 10:27:23,120 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 27 [2021-12-22 10:27:23,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 10:27:23,121 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2021-12-22 10:27:23,121 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.9444444444444444) internal successors, (70), 36 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 10:27:23,121 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2021-12-22 10:27:23,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-22 10:27:23,121 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 10:27:23,121 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 10:27:23,143 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2021-12-22 10:27:23,322 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-12-22 10:27:23,322 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 10:27:23,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 10:27:23,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1961532986, now seen corresponding path program 2 times [2021-12-22 10:27:23,322 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 10:27:23,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287299485] [2021-12-22 10:27:23,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 10:27:23,323 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 10:27:23,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 10:27:23,628 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 10:27:23,628 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 10:27:23,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287299485] [2021-12-22 10:27:23,628 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287299485] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 10:27:23,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1314333316] [2021-12-22 10:27:23,629 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-22 10:27:23,629 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 10:27:23,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 10:27:23,630 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) [2021-12-22 10:27:23,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-22 10:27:23,705 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-22 10:27:23,706 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-22 10:27:23,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 66 conjunts are in the unsatisfiable core [2021-12-22 10:27:23,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 10:27:23,716 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-22 10:27:23,765 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-22 10:27:23,765 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-22 10:27:23,810 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-22 10:27:23,817 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-22 10:27:23,882 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-22 10:27:23,882 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2021-12-22 10:27:23,885 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-22 10:27:23,907 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-22 10:27:23,907 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2021-12-22 10:27:23,913 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-22 10:27:24,049 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-22 10:27:24,050 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 101 treesize of output 92 [2021-12-22 10:27:24,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 10:27:24,054 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 36 [2021-12-22 10:27:24,057 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 65 treesize of output 51 [2021-12-22 10:27:24,148 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-22 10:27:24,149 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 72 [2021-12-22 10:27:24,170 INFO L353 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2021-12-22 10:27:24,170 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 65 treesize of output 70 [2021-12-22 10:27:24,182 INFO L353 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2021-12-22 10:27:24,182 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 29 treesize of output 34 [2021-12-22 10:27:24,278 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 11 [2021-12-22 10:27:24,303 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 47 treesize of output 39 [2021-12-22 10:27:24,464 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 115 treesize of output 99 [2021-12-22 10:27:24,770 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 125 treesize of output 101 [2021-12-22 10:27:24,788 INFO L353 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2021-12-22 10:27:24,788 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 108 treesize of output 85 [2021-12-22 10:27:25,111 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-22 10:27:25,111 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 14 [2021-12-22 10:27:25,133 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 10:27:25,134 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 10:27:27,292 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~p~0#1.base| Int)) (or (not (= 2 (select (select (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse0 (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)) (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))))) (or (= 2 .cse0) (= 3 .cse0)))))) is different from false [2021-12-22 10:27:27,340 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_682 Int) (v_ArrVal_683 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_91| Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse1 (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) .cse3 v_ArrVal_682)))) (store .cse4 |v_ULTIMATE.start_main_~p~0#1.base_91| (store (select .cse4 |v_ULTIMATE.start_main_~p~0#1.base_91|) |c_ULTIMATE.start_main_~t~0#1.offset| 3))))) (let ((.cse0 (let ((.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select .cse1 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_91| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse3 |c_ULTIMATE.start_main_~t~0#1.offset|)) |v_ULTIMATE.start_main_~p~0#1.base_91| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (or (= 3 .cse0) (= 2 .cse0) (not (= 2 (select (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))))))) is different from false [2021-12-22 10:27:27,396 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_682 Int) (v_ArrVal_683 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_91| Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse1 (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) .cse3 v_ArrVal_682)))) (store .cse4 |v_ULTIMATE.start_main_~p~0#1.base_91| (store (select .cse4 |v_ULTIMATE.start_main_~p~0#1.base_91|) 0 3))))) (let ((.cse0 (let ((.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select .cse1 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_91| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse3 0)) |v_ULTIMATE.start_main_~p~0#1.base_91| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (or (= 2 .cse0) (not (= (select (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) (= 3 .cse0)))))) is different from false [2021-12-22 10:27:27,423 INFO L353 Elim1Store]: treesize reduction 4, result has 90.0 percent of original size [2021-12-22 10:27:27,423 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 8709 treesize of output 8185 [2021-12-22 10:27:27,496 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 10:27:27,496 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 3851 treesize of output 3369 [2021-12-22 10:27:43,541 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 8 treesize of output 4 [2021-12-22 10:27:43,768 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 8 treesize of output 4 [2021-12-22 10:27:43,957 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 8 treesize of output 4 [2021-12-22 10:27:44,007 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 8 treesize of output 4 [2021-12-22 10:27:47,928 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 8 treesize of output 4 [2021-12-22 10:27:48,273 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 8 treesize of output 4 [2021-12-22 10:27:48,549 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 8 treesize of output 4 [2021-12-22 10:27:48,613 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 8 treesize of output 4 [2021-12-22 10:27:52,082 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 8 treesize of output 4 [2021-12-22 10:27:52,263 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 8 treesize of output 4 [2021-12-22 10:27:52,344 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 8 treesize of output 4 [2021-12-22 10:27:52,365 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 8 treesize of output 4