/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 SMT_FEATURE_HEURISTIC --traceabstraction.assert.codeblocks.term.scoring.heuristic NUM_VARIABLES --traceabstraction.assert.codeblocks.term.scoring.heuristic.partitioning.strategy FIXED_NUM_PARTITIONS --traceabstraction.assert.codeblocks.term.scoring.heuristic.number.of.partitions 4 -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-fpi/eqn5f.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-d623d84 [2020-07-20 17:36:54,615 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-20 17:36:54,617 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-20 17:36:54,632 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-20 17:36:54,633 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-20 17:36:54,634 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-20 17:36:54,636 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-20 17:36:54,638 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-20 17:36:54,640 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-20 17:36:54,642 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-20 17:36:54,643 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-20 17:36:54,645 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-20 17:36:54,645 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-20 17:36:54,646 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-20 17:36:54,648 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-20 17:36:54,650 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-20 17:36:54,651 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-20 17:36:54,653 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-20 17:36:54,655 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-20 17:36:54,658 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-20 17:36:54,665 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-20 17:36:54,666 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-20 17:36:54,670 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-20 17:36:54,671 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-20 17:36:54,680 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-20 17:36:54,681 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-20 17:36:54,681 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-20 17:36:54,685 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-20 17:36:54,685 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-20 17:36:54,686 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-20 17:36:54,686 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-20 17:36:54,691 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-20 17:36:54,693 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-20 17:36:54,697 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-20 17:36:54,700 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-20 17:36:54,701 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-20 17:36:54,703 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-20 17:36:54,703 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-20 17:36:54,703 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-20 17:36:54,704 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-20 17:36:54,707 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-20 17:36:54,708 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 17:36:54,743 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-20 17:36:54,744 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-20 17:36:54,746 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-20 17:36:54,747 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-20 17:36:54,747 INFO L138 SettingsManager]: * Use SBE=true [2020-07-20 17:36:54,747 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-20 17:36:54,747 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-20 17:36:54,748 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-20 17:36:54,748 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-20 17:36:54,748 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-20 17:36:54,749 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-20 17:36:54,750 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-20 17:36:54,750 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-20 17:36:54,750 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-20 17:36:54,751 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-20 17:36:54,751 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-20 17:36:54,751 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-20 17:36:54,751 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-20 17:36:54,752 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-20 17:36:54,752 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-20 17:36:54,752 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-20 17:36:54,752 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-20 17:36:54,753 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-20 17:36:54,753 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-20 17:36:54,753 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-20 17:36:54,753 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-20 17:36:54,753 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 17:36:54,754 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-20 17:36:54,754 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-20 17:36:54,754 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 -> SMT_FEATURE_HEURISTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic -> NUM_VARIABLES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic Partitioning Strategy -> FIXED_NUM_PARTITIONS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic number of partitions -> 4 [2020-07-20 17:36:55,117 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-20 17:36:55,134 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-20 17:36:55,138 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-20 17:36:55,141 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-20 17:36:55,142 INFO L275 PluginConnector]: CDTParser initialized [2020-07-20 17:36:55,143 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/eqn5f.c [2020-07-20 17:36:55,222 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41609674d/860720aa8bbc488293fb8e1e4805053b/FLAG42c4bfe26 [2020-07-20 17:36:55,819 INFO L306 CDTParser]: Found 1 translation units. [2020-07-20 17:36:55,820 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/eqn5f.c [2020-07-20 17:36:55,832 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41609674d/860720aa8bbc488293fb8e1e4805053b/FLAG42c4bfe26 [2020-07-20 17:36:56,089 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41609674d/860720aa8bbc488293fb8e1e4805053b [2020-07-20 17:36:56,105 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-20 17:36:56,109 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-20 17:36:56,110 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-20 17:36:56,110 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-20 17:36:56,115 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-20 17:36:56,116 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 05:36:56" (1/1) ... [2020-07-20 17:36:56,120 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@506a7cf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:36:56, skipping insertion in model container [2020-07-20 17:36:56,121 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 05:36:56" (1/1) ... [2020-07-20 17:36:56,129 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-20 17:36:56,148 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-20 17:36:56,368 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 17:36:56,381 INFO L203 MainTranslator]: Completed pre-run [2020-07-20 17:36:56,405 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 17:36:56,424 INFO L208 MainTranslator]: Completed translation [2020-07-20 17:36:56,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:36:56 WrapperNode [2020-07-20 17:36:56,425 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-20 17:36:56,426 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-20 17:36:56,426 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-20 17:36:56,426 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-20 17:36:56,550 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:36:56" (1/1) ... [2020-07-20 17:36:56,553 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:36:56" (1/1) ... [2020-07-20 17:36:56,564 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:36:56" (1/1) ... [2020-07-20 17:36:56,565 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:36:56" (1/1) ... [2020-07-20 17:36:56,573 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:36:56" (1/1) ... [2020-07-20 17:36:56,584 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:36:56" (1/1) ... [2020-07-20 17:36:56,587 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:36:56" (1/1) ... [2020-07-20 17:36:56,590 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-20 17:36:56,591 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-20 17:36:56,591 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-20 17:36:56,591 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-20 17:36:56,592 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:36:56" (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 17:36:56,674 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-20 17:36:56,675 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-20 17:36:56,675 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-20 17:36:56,675 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-20 17:36:56,675 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-20 17:36:56,675 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-20 17:36:56,675 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-20 17:36:56,676 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-20 17:36:56,676 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-20 17:36:56,676 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-20 17:36:56,676 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-20 17:36:56,676 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-20 17:36:56,676 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-20 17:36:56,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-20 17:36:56,677 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-20 17:36:56,677 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-20 17:36:56,677 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-20 17:36:56,677 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-20 17:36:57,037 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-20 17:36:57,038 INFO L295 CfgBuilder]: Removed 3 assume(true) statements. [2020-07-20 17:36:57,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 05:36:57 BoogieIcfgContainer [2020-07-20 17:36:57,045 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-20 17:36:57,047 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-20 17:36:57,048 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-20 17:36:57,052 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-20 17:36:57,053 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 05:36:56" (1/3) ... [2020-07-20 17:36:57,054 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53dc4c4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 05:36:57, skipping insertion in model container [2020-07-20 17:36:57,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:36:56" (2/3) ... [2020-07-20 17:36:57,056 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53dc4c4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 05:36:57, skipping insertion in model container [2020-07-20 17:36:57,056 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 05:36:57" (3/3) ... [2020-07-20 17:36:57,059 INFO L109 eAbstractionObserver]: Analyzing ICFG eqn5f.c [2020-07-20 17:36:57,075 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBPonlyIfFpWasNotPerfect Determinization: PREDICATE_ABSTRACTION [2020-07-20 17:36:57,087 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-20 17:36:57,107 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-20 17:36:57,141 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-20 17:36:57,141 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-20 17:36:57,141 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBPonlyIfFpWasNotPerfect [2020-07-20 17:36:57,141 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-20 17:36:57,142 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-20 17:36:57,142 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-20 17:36:57,142 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-20 17:36:57,142 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-20 17:36:57,165 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2020-07-20 17:36:57,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-20 17:36:57,173 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 17:36:57,175 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 17:36:57,175 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 17:36:57,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 17:36:57,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1314760119, now seen corresponding path program 1 times [2020-07-20 17:36:57,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 17:36:57,196 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1392512383] [2020-07-20 17:36:57,197 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) 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 17:36:57,355 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 17:36:57,356 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 17:36:57,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 1 conjunts are in the unsatisfiable core [2020-07-20 17:36:57,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 17:36:57,393 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 17:36:57,395 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 17:36:57,397 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1392512383] [2020-07-20 17:36:57,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 17:36:57,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-20 17:36:57,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351765418] [2020-07-20 17:36:57,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-20 17:36:57,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 17:36:57,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-20 17:36:57,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-20 17:36:57,433 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 2 states. [2020-07-20 17:36:57,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 17:36:57,465 INFO L93 Difference]: Finished difference Result 58 states and 73 transitions. [2020-07-20 17:36:57,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-20 17:36:57,466 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 22 [2020-07-20 17:36:57,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 17:36:57,477 INFO L225 Difference]: With dead ends: 58 [2020-07-20 17:36:57,478 INFO L226 Difference]: Without dead ends: 29 [2020-07-20 17:36:57,483 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 17:36:57,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-07-20 17:36:57,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-07-20 17:36:57,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-20 17:36:57,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2020-07-20 17:36:57,544 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 22 [2020-07-20 17:36:57,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 17:36:57,545 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2020-07-20 17:36:57,545 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-20 17:36:57,545 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2020-07-20 17:36:57,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-20 17:36:57,546 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 17:36:57,546 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 17:36:57,763 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 17:36:57,765 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 17:36:57,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 17:36:57,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1901566133, now seen corresponding path program 1 times [2020-07-20 17:36:57,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 17:36:57,767 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [782245116] [2020-07-20 17:36:57,767 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) 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 17:36:57,857 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-20 17:36:57,858 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 17:36:57,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-20 17:36:57,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 17:36:58,010 INFO L350 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2020-07-20 17:36:58,012 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 15 [2020-07-20 17:36:58,014 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 17:36:58,039 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 17:36:58,043 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 1 xjuncts. [2020-07-20 17:36:58,045 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:18 [2020-07-20 17:36:58,197 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 17:36:58,199 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 17:36:58,201 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-20 17:36:58,229 INFO L624 ElimStorePlain]: treesize reduction 12, result has 36.8 percent of original size [2020-07-20 17:36:58,230 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 17:36:58,231 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:7 [2020-07-20 17:36:58,299 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 17:36:58,300 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 17:36:58,302 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [782245116] [2020-07-20 17:36:58,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 17:36:58,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-20 17:36:58,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601962303] [2020-07-20 17:36:58,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-20 17:36:58,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 17:36:58,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-20 17:36:58,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-07-20 17:36:58,311 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 8 states. [2020-07-20 17:36:58,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 17:36:58,650 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2020-07-20 17:36:58,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-20 17:36:58,651 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-07-20 17:36:58,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 17:36:58,656 INFO L225 Difference]: With dead ends: 48 [2020-07-20 17:36:58,656 INFO L226 Difference]: Without dead ends: 46 [2020-07-20 17:36:58,658 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2020-07-20 17:36:58,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-07-20 17:36:58,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2020-07-20 17:36:58,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-20 17:36:58,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2020-07-20 17:36:58,676 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 22 [2020-07-20 17:36:58,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 17:36:58,677 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2020-07-20 17:36:58,677 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-20 17:36:58,677 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2020-07-20 17:36:58,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-20 17:36:58,679 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 17:36:58,679 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 17:36:58,893 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 17:36:58,894 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 17:36:58,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 17:36:58,895 INFO L82 PathProgramCache]: Analyzing trace with hash -2104565367, now seen corresponding path program 1 times [2020-07-20 17:36:58,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 17:36:58,895 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1108627827] [2020-07-20 17:36:58,895 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) 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 17:36:58,987 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-20 17:36:58,988 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 17:36:58,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-20 17:36:58,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 17:36:59,024 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 17:36:59,024 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 17:36:59,025 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1108627827] [2020-07-20 17:36:59,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 17:36:59,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-20 17:36:59,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663833504] [2020-07-20 17:36:59,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-20 17:36:59,027 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 17:36:59,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-20 17:36:59,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-20 17:36:59,028 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 5 states. [2020-07-20 17:36:59,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 17:36:59,183 INFO L93 Difference]: Finished difference Result 71 states and 78 transitions. [2020-07-20 17:36:59,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-20 17:36:59,184 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2020-07-20 17:36:59,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 17:36:59,188 INFO L225 Difference]: With dead ends: 71 [2020-07-20 17:36:59,189 INFO L226 Difference]: Without dead ends: 58 [2020-07-20 17:36:59,190 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 17:36:59,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-07-20 17:36:59,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 39. [2020-07-20 17:36:59,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-20 17:36:59,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2020-07-20 17:36:59,201 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 24 [2020-07-20 17:36:59,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 17:36:59,201 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2020-07-20 17:36:59,202 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-20 17:36:59,202 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2020-07-20 17:36:59,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-20 17:36:59,203 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 17:36:59,203 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 17:36:59,416 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 17:36:59,417 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 17:36:59,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 17:36:59,419 INFO L82 PathProgramCache]: Analyzing trace with hash -2011180599, now seen corresponding path program 1 times [2020-07-20 17:36:59,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 17:36:59,420 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1347211120] [2020-07-20 17:36:59,420 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) 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 17:36:59,504 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-20 17:36:59,504 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 17:36:59,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-20 17:36:59,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 17:36:59,539 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 17:36:59,540 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 17:36:59,578 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 17:36:59,579 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1347211120] [2020-07-20 17:36:59,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 17:36:59,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-07-20 17:36:59,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135076939] [2020-07-20 17:36:59,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-20 17:36:59,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 17:36:59,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-20 17:36:59,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-20 17:36:59,581 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 6 states. [2020-07-20 17:36:59,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 17:36:59,729 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2020-07-20 17:36:59,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-20 17:36:59,730 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2020-07-20 17:36:59,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 17:36:59,732 INFO L225 Difference]: With dead ends: 66 [2020-07-20 17:36:59,732 INFO L226 Difference]: Without dead ends: 55 [2020-07-20 17:36:59,733 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 17:36:59,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-07-20 17:36:59,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 40. [2020-07-20 17:36:59,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-20 17:36:59,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2020-07-20 17:36:59,743 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 24 [2020-07-20 17:36:59,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 17:36:59,743 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2020-07-20 17:36:59,743 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-20 17:36:59,743 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2020-07-20 17:36:59,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-20 17:36:59,744 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 17:36:59,744 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 17:36:59,955 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 17:36:59,956 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 17:36:59,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 17:36:59,957 INFO L82 PathProgramCache]: Analyzing trace with hash -69884793, now seen corresponding path program 1 times [2020-07-20 17:36:59,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 17:36:59,958 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [324641023] [2020-07-20 17:36:59,959 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) 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 17:37:00,043 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-20 17:37:00,044 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 17:37:00,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 31 conjunts are in the unsatisfiable core [2020-07-20 17:37:00,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 17:37:00,067 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 17:37:00,068 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 17:37:00,088 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 17:37:00,097 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 0 case distinctions, treesize of input 27 treesize of output 15 [2020-07-20 17:37:00,098 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-20 17:37:00,113 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 17:37:00,114 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 17:37:00,114 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:28 [2020-07-20 17:37:00,142 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-20 17:37:00,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 17:37:00,145 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 39 [2020-07-20 17:37:00,148 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 17:37:00,173 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 17:37:00,174 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-20 17:37:00,175 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:57, output treesize:57 [2020-07-20 17:37:00,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 17:37:00,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 17:37:00,325 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 17:37:00,326 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 120 [2020-07-20 17:37:00,329 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 17:37:00,421 INFO L624 ElimStorePlain]: treesize reduction 79, result has 49.0 percent of original size [2020-07-20 17:37:00,423 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 17:37:00,424 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:78, output treesize:76 [2020-07-20 17:37:00,505 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-20 17:37:00,700 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2020-07-20 17:37:00,707 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 17:37:00,927 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-20 17:37:00,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 17:37:00,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 17:37:00,931 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-20 17:37:00,933 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-20 17:37:00,987 INFO L350 Elim1Store]: treesize reduction 43, result has 37.7 percent of original size [2020-07-20 17:37:00,989 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 58 treesize of output 43 [2020-07-20 17:37:00,992 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 17:37:01,004 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 17:37:01,006 INFO L544 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-20 17:37:01,007 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:67, output treesize:7 [2020-07-20 17:37:01,102 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 17:37:01,102 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 17:37:01,165 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:37:02,336 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~i~0 Int)) (or (<= c_~N~0 main_~i~0) (< (+ main_~i~0 1) c_~N~0) (= 1 (select (let ((.cse0 (select |c_#memory_int| c_main_~b~0.base)) (.cse1 (* main_~i~0 8))) (store .cse0 (+ c_main_~b~0.offset .cse1) (+ (select .cse0 (+ c_main_~b~0.offset .cse1 (- 8))) (select (select |c_#memory_int| c_main_~a~0.base) (+ .cse1 c_main_~a~0.offset (- 8)))))) c_main_~b~0.offset)))) is different from false [2020-07-20 17:37:03,348 WARN L193 SmtUtils]: Spent 943.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2020-07-20 17:37:04,362 WARN L193 SmtUtils]: Spent 933.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2020-07-20 17:37:05,523 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_prenex_2 Int)) (or (= 1 (select (let ((.cse2 (let ((.cse3 (select |c_#memory_int| c_main_~a~0.base)) (.cse4 (* c_main_~i~0 8))) (store .cse3 (+ .cse4 c_main_~a~0.offset) (+ (select .cse3 (+ .cse4 c_main_~a~0.offset (- 8))) 10))))) (let ((.cse0 (select (store |c_#memory_int| c_main_~a~0.base .cse2) c_main_~b~0.base)) (.cse1 (* v_prenex_2 8))) (store .cse0 (+ c_main_~b~0.offset .cse1) (+ (select .cse0 (+ c_main_~b~0.offset .cse1 (- 8))) (select .cse2 (+ .cse1 c_main_~a~0.offset (- 8))))))) c_main_~b~0.offset)) (< v_prenex_2 c_main_~i~0) (< c_main_~i~0 v_prenex_2))) is different from false [2020-07-20 17:37:05,570 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2020-07-20 17:37:05,571 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [324641023] [2020-07-20 17:37:05,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 17:37:05,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 22 [2020-07-20 17:37:05,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649311450] [2020-07-20 17:37:05,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-07-20 17:37:05,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 17:37:05,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-07-20 17:37:05,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=304, Unknown=2, NotChecked=74, Total=462 [2020-07-20 17:37:05,574 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 22 states. [2020-07-20 17:37:06,554 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_main_~b~0.base) c_main_~b~0.offset) 1) (= 1 (select (select |c_#memory_int| c_main_~a~0.base) c_main_~a~0.offset)) (= 1 c_main_~i~0) (forall ((v_prenex_2 Int)) (or (= 1 (select (let ((.cse2 (let ((.cse3 (select |c_#memory_int| c_main_~a~0.base)) (.cse4 (* c_main_~i~0 8))) (store .cse3 (+ .cse4 c_main_~a~0.offset) (+ (select .cse3 (+ .cse4 c_main_~a~0.offset (- 8))) 10))))) (let ((.cse0 (select (store |c_#memory_int| c_main_~a~0.base .cse2) c_main_~b~0.base)) (.cse1 (* v_prenex_2 8))) (store .cse0 (+ c_main_~b~0.offset .cse1) (+ (select .cse0 (+ c_main_~b~0.offset .cse1 (- 8))) (select .cse2 (+ .cse1 c_main_~a~0.offset (- 8))))))) c_main_~b~0.offset)) (< v_prenex_2 c_main_~i~0) (< c_main_~i~0 v_prenex_2))) (= 0 c_main_~a~0.offset) (not (= c_main_~a~0.base c_main_~b~0.base)) (= c_main_~b~0.offset 0)) is different from false [2020-07-20 17:37:07,396 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| c_main_~a~0.base))) (let ((.cse0 (select .cse1 (+ c_main_~a~0.offset 8)))) (and (<= c_~N~0 2) (<= c_main_~i~0 2) (= (select (select |c_#memory_int| c_main_~b~0.base) c_main_~b~0.offset) 1) (< 1 c_~N~0) (= 0 c_main_~a~0.offset) (= 11 .cse0) (not (= c_main_~a~0.base c_main_~b~0.base)) (= c_main_~b~0.offset 0) (= (+ (select .cse1 c_main_~a~0.offset) 10) .cse0) (forall ((main_~i~0 Int)) (or (<= c_~N~0 main_~i~0) (< (+ main_~i~0 1) c_~N~0) (= 1 (select (let ((.cse2 (select |c_#memory_int| c_main_~b~0.base)) (.cse3 (* 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 17:37:08,719 WARN L193 SmtUtils]: Spent 1.26 s on a formula simplification that was a NOOP. DAG size: 34 [2020-07-20 17:37:09,544 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| c_main_~a~0.base))) (let ((.cse0 (select .cse1 (+ c_main_~a~0.offset 8)))) (and (<= c_~N~0 2) (= (select (select |c_#memory_int| c_main_~b~0.base) c_main_~b~0.offset) 1) (< 1 c_~N~0) (= 0 c_main_~a~0.offset) (= 11 .cse0) (not (= c_main_~a~0.base c_main_~b~0.base)) (= c_main_~b~0.offset 0) (= (+ (select .cse1 c_main_~a~0.offset) 10) .cse0) (forall ((main_~i~0 Int)) (or (<= c_~N~0 main_~i~0) (< (+ main_~i~0 1) c_~N~0) (= 1 (select (let ((.cse2 (select |c_#memory_int| c_main_~b~0.base)) (.cse3 (* 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 17:37:10,662 WARN L193 SmtUtils]: Spent 1.06 s on a formula simplification that was a NOOP. DAG size: 33 [2020-07-20 17:37:13,046 WARN L193 SmtUtils]: Spent 2.31 s on a formula simplification that was a NOOP. DAG size: 34 [2020-07-20 17:37:16,491 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_main_~b~0.base) c_main_~b~0.offset) 1) (forall ((main_~i~0 Int)) (or (<= c_~N~0 main_~i~0) (< (+ main_~i~0 1) c_~N~0) (= 1 (select (let ((.cse0 (select |c_#memory_int| c_main_~b~0.base)) (.cse1 (* main_~i~0 8))) (store .cse0 (+ c_main_~b~0.offset .cse1) (+ (select .cse0 (+ c_main_~b~0.offset .cse1 (- 8))) (select (select |c_#memory_int| c_main_~a~0.base) (+ .cse1 c_main_~a~0.offset (- 8)))))) c_main_~b~0.offset))))) is different from false [2020-07-20 17:37:20,236 WARN L193 SmtUtils]: Spent 1.57 s on a formula simplification. DAG size of input: 76 DAG size of output: 46 [2020-07-20 17:37:22,002 WARN L193 SmtUtils]: Spent 1.62 s on a formula simplification. DAG size of input: 77 DAG size of output: 40 [2020-07-20 17:37:22,724 WARN L193 SmtUtils]: Spent 626.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 42 [2020-07-20 17:37:24,254 WARN L193 SmtUtils]: Spent 1.44 s on a formula simplification that was a NOOP. DAG size: 42 [2020-07-20 17:37:25,656 WARN L193 SmtUtils]: Spent 1.31 s on a formula simplification that was a NOOP. DAG size: 44 [2020-07-20 17:37:27,826 WARN L193 SmtUtils]: Spent 1.62 s on a formula simplification that was a NOOP. DAG size: 55 [2020-07-20 17:37:28,978 WARN L193 SmtUtils]: Spent 1.05 s on a formula simplification that was a NOOP. DAG size: 54 [2020-07-20 17:37:29,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 17:37:29,046 INFO L93 Difference]: Finished difference Result 89 states and 102 transitions. [2020-07-20 17:37:29,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-07-20 17:37:29,047 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 26 [2020-07-20 17:37:29,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 17:37:29,050 INFO L225 Difference]: With dead ends: 89 [2020-07-20 17:37:29,050 INFO L226 Difference]: Without dead ends: 87 [2020-07-20 17:37:29,052 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 25.1s TimeCoverageRelationStatistics Valid=240, Invalid=769, Unknown=7, NotChecked=390, Total=1406 [2020-07-20 17:37:29,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2020-07-20 17:37:29,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 48. [2020-07-20 17:37:29,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-07-20 17:37:29,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2020-07-20 17:37:29,070 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 26 [2020-07-20 17:37:29,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 17:37:29,071 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2020-07-20 17:37:29,071 INFO L480 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-07-20 17:37:29,071 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2020-07-20 17:37:29,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-20 17:37:29,072 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 17:37:29,072 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 17:37:29,272 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 17:37:29,274 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 17:37:29,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 17:37:29,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1499578309, now seen corresponding path program 2 times [2020-07-20 17:37:29,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 17:37:29,276 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [967958778] [2020-07-20 17:37:29,276 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) 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 17:37:29,412 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-20 17:37:29,413 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 17:37:29,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-20 17:37:29,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 17:37:29,469 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 17:37:29,470 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 17:37:29,541 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 17:37:29,541 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [967958778] [2020-07-20 17:37:29,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 17:37:29,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-07-20 17:37:29,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024217186] [2020-07-20 17:37:29,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-20 17:37:29,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 17:37:29,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-20 17:37:29,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-07-20 17:37:29,543 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand 9 states. [2020-07-20 17:37:29,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 17:37:29,883 INFO L93 Difference]: Finished difference Result 95 states and 107 transitions. [2020-07-20 17:37:29,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-20 17:37:29,884 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2020-07-20 17:37:29,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 17:37:29,885 INFO L225 Difference]: With dead ends: 95 [2020-07-20 17:37:29,885 INFO L226 Difference]: Without dead ends: 74 [2020-07-20 17:37:29,886 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2020-07-20 17:37:29,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-07-20 17:37:29,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 50. [2020-07-20 17:37:29,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-07-20 17:37:29,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2020-07-20 17:37:29,899 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 28 [2020-07-20 17:37:29,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 17:37:29,900 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2020-07-20 17:37:29,900 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-20 17:37:29,900 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2020-07-20 17:37:29,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-20 17:37:29,902 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 17:37:29,902 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 17:37:30,112 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 17:37:30,113 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 17:37:30,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 17:37:30,115 INFO L82 PathProgramCache]: Analyzing trace with hash 2071122883, now seen corresponding path program 3 times [2020-07-20 17:37:30,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 17:37:30,116 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [921432966] [2020-07-20 17:37:30,117 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) 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 17:37:30,214 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-20 17:37:30,214 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 17:37:30,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 29 conjunts are in the unsatisfiable core [2020-07-20 17:37:30,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 17:37:30,230 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 17:37:30,231 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 17:37:30,243 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 17:37:30,253 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 0 case distinctions, treesize of input 27 treesize of output 15 [2020-07-20 17:37:30,254 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-20 17:37:30,261 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 17:37:30,262 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 17:37:30,262 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:22 [2020-07-20 17:37:30,338 INFO L350 Elim1Store]: treesize reduction 54, result has 46.0 percent of original size [2020-07-20 17:37:30,339 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 17:37:30,341 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 17:37:30,376 INFO L624 ElimStorePlain]: treesize reduction 32, result has 57.9 percent of original size [2020-07-20 17:37:30,377 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-20 17:37:30,377 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:48, output treesize:44 [2020-07-20 17:37:30,515 INFO L350 Elim1Store]: treesize reduction 126, result has 31.5 percent of original size [2020-07-20 17:37:30,516 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 64 treesize of output 89 [2020-07-20 17:37:30,518 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 17:37:30,570 INFO L624 ElimStorePlain]: treesize reduction 32, result has 68.3 percent of original size [2020-07-20 17:37:30,571 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-20 17:37:30,571 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:74, output treesize:69 [2020-07-20 17:37:30,817 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 44 [2020-07-20 17:37:30,819 INFO L350 Elim1Store]: treesize reduction 86, result has 50.9 percent of original size [2020-07-20 17:37:30,820 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 82 treesize of output 155 [2020-07-20 17:37:30,822 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 17:37:30,942 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 45 [2020-07-20 17:37:30,943 INFO L624 ElimStorePlain]: treesize reduction 143, result has 39.7 percent of original size [2020-07-20 17:37:30,944 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-20 17:37:30,944 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:92, output treesize:94 [2020-07-20 17:37:31,116 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-20 17:37:31,121 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 17:37:31,124 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-20 17:37:31,142 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-20 17:37:31,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 17:37:31,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 17:37:31,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 17:37:31,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 17:37:31,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 17:37:31,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 17:37:31,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 17:37:31,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 17:37:31,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 17:37:31,164 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-20 17:37:31,250 INFO L244 Elim1Store]: Index analysis took 108 ms [2020-07-20 17:37:31,252 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 10 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 98 [2020-07-20 17:37:31,255 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 17:37:31,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 17:37:31,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 17:37:31,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 17:37:31,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 17:37:31,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 17:37:31,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 17:37:31,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 17:37:31,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 17:37:31,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 17:37:31,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 17:37:31,363 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 17:37:31,364 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 11 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 6 case distinctions, treesize of input 112 treesize of output 208 [2020-07-20 17:37:31,368 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-20 17:37:31,654 WARN L193 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 63 [2020-07-20 17:37:31,656 INFO L624 ElimStorePlain]: treesize reduction 195, result has 59.2 percent of original size [2020-07-20 17:37:31,659 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2020-07-20 17:37:31,659 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:249, output treesize:283 [2020-07-20 17:37:33,254 WARN L193 SmtUtils]: Spent 798.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-07-20 17:37:33,259 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 17:37:33,260 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-20 17:37:40,390 WARN L193 SmtUtils]: Spent 4.40 s on a formula simplification. DAG size of input: 103 DAG size of output: 101 [2020-07-20 17:37:40,395 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-20 17:37:40,562 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2020-07-20 17:37:40,665 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2020-07-20 17:37:41,316 WARN L193 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 81 [2020-07-20 17:37:41,317 INFO L350 Elim1Store]: treesize reduction 102, result has 64.7 percent of original size [2020-07-20 17:37:41,317 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 1 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 20 case distinctions, treesize of input 132 treesize of output 217 [2020-07-20 17:37:41,324 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 1] term [2020-07-20 17:37:41,325 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-20 17:37:41,326 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 1] term [2020-07-20 17:37:41,326 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-20 17:37:41,327 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-20 17:37:41,327 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 17:37:41,340 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-20 17:37:41,341 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 17:37:41,350 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 2, 3, 2, 2, 2, 1] term [2020-07-20 17:37:41,351 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-20 17:37:41,353 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 1] term [2020-07-20 17:37:41,354 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-20 17:37:41,357 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 1] term [2020-07-20 17:37:41,357 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-20 17:37:41,362 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 1] term [2020-07-20 17:37:41,362 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-20 17:37:41,364 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 1] term [2020-07-20 17:37:41,364 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-20 17:37:41,365 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-20 17:37:41,365 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 17:37:41,367 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-20 17:37:41,367 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 17:37:41,375 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 2, 2, 1] term [2020-07-20 17:37:41,376 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-20 17:37:41,376 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 1] term [2020-07-20 17:37:41,377 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-20 17:37:41,378 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-20 17:37:41,378 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 17:37:41,380 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-20 17:37:41,381 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 17:37:41,383 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 1] term [2020-07-20 17:37:41,384 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-20 17:37:41,389 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 1] term [2020-07-20 17:37:41,389 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-20 17:37:41,393 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 1] term [2020-07-20 17:37:41,394 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-20 17:37:41,396 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 1] term [2020-07-20 17:37:41,397 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-20 17:37:41,397 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-20 17:37:41,398 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 17:37:41,402 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[12, 2, 1] term [2020-07-20 17:37:41,403 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-20 17:37:41,407 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 3, 6, 2, 5, 2, 4, 3, 3, 2, 2, 3, 1] term [2020-07-20 17:37:41,408 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-07-20 17:37:41,410 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 4, 2, 3, 2, 2, 3, 1] term [2020-07-20 17:37:41,411 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-20 17:37:41,412 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 4, 2, 3, 2, 2, 3, 1] term [2020-07-20 17:37:41,413 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-20 17:37:41,413 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 1] term [2020-07-20 17:37:41,414 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-20 17:37:41,422 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 1] term [2020-07-20 17:37:41,423 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-20 17:37:41,425 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-20 17:37:41,426 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 17:37:41,427 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-20 17:37:41,427 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 17:37:41,432 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 2, 3, 1] term [2020-07-20 17:37:41,433 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-20 17:37:41,434 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 1] term [2020-07-20 17:37:41,434 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-20 17:37:41,438 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 1] term [2020-07-20 17:37:41,439 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-20 17:37:41,440 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-20 17:37:41,441 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 17:37:41,442 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 2, 3, 1] term [2020-07-20 17:37:41,442 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-20 17:37:41,444 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 3, 1] term [2020-07-20 17:37:41,445 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 17:37:41,446 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 3, 1] term [2020-07-20 17:37:41,446 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 17:37:41,446 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-20 17:37:41,447 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 17:37:41,449 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 1] term [2020-07-20 17:37:41,450 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-20 17:37:41,451 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 1] term [2020-07-20 17:37:41,451 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-20 17:37:41,456 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-20 17:37:41,458 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 17:37:41,459 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 1] term [2020-07-20 17:37:41,460 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-20 17:37:41,460 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 1] term [2020-07-20 17:37:41,460 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-20 17:37:41,465 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-20 17:37:41,465 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 17:37:41,469 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 2, 3, 1] term [2020-07-20 17:37:41,470 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-20 17:37:41,472 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 2, 3, 1] term [2020-07-20 17:37:41,473 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-20 17:37:41,474 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 3, 1] term [2020-07-20 17:37:41,475 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 17:37:41,475 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 3, 1] term [2020-07-20 17:37:41,476 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 17:37:41,476 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-20 17:37:41,477 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 17:37:41,479 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 6, 2, 5, 2, 4, 2, 3, 2, 2, 3, 1] term [2020-07-20 17:37:41,480 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-20 17:37:41,482 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 4, 2, 3, 2, 2, 3, 1] term [2020-07-20 17:37:41,482 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-20 17:37:41,484 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 4, 2, 3, 2, 2, 3, 1] term [2020-07-20 17:37:41,485 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-20 17:37:41,486 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 2, 3, 1] term [2020-07-20 17:37:41,486 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-20 17:37:41,487 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 2, 3, 1] term [2020-07-20 17:37:41,487 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-20 17:37:41,488 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 3, 1] term [2020-07-20 17:37:41,489 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 17:37:41,490 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 3, 1] term [2020-07-20 17:37:41,490 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 17:37:41,495 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 1] term [2020-07-20 17:37:41,496 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-20 17:37:41,496 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 1] term [2020-07-20 17:37:41,496 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-20 17:37:41,497 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-20 17:37:41,498 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 17:37:41,499 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-20 17:37:41,500 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 17:37:41,504 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 1] term [2020-07-20 17:37:41,504 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-20 17:37:41,505 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 1] term [2020-07-20 17:37:41,506 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-20 17:37:41,507 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-20 17:37:41,507 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 17:37:41,526 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 17:37:42,144 WARN L193 SmtUtils]: Spent 616.00 ms on a formula simplification. DAG size of input: 290 DAG size of output: 15 [2020-07-20 17:37:42,145 INFO L624 ElimStorePlain]: treesize reduction 2738, result has 0.6 percent of original size [2020-07-20 17:37:42,146 INFO L544 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-20 17:37:42,147 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:145, output treesize:7 [2020-07-20 17:37:42,401 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 17:37:42,402 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 17:37:42,534 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:37:45,239 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~i~0 Int)) (or (= 1 (select (let ((.cse4 (select |c_#memory_int| c_main_~b~0.base)) (.cse1 (* main_~i~0 8))) (let ((.cse2 (select .cse4 (+ c_main_~b~0.offset .cse1 (- 8)))) (.cse3 (select (select |c_#memory_int| c_main_~a~0.base) (+ .cse1 c_main_~a~0.offset (- 8))))) (let ((.cse0 (store .cse4 (+ c_main_~b~0.offset .cse1) (+ .cse2 .cse3)))) (store .cse0 (+ c_main_~b~0.offset .cse1 8) (+ .cse2 (select (select (store |c_#memory_int| c_main_~b~0.base .cse0) c_main_~a~0.base) (+ .cse1 c_main_~a~0.offset)) .cse3))))) c_main_~b~0.offset)) (< (+ main_~i~0 2) c_~N~0) (<= c_~N~0 (+ main_~i~0 1)))) is different from false [2020-07-20 17:37:47,932 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_prenex_7 Int)) (let ((.cse0 (+ v_prenex_7 1))) (or (< c_main_~i~0 .cse0) (< .cse0 c_main_~i~0) (= 1 (select (let ((.cse7 (let ((.cse8 (select |c_#memory_int| c_main_~a~0.base)) (.cse9 (* c_main_~i~0 8))) (store .cse8 (+ .cse9 c_main_~a~0.offset) (+ (select .cse8 (+ .cse9 c_main_~a~0.offset (- 8))) 10))))) (let ((.cse3 (store |c_#memory_int| c_main_~a~0.base .cse7))) (let ((.cse6 (select .cse3 c_main_~b~0.base)) (.cse2 (* v_prenex_7 8))) (let ((.cse4 (select .cse6 (+ c_main_~b~0.offset .cse2 (- 8)))) (.cse5 (select .cse7 (+ .cse2 c_main_~a~0.offset (- 8))))) (let ((.cse1 (store .cse6 (+ c_main_~b~0.offset .cse2) (+ .cse4 .cse5)))) (store .cse1 (+ c_main_~b~0.offset .cse2 8) (+ (select (select (store .cse3 c_main_~b~0.base .cse1) c_main_~a~0.base) (+ .cse2 c_main_~a~0.offset)) .cse4 .cse5))))))) c_main_~b~0.offset))))) is different from false [2020-07-20 17:37:49,991 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_prenex_7 Int)) (or (< c_main_~i~0 v_prenex_7) (= 1 (select (let ((.cse6 (let ((.cse7 (select |c_#memory_int| c_main_~a~0.base)) (.cse8 (* c_main_~i~0 8))) (store .cse7 (+ .cse8 c_main_~a~0.offset 8) (+ (select .cse7 (+ .cse8 c_main_~a~0.offset)) 10))))) (let ((.cse3 (store |c_#memory_int| c_main_~a~0.base .cse6))) (let ((.cse5 (select .cse3 c_main_~b~0.base)) (.cse1 (* v_prenex_7 8))) (let ((.cse2 (select .cse5 (+ c_main_~b~0.offset .cse1 (- 8)))) (.cse4 (select .cse6 (+ .cse1 c_main_~a~0.offset (- 8))))) (let ((.cse0 (store .cse5 (+ c_main_~b~0.offset .cse1) (+ .cse2 .cse4)))) (store .cse0 (+ c_main_~b~0.offset .cse1 8) (+ .cse2 (select (select (store .cse3 c_main_~b~0.base .cse0) c_main_~a~0.base) (+ .cse1 c_main_~a~0.offset)) .cse4))))))) c_main_~b~0.offset)) (< v_prenex_7 c_main_~i~0))) is different from false [2020-07-20 17:37:52,025 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_prenex_7 Int)) (or (< c_main_~i~0 v_prenex_7) (= 1 (select (let ((.cse6 (let ((.cse7 (select |c_#memory_int| c_main_~a~0.base)) (.cse8 (* c_main_~i~0 8))) (let ((.cse9 (select .cse7 (+ .cse8 c_main_~a~0.offset (- 8))))) (store (store .cse7 (+ .cse8 c_main_~a~0.offset) (+ .cse9 10)) (+ .cse8 c_main_~a~0.offset 8) (+ .cse9 20)))))) (let ((.cse3 (store |c_#memory_int| c_main_~a~0.base .cse6))) (let ((.cse5 (select .cse3 c_main_~b~0.base)) (.cse1 (* v_prenex_7 8))) (let ((.cse2 (select .cse6 (+ .cse1 c_main_~a~0.offset (- 8)))) (.cse4 (select .cse5 (+ c_main_~b~0.offset .cse1 (- 8))))) (let ((.cse0 (store .cse5 (+ c_main_~b~0.offset .cse1) (+ .cse2 .cse4)))) (store .cse0 (+ c_main_~b~0.offset .cse1 8) (+ .cse2 (select (select (store .cse3 c_main_~b~0.base .cse0) c_main_~a~0.base) (+ .cse1 c_main_~a~0.offset)) .cse4))))))) c_main_~b~0.offset)) (< v_prenex_7 c_main_~i~0))) is different from false [2020-07-20 17:37:52,074 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2020-07-20 17:37:52,075 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [921432966] [2020-07-20 17:37:52,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 17:37:52,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 30 [2020-07-20 17:37:52,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140532151] [2020-07-20 17:37:52,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2020-07-20 17:37:52,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 17:37:52,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2020-07-20 17:37:52,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=531, Unknown=5, NotChecked=204, Total=870 [2020-07-20 17:37:52,085 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 30 states. [2020-07-20 17:37:54,194 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_main_~b~0.base) c_main_~b~0.offset) 1) (= 1 (select (select |c_#memory_int| c_main_~a~0.base) c_main_~a~0.offset)) (forall ((v_prenex_7 Int)) (or (< c_main_~i~0 v_prenex_7) (= 1 (select (let ((.cse6 (let ((.cse7 (select |c_#memory_int| c_main_~a~0.base)) (.cse8 (* c_main_~i~0 8))) (let ((.cse9 (select .cse7 (+ .cse8 c_main_~a~0.offset (- 8))))) (store (store .cse7 (+ .cse8 c_main_~a~0.offset) (+ .cse9 10)) (+ .cse8 c_main_~a~0.offset 8) (+ .cse9 20)))))) (let ((.cse3 (store |c_#memory_int| c_main_~a~0.base .cse6))) (let ((.cse5 (select .cse3 c_main_~b~0.base)) (.cse1 (* v_prenex_7 8))) (let ((.cse2 (select .cse6 (+ .cse1 c_main_~a~0.offset (- 8)))) (.cse4 (select .cse5 (+ c_main_~b~0.offset .cse1 (- 8))))) (let ((.cse0 (store .cse5 (+ c_main_~b~0.offset .cse1) (+ .cse2 .cse4)))) (store .cse0 (+ c_main_~b~0.offset .cse1 8) (+ .cse2 (select (select (store .cse3 c_main_~b~0.base .cse0) c_main_~a~0.base) (+ .cse1 c_main_~a~0.offset)) .cse4))))))) c_main_~b~0.offset)) (< v_prenex_7 c_main_~i~0))) (= 1 c_main_~i~0) (not (= c_main_~a~0.base c_main_~b~0.base))) is different from false [2020-07-20 17:37:55,859 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_main_~a~0.base))) (and (= (select (select |c_#memory_int| c_main_~b~0.base) c_main_~b~0.offset) 1) (= 1 (select .cse0 c_main_~a~0.offset)) (forall ((v_prenex_7 Int)) (or (< c_main_~i~0 v_prenex_7) (= 1 (select (let ((.cse7 (let ((.cse8 (select |c_#memory_int| c_main_~a~0.base)) (.cse9 (* c_main_~i~0 8))) (store .cse8 (+ .cse9 c_main_~a~0.offset 8) (+ (select .cse8 (+ .cse9 c_main_~a~0.offset)) 10))))) (let ((.cse4 (store |c_#memory_int| c_main_~a~0.base .cse7))) (let ((.cse6 (select .cse4 c_main_~b~0.base)) (.cse2 (* v_prenex_7 8))) (let ((.cse3 (select .cse6 (+ c_main_~b~0.offset .cse2 (- 8)))) (.cse5 (select .cse7 (+ .cse2 c_main_~a~0.offset (- 8))))) (let ((.cse1 (store .cse6 (+ c_main_~b~0.offset .cse2) (+ .cse3 .cse5)))) (store .cse1 (+ c_main_~b~0.offset .cse2 8) (+ .cse3 (select (select (store .cse4 c_main_~b~0.base .cse1) c_main_~a~0.base) (+ .cse2 c_main_~a~0.offset)) .cse5))))))) c_main_~b~0.offset)) (< v_prenex_7 c_main_~i~0))) (= 1 c_main_~i~0) (not (= c_main_~a~0.base c_main_~b~0.base)) (let ((.cse10 (* c_main_~i~0 8))) (= (+ (select .cse0 (+ .cse10 c_main_~a~0.offset (- 8))) 10) (select .cse0 (+ .cse10 c_main_~a~0.offset)))))) is different from false [2020-07-20 17:37:57,685 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_main_~a~0.base))) (and (= 2 c_main_~i~0) (= (select (select |c_#memory_int| c_main_~b~0.base) c_main_~b~0.offset) 1) (= 1 (select .cse0 c_main_~a~0.offset)) (let ((.cse1 (* c_main_~i~0 8))) (= (+ (select .cse0 (+ .cse1 c_main_~a~0.offset (- 16))) 10) (select .cse0 (+ .cse1 c_main_~a~0.offset (- 8))))) (not (= c_main_~a~0.base c_main_~b~0.base)) (forall ((v_prenex_7 Int)) (let ((.cse2 (+ v_prenex_7 1))) (or (< c_main_~i~0 .cse2) (< .cse2 c_main_~i~0) (= 1 (select (let ((.cse9 (let ((.cse10 (select |c_#memory_int| c_main_~a~0.base)) (.cse11 (* c_main_~i~0 8))) (store .cse10 (+ .cse11 c_main_~a~0.offset) (+ (select .cse10 (+ .cse11 c_main_~a~0.offset (- 8))) 10))))) (let ((.cse5 (store |c_#memory_int| c_main_~a~0.base .cse9))) (let ((.cse8 (select .cse5 c_main_~b~0.base)) (.cse4 (* v_prenex_7 8))) (let ((.cse6 (select .cse8 (+ c_main_~b~0.offset .cse4 (- 8)))) (.cse7 (select .cse9 (+ .cse4 c_main_~a~0.offset (- 8))))) (let ((.cse3 (store .cse8 (+ c_main_~b~0.offset .cse4) (+ .cse6 .cse7)))) (store .cse3 (+ c_main_~b~0.offset .cse4 8) (+ (select (select (store .cse5 c_main_~b~0.base .cse3) c_main_~a~0.base) (+ .cse4 c_main_~a~0.offset)) .cse6 .cse7))))))) c_main_~b~0.offset))))))) is different from false [2020-07-20 17:38:02,151 WARN L193 SmtUtils]: Spent 4.13 s on a formula simplification that was a NOOP. DAG size: 43 [2020-07-20 17:38:04,206 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_main_~a~0.base))) (let ((.cse2 (select .cse0 c_main_~a~0.offset)) (.cse1 (select .cse0 (+ c_main_~a~0.offset 16)))) (and (<= c_main_~i~0 3) (= (+ (select .cse0 (+ c_main_~a~0.offset 8)) 10) .cse1) (= (select (select |c_#memory_int| c_main_~b~0.base) c_main_~b~0.offset) 1) (= 1 .cse2) (<= c_~N~0 3) (= (+ .cse2 20) .cse1) (< 2 c_~N~0) (not (= c_main_~a~0.base c_main_~b~0.base)) (forall ((main_~i~0 Int)) (or (= 1 (select (let ((.cse7 (select |c_#memory_int| c_main_~b~0.base)) (.cse4 (* main_~i~0 8))) (let ((.cse5 (select .cse7 (+ c_main_~b~0.offset .cse4 (- 8)))) (.cse6 (select (select |c_#memory_int| c_main_~a~0.base) (+ .cse4 c_main_~a~0.offset (- 8))))) (let ((.cse3 (store .cse7 (+ c_main_~b~0.offset .cse4) (+ .cse5 .cse6)))) (store .cse3 (+ c_main_~b~0.offset .cse4 8) (+ .cse5 (select (select (store |c_#memory_int| c_main_~b~0.base .cse3) c_main_~a~0.base) (+ .cse4 c_main_~a~0.offset)) .cse6))))) c_main_~b~0.offset)) (< (+ main_~i~0 2) c_~N~0) (<= c_~N~0 (+ main_~i~0 1))))))) is different from false [2020-07-20 17:38:12,815 WARN L193 SmtUtils]: Spent 8.35 s on a formula simplification that was a NOOP. DAG size: 67 [2020-07-20 17:38:14,862 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_main_~a~0.base))) (let ((.cse2 (select .cse0 c_main_~a~0.offset)) (.cse1 (select .cse0 (+ c_main_~a~0.offset 16)))) (and (= (+ (select .cse0 (+ c_main_~a~0.offset 8)) 10) .cse1) (= (select (select |c_#memory_int| c_main_~b~0.base) c_main_~b~0.offset) 1) (= 1 .cse2) (<= c_~N~0 3) (= (+ .cse2 20) .cse1) (< 2 c_~N~0) (not (= c_main_~a~0.base c_main_~b~0.base)) (forall ((main_~i~0 Int)) (or (= 1 (select (let ((.cse7 (select |c_#memory_int| c_main_~b~0.base)) (.cse4 (* main_~i~0 8))) (let ((.cse5 (select .cse7 (+ c_main_~b~0.offset .cse4 (- 8)))) (.cse6 (select (select |c_#memory_int| c_main_~a~0.base) (+ .cse4 c_main_~a~0.offset (- 8))))) (let ((.cse3 (store .cse7 (+ c_main_~b~0.offset .cse4) (+ .cse5 .cse6)))) (store .cse3 (+ c_main_~b~0.offset .cse4 8) (+ .cse5 (select (select (store |c_#memory_int| c_main_~b~0.base .cse3) c_main_~a~0.base) (+ .cse4 c_main_~a~0.offset)) .cse6))))) c_main_~b~0.offset)) (< (+ main_~i~0 2) c_~N~0) (<= c_~N~0 (+ main_~i~0 1))))))) is different from false [2020-07-20 17:38:19,217 WARN L193 SmtUtils]: Spent 4.11 s on a formula simplification that was a NOOP. DAG size: 56 [2020-07-20 17:38:47,232 WARN L193 SmtUtils]: Spent 16.60 s on a formula simplification. DAG size of input: 68 DAG size of output: 42 [2020-07-20 17:38:54,209 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_main_~i~0 1))) (and (or (= 1 (select (let ((.cse0 (select |c_#memory_int| c_main_~b~0.base)) (.cse1 (* c_main_~i~0 8))) (store .cse0 (+ c_main_~b~0.offset .cse1 8) (+ (select (select |c_#memory_int| c_main_~a~0.base) (+ .cse1 c_main_~a~0.offset)) (select .cse0 (+ c_main_~b~0.offset .cse1))))) c_main_~b~0.offset)) (< (+ c_main_~i~0 2) c_~N~0) (<= c_~N~0 .cse2)) (forall ((main_~i~0 Int)) (or (= 1 (select (let ((.cse7 (select |c_#memory_int| c_main_~b~0.base)) (.cse4 (* main_~i~0 8))) (let ((.cse5 (select .cse7 (+ c_main_~b~0.offset .cse4 (- 8)))) (.cse6 (select (select |c_#memory_int| c_main_~a~0.base) (+ .cse4 c_main_~a~0.offset (- 8))))) (let ((.cse3 (store .cse7 (+ c_main_~b~0.offset .cse4) (+ .cse5 .cse6)))) (store .cse3 (+ c_main_~b~0.offset .cse4 8) (+ .cse5 (select (select (store |c_#memory_int| c_main_~b~0.base .cse3) c_main_~a~0.base) (+ .cse4 c_main_~a~0.offset)) .cse6))))) c_main_~b~0.offset)) (< (+ main_~i~0 2) c_~N~0) (<= c_~N~0 (+ main_~i~0 1)))) (or (< .cse2 c_~N~0) (forall ((v_prenex_7 Int)) (or (= 1 (select (let ((.cse12 (select |c_#memory_int| c_main_~b~0.base)) (.cse9 (* v_prenex_7 8))) (let ((.cse10 (select .cse12 (+ c_main_~b~0.offset .cse9 (- 8)))) (.cse11 (select (select |c_#memory_int| c_main_~a~0.base) (+ .cse9 c_main_~a~0.offset (- 8))))) (let ((.cse8 (store .cse12 (+ c_main_~b~0.offset .cse9) (+ .cse10 .cse11)))) (store .cse8 (+ c_main_~b~0.offset .cse9 8) (+ .cse10 (select (select (store |c_#memory_int| c_main_~b~0.base .cse8) c_main_~a~0.base) (+ .cse9 c_main_~a~0.offset)) .cse11))))) c_main_~b~0.offset)) (<= c_~N~0 (+ v_prenex_7 1)) (< (+ v_prenex_7 2) c_~N~0)))))) is different from false [2020-07-20 17:38:54,692 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2020-07-20 17:38:59,285 WARN L193 SmtUtils]: Spent 4.20 s on a formula simplification that was a NOOP. DAG size: 58 [2020-07-20 17:39:01,787 WARN L193 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2020-07-20 17:39:04,475 WARN L193 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2020-07-20 17:39:44,858 WARN L193 SmtUtils]: Spent 37.61 s on a formula simplification. DAG size of input: 157 DAG size of output: 62 [2020-07-20 17:39:49,887 WARN L193 SmtUtils]: Spent 727.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2020-07-20 17:40:02,699 WARN L193 SmtUtils]: Spent 9.18 s on a formula simplification that was a NOOP. DAG size: 94 [2020-07-20 17:40:13,163 WARN L193 SmtUtils]: Spent 8.62 s on a formula simplification that was a NOOP. DAG size: 96 [2020-07-20 17:40:14,020 WARN L193 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2020-07-20 17:40:19,601 WARN L193 SmtUtils]: Spent 3.27 s on a formula simplification that was a NOOP. DAG size: 63 [2020-07-20 17:40:23,371 WARN L193 SmtUtils]: Spent 2.83 s on a formula simplification that was a NOOP. DAG size: 65 [2020-07-20 17:40:30,017 WARN L193 SmtUtils]: Spent 279.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2020-07-20 17:40:35,213 WARN L193 SmtUtils]: Spent 2.97 s on a formula simplification that was a NOOP. DAG size: 105 [2020-07-20 17:40:40,494 WARN L193 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2020-07-20 17:40:45,593 WARN L193 SmtUtils]: Spent 4.49 s on a formula simplification that was a NOOP. DAG size: 93 [2020-07-20 17:40:50,302 WARN L193 SmtUtils]: Spent 2.46 s on a formula simplification that was a NOOP. DAG size: 79 [2020-07-20 17:40:52,890 WARN L193 SmtUtils]: Spent 2.26 s on a formula simplification that was a NOOP. DAG size: 42 [2020-07-20 17:40:53,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 17:40:53,809 INFO L93 Difference]: Finished difference Result 109 states and 125 transitions. [2020-07-20 17:40:53,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2020-07-20 17:40:53,814 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2020-07-20 17:40:53,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 17:40:53,816 INFO L225 Difference]: With dead ends: 109 [2020-07-20 17:40:53,816 INFO L226 Difference]: Without dead ends: 107 [2020-07-20 17:40:53,818 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 461 ImplicationChecksByTransitivity, 164.4s TimeCoverageRelationStatistics Valid=529, Invalid=1947, Unknown=14, NotChecked=1050, Total=3540 [2020-07-20 17:40:53,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2020-07-20 17:40:53,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 58. [2020-07-20 17:40:53,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-07-20 17:40:53,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2020-07-20 17:40:53,836 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 30 [2020-07-20 17:40:53,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 17:40:53,836 INFO L479 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2020-07-20 17:40:53,837 INFO L480 AbstractCegarLoop]: Interpolant automaton has 30 states. [2020-07-20 17:40:53,837 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2020-07-20 17:40:53,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-20 17:40:53,841 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 17:40:53,841 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 17:40:54,054 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 17:40:54,056 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 17:40:54,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 17:40:54,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1619571715, now seen corresponding path program 4 times [2020-07-20 17:40:54,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 17:40:54,057 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [651765971] [2020-07-20 17:40:54,057 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) 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 17:40:54,150 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-20 17:40:54,151 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 17:40:54,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-20 17:40:54,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 17:40:54,237 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 17:40:54,237 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 17:40:54,341 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 17:40:54,342 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [651765971] [2020-07-20 17:40:54,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 17:40:54,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2020-07-20 17:40:54,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102714941] [2020-07-20 17:40:54,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-20 17:40:54,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 17:40:54,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-20 17:40:54,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2020-07-20 17:40:54,344 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. Second operand 12 states. [2020-07-20 17:40:56,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 17:40:56,426 INFO L93 Difference]: Finished difference Result 131 states and 146 transitions. [2020-07-20 17:40:56,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-07-20 17:40:56,428 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 30 [2020-07-20 17:40:56,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 17:40:56,429 INFO L225 Difference]: With dead ends: 131 [2020-07-20 17:40:56,429 INFO L226 Difference]: Without dead ends: 113 [2020-07-20 17:40:56,430 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=200, Invalid=502, Unknown=0, NotChecked=0, Total=702 [2020-07-20 17:40:56,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2020-07-20 17:40:56,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 56. [2020-07-20 17:40:56,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-07-20 17:40:56,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2020-07-20 17:40:56,458 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 30 [2020-07-20 17:40:56,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 17:40:56,458 INFO L479 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2020-07-20 17:40:56,458 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-20 17:40:56,459 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2020-07-20 17:40:56,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-07-20 17:40:56,461 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 17:40:56,462 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 17:40:56,669 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 17:40:56,671 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 17:40:56,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 17:40:56,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1718620161, now seen corresponding path program 5 times [2020-07-20 17:40:56,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 17:40:56,672 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [308389301] [2020-07-20 17:40:56,672 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) 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 17:40:56,827 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-20 17:40:56,828 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 17:40:56,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-20 17:40:56,833 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 17:40:56,941 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 17:40:56,941 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 17:40:57,044 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 17:40:57,044 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [308389301] [2020-07-20 17:40:57,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 17:40:57,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2020-07-20 17:40:57,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461433223] [2020-07-20 17:40:57,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-20 17:40:57,045 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 17:40:57,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-20 17:40:57,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2020-07-20 17:40:57,046 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand 12 states. [2020-07-20 17:40:58,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 17:40:58,399 INFO L93 Difference]: Finished difference Result 106 states and 117 transitions. [2020-07-20 17:40:58,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-07-20 17:40:58,401 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2020-07-20 17:40:58,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 17:40:58,403 INFO L225 Difference]: With dead ends: 106 [2020-07-20 17:40:58,403 INFO L226 Difference]: Without dead ends: 90 [2020-07-20 17:40:58,404 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 49 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=163, Invalid=389, Unknown=0, NotChecked=0, Total=552 [2020-07-20 17:40:58,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2020-07-20 17:40:58,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 63. [2020-07-20 17:40:58,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-07-20 17:40:58,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2020-07-20 17:40:58,423 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 32 [2020-07-20 17:40:58,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 17:40:58,424 INFO L479 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2020-07-20 17:40:58,424 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-20 17:40:58,424 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2020-07-20 17:40:58,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-07-20 17:40:58,427 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 17:40:58,427 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 17:40:58,640 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 17:40:58,642 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 17:40:58,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 17:40:58,642 INFO L82 PathProgramCache]: Analyzing trace with hash 890841693, now seen corresponding path program 1 times [2020-07-20 17:40:58,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 17:40:58,643 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1919735288] [2020-07-20 17:40:58,643 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) 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 17:40:58,744 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-20 17:40:58,744 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2020-07-20 17:40:58,744 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-20 17:40:58,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-20 17:40:58,766 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-20 17:40:58,794 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-20 17:40:58,795 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-20 17:40:59,008 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 17:40:59,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.07 05:40:59 BoogieIcfgContainer [2020-07-20 17:40:59,049 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-20 17:40:59,050 INFO L168 Benchmark]: Toolchain (without parser) took 242944.16 ms. Allocated memory was 147.3 MB in the beginning and 252.7 MB in the end (delta: 105.4 MB). Free memory was 103.6 MB in the beginning and 154.8 MB in the end (delta: -51.2 MB). Peak memory consumption was 54.1 MB. Max. memory is 7.1 GB. [2020-07-20 17:40:59,051 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 147.3 MB. Free memory was 122.3 MB in the beginning and 122.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-20 17:40:59,051 INFO L168 Benchmark]: CACSL2BoogieTranslator took 315.63 ms. Allocated memory is still 147.3 MB. Free memory was 103.2 MB in the beginning and 92.4 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 7.1 GB. [2020-07-20 17:40:59,052 INFO L168 Benchmark]: Boogie Preprocessor took 164.24 ms. Allocated memory was 147.3 MB in the beginning and 204.5 MB in the end (delta: 57.1 MB). Free memory was 92.4 MB in the beginning and 182.1 MB in the end (delta: -89.7 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2020-07-20 17:40:59,052 INFO L168 Benchmark]: RCFGBuilder took 454.63 ms. Allocated memory is still 204.5 MB. Free memory was 182.1 MB in the beginning and 165.6 MB in the end (delta: 16.5 MB). Peak memory consumption was 16.5 MB. Max. memory is 7.1 GB. [2020-07-20 17:40:59,053 INFO L168 Benchmark]: TraceAbstraction took 242001.57 ms. Allocated memory was 204.5 MB in the beginning and 252.7 MB in the end (delta: 48.2 MB). Free memory was 165.0 MB in the beginning and 154.8 MB in the end (delta: 10.2 MB). Peak memory consumption was 58.4 MB. Max. memory is 7.1 GB. [2020-07-20 17:40:59,055 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.28 ms. Allocated memory is still 147.3 MB. Free memory was 122.3 MB in the beginning and 122.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 315.63 ms. Allocated memory is still 147.3 MB. Free memory was 103.2 MB in the beginning and 92.4 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 164.24 ms. Allocated memory was 147.3 MB in the beginning and 204.5 MB in the end (delta: 57.1 MB). Free memory was 92.4 MB in the beginning and 182.1 MB in the end (delta: -89.7 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 454.63 ms. Allocated memory is still 204.5 MB. Free memory was 182.1 MB in the beginning and 165.6 MB in the end (delta: 16.5 MB). Peak memory consumption was 16.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 242001.57 ms. Allocated memory was 204.5 MB in the beginning and 252.7 MB in the end (delta: 48.2 MB). Free memory was 165.0 MB in the beginning and 154.8 MB in the end (delta: 10.2 MB). Peak memory consumption was 58.4 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] = 1 [L30] b[0] = 1 [L31] i=1 VAL [\old(N)=0, a={-1:0}, b={1:0}, i=1, malloc(sizeof(long long)*N)={1:0}, malloc(sizeof(long long)*N)={-1:0}, N=2] [L31] COND TRUE i