/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops/sum_array-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 21:25:15,335 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 21:25:15,338 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 21:25:15,356 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 21:25:15,356 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 21:25:15,358 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 21:25:15,360 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 21:25:15,371 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 21:25:15,373 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 21:25:15,374 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 21:25:15,375 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 21:25:15,376 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 21:25:15,376 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 21:25:15,377 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 21:25:15,378 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 21:25:15,379 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 21:25:15,380 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 21:25:15,381 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 21:25:15,382 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 21:25:15,384 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 21:25:15,385 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 21:25:15,386 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 21:25:15,387 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 21:25:15,387 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 21:25:15,390 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 21:25:15,390 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 21:25:15,390 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 21:25:15,391 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 21:25:15,391 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 21:25:15,392 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 21:25:15,392 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 21:25:15,393 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 21:25:15,394 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 21:25:15,394 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 21:25:15,395 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 21:25:15,395 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 21:25:15,398 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 21:25:15,398 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 21:25:15,399 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 21:25:15,399 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 21:25:15,400 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 21:25:15,401 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 [2019-11-06 21:25:15,421 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 21:25:15,421 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 21:25:15,422 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 21:25:15,424 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 21:25:15,424 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 21:25:15,424 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 21:25:15,424 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 21:25:15,425 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 21:25:15,425 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 21:25:15,425 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 21:25:15,425 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 21:25:15,425 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 21:25:15,426 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 21:25:15,426 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 21:25:15,426 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 21:25:15,426 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 21:25:15,426 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 21:25:15,427 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 21:25:15,427 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 21:25:15,427 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 21:25:15,427 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 21:25:15,427 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 21:25:15,427 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 21:25:15,428 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 21:25:15,428 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 21:25:15,428 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 21:25:15,428 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 21:25:15,428 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 21:25:15,429 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-06 21:25:15,680 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 21:25:15,695 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 21:25:15,699 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 21:25:15,700 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 21:25:15,700 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 21:25:15,701 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum_array-2.i [2019-11-06 21:25:15,770 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79716a308/bf9298cad1ed4f9b97ca9b299486b97f/FLAGe91fb9a73 [2019-11-06 21:25:16,194 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 21:25:16,195 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum_array-2.i [2019-11-06 21:25:16,201 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79716a308/bf9298cad1ed4f9b97ca9b299486b97f/FLAGe91fb9a73 [2019-11-06 21:25:16,579 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79716a308/bf9298cad1ed4f9b97ca9b299486b97f [2019-11-06 21:25:16,588 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 21:25:16,589 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 21:25:16,590 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 21:25:16,590 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 21:25:16,594 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 21:25:16,594 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:25:16" (1/1) ... [2019-11-06 21:25:16,597 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a16e456 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:25:16, skipping insertion in model container [2019-11-06 21:25:16,597 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:25:16" (1/1) ... [2019-11-06 21:25:16,604 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 21:25:16,618 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 21:25:16,808 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 21:25:16,812 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 21:25:16,836 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 21:25:16,934 INFO L192 MainTranslator]: Completed translation [2019-11-06 21:25:16,935 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:25:16 WrapperNode [2019-11-06 21:25:16,936 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 21:25:16,936 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 21:25:16,936 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 21:25:16,937 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 21:25:16,950 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:25:16" (1/1) ... [2019-11-06 21:25:16,950 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:25:16" (1/1) ... [2019-11-06 21:25:16,958 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:25:16" (1/1) ... [2019-11-06 21:25:16,958 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:25:16" (1/1) ... [2019-11-06 21:25:16,973 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:25:16" (1/1) ... [2019-11-06 21:25:16,982 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:25:16" (1/1) ... [2019-11-06 21:25:16,984 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:25:16" (1/1) ... [2019-11-06 21:25:16,986 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 21:25:16,992 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 21:25:16,992 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 21:25:16,992 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 21:25:16,993 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:25:16" (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 [2019-11-06 21:25:17,042 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 21:25:17,042 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 21:25:17,042 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-11-06 21:25:17,043 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 21:25:17,043 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 21:25:17,043 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-06 21:25:17,043 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-06 21:25:17,043 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-11-06 21:25:17,044 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2019-11-06 21:25:17,044 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 21:25:17,044 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-06 21:25:17,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-06 21:25:17,044 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-06 21:25:17,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-06 21:25:17,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 21:25:17,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 21:25:17,381 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 21:25:17,381 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-06 21:25:17,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:25:17 BoogieIcfgContainer [2019-11-06 21:25:17,382 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 21:25:17,383 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 21:25:17,383 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 21:25:17,386 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 21:25:17,386 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:25:16" (1/3) ... [2019-11-06 21:25:17,387 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44c5c15d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:25:17, skipping insertion in model container [2019-11-06 21:25:17,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:25:16" (2/3) ... [2019-11-06 21:25:17,388 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44c5c15d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:25:17, skipping insertion in model container [2019-11-06 21:25:17,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:25:17" (3/3) ... [2019-11-06 21:25:17,390 INFO L109 eAbstractionObserver]: Analyzing ICFG sum_array-2.i [2019-11-06 21:25:17,399 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 21:25:17,406 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-06 21:25:17,417 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-06 21:25:17,441 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 21:25:17,441 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 21:25:17,441 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 21:25:17,441 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 21:25:17,441 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 21:25:17,442 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 21:25:17,442 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 21:25:17,442 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 21:25:17,458 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2019-11-06 21:25:17,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-06 21:25:17,463 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:25:17,464 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:25:17,466 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:25:17,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:25:17,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1823924036, now seen corresponding path program 1 times [2019-11-06 21:25:17,479 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:25:17,479 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936887253] [2019-11-06 21:25:17,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:25:17,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:25:17,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:25:17,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:25:17,649 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936887253] [2019-11-06 21:25:17,650 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:25:17,650 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:25:17,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097191673] [2019-11-06 21:25:17,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:25:17,656 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:25:17,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:25:17,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:25:17,672 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 3 states. [2019-11-06 21:25:17,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:25:17,792 INFO L93 Difference]: Finished difference Result 55 states and 73 transitions. [2019-11-06 21:25:17,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:25:17,794 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-06 21:25:17,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:25:17,806 INFO L225 Difference]: With dead ends: 55 [2019-11-06 21:25:17,806 INFO L226 Difference]: Without dead ends: 27 [2019-11-06 21:25:17,810 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:25:17,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-11-06 21:25:17,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-11-06 21:25:17,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-06 21:25:17,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2019-11-06 21:25:17,846 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 17 [2019-11-06 21:25:17,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:25:17,847 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2019-11-06 21:25:17,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:25:17,847 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2019-11-06 21:25:17,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-06 21:25:17,848 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:25:17,848 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:25:17,849 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:25:17,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:25:17,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1169658974, now seen corresponding path program 1 times [2019-11-06 21:25:17,850 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:25:17,850 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356901983] [2019-11-06 21:25:17,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:25:17,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:25:17,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:25:18,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:25:18,001 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356901983] [2019-11-06 21:25:18,001 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:25:18,002 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 21:25:18,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77815844] [2019-11-06 21:25:18,004 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 21:25:18,004 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:25:18,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 21:25:18,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 21:25:18,005 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 5 states. [2019-11-06 21:25:18,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:25:18,201 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2019-11-06 21:25:18,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 21:25:18,202 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-06 21:25:18,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:25:18,205 INFO L225 Difference]: With dead ends: 62 [2019-11-06 21:25:18,205 INFO L226 Difference]: Without dead ends: 39 [2019-11-06 21:25:18,206 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 21:25:18,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-11-06 21:25:18,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 30. [2019-11-06 21:25:18,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-06 21:25:18,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2019-11-06 21:25:18,218 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 17 [2019-11-06 21:25:18,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:25:18,218 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2019-11-06 21:25:18,219 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 21:25:18,219 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2019-11-06 21:25:18,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-06 21:25:18,220 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:25:18,221 INFO L410 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] [2019-11-06 21:25:18,222 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:25:18,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:25:18,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1835570138, now seen corresponding path program 1 times [2019-11-06 21:25:18,223 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:25:18,223 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569802995] [2019-11-06 21:25:18,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:25:18,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:25:19,243 WARN L191 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 34 [2019-11-06 21:25:19,482 WARN L191 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 44 [2019-11-06 21:25:19,846 WARN L191 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 47 [2019-11-06 21:25:19,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:25:19,927 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:25:19,928 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569802995] [2019-11-06 21:25:19,928 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [926946604] [2019-11-06 21:25:19,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:25:19,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:25:19,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-06 21:25:20,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:25:20,073 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:25:20,074 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2019-11-06 21:25:20,075 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:25:20,081 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:25:20,081 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:25:20,082 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:13 [2019-11-06 21:25:20,146 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-11-06 21:25:20,147 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:25:20,159 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:25:20,160 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:25:20,160 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2019-11-06 21:25:20,243 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2019-11-06 21:25:20,244 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:25:20,253 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:25:20,254 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:25:20,254 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:51, output treesize:5 [2019-11-06 21:25:20,309 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-06 21:25:20,309 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:25:20,309 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 20 [2019-11-06 21:25:20,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451481385] [2019-11-06 21:25:20,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-06 21:25:20,311 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:25:20,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-06 21:25:20,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2019-11-06 21:25:20,313 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 20 states. [2019-11-06 21:25:21,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:25:21,221 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2019-11-06 21:25:21,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-06 21:25:21,221 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 25 [2019-11-06 21:25:21,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:25:21,222 INFO L225 Difference]: With dead ends: 63 [2019-11-06 21:25:21,223 INFO L226 Difference]: Without dead ends: 46 [2019-11-06 21:25:21,224 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=172, Invalid=820, Unknown=0, NotChecked=0, Total=992 [2019-11-06 21:25:21,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-11-06 21:25:21,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2019-11-06 21:25:21,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-06 21:25:21,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2019-11-06 21:25:21,231 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 25 [2019-11-06 21:25:21,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:25:21,232 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2019-11-06 21:25:21,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-06 21:25:21,232 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2019-11-06 21:25:21,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-06 21:25:21,233 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:25:21,233 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 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, 1, 1] [2019-11-06 21:25:21,446 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:25:21,446 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:25:21,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:25:21,447 INFO L82 PathProgramCache]: Analyzing trace with hash 997765806, now seen corresponding path program 1 times [2019-11-06 21:25:21,447 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:25:21,447 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702392269] [2019-11-06 21:25:21,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:25:21,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:25:21,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:25:21,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:25:21,668 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-06 21:25:21,668 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702392269] [2019-11-06 21:25:21,668 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1190625614] [2019-11-06 21:25:21,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:25:21,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:25:21,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-06 21:25:21,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:25:21,782 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-06 21:25:21,782 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:25:21,782 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 12 [2019-11-06 21:25:21,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886271615] [2019-11-06 21:25:21,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-06 21:25:21,785 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:25:21,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-06 21:25:21,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-11-06 21:25:21,785 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 12 states. [2019-11-06 21:25:22,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:25:22,052 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2019-11-06 21:25:22,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-06 21:25:22,052 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 36 [2019-11-06 21:25:22,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:25:22,054 INFO L225 Difference]: With dead ends: 76 [2019-11-06 21:25:22,054 INFO L226 Difference]: Without dead ends: 55 [2019-11-06 21:25:22,054 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-11-06 21:25:22,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-06 21:25:22,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 44. [2019-11-06 21:25:22,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-06 21:25:22,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2019-11-06 21:25:22,063 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 36 [2019-11-06 21:25:22,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:25:22,063 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2019-11-06 21:25:22,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-06 21:25:22,064 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2019-11-06 21:25:22,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-06 21:25:22,065 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:25:22,065 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:25:22,269 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:25:22,269 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:25:22,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:25:22,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1913486187, now seen corresponding path program 2 times [2019-11-06 21:25:22,271 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:25:22,271 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021567134] [2019-11-06 21:25:22,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:25:22,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:25:22,664 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2019-11-06 21:25:22,997 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 38 [2019-11-06 21:25:23,332 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 47 [2019-11-06 21:25:23,781 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 39 [2019-11-06 21:25:23,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:25:23,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:25:23,898 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:25:23,899 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021567134] [2019-11-06 21:25:23,899 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [683934278] [2019-11-06 21:25:23,899 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:25:23,973 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-06 21:25:23,973 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 21:25:23,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 42 conjunts are in the unsatisfiable core [2019-11-06 21:25:23,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:25:23,999 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:25:24,000 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2019-11-06 21:25:24,000 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:25:24,029 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:25:24,030 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:25:24,030 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:22 [2019-11-06 21:25:24,279 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-11-06 21:25:24,280 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:25:24,294 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:25:24,294 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:25:24,295 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:46, output treesize:42 [2019-11-06 21:25:24,772 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 15 [2019-11-06 21:25:24,772 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:25:24,780 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:25:24,781 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:25:24,781 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:55, output treesize:5 [2019-11-06 21:25:24,849 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-06 21:25:24,850 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:25:24,850 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 14] total 30 [2019-11-06 21:25:24,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974272879] [2019-11-06 21:25:24,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-11-06 21:25:24,851 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:25:24,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-11-06 21:25:24,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2019-11-06 21:25:24,852 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand 30 states. [2019-11-06 21:25:27,919 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 55 [2019-11-06 21:25:29,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:25:29,270 INFO L93 Difference]: Finished difference Result 88 states and 96 transitions. [2019-11-06 21:25:29,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-11-06 21:25:29,270 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 41 [2019-11-06 21:25:29,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:25:29,271 INFO L225 Difference]: With dead ends: 88 [2019-11-06 21:25:29,271 INFO L226 Difference]: Without dead ends: 62 [2019-11-06 21:25:29,273 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 568 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=347, Invalid=2409, Unknown=0, NotChecked=0, Total=2756 [2019-11-06 21:25:29,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-11-06 21:25:29,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 55. [2019-11-06 21:25:29,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-11-06 21:25:29,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2019-11-06 21:25:29,283 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 41 [2019-11-06 21:25:29,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:25:29,283 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2019-11-06 21:25:29,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-11-06 21:25:29,284 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2019-11-06 21:25:29,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-06 21:25:29,285 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:25:29,285 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:25:29,488 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:25:29,488 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:25:29,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:25:29,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1732717085, now seen corresponding path program 3 times [2019-11-06 21:25:29,489 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:25:29,490 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941029674] [2019-11-06 21:25:29,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:25:29,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:25:29,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:25:29,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:25:29,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:25:29,747 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-06 21:25:29,748 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941029674] [2019-11-06 21:25:29,748 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166338587] [2019-11-06 21:25:29,748 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:25:29,807 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-06 21:25:29,807 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 21:25:29,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-06 21:25:29,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:25:30,001 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-06 21:25:30,001 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:25:30,002 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 17 [2019-11-06 21:25:30,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101035201] [2019-11-06 21:25:30,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-06 21:25:30,003 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:25:30,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-06 21:25:30,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2019-11-06 21:25:30,003 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 17 states. [2019-11-06 21:25:30,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:25:30,551 INFO L93 Difference]: Finished difference Result 102 states and 109 transitions. [2019-11-06 21:25:30,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-06 21:25:30,552 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 52 [2019-11-06 21:25:30,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:25:30,553 INFO L225 Difference]: With dead ends: 102 [2019-11-06 21:25:30,554 INFO L226 Difference]: Without dead ends: 71 [2019-11-06 21:25:30,555 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2019-11-06 21:25:30,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-06 21:25:30,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 60. [2019-11-06 21:25:30,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-06 21:25:30,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2019-11-06 21:25:30,567 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 52 [2019-11-06 21:25:30,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:25:30,568 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2019-11-06 21:25:30,568 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-06 21:25:30,568 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2019-11-06 21:25:30,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-06 21:25:30,570 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:25:30,570 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:25:30,773 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:25:30,773 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:25:30,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:25:30,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1071400400, now seen corresponding path program 4 times [2019-11-06 21:25:30,774 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:25:30,774 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501521831] [2019-11-06 21:25:30,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:25:30,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:25:31,646 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 37 [2019-11-06 21:25:31,974 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 36 [2019-11-06 21:25:32,154 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 42 [2019-11-06 21:25:32,311 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 36 [2019-11-06 21:25:32,578 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 31 [2019-11-06 21:25:33,012 WARN L191 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 205 DAG size of output: 60 [2019-11-06 21:25:33,271 WARN L191 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 60 [2019-11-06 21:25:33,692 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 40 [2019-11-06 21:25:33,921 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 33 [2019-11-06 21:25:34,191 WARN L191 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 41 [2019-11-06 21:25:34,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:25:34,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:25:34,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:25:34,336 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 4 proven. 41 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-06 21:25:34,336 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501521831] [2019-11-06 21:25:34,336 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [377320600] [2019-11-06 21:25:34,336 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:25:34,406 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-06 21:25:34,407 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 21:25:34,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 49 conjunts are in the unsatisfiable core [2019-11-06 21:25:34,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:25:34,421 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:25:34,421 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2019-11-06 21:25:34,422 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:25:34,428 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:25:34,428 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:25:34,429 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:16 [2019-11-06 21:25:34,632 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-06 21:25:34,632 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:25:34,643 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:25:34,643 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:25:34,644 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2019-11-06 21:25:34,661 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 62 [2019-11-06 21:25:34,662 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:25:34,698 INFO L567 ElimStorePlain]: treesize reduction 70, result has 42.1 percent of original size [2019-11-06 21:25:34,699 INFO L464 ElimStorePlain]: Eliminatee v_prenex_2 vanished before elimination [2019-11-06 21:25:34,699 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:25:34,700 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:125, output treesize:51 [2019-11-06 21:25:34,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:25:34,825 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:25:34,826 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:25:34,827 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:25:34,849 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 112 [2019-11-06 21:25:34,850 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:25:34,856 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-11-06 21:25:34,856 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:25:34,890 INFO L567 ElimStorePlain]: treesize reduction 5, result has 94.8 percent of original size [2019-11-06 21:25:34,892 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:25:34,893 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:207, output treesize:92 [2019-11-06 21:25:35,042 INFO L341 Elim1Store]: treesize reduction 124, result has 12.1 percent of original size [2019-11-06 21:25:35,043 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 3 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 9 case distinctions, treesize of input 68 treesize of output 88 [2019-11-06 21:25:35,044 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:25:35,059 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:25:35,059 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:25:35,060 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:80, output treesize:76 [2019-11-06 21:25:37,270 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#C~0.base_BEFORE_CALL_2| Int) (|v_main_~#C~0.offset_BEFORE_CALL_2| Int) (|v_main_~#B~0.offset_BEFORE_CALL_2| Int) (|v_main_~#B~0.base_BEFORE_CALL_2| Int) (|v_main_~#A~0.offset_BEFORE_CALL_2| Int) (|v_main_~#A~0.base_BEFORE_CALL_2| Int)) (let ((.cse0 (select |c_#memory_int| |v_main_~#C~0.base_BEFORE_CALL_2|)) (.cse1 (select |c_#memory_int| |v_main_~#B~0.base_BEFORE_CALL_2|)) (.cse2 (select |c_#memory_int| |v_main_~#A~0.base_BEFORE_CALL_2|))) (and (not (= |v_main_~#C~0.base_BEFORE_CALL_2| |v_main_~#B~0.base_BEFORE_CALL_2|)) (= (select .cse0 (+ |v_main_~#C~0.offset_BEFORE_CALL_2| 8)) (+ (select .cse1 (+ |v_main_~#B~0.offset_BEFORE_CALL_2| 8)) (select .cse2 (+ |v_main_~#A~0.offset_BEFORE_CALL_2| 8)))) (= (select .cse0 (+ |v_main_~#C~0.offset_BEFORE_CALL_2| 4)) (+ (select .cse1 (+ |v_main_~#B~0.offset_BEFORE_CALL_2| 4)) (select .cse2 (+ |v_main_~#A~0.offset_BEFORE_CALL_2| 4)))) (= (select .cse0 |v_main_~#C~0.offset_BEFORE_CALL_2|) (+ (select .cse1 |v_main_~#B~0.offset_BEFORE_CALL_2|) (select .cse2 |v_main_~#A~0.offset_BEFORE_CALL_2|))) (not (= |v_main_~#A~0.base_BEFORE_CALL_2| |v_main_~#C~0.base_BEFORE_CALL_2|)) (not (= |v_main_~#A~0.base_BEFORE_CALL_2| |v_main_~#B~0.base_BEFORE_CALL_2|))))) is different from true [2019-11-06 21:25:39,469 WARN L191 SmtUtils]: Spent 2.11 s on a formula simplification that was a NOOP. DAG size: 45 [2019-11-06 21:25:41,839 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#C~0.base_BEFORE_CALL_3| Int) (|v_main_~#B~0.base_BEFORE_CALL_3| Int) (|v_main_~#C~0.offset_BEFORE_CALL_3| Int) (|v_main_~#A~0.base_BEFORE_CALL_3| Int) (|v_main_~#B~0.offset_BEFORE_CALL_3| Int) (|v_main_~#A~0.offset_BEFORE_CALL_3| Int)) (let ((.cse2 (select |c_#memory_int| |v_main_~#C~0.base_BEFORE_CALL_3|)) (.cse1 (select |c_#memory_int| |v_main_~#A~0.base_BEFORE_CALL_3|)) (.cse0 (select |c_#memory_int| |v_main_~#B~0.base_BEFORE_CALL_3|))) (and (not (= |v_main_~#C~0.base_BEFORE_CALL_3| |v_main_~#B~0.base_BEFORE_CALL_3|)) (= (+ (select .cse0 |v_main_~#B~0.offset_BEFORE_CALL_3|) (select .cse1 |v_main_~#A~0.offset_BEFORE_CALL_3|)) (select .cse2 |v_main_~#C~0.offset_BEFORE_CALL_3|)) (not (= |v_main_~#A~0.base_BEFORE_CALL_3| |v_main_~#B~0.base_BEFORE_CALL_3|)) (not (= |v_main_~#A~0.base_BEFORE_CALL_3| |v_main_~#C~0.base_BEFORE_CALL_3|)) (= (select .cse2 (+ |v_main_~#C~0.offset_BEFORE_CALL_3| 8)) (+ (select .cse0 (+ |v_main_~#B~0.offset_BEFORE_CALL_3| 8)) (select .cse1 (+ |v_main_~#A~0.offset_BEFORE_CALL_3| 8)))) (= (select .cse2 (+ |v_main_~#C~0.offset_BEFORE_CALL_3| 4)) (+ (select .cse1 (+ |v_main_~#A~0.offset_BEFORE_CALL_3| 4)) (select .cse0 (+ |v_main_~#B~0.offset_BEFORE_CALL_3| 4))))))) is different from true [2019-11-06 21:25:42,058 INFO L341 Elim1Store]: treesize reduction 96, result has 1.0 percent of original size [2019-11-06 21:25:42,059 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 3 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 9 case distinctions, treesize of input 91 treesize of output 25 [2019-11-06 21:25:42,061 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:25:42,068 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:25:42,068 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:25:42,068 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:103, output treesize:5 [2019-11-06 21:25:42,174 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 1 trivial. 7 not checked. [2019-11-06 21:25:42,174 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:25:42,174 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21] total 41 [2019-11-06 21:25:42,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489652943] [2019-11-06 21:25:42,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-11-06 21:25:42,175 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:25:42,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-11-06 21:25:42,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1353, Unknown=2, NotChecked=150, Total=1640 [2019-11-06 21:25:42,177 INFO L87 Difference]: Start difference. First operand 60 states and 63 transitions. Second operand 41 states. [2019-11-06 21:25:43,702 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 69 [2019-11-06 21:25:43,941 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 78 [2019-11-06 21:25:45,744 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 83 [2019-11-06 21:25:48,143 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 65 [2019-11-06 21:25:48,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:25:48,664 INFO L93 Difference]: Finished difference Result 127 states and 138 transitions. [2019-11-06 21:25:48,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-11-06 21:25:48,665 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 57 [2019-11-06 21:25:48,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:25:48,666 INFO L225 Difference]: With dead ends: 127 [2019-11-06 21:25:48,666 INFO L226 Difference]: Without dead ends: 78 [2019-11-06 21:25:48,671 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 47 SyntacticMatches, 9 SemanticMatches, 66 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1133 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=484, Invalid=3812, Unknown=2, NotChecked=258, Total=4556 [2019-11-06 21:25:48,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-06 21:25:48,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 71. [2019-11-06 21:25:48,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-06 21:25:48,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2019-11-06 21:25:48,699 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 57 [2019-11-06 21:25:48,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:25:48,705 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2019-11-06 21:25:48,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-11-06 21:25:48,705 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2019-11-06 21:25:48,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-06 21:25:48,706 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:25:48,706 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:25:48,911 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:25:48,912 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:25:48,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:25:48,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1892204120, now seen corresponding path program 5 times [2019-11-06 21:25:48,913 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:25:48,913 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958873227] [2019-11-06 21:25:48,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:25:48,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:25:49,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:25:49,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:25:49,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:25:49,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:25:49,190 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 6 proven. 34 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-06 21:25:49,190 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958873227] [2019-11-06 21:25:49,190 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [350635277] [2019-11-06 21:25:49,191 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true