./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/sina3.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version ff03de63 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-fpi/sina3.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 2aebf3cfbf85ca5d76e40b9ce94a108ab82985532ad1ea09b88a009b3e11ff5a --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ff03de6 [2021-12-21 10:15:56,056 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-21 10:15:56,080 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-21 10:15:56,114 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-21 10:15:56,114 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-21 10:15:56,117 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-21 10:15:56,118 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-21 10:15:56,121 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-21 10:15:56,123 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-21 10:15:56,126 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-21 10:15:56,127 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-21 10:15:56,128 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-21 10:15:56,128 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-21 10:15:56,130 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-21 10:15:56,131 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-21 10:15:56,133 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-21 10:15:56,134 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-21 10:15:56,134 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-21 10:15:56,136 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-21 10:15:56,140 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-21 10:15:56,141 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-21 10:15:56,142 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-21 10:15:56,143 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-21 10:15:56,144 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-21 10:15:56,149 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-21 10:15:56,149 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-21 10:15:56,150 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-21 10:15:56,151 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-21 10:15:56,151 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-21 10:15:56,152 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-21 10:15:56,152 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-21 10:15:56,153 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-21 10:15:56,154 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-21 10:15:56,154 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-21 10:15:56,155 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-21 10:15:56,156 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-21 10:15:56,156 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-21 10:15:56,157 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-21 10:15:56,157 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-21 10:15:56,157 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-21 10:15:56,158 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-21 10:15:56,160 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-21 10:15:56,188 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-21 10:15:56,188 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-21 10:15:56,189 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-21 10:15:56,189 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-21 10:15:56,189 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-21 10:15:56,190 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-21 10:15:56,190 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-21 10:15:56,190 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-21 10:15:56,190 INFO L138 SettingsManager]: * Use SBE=true [2021-12-21 10:15:56,191 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-21 10:15:56,191 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-21 10:15:56,191 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-21 10:15:56,191 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-21 10:15:56,192 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-21 10:15:56,192 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-21 10:15:56,192 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-21 10:15:56,192 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-21 10:15:56,192 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-21 10:15:56,192 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-21 10:15:56,192 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-21 10:15:56,193 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-21 10:15:56,193 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-21 10:15:56,193 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-21 10:15:56,193 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-21 10:15:56,193 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 10:15:56,193 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-21 10:15:56,194 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-21 10:15:56,194 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-21 10:15:56,194 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-21 10:15:56,194 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-21 10:15:56,194 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-21 10:15:56,194 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-21 10:15:56,195 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-21 10:15:56,195 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-21 10:15:56,195 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 -> 2aebf3cfbf85ca5d76e40b9ce94a108ab82985532ad1ea09b88a009b3e11ff5a [2021-12-21 10:15:56,413 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-21 10:15:56,431 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-21 10:15:56,433 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-21 10:15:56,433 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-21 10:15:56,434 INFO L275 PluginConnector]: CDTParser initialized [2021-12-21 10:15:56,435 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/sina3.c [2021-12-21 10:15:56,475 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af5f9a031/d2c36aa5c1bf41e2a3db0966006351f1/FLAG0371ee6e5 [2021-12-21 10:15:56,797 INFO L306 CDTParser]: Found 1 translation units. [2021-12-21 10:15:56,798 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/sina3.c [2021-12-21 10:15:56,806 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af5f9a031/d2c36aa5c1bf41e2a3db0966006351f1/FLAG0371ee6e5 [2021-12-21 10:15:57,218 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af5f9a031/d2c36aa5c1bf41e2a3db0966006351f1 [2021-12-21 10:15:57,221 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-21 10:15:57,222 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-21 10:15:57,225 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-21 10:15:57,225 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-21 10:15:57,228 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-21 10:15:57,228 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 10:15:57" (1/1) ... [2021-12-21 10:15:57,230 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5273cd03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:15:57, skipping insertion in model container [2021-12-21 10:15:57,230 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 10:15:57" (1/1) ... [2021-12-21 10:15:57,234 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-21 10:15:57,246 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-21 10:15:57,359 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-fpi/sina3.c[588,601] [2021-12-21 10:15:57,381 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 10:15:57,386 INFO L203 MainTranslator]: Completed pre-run [2021-12-21 10:15:57,397 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-fpi/sina3.c[588,601] [2021-12-21 10:15:57,416 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 10:15:57,425 INFO L208 MainTranslator]: Completed translation [2021-12-21 10:15:57,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:15:57 WrapperNode [2021-12-21 10:15:57,425 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-21 10:15:57,426 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-21 10:15:57,426 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-21 10:15:57,426 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-21 10:15:57,430 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:15:57" (1/1) ... [2021-12-21 10:15:57,434 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:15:57" (1/1) ... [2021-12-21 10:15:57,454 INFO L137 Inliner]: procedures = 17, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 96 [2021-12-21 10:15:57,454 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-21 10:15:57,455 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-21 10:15:57,455 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-21 10:15:57,455 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-21 10:15:57,461 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:15:57" (1/1) ... [2021-12-21 10:15:57,461 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:15:57" (1/1) ... [2021-12-21 10:15:57,471 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:15:57" (1/1) ... [2021-12-21 10:15:57,472 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:15:57" (1/1) ... [2021-12-21 10:15:57,479 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:15:57" (1/1) ... [2021-12-21 10:15:57,486 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:15:57" (1/1) ... [2021-12-21 10:15:57,488 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:15:57" (1/1) ... [2021-12-21 10:15:57,493 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-21 10:15:57,496 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-21 10:15:57,496 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-21 10:15:57,496 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-21 10:15:57,497 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:15:57" (1/1) ... [2021-12-21 10:15:57,502 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 10:15:57,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 10:15:57,554 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-21 10:15:57,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-21 10:15:57,582 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-21 10:15:57,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-21 10:15:57,583 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-21 10:15:57,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-21 10:15:57,583 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-21 10:15:57,583 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-21 10:15:57,586 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-21 10:15:57,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-21 10:15:57,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-21 10:15:57,639 INFO L234 CfgBuilder]: Building ICFG [2021-12-21 10:15:57,643 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-21 10:15:57,811 INFO L275 CfgBuilder]: Performing block encoding [2021-12-21 10:15:57,816 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-21 10:15:57,816 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2021-12-21 10:15:57,817 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 10:15:57 BoogieIcfgContainer [2021-12-21 10:15:57,817 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-21 10:15:57,818 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-21 10:15:57,818 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-21 10:15:57,821 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-21 10:15:57,821 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 10:15:57" (1/3) ... [2021-12-21 10:15:57,821 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@275a02cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 10:15:57, skipping insertion in model container [2021-12-21 10:15:57,822 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:15:57" (2/3) ... [2021-12-21 10:15:57,822 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@275a02cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 10:15:57, skipping insertion in model container [2021-12-21 10:15:57,822 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 10:15:57" (3/3) ... [2021-12-21 10:15:57,823 INFO L111 eAbstractionObserver]: Analyzing ICFG sina3.c [2021-12-21 10:15:57,826 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-21 10:15:57,826 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-21 10:15:57,855 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-21 10:15:57,859 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-21 10:15:57,860 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-21 10:15:57,877 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 25 states have (on average 1.56) internal successors, (39), 26 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:15:57,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-21 10:15:57,889 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:15:57,889 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 10:15:57,890 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:15:57,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:15:57,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1389277550, now seen corresponding path program 1 times [2021-12-21 10:15:57,900 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:15:57,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075141665] [2021-12-21 10:15:57,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:15:57,902 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:15:57,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:15:58,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 10:15:58,044 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:15:58,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075141665] [2021-12-21 10:15:58,046 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075141665] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 10:15:58,046 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 10:15:58,047 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-21 10:15:58,048 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51949589] [2021-12-21 10:15:58,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 10:15:58,052 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-21 10:15:58,052 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:15:58,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-21 10:15:58,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-21 10:15:58,078 INFO L87 Difference]: Start difference. First operand has 27 states, 25 states have (on average 1.56) internal successors, (39), 26 states have internal predecessors, (39), 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 8.0) internal successors, (16), 2 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) [2021-12-21 10:15:58,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:15:58,093 INFO L93 Difference]: Finished difference Result 50 states and 72 transitions. [2021-12-21 10:15:58,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-21 10:15:58,095 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 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 [2021-12-21 10:15:58,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:15:58,101 INFO L225 Difference]: With dead ends: 50 [2021-12-21 10:15:58,101 INFO L226 Difference]: Without dead ends: 23 [2021-12-21 10:15:58,103 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-21 10:15:58,106 INFO L933 BasicCegarLoop]: 32 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, 32 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 10:15:58,107 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 10:15:58,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2021-12-21 10:15:58,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2021-12-21 10:15:58,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:15:58,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2021-12-21 10:15:58,131 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 16 [2021-12-21 10:15:58,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:15:58,131 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2021-12-21 10:15:58,132 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 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) [2021-12-21 10:15:58,132 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2021-12-21 10:15:58,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-21 10:15:58,132 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:15:58,132 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 10:15:58,133 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-21 10:15:58,133 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:15:58,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:15:58,134 INFO L85 PathProgramCache]: Analyzing trace with hash 796930410, now seen corresponding path program 1 times [2021-12-21 10:15:58,134 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:15:58,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552811079] [2021-12-21 10:15:58,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:15:58,134 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:15:58,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:15:58,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 10:15:58,192 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:15:58,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552811079] [2021-12-21 10:15:58,193 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552811079] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 10:15:58,193 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 10:15:58,193 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 10:15:58,193 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288698034] [2021-12-21 10:15:58,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 10:15:58,194 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 10:15:58,194 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:15:58,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 10:15:58,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-21 10:15:58,195 INFO L87 Difference]: Start difference. First operand 23 states and 27 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) [2021-12-21 10:15:58,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:15:58,248 INFO L93 Difference]: Finished difference Result 53 states and 64 transitions. [2021-12-21 10:15:58,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 10:15:58,248 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 [2021-12-21 10:15:58,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:15:58,249 INFO L225 Difference]: With dead ends: 53 [2021-12-21 10:15:58,249 INFO L226 Difference]: Without dead ends: 37 [2021-12-21 10:15:58,249 INFO L932 BasicCegarLoop]: 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 [2021-12-21 10:15:58,250 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 41 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 10:15:58,251 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 17 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 10:15:58,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2021-12-21 10:15:58,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 27. [2021-12-21 10:15:58,255 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) [2021-12-21 10:15:58,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2021-12-21 10:15:58,256 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 16 [2021-12-21 10:15:58,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:15:58,256 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2021-12-21 10:15:58,256 INFO L471 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) [2021-12-21 10:15:58,256 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2021-12-21 10:15:58,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-21 10:15:58,257 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:15:58,257 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 10:15:58,257 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-21 10:15:58,257 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:15:58,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:15:58,258 INFO L85 PathProgramCache]: Analyzing trace with hash 495241442, now seen corresponding path program 1 times [2021-12-21 10:15:58,258 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:15:58,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007521864] [2021-12-21 10:15:58,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:15:58,259 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:15:58,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:15:59,032 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 10:15:59,032 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:15:59,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007521864] [2021-12-21 10:15:59,033 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007521864] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 10:15:59,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1224747935] [2021-12-21 10:15:59,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:15:59,034 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:15:59,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 10:15:59,040 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 10:15:59,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-21 10:15:59,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:15:59,098 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 47 conjunts are in the unsatisfiable core [2021-12-21 10:15:59,103 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 10:15:59,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:15:59,157 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2021-12-21 10:15:59,178 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 10:15:59,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:15:59,226 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-21 10:15:59,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:15:59,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:15:59,466 INFO L387 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 26 treesize of output 28 [2021-12-21 10:15:59,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:15:59,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:15:59,647 INFO L387 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 43 treesize of output 33 [2021-12-21 10:15:59,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:15:59,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:15:59,852 INFO L387 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 45 treesize of output 35 [2021-12-21 10:16:00,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:16:00,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:16:00,108 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-21 10:16:00,108 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 36 [2021-12-21 10:16:00,133 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 10:16:00,134 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 10:16:00,563 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-21 10:16:00,568 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2021-12-21 10:16:00,572 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-21 10:16:00,573 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-21 10:16:00,574 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-21 10:16:00,584 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 10:16:00,585 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1224747935] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 10:16:00,585 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 10:16:00,585 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 38 [2021-12-21 10:16:00,585 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177826393] [2021-12-21 10:16:00,586 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 10:16:00,586 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2021-12-21 10:16:00,586 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:16:00,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-12-21 10:16:00,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=1192, Unknown=0, NotChecked=0, Total=1406 [2021-12-21 10:16:00,588 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 38 states, 38 states have (on average 1.605263157894737) internal successors, (61), 38 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:16:01,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:16:01,040 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2021-12-21 10:16:01,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-21 10:16:01,040 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.605263157894737) internal successors, (61), 38 states have internal predecessors, (61), 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 [2021-12-21 10:16:01,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:16:01,042 INFO L225 Difference]: With dead ends: 55 [2021-12-21 10:16:01,042 INFO L226 Difference]: Without dead ends: 53 [2021-12-21 10:16:01,044 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 23 SyntacticMatches, 5 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 651 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=281, Invalid=1441, Unknown=0, NotChecked=0, Total=1722 [2021-12-21 10:16:01,047 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 43 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 11 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-21 10:16:01,052 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 114 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 334 Invalid, 0 Unknown, 11 Unchecked, 0.3s Time] [2021-12-21 10:16:01,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2021-12-21 10:16:01,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 44. [2021-12-21 10:16:01,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.2093023255813953) internal successors, (52), 43 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:16:01,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2021-12-21 10:16:01,059 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 24 [2021-12-21 10:16:01,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:16:01,059 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2021-12-21 10:16:01,060 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.605263157894737) internal successors, (61), 38 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:16:01,060 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2021-12-21 10:16:01,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-21 10:16:01,063 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:16:01,063 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 10:16:01,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-21 10:16:01,273 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:16:01,273 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:16:01,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:16:01,274 INFO L85 PathProgramCache]: Analyzing trace with hash 831040416, now seen corresponding path program 2 times [2021-12-21 10:16:01,274 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:16:01,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565231925] [2021-12-21 10:16:01,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:16:01,274 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:16:01,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:16:01,337 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-21 10:16:01,337 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:16:01,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565231925] [2021-12-21 10:16:01,337 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565231925] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 10:16:01,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1072903721] [2021-12-21 10:16:01,337 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-21 10:16:01,338 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:16:01,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 10:16:01,339 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 10:16:01,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-21 10:16:01,401 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-21 10:16:01,401 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 10:16:01,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-21 10:16:01,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 10:16:01,493 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-21 10:16:01,494 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 10:16:01,540 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-21 10:16:01,540 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1072903721] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 10:16:01,540 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 10:16:01,540 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2021-12-21 10:16:01,541 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668708533] [2021-12-21 10:16:01,541 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 10:16:01,541 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-21 10:16:01,541 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:16:01,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-21 10:16:01,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-12-21 10:16:01,542 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 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) [2021-12-21 10:16:01,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:16:01,648 INFO L93 Difference]: Finished difference Result 110 states and 128 transitions. [2021-12-21 10:16:01,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-21 10:16:01,648 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 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) Word has length 26 [2021-12-21 10:16:01,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:16:01,651 INFO L225 Difference]: With dead ends: 110 [2021-12-21 10:16:01,653 INFO L226 Difference]: Without dead ends: 66 [2021-12-21 10:16:01,654 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2021-12-21 10:16:01,654 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 56 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 10:16:01,655 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 61 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 10:16:01,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2021-12-21 10:16:01,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2021-12-21 10:16:01,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 45 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:16:01,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2021-12-21 10:16:01,675 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 26 [2021-12-21 10:16:01,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:16:01,677 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2021-12-21 10:16:01,678 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 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) [2021-12-21 10:16:01,678 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2021-12-21 10:16:01,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-21 10:16:01,679 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:16:01,679 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 10:16:01,697 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-21 10:16:01,891 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2021-12-21 10:16:01,892 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:16:01,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:16:01,892 INFO L85 PathProgramCache]: Analyzing trace with hash -587916192, now seen corresponding path program 3 times [2021-12-21 10:16:01,892 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:16:01,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555626896] [2021-12-21 10:16:01,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:16:01,892 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:16:01,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:16:01,931 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-21 10:16:01,932 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:16:01,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555626896] [2021-12-21 10:16:01,932 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555626896] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 10:16:01,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [269848045] [2021-12-21 10:16:01,932 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-21 10:16:01,932 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:16:01,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 10:16:01,941 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 10:16:01,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-21 10:16:01,994 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-12-21 10:16:01,994 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 10:16:01,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-21 10:16:01,996 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 10:16:02,061 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-21 10:16:02,062 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 10:16:02,102 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-21 10:16:02,103 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [269848045] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 10:16:02,103 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 10:16:02,103 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2021-12-21 10:16:02,103 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997821695] [2021-12-21 10:16:02,103 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 10:16:02,104 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-21 10:16:02,105 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:16:02,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-21 10:16:02,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-12-21 10:16:02,105 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:16:02,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:16:02,213 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2021-12-21 10:16:02,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-21 10:16:02,214 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 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 26 [2021-12-21 10:16:02,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:16:02,214 INFO L225 Difference]: With dead ends: 63 [2021-12-21 10:16:02,214 INFO L226 Difference]: Without dead ends: 50 [2021-12-21 10:16:02,214 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2021-12-21 10:16:02,215 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 60 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 10:16:02,215 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 53 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 10:16:02,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2021-12-21 10:16:02,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 35. [2021-12-21 10:16:02,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 34 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:16:02,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2021-12-21 10:16:02,219 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 26 [2021-12-21 10:16:02,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:16:02,219 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2021-12-21 10:16:02,219 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:16:02,219 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2021-12-21 10:16:02,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-21 10:16:02,219 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:16:02,219 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 10:16:02,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-21 10:16:02,427 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:16:02,428 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:16:02,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:16:02,428 INFO L85 PathProgramCache]: Analyzing trace with hash -826292134, now seen corresponding path program 4 times [2021-12-21 10:16:02,428 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:16:02,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027713764] [2021-12-21 10:16:02,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:16:02,429 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:16:02,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:16:03,320 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 10:16:03,321 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:16:03,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027713764] [2021-12-21 10:16:03,321 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027713764] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 10:16:03,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1301289787] [2021-12-21 10:16:03,321 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-21 10:16:03,321 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:16:03,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 10:16:03,322 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 10:16:03,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-21 10:16:03,384 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-21 10:16:03,384 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 10:16:03,385 WARN L261 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 65 conjunts are in the unsatisfiable core [2021-12-21 10:16:03,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 10:16:03,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:16:03,427 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2021-12-21 10:16:03,436 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 10:16:03,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:16:03,481 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-21 10:16:03,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:16:03,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:16:03,570 INFO L387 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 30 treesize of output 32 [2021-12-21 10:16:03,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:16:03,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:16:03,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:16:03,841 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2021-12-21 10:16:03,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:16:03,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:16:03,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:16:03,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:16:03,989 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2021-12-21 10:16:04,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:16:04,210 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-21 10:16:04,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:16:04,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:16:04,213 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 53 [2021-12-21 10:16:04,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:16:04,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:16:04,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:16:04,365 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 49 [2021-12-21 10:16:04,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:16:04,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:16:04,583 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-21 10:16:04,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:16:04,584 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-21 10:16:04,585 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 53 [2021-12-21 10:16:04,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:16:04,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:16:04,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:16:04,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:16:04,782 INFO L353 Elim1Store]: treesize reduction 33, result has 31.3 percent of original size [2021-12-21 10:16:04,782 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 66 [2021-12-21 10:16:05,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:16:05,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:16:05,014 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-21 10:16:05,015 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 34 [2021-12-21 10:16:05,049 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 10:16:05,049 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 10:16:07,190 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_69| Int)) (or (forall ((v_ArrVal_229 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_69| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_229) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_69|)))) is different from false [2021-12-21 10:16:17,519 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_75| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_75|)) (forall ((v_ArrVal_221 Int) (|v_ULTIMATE.start_main_~i~0#1_69| Int) (v_ArrVal_229 Int)) (or (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_69|)) (= (select (store (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_75| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_221)))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse3 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3))))) (store (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse1 (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse2 .cse3))))))) (+ (* |v_ULTIMATE.start_main_~i~0#1_69| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_229) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1)))))) is different from false [2021-12-21 10:16:19,565 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_221 Int) (|v_ULTIMATE.start_main_~i~0#1_69| Int) (|v_ULTIMATE.start_main_~i~0#1_75| Int) (v_ArrVal_229 Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_75|)) (= (select (store (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (+ (* |v_ULTIMATE.start_main_~i~0#1_75| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_221)))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse3 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse2 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3))))) (store (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse1 .cse2 .cse3 (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)))))))) (+ (* |v_ULTIMATE.start_main_~i~0#1_69| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_229) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_69|)))) is different from false [2021-12-21 10:16:21,052 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_221 Int) (|v_ULTIMATE.start_main_~i~0#1_69| Int) (|v_ULTIMATE.start_main_~i~0#1_75| Int) (v_ArrVal_229 Int)) (or (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_75|)) (= (select (store (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) (+ (* |v_ULTIMATE.start_main_~i~0#1_75| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_221)))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse3 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse2 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3))))) (store (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse1 .cse2 (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse3))))))) (+ (* |v_ULTIMATE.start_main_~i~0#1_69| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_229) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_69|)))) is different from false [2021-12-21 10:16:57,097 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2021-12-21 10:16:57,097 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1301289787] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 10:16:57,097 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 10:16:57,097 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 22] total 60 [2021-12-21 10:16:57,098 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965189814] [2021-12-21 10:16:57,098 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 10:16:57,098 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2021-12-21 10:16:57,098 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:16:57,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2021-12-21 10:16:57,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=2775, Unknown=28, NotChecked=444, Total=3540 [2021-12-21 10:16:57,101 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 60 states, 60 states have (on average 1.4166666666666667) internal successors, (85), 60 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:17:01,390 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (<= c_~N~0 2) (= (select .cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~i~0#1| 0) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |c_ULTIMATE.start_main_~#sum~0#1.base|) (forall ((|v_ULTIMATE.start_main_~i~0#1_75| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_75|)) (forall ((v_ArrVal_221 Int) (|v_ULTIMATE.start_main_~i~0#1_69| Int) (v_ArrVal_229 Int)) (or (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_69|)) (= (select (store (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_75| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_221)))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse4 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse1 (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse4))))) (store (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse2 (select (select .cse1 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse3 .cse4))))))) (+ (* |v_ULTIMATE.start_main_~i~0#1_69| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_229) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1)))))) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (< 1 c_~N~0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~b~0#1.offset|)) 1) (= (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (< (+ |c_ULTIMATE.start_main_~b~0#1.base| 1) |c_ULTIMATE.start_main_~#sum~0#1.base|) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from false [2021-12-21 10:17:03,650 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse3 (select .cse4 .cse1))) (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse2 (+ c_~N~0 1)) (.cse5 (+ (- 2) .cse3))) (and (<= c_~N~0 .cse0) (<= c_~N~0 2) (= .cse1 0) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~i~0#1| 0) (<= .cse2 .cse3) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (and (< (+ |ULTIMATE.start_main_~b~0#1.base| 1) |ULTIMATE.start_main_~#sum~0#1.base|) (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (+ (- 1) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |ULTIMATE.start_main_~#sum~0#1.base|) (= (select (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (* |c_ULTIMATE.start_main_~i~0#1| 4)) 1))) (= (select .cse4 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse5) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (< 1 c_~N~0) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (<= .cse0 c_~N~0) (= (+ (- 1) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~b~0#1.offset|))) 0) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (<= .cse3 .cse2) (forall ((|v_ULTIMATE.start_main_~i~0#1_69| Int)) (or (forall ((v_ArrVal_229 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_69| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_229) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_69|)))) (= .cse5 1))))) is different from false [2021-12-21 10:17:05,712 WARN L838 $PredicateComparison]: unable to prove that (and (<= c_~N~0 2) (= 3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (< 1 c_~N~0) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_69| Int)) (or (forall ((v_ArrVal_229 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_69| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_229) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ c_~N~0 1))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_69|)))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (and (= (select (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0) 1) (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 2) (< (+ |ULTIMATE.start_main_~b~0#1.base| 1) |ULTIMATE.start_main_~#sum~0#1.base|) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |ULTIMATE.start_main_~#sum~0#1.base|)))) is different from false [2021-12-21 10:17:05,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:17:05,868 INFO L93 Difference]: Finished difference Result 68 states and 77 transitions. [2021-12-21 10:17:05,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-12-21 10:17:05,869 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 1.4166666666666667) internal successors, (85), 60 states have internal predecessors, (85), 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 32 [2021-12-21 10:17:05,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:17:05,871 INFO L225 Difference]: With dead ends: 68 [2021-12-21 10:17:05,871 INFO L226 Difference]: Without dead ends: 66 [2021-12-21 10:17:05,872 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 24 SyntacticMatches, 4 SemanticMatches, 68 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1456 ImplicationChecksByTransitivity, 60.7s TimeCoverageRelationStatistics Valid=377, Invalid=3526, Unknown=31, NotChecked=896, Total=4830 [2021-12-21 10:17:05,872 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 14 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 536 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 10:17:05,873 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 151 Invalid, 797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 244 Invalid, 0 Unknown, 536 Unchecked, 0.2s Time] [2021-12-21 10:17:05,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2021-12-21 10:17:05,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 60. [2021-12-21 10:17:05,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.1694915254237288) internal successors, (69), 59 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:17:05,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 69 transitions. [2021-12-21 10:17:05,883 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 69 transitions. Word has length 32 [2021-12-21 10:17:05,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:17:05,884 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 69 transitions. [2021-12-21 10:17:05,884 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 1.4166666666666667) internal successors, (85), 60 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:17:05,884 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2021-12-21 10:17:05,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-21 10:17:05,885 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:17:05,885 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 10:17:05,902 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-21 10:17:06,093 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:17:06,094 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:17:06,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:17:06,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1696042328, now seen corresponding path program 5 times [2021-12-21 10:17:06,094 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:17:06,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642613184] [2021-12-21 10:17:06,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:17:06,094 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:17:06,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:17:06,160 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-21 10:17:06,160 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:17:06,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642613184] [2021-12-21 10:17:06,160 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642613184] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 10:17:06,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1285094553] [2021-12-21 10:17:06,160 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-21 10:17:06,161 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:17:06,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 10:17:06,161 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 10:17:06,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-21 10:17:06,240 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2021-12-21 10:17:06,240 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 10:17:06,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-21 10:17:06,242 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 10:17:06,319 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-21 10:17:06,319 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 10:17:06,373 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-21 10:17:06,374 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1285094553] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 10:17:06,374 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 10:17:06,374 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2021-12-21 10:17:06,374 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24159689] [2021-12-21 10:17:06,374 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 10:17:06,375 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-21 10:17:06,375 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:17:06,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-21 10:17:06,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2021-12-21 10:17:06,376 INFO L87 Difference]: Start difference. First operand 60 states and 69 transitions. Second operand has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:17:06,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:17:06,503 INFO L93 Difference]: Finished difference Result 148 states and 167 transitions. [2021-12-21 10:17:06,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-21 10:17:06,504 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 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 34 [2021-12-21 10:17:06,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:17:06,504 INFO L225 Difference]: With dead ends: 148 [2021-12-21 10:17:06,504 INFO L226 Difference]: Without dead ends: 111 [2021-12-21 10:17:06,508 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2021-12-21 10:17:06,508 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 111 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 10:17:06,510 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 66 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 10:17:06,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2021-12-21 10:17:06,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 83. [2021-12-21 10:17:06,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 82 states have (on average 1.1219512195121952) internal successors, (92), 82 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:17:06,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 92 transitions. [2021-12-21 10:17:06,522 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 92 transitions. Word has length 34 [2021-12-21 10:17:06,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:17:06,522 INFO L470 AbstractCegarLoop]: Abstraction has 83 states and 92 transitions. [2021-12-21 10:17:06,522 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:17:06,523 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 92 transitions. [2021-12-21 10:17:06,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-21 10:17:06,526 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:17:06,526 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 10:17:06,545 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-21 10:17:06,743 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:17:06,743 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:17:06,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:17:06,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1205583320, now seen corresponding path program 6 times [2021-12-21 10:17:06,744 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:17:06,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383488261] [2021-12-21 10:17:06,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:17:06,744 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:17:06,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:17:06,798 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-21 10:17:06,799 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:17:06,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383488261] [2021-12-21 10:17:06,799 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383488261] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 10:17:06,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [761016304] [2021-12-21 10:17:06,799 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-21 10:17:06,799 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:17:06,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 10:17:06,800 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 10:17:06,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-21 10:17:06,861 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2021-12-21 10:17:06,861 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 10:17:06,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-21 10:17:06,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 10:17:06,952 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-21 10:17:06,952 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 10:17:07,013 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-21 10:17:07,013 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [761016304] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 10:17:07,013 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 10:17:07,013 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2021-12-21 10:17:07,014 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964637198] [2021-12-21 10:17:07,014 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 10:17:07,014 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-21 10:17:07,014 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:17:07,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-21 10:17:07,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2021-12-21 10:17:07,015 INFO L87 Difference]: Start difference. First operand 83 states and 92 transitions. Second operand has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:17:07,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:17:07,210 INFO L93 Difference]: Finished difference Result 112 states and 119 transitions. [2021-12-21 10:17:07,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-21 10:17:07,210 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 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 34 [2021-12-21 10:17:07,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:17:07,211 INFO L225 Difference]: With dead ends: 112 [2021-12-21 10:17:07,211 INFO L226 Difference]: Without dead ends: 91 [2021-12-21 10:17:07,211 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2021-12-21 10:17:07,212 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 121 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 10:17:07,212 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [121 Valid, 106 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-21 10:17:07,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2021-12-21 10:17:07,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 68. [2021-12-21 10:17:07,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.0895522388059702) internal successors, (73), 67 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:17:07,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 73 transitions. [2021-12-21 10:17:07,218 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 73 transitions. Word has length 34 [2021-12-21 10:17:07,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:17:07,218 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 73 transitions. [2021-12-21 10:17:07,218 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:17:07,218 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions. [2021-12-21 10:17:07,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-21 10:17:07,219 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:17:07,219 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 10:17:07,237 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-21 10:17:07,435 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:17:07,436 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:17:07,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:17:07,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1737020496, now seen corresponding path program 1 times [2021-12-21 10:17:07,436 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:17:07,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937145153] [2021-12-21 10:17:07,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:17:07,436 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:17:07,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:17:08,044 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 10:17:08,044 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:17:08,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937145153] [2021-12-21 10:17:08,045 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937145153] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 10:17:08,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2015169212] [2021-12-21 10:17:08,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:17:08,045 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:17:08,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 10:17:08,046 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 10:17:08,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-21 10:17:08,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:17:08,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 81 conjunts are in the unsatisfiable core [2021-12-21 10:17:08,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 10:17:08,130 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 10:17:08,137 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-21 10:17:08,138 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2021-12-21 10:17:08,173 INFO L387 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-21 10:17:08,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:17:08,271 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2021-12-21 10:17:08,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:17:08,416 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2021-12-21 10:17:08,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:17:08,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:17:08,524 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 52 [2021-12-21 10:17:08,674 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-21 10:17:08,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:17:08,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:17:08,677 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 61 [2021-12-21 10:17:08,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:17:08,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:17:08,805 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 61 [2021-12-21 10:17:08,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:17:08,992 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-21 10:17:08,992 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-21 10:17:08,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:17:08,994 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 70 [2021-12-21 10:17:09,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:17:09,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:17:09,124 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-21 10:17:09,124 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 73 treesize of output 59 [2021-12-21 10:17:09,652 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 10:17:09,652 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 10:17:12,087 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 10:17:12,087 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2015169212] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 10:17:12,087 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 10:17:12,087 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23, 23] total 63 [2021-12-21 10:17:12,088 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108010051] [2021-12-21 10:17:12,088 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 10:17:12,088 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2021-12-21 10:17:12,088 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:17:12,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2021-12-21 10:17:12,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=468, Invalid=3438, Unknown=0, NotChecked=0, Total=3906 [2021-12-21 10:17:12,089 INFO L87 Difference]: Start difference. First operand 68 states and 73 transitions. Second operand has 63 states, 63 states have (on average 1.5396825396825398) internal successors, (97), 63 states have internal predecessors, (97), 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)