/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --traceabstraction.compute.interpolants.along.a.counterexample FPandBPonlyIfFpWasNotPerfect -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.assert.codeblocks NOT_INCREMENTALLY -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-fpi/eqn2f.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-d623d84 [2020-07-20 11:45:52,343 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-20 11:45:52,347 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-20 11:45:52,365 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-20 11:45:52,365 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-20 11:45:52,367 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-20 11:45:52,369 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-20 11:45:52,379 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-20 11:45:52,382 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-20 11:45:52,386 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-20 11:45:52,387 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-20 11:45:52,389 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-20 11:45:52,389 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-20 11:45:52,391 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-20 11:45:52,393 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-20 11:45:52,394 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-20 11:45:52,396 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-20 11:45:52,397 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-20 11:45:52,398 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-20 11:45:52,400 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-20 11:45:52,401 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-20 11:45:52,402 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-20 11:45:52,403 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-20 11:45:52,404 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-20 11:45:52,406 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-20 11:45:52,406 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-20 11:45:52,406 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-20 11:45:52,407 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-20 11:45:52,407 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-20 11:45:52,408 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-20 11:45:52,408 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-20 11:45:52,409 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-20 11:45:52,410 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-20 11:45:52,411 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-20 11:45:52,411 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-20 11:45:52,412 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-20 11:45:52,412 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-20 11:45:52,412 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-20 11:45:52,413 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-20 11:45:52,413 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-20 11:45:52,414 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-20 11:45:52,415 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-20 11:45:52,429 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-20 11:45:52,429 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-20 11:45:52,430 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-20 11:45:52,431 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-20 11:45:52,431 INFO L138 SettingsManager]: * Use SBE=true [2020-07-20 11:45:52,431 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-20 11:45:52,431 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-20 11:45:52,431 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-20 11:45:52,432 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-20 11:45:52,432 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-20 11:45:52,432 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-20 11:45:52,432 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-20 11:45:52,432 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-20 11:45:52,432 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-20 11:45:52,433 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-20 11:45:52,433 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-20 11:45:52,433 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-20 11:45:52,433 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-20 11:45:52,433 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-20 11:45:52,434 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-20 11:45:52,434 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-20 11:45:52,434 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-20 11:45:52,434 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-20 11:45:52,434 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-20 11:45:52,435 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-20 11:45:52,435 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-20 11:45:52,435 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 11:45:52,435 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-20 11:45:52,435 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-20 11:45:52,435 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> FPandBPonlyIfFpWasNotPerfect Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks -> NOT_INCREMENTALLY [2020-07-20 11:45:52,708 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-20 11:45:52,724 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-20 11:45:52,728 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-20 11:45:52,729 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-20 11:45:52,730 INFO L275 PluginConnector]: CDTParser initialized [2020-07-20 11:45:52,731 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/eqn2f.c [2020-07-20 11:45:52,804 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/732db785b/d66de7f043f2497b8ca39c6fd2603326/FLAG396252b6b [2020-07-20 11:45:53,320 INFO L306 CDTParser]: Found 1 translation units. [2020-07-20 11:45:53,321 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/eqn2f.c [2020-07-20 11:45:53,328 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/732db785b/d66de7f043f2497b8ca39c6fd2603326/FLAG396252b6b [2020-07-20 11:45:53,635 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/732db785b/d66de7f043f2497b8ca39c6fd2603326 [2020-07-20 11:45:53,645 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-20 11:45:53,648 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-20 11:45:53,649 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-20 11:45:53,650 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-20 11:45:53,653 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-20 11:45:53,654 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 11:45:53" (1/1) ... [2020-07-20 11:45:53,657 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67f9a050 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 11:45:53, skipping insertion in model container [2020-07-20 11:45:53,657 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 11:45:53" (1/1) ... [2020-07-20 11:45:53,665 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-20 11:45:53,683 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-20 11:45:53,845 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 11:45:53,854 INFO L203 MainTranslator]: Completed pre-run [2020-07-20 11:45:53,873 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 11:45:53,889 INFO L208 MainTranslator]: Completed translation [2020-07-20 11:45:53,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 11:45:53 WrapperNode [2020-07-20 11:45:53,890 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-20 11:45:53,891 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-20 11:45:53,891 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-20 11:45:53,891 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-20 11:45:53,902 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 11:45:53" (1/1) ... [2020-07-20 11:45:53,902 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 11:45:53" (1/1) ... [2020-07-20 11:45:54,003 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 11:45:53" (1/1) ... [2020-07-20 11:45:54,003 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 11:45:53" (1/1) ... [2020-07-20 11:45:54,011 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 11:45:53" (1/1) ... [2020-07-20 11:45:54,017 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 11:45:53" (1/1) ... [2020-07-20 11:45:54,018 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 11:45:53" (1/1) ... [2020-07-20 11:45:54,021 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-20 11:45:54,021 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-20 11:45:54,021 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-20 11:45:54,021 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-20 11:45:54,022 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 11:45:53" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-20 11:45:54,090 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-20 11:45:54,090 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-20 11:45:54,090 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-20 11:45:54,090 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-20 11:45:54,090 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-20 11:45:54,090 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-20 11:45:54,091 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-20 11:45:54,091 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-20 11:45:54,091 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-20 11:45:54,091 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-20 11:45:54,091 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-20 11:45:54,091 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-20 11:45:54,092 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-20 11:45:54,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-20 11:45:54,092 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-20 11:45:54,092 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-20 11:45:54,093 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-20 11:45:54,093 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-20 11:45:54,398 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-20 11:45:54,398 INFO L295 CfgBuilder]: Removed 3 assume(true) statements. [2020-07-20 11:45:54,402 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 11:45:54 BoogieIcfgContainer [2020-07-20 11:45:54,403 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-20 11:45:54,404 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-20 11:45:54,404 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-20 11:45:54,407 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-20 11:45:54,407 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 11:45:53" (1/3) ... [2020-07-20 11:45:54,408 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bcd7b98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 11:45:54, skipping insertion in model container [2020-07-20 11:45:54,408 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 11:45:53" (2/3) ... [2020-07-20 11:45:54,409 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bcd7b98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 11:45:54, skipping insertion in model container [2020-07-20 11:45:54,409 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 11:45:54" (3/3) ... [2020-07-20 11:45:54,411 INFO L109 eAbstractionObserver]: Analyzing ICFG eqn2f.c [2020-07-20 11:45:54,424 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBPonlyIfFpWasNotPerfect Determinization: PREDICATE_ABSTRACTION [2020-07-20 11:45:54,430 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-20 11:45:54,440 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-20 11:45:54,465 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-20 11:45:54,465 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-20 11:45:54,466 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBPonlyIfFpWasNotPerfect [2020-07-20 11:45:54,466 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-20 11:45:54,466 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-20 11:45:54,466 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-20 11:45:54,466 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-20 11:45:54,466 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-20 11:45:54,486 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2020-07-20 11:45:54,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-20 11:45:54,492 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 11:45:54,493 INFO L422 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] [2020-07-20 11:45:54,493 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 11:45:54,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 11:45:54,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1314760119, now seen corresponding path program 1 times [2020-07-20 11:45:54,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 11:45:54,506 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1296836045] [2020-07-20 11:45:54,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 11:45:54,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 11:45:54,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 1 conjunts are in the unsatisfiable core [2020-07-20 11:45:54,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 11:45:54,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 11:45:54,626 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 11:45:54,627 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1296836045] [2020-07-20 11:45:54,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 11:45:54,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-20 11:45:54,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567675358] [2020-07-20 11:45:54,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-20 11:45:54,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 11:45:54,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-20 11:45:54,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-20 11:45:54,650 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 2 states. [2020-07-20 11:45:54,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 11:45:54,672 INFO L93 Difference]: Finished difference Result 58 states and 73 transitions. [2020-07-20 11:45:54,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-20 11:45:54,673 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 22 [2020-07-20 11:45:54,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 11:45:54,681 INFO L225 Difference]: With dead ends: 58 [2020-07-20 11:45:54,681 INFO L226 Difference]: Without dead ends: 29 [2020-07-20 11:45:54,685 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-20 11:45:54,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-07-20 11:45:54,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-07-20 11:45:54,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-20 11:45:54,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2020-07-20 11:45:54,725 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 22 [2020-07-20 11:45:54,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 11:45:54,726 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2020-07-20 11:45:54,726 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-20 11:45:54,726 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2020-07-20 11:45:54,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-20 11:45:54,727 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 11:45:54,728 INFO L422 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] [2020-07-20 11:45:54,942 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 11:45:54,942 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 11:45:54,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 11:45:54,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1901566133, now seen corresponding path program 1 times [2020-07-20 11:45:54,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 11:45:54,945 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1420342074] [2020-07-20 11:45:54,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 11:45:55,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 11:45:55,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-20 11:45:55,022 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 11:45:55,109 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 11:45:55,110 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 39 [2020-07-20 11:45:55,111 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 11:45:55,142 INFO L624 ElimStorePlain]: treesize reduction 16, result has 59.0 percent of original size [2020-07-20 11:45:55,145 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-20 11:45:55,146 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:7 [2020-07-20 11:45:55,186 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 11:45:55,186 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2020-07-20 11:45:55,188 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-20 11:45:55,200 INFO L624 ElimStorePlain]: treesize reduction 9, result has 43.8 percent of original size [2020-07-20 11:45:55,201 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-20 11:45:55,201 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:7 [2020-07-20 11:45:55,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 11:45:55,235 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 11:45:55,235 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1420342074] [2020-07-20 11:45:55,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 11:45:55,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-20 11:45:55,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794255099] [2020-07-20 11:45:55,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-20 11:45:55,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 11:45:55,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-20 11:45:55,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-20 11:45:55,239 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 7 states. [2020-07-20 11:45:55,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 11:45:55,359 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2020-07-20 11:45:55,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-20 11:45:55,360 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2020-07-20 11:45:55,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 11:45:55,363 INFO L225 Difference]: With dead ends: 47 [2020-07-20 11:45:55,363 INFO L226 Difference]: Without dead ends: 45 [2020-07-20 11:45:55,365 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-07-20 11:45:55,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-07-20 11:45:55,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2020-07-20 11:45:55,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-20 11:45:55,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2020-07-20 11:45:55,380 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 22 [2020-07-20 11:45:55,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 11:45:55,381 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2020-07-20 11:45:55,381 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-20 11:45:55,381 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2020-07-20 11:45:55,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-20 11:45:55,382 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 11:45:55,382 INFO L422 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] [2020-07-20 11:45:55,596 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 11:45:55,597 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 11:45:55,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 11:45:55,598 INFO L82 PathProgramCache]: Analyzing trace with hash -2104565367, now seen corresponding path program 1 times [2020-07-20 11:45:55,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 11:45:55,600 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [432561673] [2020-07-20 11:45:55,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 11:45:55,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 11:45:55,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-20 11:45:55,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 11:45:55,720 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 11:45:55,720 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 11:45:55,721 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [432561673] [2020-07-20 11:45:55,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 11:45:55,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-20 11:45:55,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141387905] [2020-07-20 11:45:55,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-20 11:45:55,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 11:45:55,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-20 11:45:55,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-20 11:45:55,723 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 5 states. [2020-07-20 11:45:55,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 11:45:55,841 INFO L93 Difference]: Finished difference Result 71 states and 78 transitions. [2020-07-20 11:45:55,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-20 11:45:55,842 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2020-07-20 11:45:55,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 11:45:55,846 INFO L225 Difference]: With dead ends: 71 [2020-07-20 11:45:55,847 INFO L226 Difference]: Without dead ends: 58 [2020-07-20 11:45:55,847 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-07-20 11:45:55,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-07-20 11:45:55,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 39. [2020-07-20 11:45:55,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-20 11:45:55,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2020-07-20 11:45:55,871 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 24 [2020-07-20 11:45:55,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 11:45:55,877 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2020-07-20 11:45:55,878 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-20 11:45:55,878 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2020-07-20 11:45:55,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-20 11:45:55,879 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 11:45:55,879 INFO L422 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] [2020-07-20 11:45:56,093 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 11:45:56,094 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 11:45:56,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 11:45:56,094 INFO L82 PathProgramCache]: Analyzing trace with hash -2011180599, now seen corresponding path program 1 times [2020-07-20 11:45:56,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 11:45:56,096 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1049109546] [2020-07-20 11:45:56,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 11:45:56,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 11:45:56,136 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-20 11:45:56,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 11:45:56,166 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 11:45:56,167 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 11:45:56,211 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 11:45:56,211 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1049109546] [2020-07-20 11:45:56,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 11:45:56,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-07-20 11:45:56,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940473120] [2020-07-20 11:45:56,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-20 11:45:56,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 11:45:56,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-20 11:45:56,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-20 11:45:56,215 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 6 states. [2020-07-20 11:45:56,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 11:45:56,361 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2020-07-20 11:45:56,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-20 11:45:56,361 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2020-07-20 11:45:56,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 11:45:56,365 INFO L225 Difference]: With dead ends: 66 [2020-07-20 11:45:56,365 INFO L226 Difference]: Without dead ends: 55 [2020-07-20 11:45:56,366 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2020-07-20 11:45:56,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-07-20 11:45:56,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 40. [2020-07-20 11:45:56,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-20 11:45:56,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2020-07-20 11:45:56,380 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 24 [2020-07-20 11:45:56,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 11:45:56,381 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2020-07-20 11:45:56,382 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-20 11:45:56,382 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2020-07-20 11:45:56,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-20 11:45:56,383 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 11:45:56,383 INFO L422 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, 1, 1] [2020-07-20 11:45:56,583 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 11:45:56,584 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 11:45:56,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 11:45:56,585 INFO L82 PathProgramCache]: Analyzing trace with hash -69884793, now seen corresponding path program 1 times [2020-07-20 11:45:56,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 11:45:56,586 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1489897573] [2020-07-20 11:45:56,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 11:45:56,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 11:45:56,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 17 conjunts are in the unsatisfiable core [2020-07-20 11:45:56,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 11:45:56,666 INFO L384 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 10 treesize of output 8 [2020-07-20 11:45:56,668 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 11:45:56,673 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 11:45:56,684 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2020-07-20 11:45:56,685 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-20 11:45:56,692 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 11:45:56,693 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-20 11:45:56,693 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:19 [2020-07-20 11:45:56,755 INFO L350 Elim1Store]: treesize reduction 54, result has 46.0 percent of original size [2020-07-20 11:45:56,756 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 72 [2020-07-20 11:45:56,758 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 11:45:56,790 INFO L624 ElimStorePlain]: treesize reduction 24, result has 67.1 percent of original size [2020-07-20 11:45:56,792 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:45:56,795 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-20 11:45:56,796 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:49 [2020-07-20 11:45:56,797 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:45:56,818 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:45:56,839 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:45:56,865 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:45:56,920 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 1] term [2020-07-20 11:45:56,921 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:45:56,935 INFO L440 ElimStorePlain]: Different costs {12=[v_prenex_2], 20=[|v_#memory_int_16|]} [2020-07-20 11:45:56,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:45:56,946 INFO L350 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2020-07-20 11:45:56,946 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 43 [2020-07-20 11:45:56,948 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 11:45:56,986 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 11:45:56,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:45:57,014 INFO L350 Elim1Store]: treesize reduction 17, result has 60.5 percent of original size [2020-07-20 11:45:57,015 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 85 [2020-07-20 11:45:57,018 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-20 11:45:57,089 INFO L624 ElimStorePlain]: treesize reduction 69, result has 62.5 percent of original size [2020-07-20 11:45:57,094 INFO L544 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2020-07-20 11:45:57,094 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:115, output treesize:115 [2020-07-20 11:45:58,494 WARN L193 SmtUtils]: Spent 1.38 s on a formula simplification that was a NOOP. DAG size: 49 [2020-07-20 11:46:01,959 WARN L193 SmtUtils]: Spent 1.36 s on a formula simplification that was a NOOP. DAG size: 52 [2020-07-20 11:46:01,963 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:46:01,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:46:01,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:46:02,002 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-20 11:46:02,007 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-20 11:46:02,056 INFO L350 Elim1Store]: treesize reduction 17, result has 60.5 percent of original size [2020-07-20 11:46:02,057 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 47 [2020-07-20 11:46:02,061 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-20 11:46:02,062 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:46:02,064 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 11:46:02,092 INFO L350 Elim1Store]: treesize reduction 20, result has 57.4 percent of original size [2020-07-20 11:46:02,093 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 53 treesize of output 43 [2020-07-20 11:46:02,095 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2020-07-20 11:46:02,133 INFO L624 ElimStorePlain]: treesize reduction 24, result has 48.9 percent of original size [2020-07-20 11:46:02,135 INFO L544 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-20 11:46:02,135 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:143, output treesize:7 [2020-07-20 11:46:02,222 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 11:46:02,222 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 11:46:02,278 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 11:46:04,639 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 11:46:04,639 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1489897573] [2020-07-20 11:46:04,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 11:46:04,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 15 [2020-07-20 11:46:04,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172238109] [2020-07-20 11:46:04,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-20 11:46:04,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 11:46:04,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-20 11:46:04,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=168, Unknown=2, NotChecked=0, Total=210 [2020-07-20 11:46:04,642 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 15 states. [2020-07-20 11:46:11,918 WARN L193 SmtUtils]: Spent 4.30 s on a formula simplification. DAG size of input: 61 DAG size of output: 60 [2020-07-20 11:46:18,469 WARN L193 SmtUtils]: Spent 4.34 s on a formula simplification. DAG size of input: 72 DAG size of output: 71 [2020-07-20 11:46:20,509 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((main_~i~0 Int)) (= 1 (select (select (store |c_#memory_int| c_main_~a~0.base (let ((.cse0 (select |c_#memory_int| c_main_~a~0.base)) (.cse1 (* main_~i~0 8))) (store .cse0 (+ .cse1 c_main_~a~0.offset) (+ (select .cse0 (+ .cse1 c_main_~a~0.offset (- 8))) 4)))) c_main_~b~0.base) c_main_~b~0.offset))) (= 1 (select (let ((.cse2 (select |c_#memory_int| c_main_~b~0.base)) (.cse3 (* c_main_~i~0 8))) (store .cse2 (+ c_main_~b~0.offset .cse3) (+ (select .cse2 (+ c_main_~b~0.offset .cse3 (- 8))) (select (select |c_#memory_int| c_main_~a~0.base) (+ .cse3 c_main_~a~0.offset (- 8)))))) c_main_~b~0.offset))) is different from false [2020-07-20 11:46:27,259 WARN L193 SmtUtils]: Spent 4.40 s on a formula simplification. DAG size of input: 69 DAG size of output: 66 [2020-07-20 11:46:31,832 WARN L193 SmtUtils]: Spent 4.37 s on a formula simplification. DAG size of input: 71 DAG size of output: 68 [2020-07-20 11:46:35,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 11:46:35,626 INFO L93 Difference]: Finished difference Result 102 states and 118 transitions. [2020-07-20 11:46:35,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-07-20 11:46:35,634 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 26 [2020-07-20 11:46:35,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 11:46:35,636 INFO L225 Difference]: With dead ends: 102 [2020-07-20 11:46:35,636 INFO L226 Difference]: Without dead ends: 100 [2020-07-20 11:46:35,637 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 33 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 27.9s TimeCoverageRelationStatistics Valid=156, Invalid=657, Unknown=3, NotChecked=54, Total=870 [2020-07-20 11:46:35,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2020-07-20 11:46:35,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 54. [2020-07-20 11:46:35,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-07-20 11:46:35,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2020-07-20 11:46:35,653 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 62 transitions. Word has length 26 [2020-07-20 11:46:35,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 11:46:35,653 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 62 transitions. [2020-07-20 11:46:35,654 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-20 11:46:35,654 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2020-07-20 11:46:35,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-20 11:46:35,655 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 11:46:35,655 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 11:46:35,855 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 11:46:35,856 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 11:46:35,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 11:46:35,857 INFO L82 PathProgramCache]: Analyzing trace with hash 913238305, now seen corresponding path program 1 times [2020-07-20 11:46:35,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 11:46:35,858 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1964096277] [2020-07-20 11:46:35,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 11:46:35,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 11:46:35,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-20 11:46:35,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 11:46:35,924 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 11:46:35,924 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 11:46:35,925 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1964096277] [2020-07-20 11:46:35,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 11:46:35,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-20 11:46:35,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685593204] [2020-07-20 11:46:35,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-20 11:46:35,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 11:46:35,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-20 11:46:35,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-20 11:46:35,926 INFO L87 Difference]: Start difference. First operand 54 states and 62 transitions. Second operand 6 states. [2020-07-20 11:46:36,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 11:46:36,064 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2020-07-20 11:46:36,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-20 11:46:36,068 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2020-07-20 11:46:36,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 11:46:36,069 INFO L225 Difference]: With dead ends: 80 [2020-07-20 11:46:36,069 INFO L226 Difference]: Without dead ends: 58 [2020-07-20 11:46:36,070 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-07-20 11:46:36,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-07-20 11:46:36,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 52. [2020-07-20 11:46:36,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-07-20 11:46:36,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2020-07-20 11:46:36,087 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 30 [2020-07-20 11:46:36,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 11:46:36,087 INFO L479 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2020-07-20 11:46:36,087 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-20 11:46:36,088 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2020-07-20 11:46:36,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-20 11:46:36,091 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 11:46:36,091 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 11:46:36,306 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 11:46:36,307 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 11:46:36,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 11:46:36,307 INFO L82 PathProgramCache]: Analyzing trace with hash -2074868861, now seen corresponding path program 2 times [2020-07-20 11:46:36,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 11:46:36,308 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [323758018] [2020-07-20 11:46:36,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 11:46:36,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 11:46:36,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-20 11:46:36,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 11:46:36,377 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-20 11:46:36,377 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 11:46:36,415 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-20 11:46:36,416 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [323758018] [2020-07-20 11:46:36,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 11:46:36,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-07-20 11:46:36,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134455994] [2020-07-20 11:46:36,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-20 11:46:36,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 11:46:36,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-20 11:46:36,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-07-20 11:46:36,418 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand 9 states. [2020-07-20 11:46:36,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 11:46:36,689 INFO L93 Difference]: Finished difference Result 98 states and 110 transitions. [2020-07-20 11:46:36,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-20 11:46:36,691 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2020-07-20 11:46:36,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 11:46:36,692 INFO L225 Difference]: With dead ends: 98 [2020-07-20 11:46:36,692 INFO L226 Difference]: Without dead ends: 76 [2020-07-20 11:46:36,693 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2020-07-20 11:46:36,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-07-20 11:46:36,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 52. [2020-07-20 11:46:36,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-07-20 11:46:36,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2020-07-20 11:46:36,707 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 30 [2020-07-20 11:46:36,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 11:46:36,707 INFO L479 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2020-07-20 11:46:36,707 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-20 11:46:36,707 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2020-07-20 11:46:36,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-20 11:46:36,708 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 11:46:36,708 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 11:46:36,922 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 11:46:36,923 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 11:46:36,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 11:46:36,923 INFO L82 PathProgramCache]: Analyzing trace with hash 2071122883, now seen corresponding path program 3 times [2020-07-20 11:46:36,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 11:46:36,923 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [459926214] [2020-07-20 11:46:36,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 11:46:36,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 11:46:36,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 23 conjunts are in the unsatisfiable core [2020-07-20 11:46:36,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 11:46:36,987 INFO L384 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 10 treesize of output 8 [2020-07-20 11:46:36,988 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 11:46:37,005 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 11:46:37,015 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2020-07-20 11:46:37,016 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-20 11:46:37,035 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 11:46:37,036 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-20 11:46:37,036 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:19 [2020-07-20 11:46:37,148 INFO L350 Elim1Store]: treesize reduction 54, result has 46.0 percent of original size [2020-07-20 11:46:37,149 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 72 [2020-07-20 11:46:37,150 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 11:46:37,228 INFO L624 ElimStorePlain]: treesize reduction 24, result has 67.1 percent of original size [2020-07-20 11:46:37,230 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:46:37,231 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-20 11:46:37,231 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:49 [2020-07-20 11:46:37,232 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:46:37,290 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:46:37,334 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:46:37,335 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:46:37,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:46:37,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:46:37,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:46:37,498 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 11:46:37,499 INFO L384 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 4 case distinctions, treesize of input 49 treesize of output 143 [2020-07-20 11:46:37,500 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 1] term [2020-07-20 11:46:37,500 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-20 11:46:37,501 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-20 11:46:37,501 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 11:46:37,502 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-20 11:46:37,502 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:46:37,504 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 11:46:37,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:46:37,767 WARN L193 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2020-07-20 11:46:37,767 INFO L350 Elim1Store]: treesize reduction 17, result has 92.5 percent of original size [2020-07-20 11:46:37,768 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 63 treesize of output 252 [2020-07-20 11:46:37,769 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 1] term [2020-07-20 11:46:37,770 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-20 11:46:37,771 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 1] term [2020-07-20 11:46:37,771 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-20 11:46:37,772 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 1] term [2020-07-20 11:46:37,772 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-20 11:46:37,773 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-20 11:46:37,773 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 11:46:37,774 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-20 11:46:37,774 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:46:37,776 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-20 11:46:38,108 WARN L193 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 45 [2020-07-20 11:46:38,109 INFO L624 ElimStorePlain]: treesize reduction 803, result has 14.5 percent of original size [2020-07-20 11:46:38,111 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:46:38,112 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2020-07-20 11:46:38,112 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:121, output treesize:101 [2020-07-20 11:46:38,113 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:46:38,262 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:46:38,363 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:46:38,535 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:46:38,865 WARN L193 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 41 [2020-07-20 11:46:38,866 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-20 11:46:38,891 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-20 11:46:38,891 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-20 11:46:38,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:46:38,897 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-20 11:46:38,917 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-20 11:46:38,951 INFO L350 Elim1Store]: treesize reduction 17, result has 67.9 percent of original size [2020-07-20 11:46:38,951 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 72 treesize of output 107 [2020-07-20 11:46:38,953 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 11:46:38,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:46:38,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:46:38,984 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-20 11:46:38,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:46:38,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:46:39,028 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-20 11:46:39,072 INFO L384 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 64 [2020-07-20 11:46:39,073 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-20 11:46:39,096 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-20 11:46:39,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:46:39,098 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-20 11:46:39,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:46:39,102 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 55 [2020-07-20 11:46:39,104 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-20 11:46:39,380 WARN L193 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2020-07-20 11:46:39,381 INFO L624 ElimStorePlain]: treesize reduction 71, result has 76.9 percent of original size [2020-07-20 11:46:39,383 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2020-07-20 11:46:39,383 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:212, output treesize:236 [2020-07-20 11:46:39,650 WARN L193 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2020-07-20 11:46:39,652 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 6, 1] term [2020-07-20 11:46:39,652 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-20 11:46:39,879 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2020-07-20 11:46:39,890 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-20 11:46:39,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:46:39,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:46:39,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:46:39,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:46:39,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:46:39,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:46:39,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:46:39,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:46:40,157 INFO L244 Elim1Store]: Index analysis took 227 ms [2020-07-20 11:46:40,170 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 11:46:40,171 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 100 [2020-07-20 11:46:40,173 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 11:46:40,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:46:40,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:46:40,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:46:40,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:46:40,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:46:40,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:46:40,386 INFO L244 Elim1Store]: Index analysis took 174 ms [2020-07-20 11:46:40,476 INFO L350 Elim1Store]: treesize reduction 17, result has 81.7 percent of original size [2020-07-20 11:46:40,477 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 7 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 87 treesize of output 175 [2020-07-20 11:46:40,479 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-20 11:46:40,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:46:40,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:46:40,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:46:40,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:46:40,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:46:40,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:46:40,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:46:40,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:46:40,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:46:40,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:46:40,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:46:40,551 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 11:46:40,552 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 12 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 109 [2020-07-20 11:46:40,553 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-20 11:46:40,888 WARN L193 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 57 [2020-07-20 11:46:40,888 INFO L624 ElimStorePlain]: treesize reduction 261, result has 49.3 percent of original size [2020-07-20 11:46:40,894 INFO L544 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 10 dim-0 vars, and 3 xjuncts. [2020-07-20 11:46:40,895 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:281, output treesize:254 [2020-07-20 11:47:03,562 WARN L193 SmtUtils]: Spent 16.31 s on a formula simplification that was a NOOP. DAG size: 101 [2020-07-20 11:47:22,132 WARN L193 SmtUtils]: Spent 16.36 s on a formula simplification that was a NOOP. DAG size: 104 [2020-07-20 11:47:22,135 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-20 11:47:22,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:47:22,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:47:22,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:47:22,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:47:22,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:47:22,221 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-20 11:47:22,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:47:22,233 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-20 11:47:22,411 WARN L193 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 35 [2020-07-20 11:47:22,411 INFO L350 Elim1Store]: treesize reduction 32, result has 64.8 percent of original size [2020-07-20 11:47:22,412 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 6 disjoint index pairs (out of 36 index pairs), introduced 8 new quantified variables, introduced 7 case distinctions, treesize of input 82 treesize of output 80 [2020-07-20 11:47:22,414 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-20 11:47:22,414 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:47:22,420 INFO L544 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-20 11:47:22,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:47:22,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:47:22,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:47:22,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:47:22,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:47:22,462 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-20 11:47:22,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:47:22,475 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-20 11:47:22,671 WARN L193 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2020-07-20 11:47:22,672 INFO L350 Elim1Store]: treesize reduction 17, result has 84.0 percent of original size [2020-07-20 11:47:22,672 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 6 disjoint index pairs (out of 36 index pairs), introduced 8 new quantified variables, introduced 7 case distinctions, treesize of input 96 treesize of output 113 [2020-07-20 11:47:22,674 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-20 11:47:22,674 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 11:47:22,675 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-20 11:47:22,675 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:47:22,676 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 11:47:22,676 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-20 11:47:22,677 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-20 11:47:22,677 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 11:47:22,677 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-20 11:47:22,678 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:47:22,678 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-20 11:47:22,679 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 11:47:22,679 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:47:22,681 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 3, 1] term [2020-07-20 11:47:22,681 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 11:47:22,682 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 1] term [2020-07-20 11:47:22,682 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:47:22,684 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-20 11:47:22,684 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 11:47:22,685 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-20 11:47:22,685 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:47:22,686 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 11:47:22,686 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-20 11:47:22,687 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-20 11:47:22,687 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 11:47:22,688 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-20 11:47:22,688 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:47:22,689 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-20 11:47:22,690 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 11:47:22,690 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:47:22,693 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 3, 1] term [2020-07-20 11:47:22,694 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 11:47:22,694 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 1] term [2020-07-20 11:47:22,694 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:47:22,695 INFO L544 ElimStorePlain]: Start of recursive call 3: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-07-20 11:47:22,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:47:22,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:47:22,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:47:22,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:47:22,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:47:22,749 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-20 11:47:22,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:47:22,850 INFO L350 Elim1Store]: treesize reduction 10, result has 81.5 percent of original size [2020-07-20 11:47:22,850 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 87 treesize of output 66 [2020-07-20 11:47:22,851 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-20 11:47:22,852 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:47:22,856 INFO L544 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-20 11:47:23,549 WARN L193 SmtUtils]: Spent 692.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 67 [2020-07-20 11:47:23,550 INFO L624 ElimStorePlain]: treesize reduction 70, result has 65.0 percent of original size [2020-07-20 11:47:23,563 INFO L544 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-20 11:47:23,564 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 13 variables, input treesize:296, output treesize:7 [2020-07-20 11:47:23,779 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 11:47:23,779 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 11:47:23,980 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 11:47:28,535 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_42 Int)) (or (< v_main_~i~0_42 (+ c_main_~i~0 1)) (= 1 (select (let ((.cse0 (select |c_#memory_int| c_main_~b~0.base)) (.cse1 (* v_main_~i~0_42 8))) (store .cse0 (+ c_main_~b~0.offset .cse1) (+ (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset .cse1 (- 8))) (select .cse0 (+ c_main_~b~0.offset .cse1 (- 8)))))) c_main_~b~0.offset)))) is different from false [2020-07-20 11:47:30,554 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_42 Int)) (or (< v_main_~i~0_42 (+ c_main_~i~0 1)) (= 1 (select (let ((.cse0 (let ((.cse2 (select |c_#memory_int| c_main_~b~0.base)) (.cse3 (* c_main_~i~0 8))) (store .cse2 (+ c_main_~b~0.offset .cse3) (+ (select .cse2 (+ c_main_~b~0.offset .cse3 (- 8))) (select (select |c_#memory_int| c_main_~a~0.base) (+ .cse3 c_main_~a~0.offset (- 8))))))) (.cse1 (* v_main_~i~0_42 8))) (store .cse0 (+ c_main_~b~0.offset .cse1) (+ (select .cse0 (+ c_main_~b~0.offset .cse1 (- 8))) (select (select (store |c_#memory_int| c_main_~b~0.base .cse0) c_main_~a~0.base) (+ c_main_~a~0.offset .cse1 (- 8)))))) c_main_~b~0.offset)))) is different from false [2020-07-20 11:47:32,579 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_42 Int)) (or (< v_main_~i~0_42 2) (= 1 (select (let ((.cse0 (let ((.cse2 (select |c_#memory_int| c_main_~b~0.base))) (store .cse2 (+ c_main_~b~0.offset 8) (+ (select (select |c_#memory_int| c_main_~a~0.base) c_main_~a~0.offset) (select .cse2 c_main_~b~0.offset))))) (.cse1 (* v_main_~i~0_42 8))) (store .cse0 (+ c_main_~b~0.offset .cse1) (+ (select .cse0 (+ c_main_~b~0.offset .cse1 (- 8))) (select (select (store |c_#memory_int| c_main_~b~0.base .cse0) c_main_~a~0.base) (+ c_main_~a~0.offset .cse1 (- 8)))))) c_main_~b~0.offset)))) is different from false [2020-07-20 11:47:34,619 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~i~0 Int) (v_main_~i~0_42 Int)) (or (< v_main_~i~0_42 2) (= 1 (select (let ((.cse4 (let ((.cse5 (select |c_#memory_int| c_main_~a~0.base)) (.cse6 (* main_~i~0 8))) (store .cse5 (+ .cse6 c_main_~a~0.offset) (+ (select .cse5 (+ .cse6 c_main_~a~0.offset (- 8))) 4))))) (let ((.cse2 (store |c_#memory_int| c_main_~a~0.base .cse4))) (let ((.cse0 (let ((.cse3 (select .cse2 c_main_~b~0.base))) (store .cse3 (+ c_main_~b~0.offset 8) (+ (select .cse3 c_main_~b~0.offset) (select .cse4 c_main_~a~0.offset))))) (.cse1 (* v_main_~i~0_42 8))) (store .cse0 (+ c_main_~b~0.offset .cse1) (+ (select (select (store .cse2 c_main_~b~0.base .cse0) c_main_~a~0.base) (+ c_main_~a~0.offset .cse1 (- 8))) (select .cse0 (+ c_main_~b~0.offset .cse1 (- 8)))))))) c_main_~b~0.offset)))) is different from false [2020-07-20 11:47:36,701 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~i~0 Int) (v_subst_2 Int) (v_main_~i~0_42 Int)) (or (= (select (let ((.cse4 (let ((.cse5 (let ((.cse7 (select |c_#memory_int| c_main_~a~0.base)) (.cse8 (* main_~i~0 8))) (store .cse7 (+ .cse8 c_main_~a~0.offset) (+ (select .cse7 (+ .cse8 c_main_~a~0.offset (- 8))) 4)))) (.cse6 (* v_subst_2 8))) (store .cse5 (+ .cse6 c_main_~a~0.offset) (+ (select .cse5 (+ .cse6 c_main_~a~0.offset (- 8))) 4))))) (let ((.cse2 (store |c_#memory_int| c_main_~a~0.base .cse4))) (let ((.cse0 (let ((.cse3 (select .cse2 c_main_~b~0.base))) (store .cse3 (+ c_main_~b~0.offset 8) (+ (select .cse3 c_main_~b~0.offset) (select .cse4 c_main_~a~0.offset))))) (.cse1 (* v_main_~i~0_42 8))) (store .cse0 (+ c_main_~b~0.offset .cse1) (+ (select .cse0 (+ c_main_~b~0.offset .cse1 (- 8))) (select (select (store .cse2 c_main_~b~0.base .cse0) c_main_~a~0.base) (+ c_main_~a~0.offset .cse1 (- 8)))))))) c_main_~b~0.offset) 1) (< v_main_~i~0_42 2))) is different from false [2020-07-20 11:47:36,780 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2020-07-20 11:47:36,780 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [459926214] [2020-07-20 11:47:36,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 11:47:36,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 22 [2020-07-20 11:47:36,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424469728] [2020-07-20 11:47:36,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-07-20 11:47:36,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 11:47:36,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-07-20 11:47:36,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=223, Unknown=10, NotChecked=170, Total=462 [2020-07-20 11:47:36,783 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand 22 states. [2020-07-20 11:47:40,952 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_main_~b~0.base)) (.cse1 (select |c_#memory_int| c_main_~a~0.base))) (and (= (select .cse0 c_main_~b~0.offset) 1) (= 8 (select .cse1 c_main_~a~0.offset)) (not (= c_main_~a~0.base c_main_~b~0.base)) (forall ((main_~i~0 Int) (v_subst_2 Int) (v_main_~i~0_42 Int)) (or (= (select (let ((.cse6 (let ((.cse7 (let ((.cse9 (select |c_#memory_int| c_main_~a~0.base)) (.cse10 (* main_~i~0 8))) (store .cse9 (+ .cse10 c_main_~a~0.offset) (+ (select .cse9 (+ .cse10 c_main_~a~0.offset (- 8))) 4)))) (.cse8 (* v_subst_2 8))) (store .cse7 (+ .cse8 c_main_~a~0.offset) (+ (select .cse7 (+ .cse8 c_main_~a~0.offset (- 8))) 4))))) (let ((.cse4 (store |c_#memory_int| c_main_~a~0.base .cse6))) (let ((.cse2 (let ((.cse5 (select .cse4 c_main_~b~0.base))) (store .cse5 (+ c_main_~b~0.offset 8) (+ (select .cse5 c_main_~b~0.offset) (select .cse6 c_main_~a~0.offset))))) (.cse3 (* v_main_~i~0_42 8))) (store .cse2 (+ c_main_~b~0.offset .cse3) (+ (select .cse2 (+ c_main_~b~0.offset .cse3 (- 8))) (select (select (store .cse4 c_main_~b~0.base .cse2) c_main_~a~0.base) (+ c_main_~a~0.offset .cse3 (- 8)))))))) c_main_~b~0.offset) 1) (< v_main_~i~0_42 2))) (= 1 (select (let ((.cse11 (* c_main_~i~0 8))) (store .cse0 (+ c_main_~b~0.offset .cse11) (+ (select .cse0 (+ c_main_~b~0.offset .cse11 (- 8))) (select .cse1 (+ .cse11 c_main_~a~0.offset (- 8)))))) c_main_~b~0.offset)))) is different from false [2020-07-20 11:47:43,038 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_main_~b~0.base) c_main_~b~0.offset) 1) (exists ((main_~i~0 Int)) (let ((.cse0 (select |c_#memory_int| c_main_~a~0.base))) (and (or (= 0 (* 8 main_~i~0)) (= 8 (select .cse0 c_main_~a~0.offset))) (let ((.cse1 (* main_~i~0 8))) (= (+ (select .cse0 (+ .cse1 c_main_~a~0.offset (- 8))) 4) (select .cse0 (+ .cse1 c_main_~a~0.offset))))))) (forall ((main_~i~0 Int) (v_main_~i~0_42 Int)) (or (< v_main_~i~0_42 2) (= 1 (select (let ((.cse6 (let ((.cse7 (select |c_#memory_int| c_main_~a~0.base)) (.cse8 (* main_~i~0 8))) (store .cse7 (+ .cse8 c_main_~a~0.offset) (+ (select .cse7 (+ .cse8 c_main_~a~0.offset (- 8))) 4))))) (let ((.cse4 (store |c_#memory_int| c_main_~a~0.base .cse6))) (let ((.cse2 (let ((.cse5 (select .cse4 c_main_~b~0.base))) (store .cse5 (+ c_main_~b~0.offset 8) (+ (select .cse5 c_main_~b~0.offset) (select .cse6 c_main_~a~0.offset))))) (.cse3 (* v_main_~i~0_42 8))) (store .cse2 (+ c_main_~b~0.offset .cse3) (+ (select (select (store .cse4 c_main_~b~0.base .cse2) c_main_~a~0.base) (+ c_main_~a~0.offset .cse3 (- 8))) (select .cse2 (+ c_main_~b~0.offset .cse3 (- 8)))))))) c_main_~b~0.offset)))) (not (= c_main_~a~0.base c_main_~b~0.base))) is different from false [2020-07-20 11:47:45,074 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_main_~i~0_42 Int)) (or (< v_main_~i~0_42 2) (= 1 (select (let ((.cse0 (let ((.cse2 (select |c_#memory_int| c_main_~b~0.base))) (store .cse2 (+ c_main_~b~0.offset 8) (+ (select (select |c_#memory_int| c_main_~a~0.base) c_main_~a~0.offset) (select .cse2 c_main_~b~0.offset))))) (.cse1 (* v_main_~i~0_42 8))) (store .cse0 (+ c_main_~b~0.offset .cse1) (+ (select .cse0 (+ c_main_~b~0.offset .cse1 (- 8))) (select (select (store |c_#memory_int| c_main_~b~0.base .cse0) c_main_~a~0.base) (+ c_main_~a~0.offset .cse1 (- 8)))))) c_main_~b~0.offset)))) (let ((.cse3 (= (select (select |c_#memory_int| c_main_~b~0.base) c_main_~b~0.offset) 1)) (.cse4 (not (= c_main_~a~0.base c_main_~b~0.base)))) (or (and .cse3 .cse4 (exists ((v_prenex_6 Int)) (let ((.cse5 (select |c_#memory_int| c_main_~a~0.base))) (and (or (= 0 (+ (* 8 v_prenex_6) 8)) (= (+ (select .cse5 (+ c_main_~a~0.offset (- 8))) 4) (select .cse5 c_main_~a~0.offset))) (let ((.cse6 (* v_prenex_6 8))) (= (+ (select .cse5 (+ .cse6 c_main_~a~0.offset (- 8))) 4) (select .cse5 (+ .cse6 c_main_~a~0.offset)))))))) (and .cse3 (= 8 (select (select |c_#memory_int| c_main_~a~0.base) c_main_~a~0.offset)) .cse4 (exists ((main_~i~0 Int)) (let ((.cse7 (select |c_#memory_int| c_main_~a~0.base)) (.cse8 (* main_~i~0 8))) (= (+ (select .cse7 (+ .cse8 c_main_~a~0.offset (- 8))) 4) (select .cse7 (+ .cse8 c_main_~a~0.offset))))))))) is different from false [2020-07-20 11:47:47,251 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_main_~i~0_42 Int)) (or (< v_main_~i~0_42 (+ c_main_~i~0 1)) (= 1 (select (let ((.cse0 (let ((.cse2 (select |c_#memory_int| c_main_~b~0.base)) (.cse3 (* c_main_~i~0 8))) (store .cse2 (+ c_main_~b~0.offset .cse3) (+ (select .cse2 (+ c_main_~b~0.offset .cse3 (- 8))) (select (select |c_#memory_int| c_main_~a~0.base) (+ .cse3 c_main_~a~0.offset (- 8))))))) (.cse1 (* v_main_~i~0_42 8))) (store .cse0 (+ c_main_~b~0.offset .cse1) (+ (select .cse0 (+ c_main_~b~0.offset .cse1 (- 8))) (select (select (store |c_#memory_int| c_main_~b~0.base .cse0) c_main_~a~0.base) (+ c_main_~a~0.offset .cse1 (- 8)))))) c_main_~b~0.offset)))) (let ((.cse9 (select |c_#memory_int| c_main_~a~0.base))) (let ((.cse4 (select .cse9 (+ c_main_~a~0.offset (- 8)))) (.cse6 (= (select (select |c_#memory_int| c_main_~b~0.base) c_main_~b~0.offset) 1)) (.cse7 (= 1 c_main_~i~0)) (.cse5 (select .cse9 c_main_~a~0.offset)) (.cse8 (not (= c_main_~a~0.base c_main_~b~0.base)))) (or (and (= (+ .cse4 4) .cse5) .cse6 .cse7 .cse8) (and .cse6 .cse7 .cse8 (= .cse4 (+ (select .cse9 (+ c_main_~a~0.offset (- 16))) 4))) (and .cse6 (exists ((v_prenex_7 Int)) (let ((.cse10 (select |c_#memory_int| c_main_~a~0.base)) (.cse11 (* v_prenex_7 8))) (= (+ (select .cse10 (+ .cse11 c_main_~a~0.offset (- 8))) 4) (select .cse10 (+ .cse11 c_main_~a~0.offset))))) .cse7 (= 8 .cse5) .cse8))))) is different from false [2020-07-20 11:47:49,329 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_main_~i~0_42 Int)) (or (< v_main_~i~0_42 (+ c_main_~i~0 1)) (= 1 (select (let ((.cse0 (select |c_#memory_int| c_main_~b~0.base)) (.cse1 (* v_main_~i~0_42 8))) (store .cse0 (+ c_main_~b~0.offset .cse1) (+ (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset .cse1 (- 8))) (select .cse0 (+ c_main_~b~0.offset .cse1 (- 8)))))) c_main_~b~0.offset)))) (let ((.cse8 (select |c_#memory_int| c_main_~a~0.base)) (.cse14 (select |c_#memory_int| c_main_~b~0.base)) (.cse13 (* c_main_~i~0 8))) (let ((.cse12 (select .cse14 (+ c_main_~b~0.offset .cse13))) (.cse11 (select .cse14 (+ c_main_~b~0.offset .cse13 (- 8)))) (.cse5 (select .cse8 (+ .cse13 c_main_~a~0.offset (- 8))))) (let ((.cse3 (= .cse12 (+ .cse11 .cse5))) (.cse4 (select .cse8 (+ c_main_~a~0.offset (- 8)))) (.cse2 (= .cse12 (+ .cse5 1))) (.cse6 (= 1 c_main_~i~0)) (.cse7 (not (= c_main_~a~0.base c_main_~b~0.base)))) (or (and .cse2 .cse3 (= (+ .cse4 4) .cse5) .cse6 .cse7) (and .cse2 .cse3 .cse6 .cse7 (= .cse4 (+ (select .cse8 (+ c_main_~a~0.offset (- 16))) 4))) (and .cse2 (= 8 .cse5) (exists ((v_prenex_7 Int)) (let ((.cse9 (select |c_#memory_int| c_main_~a~0.base)) (.cse10 (* v_prenex_7 8))) (= (+ (select .cse9 (+ .cse10 c_main_~a~0.offset (- 8))) 4) (select .cse9 (+ .cse10 c_main_~a~0.offset))))) .cse6 (= 1 .cse11) .cse7)))))) is different from false [2020-07-20 11:48:03,562 WARN L193 SmtUtils]: Spent 13.47 s on a formula simplification. DAG size of input: 122 DAG size of output: 122 [2020-07-20 11:48:06,478 WARN L193 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-07-20 11:48:13,110 WARN L193 SmtUtils]: Spent 238.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2020-07-20 11:48:55,028 WARN L193 SmtUtils]: Spent 41.14 s on a formula simplification. DAG size of input: 144 DAG size of output: 125 [2020-07-20 11:49:25,183 WARN L193 SmtUtils]: Spent 27.81 s on a formula simplification. DAG size of input: 146 DAG size of output: 127 [2020-07-20 11:50:03,974 WARN L193 SmtUtils]: Spent 23.15 s on a formula simplification. DAG size of input: 134 DAG size of output: 127 [2020-07-20 11:50:19,661 WARN L193 SmtUtils]: Spent 244.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2020-07-20 11:50:21,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 11:50:21,851 INFO L93 Difference]: Finished difference Result 90 states and 101 transitions. [2020-07-20 11:50:21,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-07-20 11:50:21,858 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 30 [2020-07-20 11:50:21,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 11:50:21,859 INFO L225 Difference]: With dead ends: 90 [2020-07-20 11:50:21,859 INFO L226 Difference]: Without dead ends: 88 [2020-07-20 11:50:21,860 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 35 SyntacticMatches, 5 SemanticMatches, 33 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 192.3s TimeCoverageRelationStatistics Valid=129, Invalid=487, Unknown=24, NotChecked=550, Total=1190 [2020-07-20 11:50:21,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2020-07-20 11:50:21,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 56. [2020-07-20 11:50:21,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-07-20 11:50:21,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2020-07-20 11:50:21,873 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 30 [2020-07-20 11:50:21,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 11:50:21,873 INFO L479 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2020-07-20 11:50:21,874 INFO L480 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-07-20 11:50:21,874 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2020-07-20 11:50:21,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-07-20 11:50:21,875 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 11:50:21,875 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 11:50:22,075 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 11:50:22,076 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 11:50:22,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 11:50:22,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1569644609, now seen corresponding path program 4 times [2020-07-20 11:50:22,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 11:50:22,076 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1614536049] [2020-07-20 11:50:22,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 11:50:22,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 11:50:22,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-20 11:50:22,113 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 11:50:22,198 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 11:50:22,198 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 11:50:22,276 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 11:50:22,276 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1614536049] [2020-07-20 11:50:22,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 11:50:22,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2020-07-20 11:50:22,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866498012] [2020-07-20 11:50:22,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-20 11:50:22,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 11:50:22,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-20 11:50:22,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2020-07-20 11:50:22,277 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand 12 states. [2020-07-20 11:50:23,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 11:50:23,260 INFO L93 Difference]: Finished difference Result 113 states and 127 transitions. [2020-07-20 11:50:23,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-20 11:50:23,264 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2020-07-20 11:50:23,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 11:50:23,265 INFO L225 Difference]: With dead ends: 113 [2020-07-20 11:50:23,266 INFO L226 Difference]: Without dead ends: 95 [2020-07-20 11:50:23,269 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 49 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2020-07-20 11:50:23,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2020-07-20 11:50:23,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 54. [2020-07-20 11:50:23,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-07-20 11:50:23,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2020-07-20 11:50:23,294 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 32 [2020-07-20 11:50:23,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 11:50:23,298 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2020-07-20 11:50:23,299 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-20 11:50:23,299 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2020-07-20 11:50:23,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-07-20 11:50:23,300 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 11:50:23,304 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 11:50:23,519 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 11:50:23,520 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 11:50:23,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 11:50:23,520 INFO L82 PathProgramCache]: Analyzing trace with hash 890841693, now seen corresponding path program 1 times [2020-07-20 11:50:23,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 11:50:23,521 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1964071528] [2020-07-20 11:50:23,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 11:50:23,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-20 11:50:23,574 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-20 11:50:23,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-20 11:50:23,594 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-20 11:50:23,637 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-20 11:50:23,640 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-20 11:50:23,841 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 11:50:23,886 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.07 11:50:23 BoogieIcfgContainer [2020-07-20 11:50:23,886 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-20 11:50:23,887 INFO L168 Benchmark]: Toolchain (without parser) took 270241.08 ms. Allocated memory was 142.6 MB in the beginning and 273.7 MB in the end (delta: 131.1 MB). Free memory was 101.1 MB in the beginning and 104.0 MB in the end (delta: -2.9 MB). Peak memory consumption was 128.1 MB. Max. memory is 7.1 GB. [2020-07-20 11:50:23,888 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 142.6 MB. Free memory was 119.1 MB in the beginning and 118.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-20 11:50:23,889 INFO L168 Benchmark]: CACSL2BoogieTranslator took 240.88 ms. Allocated memory is still 142.6 MB. Free memory was 100.6 MB in the beginning and 90.3 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. [2020-07-20 11:50:23,889 INFO L168 Benchmark]: Boogie Preprocessor took 130.15 ms. Allocated memory was 142.6 MB in the beginning and 201.9 MB in the end (delta: 59.2 MB). Free memory was 90.3 MB in the beginning and 179.9 MB in the end (delta: -89.6 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. [2020-07-20 11:50:23,890 INFO L168 Benchmark]: RCFGBuilder took 381.70 ms. Allocated memory is still 201.9 MB. Free memory was 179.9 MB in the beginning and 162.8 MB in the end (delta: 17.1 MB). Peak memory consumption was 17.1 MB. Max. memory is 7.1 GB. [2020-07-20 11:50:23,890 INFO L168 Benchmark]: TraceAbstraction took 269482.12 ms. Allocated memory was 201.9 MB in the beginning and 273.7 MB in the end (delta: 71.8 MB). Free memory was 162.8 MB in the beginning and 104.0 MB in the end (delta: 58.8 MB). Peak memory consumption was 130.6 MB. Max. memory is 7.1 GB. [2020-07-20 11:50:23,893 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29 ms. Allocated memory is still 142.6 MB. Free memory was 119.1 MB in the beginning and 118.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 240.88 ms. Allocated memory is still 142.6 MB. Free memory was 100.6 MB in the beginning and 90.3 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 130.15 ms. Allocated memory was 142.6 MB in the beginning and 201.9 MB in the end (delta: 59.2 MB). Free memory was 90.3 MB in the beginning and 179.9 MB in the end (delta: -89.6 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 381.70 ms. Allocated memory is still 201.9 MB. Free memory was 179.9 MB in the beginning and 162.8 MB in the end (delta: 17.1 MB). Peak memory consumption was 17.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 269482.12 ms. Allocated memory was 201.9 MB in the beginning and 273.7 MB in the end (delta: 71.8 MB). Free memory was 162.8 MB in the beginning and 104.0 MB in the end (delta: 58.8 MB). Peak memory consumption was 130.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 13]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L17] int N; VAL [\old(N)=3, N=0] [L21] N = __VERIFIER_nondet_int() [L22] COND FALSE !(N <= 0) VAL [\old(N)=0, N=2] [L23] CALL assume_abort_if_not(N <= 2147483647/sizeof(int)) VAL [\old(cond)=1, \old(N)=0, N=2] [L11] COND FALSE !(!cond) VAL [\old(cond)=1, \old(N)=0, cond=1, N=2] [L23] RET assume_abort_if_not(N <= 2147483647/sizeof(int)) VAL [\old(N)=0, N=2] [L25] int i; [L26] long long *a = malloc(sizeof(long long)*N); [L27] long long *b = malloc(sizeof(long long)*N); [L29] a[0] = 8 [L30] b[0] = 1 [L32] i=1 VAL [\old(N)=0, a={-1:0}, b={-2:0}, i=1, malloc(sizeof(long long)*N)={-2:0}, malloc(sizeof(long long)*N)={-1:0}, N=2] [L32] COND TRUE i