./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-tiling/revcpyswp2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 35987657 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/array-tiling/revcpyswp2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.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 e5d836305a9654c4a87b407d535438bc329bb78fc0805b3b823600303a7df507 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-20 21:13:46,963 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 21:13:46,965 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 21:13:47,012 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 21:13:47,013 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 21:13:47,014 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 21:13:47,017 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 21:13:47,023 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 21:13:47,026 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 21:13:47,030 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 21:13:47,031 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 21:13:47,034 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 21:13:47,034 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 21:13:47,037 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 21:13:47,039 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 21:13:47,041 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 21:13:47,041 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 21:13:47,043 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 21:13:47,045 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 21:13:47,051 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 21:13:47,053 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 21:13:47,054 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 21:13:47,055 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 21:13:47,056 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 21:13:47,058 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 21:13:47,065 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 21:13:47,065 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 21:13:47,066 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 21:13:47,068 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 21:13:47,068 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 21:13:47,069 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 21:13:47,069 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 21:13:47,071 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 21:13:47,072 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 21:13:47,072 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 21:13:47,073 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 21:13:47,073 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 21:13:47,074 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 21:13:47,074 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 21:13:47,074 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 21:13:47,075 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 21:13:47,077 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 21:13:47,078 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-20 21:13:47,114 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 21:13:47,115 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 21:13:47,115 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 21:13:47,115 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 21:13:47,116 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 21:13:47,116 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 21:13:47,117 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 21:13:47,117 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 21:13:47,117 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 21:13:47,118 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 21:13:47,119 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-20 21:13:47,119 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 21:13:47,119 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-20 21:13:47,119 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 21:13:47,119 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-20 21:13:47,120 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 21:13:47,120 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-20 21:13:47,120 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-20 21:13:47,120 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-20 21:13:47,121 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 21:13:47,122 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-20 21:13:47,122 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 21:13:47,122 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 21:13:47,123 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 21:13:47,123 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 21:13:47,123 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 21:13:47,123 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 21:13:47,124 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-20 21:13:47,124 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-20 21:13:47,124 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-20 21:13:47,125 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-20 21:13:47,125 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-20 21:13:47,125 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-20 21:13:47,125 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 -> e5d836305a9654c4a87b407d535438bc329bb78fc0805b3b823600303a7df507 [2022-07-20 21:13:47,364 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 21:13:47,383 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 21:13:47,386 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 21:13:47,388 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 21:13:47,389 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 21:13:47,390 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-tiling/revcpyswp2.c [2022-07-20 21:13:47,452 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e30b1e9bc/266a2c3fe4fc4e3cb9b6c6883691bdf5/FLAGbfa4df6ba [2022-07-20 21:13:47,872 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 21:13:47,875 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/revcpyswp2.c [2022-07-20 21:13:47,882 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e30b1e9bc/266a2c3fe4fc4e3cb9b6c6883691bdf5/FLAGbfa4df6ba [2022-07-20 21:13:48,301 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e30b1e9bc/266a2c3fe4fc4e3cb9b6c6883691bdf5 [2022-07-20 21:13:48,303 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 21:13:48,305 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 21:13:48,306 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 21:13:48,306 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 21:13:48,309 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 21:13:48,310 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 09:13:48" (1/1) ... [2022-07-20 21:13:48,311 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e8d81b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:13:48, skipping insertion in model container [2022-07-20 21:13:48,311 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 09:13:48" (1/1) ... [2022-07-20 21:13:48,317 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 21:13:48,330 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 21:13:48,452 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/array-tiling/revcpyswp2.c[432,445] [2022-07-20 21:13:48,486 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 21:13:48,493 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 21:13:48,504 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/array-tiling/revcpyswp2.c[432,445] [2022-07-20 21:13:48,513 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 21:13:48,525 INFO L208 MainTranslator]: Completed translation [2022-07-20 21:13:48,526 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:13:48 WrapperNode [2022-07-20 21:13:48,526 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 21:13:48,527 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 21:13:48,527 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 21:13:48,527 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 21:13:48,534 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:13:48" (1/1) ... [2022-07-20 21:13:48,543 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:13:48" (1/1) ... [2022-07-20 21:13:48,570 INFO L137 Inliner]: procedures = 16, calls = 28, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 108 [2022-07-20 21:13:48,571 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 21:13:48,572 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 21:13:48,572 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 21:13:48,572 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 21:13:48,578 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:13:48" (1/1) ... [2022-07-20 21:13:48,578 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:13:48" (1/1) ... [2022-07-20 21:13:48,581 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:13:48" (1/1) ... [2022-07-20 21:13:48,581 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:13:48" (1/1) ... [2022-07-20 21:13:48,587 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:13:48" (1/1) ... [2022-07-20 21:13:48,591 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:13:48" (1/1) ... [2022-07-20 21:13:48,592 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:13:48" (1/1) ... [2022-07-20 21:13:48,594 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 21:13:48,595 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 21:13:48,595 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 21:13:48,595 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 21:13:48,608 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:13:48" (1/1) ... [2022-07-20 21:13:48,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 21:13:48,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 21:13:48,637 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) [2022-07-20 21:13:48,645 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 [2022-07-20 21:13:48,677 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 21:13:48,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-20 21:13:48,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-20 21:13:48,678 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-20 21:13:48,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 21:13:48,678 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 21:13:48,679 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-20 21:13:48,740 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 21:13:48,741 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 21:13:48,873 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 21:13:48,879 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 21:13:48,880 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-07-20 21:13:48,882 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 09:13:48 BoogieIcfgContainer [2022-07-20 21:13:48,882 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 21:13:48,883 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 21:13:48,884 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 21:13:48,906 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 21:13:48,906 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 09:13:48" (1/3) ... [2022-07-20 21:13:48,907 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40b68def and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 09:13:48, skipping insertion in model container [2022-07-20 21:13:48,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:13:48" (2/3) ... [2022-07-20 21:13:48,908 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40b68def and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 09:13:48, skipping insertion in model container [2022-07-20 21:13:48,908 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 09:13:48" (3/3) ... [2022-07-20 21:13:48,909 INFO L111 eAbstractionObserver]: Analyzing ICFG revcpyswp2.c [2022-07-20 21:13:48,922 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 21:13:48,923 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-20 21:13:49,002 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 21:13:49,008 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@999c007, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@8dc4b1a [2022-07-20 21:13:49,008 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-20 21:13:49,029 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 23 states have (on average 1.565217391304348) internal successors, (36), 24 states have internal predecessors, (36), 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) [2022-07-20 21:13:49,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-20 21:13:49,035 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:13:49,036 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 21:13:49,036 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:13:49,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:13:49,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1560213877, now seen corresponding path program 1 times [2022-07-20 21:13:49,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 21:13:49,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016078830] [2022-07-20 21:13:49,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:13:49,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 21:13:49,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:13:49,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:13:49,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 21:13:49,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016078830] [2022-07-20 21:13:49,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016078830] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 21:13:49,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 21:13:49,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 21:13:49,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834000119] [2022-07-20 21:13:49,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 21:13:49,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-20 21:13:49,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 21:13:49,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-20 21:13:49,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-20 21:13:49,294 INFO L87 Difference]: Start difference. First operand has 25 states, 23 states have (on average 1.565217391304348) internal successors, (36), 24 states have internal predecessors, (36), 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) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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) [2022-07-20 21:13:49,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 21:13:49,311 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2022-07-20 21:13:49,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-20 21:13:49,313 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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 14 [2022-07-20 21:13:49,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 21:13:49,319 INFO L225 Difference]: With dead ends: 45 [2022-07-20 21:13:49,320 INFO L226 Difference]: Without dead ends: 21 [2022-07-20 21:13:49,323 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-20 21:13:49,326 INFO L413 NwaCegarLoop]: 30 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, 30 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 [2022-07-20 21:13:49,327 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 21:13:49,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-07-20 21:13:49,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-07-20 21:13:49,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 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) [2022-07-20 21:13:49,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2022-07-20 21:13:49,354 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2022-07-20 21:13:49,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 21:13:49,354 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2022-07-20 21:13:49,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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) [2022-07-20 21:13:49,355 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2022-07-20 21:13:49,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-20 21:13:49,355 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:13:49,355 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 21:13:49,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-20 21:13:49,356 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:13:49,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:13:49,357 INFO L85 PathProgramCache]: Analyzing trace with hash 631559685, now seen corresponding path program 1 times [2022-07-20 21:13:49,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 21:13:49,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457185678] [2022-07-20 21:13:49,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:13:49,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 21:13:49,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:13:49,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:13:49,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 21:13:49,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457185678] [2022-07-20 21:13:49,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457185678] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 21:13:49,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 21:13:49,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 21:13:49,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480585918] [2022-07-20 21:13:49,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 21:13:49,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 21:13:49,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 21:13:49,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 21:13:49,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 21:13:49,434 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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) [2022-07-20 21:13:49,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 21:13:49,490 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2022-07-20 21:13:49,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 21:13:49,493 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 14 [2022-07-20 21:13:49,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 21:13:49,494 INFO L225 Difference]: With dead ends: 39 [2022-07-20 21:13:49,494 INFO L226 Difference]: Without dead ends: 23 [2022-07-20 21:13:49,495 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 21:13:49,496 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 1 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 21:13:49,498 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 27 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 21:13:49,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-07-20 21:13:49,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2022-07-20 21:13:49,504 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) [2022-07-20 21:13:49,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2022-07-20 21:13:49,506 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 14 [2022-07-20 21:13:49,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 21:13:49,506 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2022-07-20 21:13:49,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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) [2022-07-20 21:13:49,507 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-07-20 21:13:49,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-20 21:13:49,508 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:13:49,509 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 21:13:49,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-20 21:13:49,509 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:13:49,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:13:49,512 INFO L85 PathProgramCache]: Analyzing trace with hash -971977821, now seen corresponding path program 1 times [2022-07-20 21:13:49,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 21:13:49,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301910950] [2022-07-20 21:13:49,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:13:49,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 21:13:49,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:13:49,578 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 21:13:49,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 21:13:49,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301910950] [2022-07-20 21:13:49,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301910950] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 21:13:49,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 21:13:49,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 21:13:49,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983497443] [2022-07-20 21:13:49,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 21:13:49,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 21:13:49,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 21:13:49,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 21:13:49,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-20 21:13:49,581 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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) [2022-07-20 21:13:49,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 21:13:49,644 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2022-07-20 21:13:49,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 21:13:49,645 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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 16 [2022-07-20 21:13:49,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 21:13:49,646 INFO L225 Difference]: With dead ends: 48 [2022-07-20 21:13:49,647 INFO L226 Difference]: Without dead ends: 35 [2022-07-20 21:13:49,648 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-20 21:13:49,649 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 36 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 21:13:49,651 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 15 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 21:13:49,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-07-20 21:13:49,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 25. [2022-07-20 21:13:49,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 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) [2022-07-20 21:13:49,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-07-20 21:13:49,660 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 16 [2022-07-20 21:13:49,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 21:13:49,661 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-07-20 21:13:49,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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) [2022-07-20 21:13:49,662 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-07-20 21:13:49,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-20 21:13:49,663 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:13:49,663 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 21:13:49,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-20 21:13:49,664 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:13:49,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:13:49,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1185722883, now seen corresponding path program 1 times [2022-07-20 21:13:49,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 21:13:49,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504936056] [2022-07-20 21:13:49,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:13:49,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 21:13:49,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:13:49,747 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-20 21:13:49,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 21:13:49,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504936056] [2022-07-20 21:13:49,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504936056] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 21:13:49,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713491249] [2022-07-20 21:13:49,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:13:49,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 21:13:49,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 21:13:49,755 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) [2022-07-20 21:13:49,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-20 21:13:49,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:13:49,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-20 21:13:49,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 21:13:49,976 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-20 21:13:49,977 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 21:13:50,003 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-20 21:13:50,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1713491249] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 21:13:50,003 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 21:13:50,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-07-20 21:13:50,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037741196] [2022-07-20 21:13:50,004 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 21:13:50,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 21:13:50,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 21:13:50,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 21:13:50,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2022-07-20 21:13:50,006 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 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) [2022-07-20 21:13:50,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 21:13:50,086 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2022-07-20 21:13:50,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 21:13:50,087 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 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 22 [2022-07-20 21:13:50,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 21:13:50,089 INFO L225 Difference]: With dead ends: 47 [2022-07-20 21:13:50,089 INFO L226 Difference]: Without dead ends: 28 [2022-07-20 21:13:50,090 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2022-07-20 21:13:50,097 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 8 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 21:13:50,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 27 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 21:13:50,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-07-20 21:13:50,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2022-07-20 21:13:50,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 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) [2022-07-20 21:13:50,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-07-20 21:13:50,113 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 22 [2022-07-20 21:13:50,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 21:13:50,113 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-07-20 21:13:50,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 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) [2022-07-20 21:13:50,114 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-07-20 21:13:50,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-20 21:13:50,115 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:13:50,115 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 21:13:50,140 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-20 21:13:50,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 21:13:50,340 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:13:50,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:13:50,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1086929509, now seen corresponding path program 2 times [2022-07-20 21:13:50,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 21:13:50,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406662159] [2022-07-20 21:13:50,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:13:50,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 21:13:50,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:13:50,466 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-20 21:13:50,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 21:13:50,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406662159] [2022-07-20 21:13:50,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406662159] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 21:13:50,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [167075319] [2022-07-20 21:13:50,467 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 21:13:50,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 21:13:50,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 21:13:50,470 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) [2022-07-20 21:13:50,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-20 21:13:50,564 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 21:13:50,565 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 21:13:50,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-20 21:13:50,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 21:13:50,653 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-20 21:13:50,653 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 21:13:50,703 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-20 21:13:50,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [167075319] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 21:13:50,703 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 21:13:50,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2022-07-20 21:13:50,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412279744] [2022-07-20 21:13:50,704 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 21:13:50,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 21:13:50,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 21:13:50,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 21:13:50,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-07-20 21:13:50,706 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 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) [2022-07-20 21:13:50,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 21:13:50,788 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2022-07-20 21:13:50,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 21:13:50,788 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 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 24 [2022-07-20 21:13:50,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 21:13:50,789 INFO L225 Difference]: With dead ends: 64 [2022-07-20 21:13:50,789 INFO L226 Difference]: Without dead ends: 49 [2022-07-20 21:13:50,790 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2022-07-20 21:13:50,791 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 38 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 21:13:50,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 27 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 21:13:50,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-07-20 21:13:50,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 33. [2022-07-20 21:13:50,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.15625) internal successors, (37), 32 states have internal predecessors, (37), 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) [2022-07-20 21:13:50,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2022-07-20 21:13:50,796 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 24 [2022-07-20 21:13:50,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 21:13:50,796 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2022-07-20 21:13:50,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 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) [2022-07-20 21:13:50,796 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2022-07-20 21:13:50,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-20 21:13:50,797 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:13:50,797 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 21:13:50,825 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-20 21:13:51,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 21:13:51,024 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:13:51,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:13:51,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1519365621, now seen corresponding path program 3 times [2022-07-20 21:13:51,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 21:13:51,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5077345] [2022-07-20 21:13:51,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:13:51,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 21:13:51,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:13:52,255 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:13:52,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 21:13:52,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5077345] [2022-07-20 21:13:52,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5077345] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 21:13:52,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1430620288] [2022-07-20 21:13:52,256 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-20 21:13:52,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 21:13:52,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 21:13:52,257 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) [2022-07-20 21:13:52,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-20 21:13:52,371 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-20 21:13:52,372 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 21:13:52,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 74 conjunts are in the unsatisfiable core [2022-07-20 21:13:52,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 21:13:52,435 INFO L356 Elim1Store]: treesize reduction 17, result has 32.0 percent of original size [2022-07-20 21:13:52,437 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1565 treesize of output 1537 [2022-07-20 21:13:52,730 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2022-07-20 21:13:52,736 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 21:13:52,913 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 26 [2022-07-20 21:13:52,917 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-07-20 21:13:52,999 INFO L356 Elim1Store]: treesize reduction 46, result has 13.2 percent of original size [2022-07-20 21:13:52,999 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 55 [2022-07-20 21:13:53,006 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 47 [2022-07-20 21:13:53,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 21:13:53,319 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 60 [2022-07-20 21:13:53,325 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 21:13:53,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 21:13:53,327 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 40 [2022-07-20 21:13:53,332 INFO L390 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 21 treesize of output 20 [2022-07-20 21:13:53,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 21:13:53,453 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 35 [2022-07-20 21:13:53,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 21:13:53,459 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-07-20 21:13:53,612 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 36 [2022-07-20 21:13:53,617 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 35 [2022-07-20 21:13:53,621 INFO L390 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 24 treesize of output 20 [2022-07-20 21:13:53,663 INFO L356 Elim1Store]: treesize reduction 19, result has 40.6 percent of original size [2022-07-20 21:13:53,664 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 55 [2022-07-20 21:13:53,669 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 47 [2022-07-20 21:13:53,674 INFO L390 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 15 treesize of output 11 [2022-07-20 21:13:53,886 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:13:53,887 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 21:13:54,055 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (or (< (+ |ULTIMATE.start_main_~i~0#1| 1) c_~SIZE~0) (forall ((v_ArrVal_382 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse1 (* |ULTIMATE.start_main_~i~0#1| 4))) (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~b~0#1.offset|))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_382))) (= (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~a_copy~0#1.base|) (+ |c_ULTIMATE.start_main_~a_copy~0#1.offset| (- 4) (* 4 c_~SIZE~0)))))))) is different from false [2022-07-20 21:13:54,083 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_380 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_57| Int) (v_ArrVal_382 (Array Int Int))) (or (let ((.cse0 (store (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse3 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ .cse3 |c_ULTIMATE.start_main_~b~0#1.offset|))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_380))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse2 (* |v_ULTIMATE.start_main_~i~0#1_57| 4))) (store (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_ArrVal_380 (+ .cse2 |c_ULTIMATE.start_main_~b~0#1.offset|)))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_382))) (= (select (select .cse0 |c_ULTIMATE.start_main_~a_copy~0#1.base|) (+ |c_ULTIMATE.start_main_~a_copy~0#1.offset| (- 4) (* 4 c_~SIZE~0))) (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (< (+ |v_ULTIMATE.start_main_~i~0#1_57| 1) c_~SIZE~0))) is different from false [2022-07-20 21:13:54,097 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_380 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_57| Int) (v_ArrVal_382 (Array Int Int))) (or (let ((.cse0 (store (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_380))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse2 (* |v_ULTIMATE.start_main_~i~0#1_57| 4))) (store (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_ArrVal_380 (+ .cse2 |c_ULTIMATE.start_main_~b~0#1.offset|)))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_382))) (= (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~a_copy~0#1.base|) (+ |c_ULTIMATE.start_main_~a_copy~0#1.offset| (- 4) (* 4 c_~SIZE~0))))) (< (+ |v_ULTIMATE.start_main_~i~0#1_57| 1) c_~SIZE~0))) is different from false [2022-07-20 21:13:54,155 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_377 Int) (v_ArrVal_380 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_57| Int) (v_ArrVal_382 (Array Int Int)) (v_ArrVal_375 (Array Int Int)) (v_ArrVal_374 (Array Int Int))) (or (let ((.cse0 (store (let ((.cse1 (store (let ((.cse4 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_375) |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_377))) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_374) |c_ULTIMATE.start_main_~b~0#1.base| .cse4))) (store .cse3 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (select .cse4 |c_ULTIMATE.start_main_~b~0#1.offset|))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_380))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse2 (* |v_ULTIMATE.start_main_~i~0#1_57| 4))) (store (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_ArrVal_380 (+ .cse2 |c_ULTIMATE.start_main_~b~0#1.offset|)))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_382))) (= (select (select .cse0 |c_ULTIMATE.start_main_~a_copy~0#1.base|) (+ |c_ULTIMATE.start_main_~a_copy~0#1.offset| (- 4) (* 4 c_~SIZE~0))) (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (< (+ |v_ULTIMATE.start_main_~i~0#1_57| 1) c_~SIZE~0))) is different from false [2022-07-20 21:13:54,183 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_60| Int)) (or (forall ((v_ArrVal_377 Int) (v_ArrVal_380 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_57| Int) (v_ArrVal_382 (Array Int Int)) (v_ArrVal_375 (Array Int Int)) (v_ArrVal_374 (Array Int Int))) (or (< (+ |v_ULTIMATE.start_main_~i~0#1_57| 1) c_~SIZE~0) (let ((.cse0 (store (let ((.cse1 (store (let ((.cse4 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_375) |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_60| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_377))) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_374) |c_ULTIMATE.start_main_~b~0#1.base| .cse4))) (store .cse3 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (select .cse4 |c_ULTIMATE.start_main_~b~0#1.offset|))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_380))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse2 (* |v_ULTIMATE.start_main_~i~0#1_57| 4))) (store (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_ArrVal_380 (+ .cse2 |c_ULTIMATE.start_main_~b~0#1.offset|)))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_382))) (= (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~a_copy~0#1.base|) (+ |c_ULTIMATE.start_main_~a_copy~0#1.offset| (- 4) (* 4 c_~SIZE~0))))))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_60|)))) is different from false [2022-07-20 21:13:54,240 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_377 Int) (v_ArrVal_380 (Array Int Int)) (v_ArrVal_371 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_57| Int) (v_ArrVal_382 (Array Int Int)) (v_ArrVal_372 (Array Int Int)) (v_ArrVal_375 (Array Int Int)) (v_ArrVal_374 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_60| Int)) (or (< (+ |v_ULTIMATE.start_main_~i~0#1_57| 1) c_~SIZE~0) (let ((.cse0 (store (let ((.cse1 (store (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_371) |c_ULTIMATE.start_main_~b~0#1.base| (let ((.cse6 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_372) |c_ULTIMATE.start_main_~b~0#1.base|) (+ .cse6 |c_ULTIMATE.start_main_~b~0#1.offset|) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|))))))) (let ((.cse4 (store (select (store .cse5 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_375) |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_60| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_377))) (let ((.cse3 (store (store .cse5 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_374) |c_ULTIMATE.start_main_~b~0#1.base| .cse4))) (store .cse3 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (select .cse4 |c_ULTIMATE.start_main_~b~0#1.offset|)))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_380))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse2 (* |v_ULTIMATE.start_main_~i~0#1_57| 4))) (store (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_ArrVal_380 (+ .cse2 |c_ULTIMATE.start_main_~b~0#1.offset|)))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_382))) (= (select (select .cse0 |c_ULTIMATE.start_main_~a_copy~0#1.base|) (+ |c_ULTIMATE.start_main_~a_copy~0#1.offset| (- 4) (* 4 c_~SIZE~0))) (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_60|)))) is different from false [2022-07-20 21:13:54,278 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_377 Int) (v_ArrVal_380 (Array Int Int)) (v_ArrVal_371 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_57| Int) (v_ArrVal_382 (Array Int Int)) (v_ArrVal_372 (Array Int Int)) (v_ArrVal_375 (Array Int Int)) (v_ArrVal_374 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_60| Int)) (or (let ((.cse0 (store (let ((.cse1 (store (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_371) |c_ULTIMATE.start_main_~b~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_372) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))))) (let ((.cse4 (store (select (store .cse5 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_375) |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_60| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_377))) (let ((.cse3 (store (store .cse5 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_374) |c_ULTIMATE.start_main_~b~0#1.base| .cse4))) (store .cse3 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (select .cse4 |c_ULTIMATE.start_main_~b~0#1.offset|)))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_380))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse2 (* |v_ULTIMATE.start_main_~i~0#1_57| 4))) (store (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_ArrVal_380 (+ .cse2 |c_ULTIMATE.start_main_~b~0#1.offset|)))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_382))) (= (select (select .cse0 |c_ULTIMATE.start_main_~a_copy~0#1.base|) (+ |c_ULTIMATE.start_main_~a_copy~0#1.offset| (- 4) (* 4 c_~SIZE~0))) (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_60|)) (< (+ |v_ULTIMATE.start_main_~i~0#1_57| 1) c_~SIZE~0))) is different from false [2022-07-20 21:13:54,648 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (or (forall ((v_ArrVal_377 Int) (v_ArrVal_380 (Array Int Int)) (v_ArrVal_371 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_57| Int) (v_ArrVal_382 (Array Int Int)) (v_ArrVal_372 (Array Int Int)) (v_ArrVal_375 (Array Int Int)) (v_ArrVal_374 (Array Int Int)) (v_ArrVal_366 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_60| Int)) (or (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_60|)) (< (+ |v_ULTIMATE.start_main_~i~0#1_57| 1) c_~SIZE~0) (let ((.cse1 (* 4 c_~SIZE~0))) (let ((.cse0 (store (let ((.cse2 (store (let ((.cse6 (let ((.cse7 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a_copy~0#1.base|) (+ |c_ULTIMATE.start_main_~a_copy~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| (- 4)) (- 4) .cse1)))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_366))) (store (store .cse7 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_371) |c_ULTIMATE.start_main_~b~0#1.base| (store (select (store .cse7 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_372) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (select (select .cse7 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (let ((.cse5 (store (select (store .cse6 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_375) |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_60| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_377))) (let ((.cse4 (store (store .cse6 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_374) |c_ULTIMATE.start_main_~b~0#1.base| .cse5))) (store .cse4 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (select .cse5 |c_ULTIMATE.start_main_~b~0#1.offset|)))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_380))) (store .cse2 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse3 (* |v_ULTIMATE.start_main_~i~0#1_57| 4))) (store (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_ArrVal_380 (+ .cse3 |c_ULTIMATE.start_main_~b~0#1.offset|)))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_382))) (= (select (select .cse0 |c_ULTIMATE.start_main_~a_copy~0#1.base|) (+ |c_ULTIMATE.start_main_~a_copy~0#1.offset| (- 4) .cse1)) (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (< (+ |ULTIMATE.start_main_~i~0#1| 1) c_~SIZE~0))) is different from false [2022-07-20 21:13:54,742 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_380 (Array Int Int)) (v_ArrVal_371 (Array Int Int)) (v_ArrVal_382 (Array Int Int)) (v_ArrVal_372 (Array Int Int)) (v_ArrVal_364 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_64| Int) (v_ArrVal_375 (Array Int Int)) (v_ArrVal_374 (Array Int Int)) (v_ArrVal_366 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_60| Int) (v_ArrVal_377 Int) (|v_ULTIMATE.start_main_~i~0#1_57| Int)) (or (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_60|)) (< (+ |v_ULTIMATE.start_main_~i~0#1_64| 1) c_~SIZE~0) (let ((.cse1 (* 4 c_~SIZE~0))) (let ((.cse0 (store (let ((.cse2 (store (let ((.cse6 (let ((.cse7 (store (let ((.cse8 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a_copy~0#1.base|) (+ |c_ULTIMATE.start_main_~a_copy~0#1.offset| (* (- 4) |c_ULTIMATE.start_main_~i~0#1|) (- 4) .cse1)))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_364))) (store .cse8 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse8 |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_64| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select .cse8 |c_ULTIMATE.start_main_~a_copy~0#1.base|) (+ |c_ULTIMATE.start_main_~a_copy~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_64| (- 4)) (- 4) .cse1))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_366))) (store (store .cse7 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_371) |c_ULTIMATE.start_main_~b~0#1.base| (store (select (store .cse7 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_372) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (select (select .cse7 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (let ((.cse5 (store (select (store .cse6 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_375) |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_60| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_377))) (let ((.cse4 (store (store .cse6 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_374) |c_ULTIMATE.start_main_~b~0#1.base| .cse5))) (store .cse4 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (select .cse5 |c_ULTIMATE.start_main_~b~0#1.offset|)))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_380))) (store .cse2 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse3 (* |v_ULTIMATE.start_main_~i~0#1_57| 4))) (store (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_ArrVal_380 (+ .cse3 |c_ULTIMATE.start_main_~b~0#1.offset|)))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_382))) (= (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~a_copy~0#1.base|) (+ |c_ULTIMATE.start_main_~a_copy~0#1.offset| (- 4) .cse1))))) (< (+ |v_ULTIMATE.start_main_~i~0#1_57| 1) c_~SIZE~0))) is different from false [2022-07-20 21:13:54,800 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_380 (Array Int Int)) (v_ArrVal_371 (Array Int Int)) (v_ArrVal_382 (Array Int Int)) (v_ArrVal_372 (Array Int Int)) (v_ArrVal_364 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_64| Int) (v_ArrVal_375 (Array Int Int)) (v_ArrVal_374 (Array Int Int)) (v_ArrVal_366 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_60| Int) (v_ArrVal_377 Int) (|v_ULTIMATE.start_main_~i~0#1_57| Int)) (or (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_60|)) (< (+ |v_ULTIMATE.start_main_~i~0#1_64| 1) c_~SIZE~0) (let ((.cse9 (* 4 c_~SIZE~0))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~a_copy~0#1.offset| (- 4) .cse9))) (let ((.cse0 (store (let ((.cse2 (store (let ((.cse6 (let ((.cse7 (store (let ((.cse8 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a_copy~0#1.base|) .cse1))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_364))) (store .cse8 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse8 |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_64| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select .cse8 |c_ULTIMATE.start_main_~a_copy~0#1.base|) (+ |c_ULTIMATE.start_main_~a_copy~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_64| (- 4)) (- 4) .cse9))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_366))) (store (store .cse7 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_371) |c_ULTIMATE.start_main_~b~0#1.base| (store (select (store .cse7 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_372) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (select (select .cse7 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (let ((.cse5 (store (select (store .cse6 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_375) |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_60| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_377))) (let ((.cse4 (store (store .cse6 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_374) |c_ULTIMATE.start_main_~b~0#1.base| .cse5))) (store .cse4 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (select .cse5 |c_ULTIMATE.start_main_~b~0#1.offset|)))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_380))) (store .cse2 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse3 (* |v_ULTIMATE.start_main_~i~0#1_57| 4))) (store (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_ArrVal_380 (+ .cse3 |c_ULTIMATE.start_main_~b~0#1.offset|)))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_382))) (= (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~a_copy~0#1.base|) .cse1))))) (< (+ |v_ULTIMATE.start_main_~i~0#1_57| 1) c_~SIZE~0))) is different from false [2022-07-20 21:13:59,311 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 21:13:59,312 INFO L390 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 13982 treesize of output 7515