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 --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/loop-acceleration/diamond_2-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:05:27,655 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:05:27,661 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:05:27,676 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:05:27,677 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:05:27,678 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:05:27,679 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:05:27,682 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:05:27,689 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:05:27,690 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:05:27,691 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:05:27,695 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:05:27,695 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:05:27,697 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:05:27,699 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:05:27,701 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:05:27,702 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:05:27,705 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:05:27,707 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:05:27,712 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:05:27,715 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:05:27,717 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:05:27,718 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:05:27,720 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:05:27,724 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:05:27,724 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:05:27,724 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:05:27,726 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:05:27,727 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:05:27,730 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:05:27,731 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:05:27,732 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:05:27,733 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:05:27,734 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:05:27,737 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:05:27,737 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:05:27,738 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:05:27,738 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:05:27,739 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:05:27,739 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:05:27,742 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:05:27,743 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-10-13 21:05:27,770 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:05:27,771 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:05:27,772 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:05:27,772 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:05:27,772 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:05:27,773 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:05:27,773 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:05:27,773 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:05:27,773 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:05:27,773 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:05:27,774 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:05:27,774 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:05:27,774 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:05:27,774 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:05:27,774 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:05:27,775 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:05:27,775 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:05:27,775 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:05:27,776 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:05:27,777 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:05:27,777 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:05:27,777 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:05:27,777 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:05:27,777 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:05:27,778 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:05:27,778 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:05:27,778 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:05:27,778 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:05:27,779 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-13 21:05:28,057 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:05:28,069 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:05:28,072 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:05:28,074 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:05:28,074 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:05:28,075 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/diamond_2-2.c [2019-10-13 21:05:28,145 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a1a5e9c8/6879febe1aa043909c6393ad052a325e/FLAGdc52a2c3a [2019-10-13 21:05:28,605 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:05:28,605 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/diamond_2-2.c [2019-10-13 21:05:28,613 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a1a5e9c8/6879febe1aa043909c6393ad052a325e/FLAGdc52a2c3a [2019-10-13 21:05:28,950 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a1a5e9c8/6879febe1aa043909c6393ad052a325e [2019-10-13 21:05:28,961 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:05:28,963 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:05:28,964 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:05:28,964 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:05:28,967 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:05:28,968 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:05:28" (1/1) ... [2019-10-13 21:05:28,971 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bae8b18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:28, skipping insertion in model container [2019-10-13 21:05:28,972 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:05:28" (1/1) ... [2019-10-13 21:05:28,980 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:05:28,998 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:05:29,221 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:05:29,226 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:05:29,249 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:05:29,264 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:05:29,265 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:29 WrapperNode [2019-10-13 21:05:29,265 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:05:29,266 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:05:29,266 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:05:29,266 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:05:29,362 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:29" (1/1) ... [2019-10-13 21:05:29,363 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:29" (1/1) ... [2019-10-13 21:05:29,379 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:29" (1/1) ... [2019-10-13 21:05:29,379 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:29" (1/1) ... [2019-10-13 21:05:29,388 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:29" (1/1) ... [2019-10-13 21:05:29,397 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:29" (1/1) ... [2019-10-13 21:05:29,398 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:29" (1/1) ... [2019-10-13 21:05:29,400 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:05:29,400 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:05:29,400 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:05:29,401 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:05:29,401 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:29" (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-10-13 21:05:29,460 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:05:29,460 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:05:29,460 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-13 21:05:29,460 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:05:29,460 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:05:29,461 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2019-10-13 21:05:29,461 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-13 21:05:29,461 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:05:29,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:05:29,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:05:29,732 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:05:29,732 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-13 21:05:29,733 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:05:29 BoogieIcfgContainer [2019-10-13 21:05:29,734 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:05:29,735 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:05:29,735 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:05:29,738 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:05:29,739 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:05:28" (1/3) ... [2019-10-13 21:05:29,740 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e4ed755 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:05:29, skipping insertion in model container [2019-10-13 21:05:29,740 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:29" (2/3) ... [2019-10-13 21:05:29,740 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e4ed755 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:05:29, skipping insertion in model container [2019-10-13 21:05:29,740 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:05:29" (3/3) ... [2019-10-13 21:05:29,742 INFO L109 eAbstractionObserver]: Analyzing ICFG diamond_2-2.c [2019-10-13 21:05:29,752 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:05:29,761 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:05:29,773 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:05:29,798 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:05:29,798 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:05:29,799 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:05:29,799 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:05:29,799 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:05:29,799 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:05:29,799 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:05:29,800 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:05:29,818 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2019-10-13 21:05:29,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-13 21:05:29,824 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:29,825 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:05:29,827 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:29,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:29,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1906239810, now seen corresponding path program 1 times [2019-10-13 21:05:29,840 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:29,840 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301549109] [2019-10-13 21:05:29,841 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:29,841 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:29,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:29,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:29,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:05:29,947 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301549109] [2019-10-13 21:05:29,948 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:29,948 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-13 21:05:29,949 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300084021] [2019-10-13 21:05:29,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-13 21:05:29,954 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:29,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-13 21:05:29,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-13 21:05:29,970 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 2 states. [2019-10-13 21:05:29,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:29,988 INFO L93 Difference]: Finished difference Result 38 states and 51 transitions. [2019-10-13 21:05:29,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-13 21:05:29,989 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-10-13 21:05:29,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:29,997 INFO L225 Difference]: With dead ends: 38 [2019-10-13 21:05:29,998 INFO L226 Difference]: Without dead ends: 21 [2019-10-13 21:05:30,001 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-13 21:05:30,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-10-13 21:05:30,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-10-13 21:05:30,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-13 21:05:30,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 31 transitions. [2019-10-13 21:05:30,038 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 31 transitions. Word has length 10 [2019-10-13 21:05:30,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:30,039 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 31 transitions. [2019-10-13 21:05:30,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-13 21:05:30,039 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 31 transitions. [2019-10-13 21:05:30,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-13 21:05:30,040 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:30,040 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:05:30,040 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:30,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:30,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1847134466, now seen corresponding path program 1 times [2019-10-13 21:05:30,041 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:30,042 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121152960] [2019-10-13 21:05:30,042 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:30,042 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:30,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:30,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:30,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:05:30,177 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121152960] [2019-10-13 21:05:30,178 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:30,178 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:30,178 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589059240] [2019-10-13 21:05:30,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:30,181 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:30,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:30,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:30,182 INFO L87 Difference]: Start difference. First operand 21 states and 31 transitions. Second operand 3 states. [2019-10-13 21:05:30,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:30,363 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2019-10-13 21:05:30,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:30,364 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-10-13 21:05:30,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:30,367 INFO L225 Difference]: With dead ends: 28 [2019-10-13 21:05:30,367 INFO L226 Difference]: Without dead ends: 23 [2019-10-13 21:05:30,368 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:30,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-10-13 21:05:30,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-10-13 21:05:30,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-13 21:05:30,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 32 transitions. [2019-10-13 21:05:30,376 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 32 transitions. Word has length 10 [2019-10-13 21:05:30,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:30,377 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 32 transitions. [2019-10-13 21:05:30,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:30,377 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 32 transitions. [2019-10-13 21:05:30,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-13 21:05:30,378 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:30,379 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:05:30,379 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:30,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:30,380 INFO L82 PathProgramCache]: Analyzing trace with hash -129940435, now seen corresponding path program 1 times [2019-10-13 21:05:30,380 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:30,380 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576168393] [2019-10-13 21:05:30,380 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:30,381 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:30,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:30,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:30,529 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:05:30,530 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576168393] [2019-10-13 21:05:30,530 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:30,530 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:05:30,531 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728155324] [2019-10-13 21:05:30,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:05:30,531 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:30,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:05:30,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:30,532 INFO L87 Difference]: Start difference. First operand 22 states and 32 transitions. Second operand 3 states. [2019-10-13 21:05:30,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:30,657 INFO L93 Difference]: Finished difference Result 50 states and 81 transitions. [2019-10-13 21:05:30,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:05:30,658 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-13 21:05:30,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:30,660 INFO L225 Difference]: With dead ends: 50 [2019-10-13 21:05:30,660 INFO L226 Difference]: Without dead ends: 34 [2019-10-13 21:05:30,661 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:05:30,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-10-13 21:05:30,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-10-13 21:05:30,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-13 21:05:30,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2019-10-13 21:05:30,668 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 21 [2019-10-13 21:05:30,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:30,669 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2019-10-13 21:05:30,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:05:30,669 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2019-10-13 21:05:30,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-13 21:05:30,670 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:30,670 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:05:30,670 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:30,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:30,671 INFO L82 PathProgramCache]: Analyzing trace with hash 263086575, now seen corresponding path program 1 times [2019-10-13 21:05:30,671 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:30,671 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610017330] [2019-10-13 21:05:30,671 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:30,672 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:30,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:30,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:31,020 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:05:31,021 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610017330] [2019-10-13 21:05:31,021 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1225499762] [2019-10-13 21:05:31,021 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-10-13 21:05:31,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:31,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-13 21:05:31,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:05:31,141 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:05:31,141 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:05:32,658 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:05:32,658 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1025815302] [2019-10-13 21:05:32,665 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 22 [2019-10-13 21:05:32,704 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-13 21:05:32,704 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-13 21:05:32,758 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-13 21:05:33,400 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-13 21:05:33,404 INFO L272 AbstractInterpreter]: Visited 21 different actions 101 times. Merged at 12 different actions 60 times. Widened at 1 different actions 3 times. Performed 227 root evaluator evaluations with a maximum evaluation depth of 13. Performed 227 inverse root evaluator evaluations with a maximum inverse evaluation depth of 13. Found 1 fixpoints after 1 different actions. Largest state had 3 variables. [2019-10-13 21:05:33,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:33,411 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-13 21:05:33,411 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-13 21:05:33,411 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2019-10-13 21:05:33,411 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540420896] [2019-10-13 21:05:33,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-13 21:05:33,414 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:33,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-13 21:05:33,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2019-10-13 21:05:33,418 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. Second operand 25 states. [2019-10-13 21:05:34,241 WARN L191 SmtUtils]: Spent 563.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 10 [2019-10-13 21:05:37,079 WARN L191 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 12 [2019-10-13 21:05:40,106 WARN L191 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 10 [2019-10-13 21:05:44,876 WARN L191 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 10 [2019-10-13 21:05:46,199 WARN L191 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 10 [2019-10-13 21:05:49,394 WARN L191 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 10 [2019-10-13 21:05:50,053 WARN L191 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 12 [2019-10-13 21:05:51,638 WARN L191 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 12 [2019-10-13 21:05:52,741 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 10 [2019-10-13 21:06:01,375 WARN L191 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 12 [2019-10-13 21:06:01,712 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2019-10-13 21:06:02,890 WARN L191 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 12 [2019-10-13 21:06:05,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:06:05,878 INFO L93 Difference]: Finished difference Result 128 states and 148 transitions. [2019-10-13 21:06:05,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-13 21:06:05,884 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 21 [2019-10-13 21:06:05,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:06:05,886 INFO L225 Difference]: With dead ends: 128 [2019-10-13 21:06:05,887 INFO L226 Difference]: Without dead ends: 123 [2019-10-13 21:06:05,889 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 26.9s TimeCoverageRelationStatistics Valid=593, Invalid=1045, Unknown=2, NotChecked=0, Total=1640 [2019-10-13 21:06:05,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-10-13 21:06:05,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 55. [2019-10-13 21:06:05,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-10-13 21:06:05,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 67 transitions. [2019-10-13 21:06:05,908 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 67 transitions. Word has length 21 [2019-10-13 21:06:05,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:06:05,908 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 67 transitions. [2019-10-13 21:06:05,909 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-13 21:06:05,909 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 67 transitions. [2019-10-13 21:06:05,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-13 21:06:05,910 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:06:05,910 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:06:06,116 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:06:06,122 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:06:06,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:06:06,122 INFO L82 PathProgramCache]: Analyzing trace with hash -402778255, now seen corresponding path program 1 times [2019-10-13 21:06:06,122 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:06:06,123 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099507914] [2019-10-13 21:06:06,123 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:06,123 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:06,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:06:06,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:06:06,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:06:06,247 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099507914] [2019-10-13 21:06:06,248 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:06:06,248 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:06:06,248 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116988850] [2019-10-13 21:06:06,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:06:06,249 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:06:06,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:06:06,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:06:06,250 INFO L87 Difference]: Start difference. First operand 55 states and 67 transitions. Second operand 3 states. [2019-10-13 21:06:06,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:06:06,331 INFO L93 Difference]: Finished difference Result 82 states and 94 transitions. [2019-10-13 21:06:06,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:06:06,332 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-13 21:06:06,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:06:06,333 INFO L225 Difference]: With dead ends: 82 [2019-10-13 21:06:06,333 INFO L226 Difference]: Without dead ends: 56 [2019-10-13 21:06:06,334 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:06:06,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-10-13 21:06:06,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2019-10-13 21:06:06,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-10-13 21:06:06,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2019-10-13 21:06:06,341 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 21 [2019-10-13 21:06:06,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:06:06,342 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2019-10-13 21:06:06,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:06:06,342 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2019-10-13 21:06:06,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-13 21:06:06,343 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:06:06,343 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:06:06,343 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:06:06,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:06:06,344 INFO L82 PathProgramCache]: Analyzing trace with hash -345519953, now seen corresponding path program 1 times [2019-10-13 21:06:06,344 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:06:06,344 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921234823] [2019-10-13 21:06:06,344 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:06,344 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:06,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:06:06,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:06:08,624 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse8 (div c_main_~y~0 2))) (let ((.cse18 (* 2 .cse8))) (let ((.cse15 (* 4294967296 (div c_main_~y~0 4294967296))) (.cse13 (= c_main_~y~0 .cse18)) (.cse19 (* .cse8 (- 2)))) (let ((.cse17 (div (+ .cse19 c_main_~y~0) 4294967296)) (.cse1 (not .cse13)) (.cse2 (< c_main_~y~0 .cse15)) (.cse16 (div (+ .cse19 c_main_~y~0 (- 2)) 4294967296))) (let ((.cse0 (+ .cse18 (* 4294967296 .cse16) 2)) (.cse14 (<= .cse15 c_main_~y~0)) (.cse12 (and .cse1 .cse2)) (.cse11 (+ .cse18 (* 4294967296 .cse17)))) (let ((.cse4 (or .cse12 (< .cse11 c_main_~y~0))) (.cse10 (+ .cse17 1)) (.cse3 (+ .cse16 1)) (.cse7 (or .cse13 .cse14)) (.cse9 (or (< .cse0 c_main_~y~0) .cse13 .cse14))) (and (or (and (<= c_main_~y~0 .cse0) .cse1 .cse2) (and .cse1 .cse2 (<= .cse3 0)) (and .cse4 (let ((.cse5 (* 2 c_main_~y~0)) (.cse6 (* 4 .cse8))) (or (and .cse1 .cse2 (<= (+ .cse5 (* 2 (div (+ c_main_~x~0 2) 2))) (+ .cse6 c_main_~x~0 5))) (and (<= (+ .cse5 (* 2 (div c_main_~x~0 2))) (+ .cse6 c_main_~x~0 1)) .cse7))) .cse9) (and (<= .cse10 0) .cse7) (and (<= c_main_~y~0 .cse11) .cse7)) (or .cse12 (not (= .cse11 c_main_~y~0))) .cse4 (or (not (= c_main_~y~0 .cse0)) .cse13 .cse14) (< .cse15 (+ c_main_~y~0 1)) (or .cse12 .cse13 .cse14) (or (and (<= 0 .cse16) .cse1 .cse2) (and (or .cse12 (< 0 .cse10)) (or (< 0 .cse3) .cse13 .cse14)) (and (<= 0 .cse17) .cse7)) .cse9))))))) is different from false [2019-10-13 21:06:10,667 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse12 (div c_main_~y~0 2))) (let ((.cse18 (* 2 .cse12))) (let ((.cse15 (* 4294967296 (div c_main_~y~0 4294967296))) (.cse4 (= c_main_~y~0 .cse18)) (.cse19 (* .cse12 (- 2)))) (let ((.cse17 (div (+ .cse19 c_main_~y~0) 4294967296)) (.cse6 (not .cse4)) (.cse7 (< c_main_~y~0 .cse15)) (.cse16 (div (+ .cse19 c_main_~y~0 (- 2)) 4294967296))) (let ((.cse3 (+ .cse18 (* 4294967296 .cse16) 2)) (.cse5 (<= .cse15 c_main_~y~0)) (.cse0 (and .cse6 .cse7)) (.cse1 (+ .cse18 (* 4294967296 .cse17)))) (let ((.cse2 (or .cse0 (< .cse1 c_main_~y~0))) (.cse14 (+ .cse17 1)) (.cse13 (+ .cse16 1)) (.cse11 (or .cse4 .cse5)) (.cse8 (or (< .cse3 c_main_~y~0) .cse4 .cse5))) (and (or .cse0 (not (= .cse1 c_main_~y~0))) .cse2 (or (not (= c_main_~y~0 .cse3)) .cse4 .cse5) (or (and (<= c_main_~y~0 .cse3) .cse6 .cse7) (and .cse2 .cse8 (let ((.cse9 (* 2 c_main_~y~0)) (.cse10 (* 4 .cse12))) (or (and .cse6 .cse7 (<= (+ .cse9 (* 2 (div (+ c_main_~x~0 4) 2))) (+ .cse10 c_main_~x~0 7))) (and (<= (+ .cse9 (* 2 (div (+ c_main_~x~0 2) 2))) (+ .cse10 c_main_~x~0 3)) .cse11)))) (and .cse6 .cse7 (<= .cse13 0)) (and (<= .cse14 0) .cse11) (and (<= c_main_~y~0 .cse1) .cse11)) (< .cse15 (+ c_main_~y~0 1)) (or .cse0 .cse4 .cse5) (or (and (<= 0 .cse16) .cse6 .cse7) (and (or .cse0 (< 0 .cse14)) (or (< 0 .cse13) .cse4 .cse5)) (and (<= 0 .cse17) .cse11)) .cse8))))))) is different from false [2019-10-13 21:06:12,682 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse12 (div c_main_~y~0 2))) (let ((.cse18 (* 2 .cse12))) (let ((.cse15 (* 4294967296 (div c_main_~y~0 4294967296))) (.cse4 (= c_main_~y~0 .cse18)) (.cse19 (* .cse12 (- 2)))) (let ((.cse17 (div (+ .cse19 c_main_~y~0) 4294967296)) (.cse6 (not .cse4)) (.cse7 (< c_main_~y~0 .cse15)) (.cse16 (div (+ .cse19 c_main_~y~0 (- 2)) 4294967296))) (let ((.cse3 (+ .cse18 (* 4294967296 .cse16) 2)) (.cse5 (<= .cse15 c_main_~y~0)) (.cse0 (and .cse6 .cse7)) (.cse1 (+ .cse18 (* 4294967296 .cse17)))) (let ((.cse2 (or .cse0 (< .cse1 c_main_~y~0))) (.cse14 (+ .cse17 1)) (.cse13 (+ .cse16 1)) (.cse11 (or .cse4 .cse5)) (.cse8 (or (< .cse3 c_main_~y~0) .cse4 .cse5))) (and (or .cse0 (not (= .cse1 c_main_~y~0))) .cse2 (or (not (= c_main_~y~0 .cse3)) .cse4 .cse5) (or (and (<= c_main_~y~0 .cse3) .cse6 .cse7) (and .cse2 .cse8 (let ((.cse9 (* 2 c_main_~y~0)) (.cse10 (* 4 .cse12))) (or (and .cse6 .cse7 (<= (+ .cse9 (* 2 (div (+ c_main_~x~0 4) 2))) (+ .cse10 c_main_~x~0 7))) (and (<= (+ .cse9 (* 2 (div (+ c_main_~x~0 2) 2))) (+ .cse10 c_main_~x~0 3)) .cse11)))) (and .cse6 .cse7 (<= .cse13 0)) (and (<= .cse14 0) .cse11) (and (<= c_main_~y~0 .cse1) .cse11)) (< .cse15 (+ c_main_~y~0 1)) (or .cse0 .cse4 .cse5) (or (and (<= 0 .cse16) .cse6 .cse7) (and (or .cse0 (< 0 .cse14)) (or (< 0 .cse13) .cse4 .cse5)) (and (<= 0 .cse17) .cse11)) .cse8))))))) is different from true [2019-10-13 21:06:14,718 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse19 (div c_main_~y~0 2))) (let ((.cse0 (* 2 .cse19)) (.cse21 (* .cse19 (- 2)))) (let ((.cse12 (div (+ .cse21 c_main_~y~0 (- 2)) 4294967296)) (.cse20 (* 4294967296 (div c_main_~y~0 4294967296))) (.cse10 (= c_main_~y~0 .cse0)) (.cse15 (div (+ .cse21 c_main_~y~0) 4294967296))) (let ((.cse1 (* 4294967296 .cse15)) (.cse3 (not .cse10)) (.cse4 (< c_main_~y~0 .cse20)) (.cse5 (* 4294967296 .cse12))) (let ((.cse9 (+ .cse0 .cse5 2)) (.cse11 (<= .cse20 c_main_~y~0)) (.cse6 (and .cse3 .cse4)) (.cse7 (+ .cse0 .cse1))) (let ((.cse14 (+ .cse12 1)) (.cse13 (+ .cse15 1)) (.cse8 (or .cse6 (< .cse7 c_main_~y~0))) (.cse2 (or .cse10 .cse11)) (.cse16 (or (< .cse9 c_main_~y~0) .cse10 .cse11))) (and (or (and (<= c_main_~y~0 (+ .cse0 .cse1 4294967295)) .cse2) (and .cse3 .cse4 (<= c_main_~y~0 (+ .cse0 .cse5 4294967297)))) (or .cse6 (not (= .cse7 c_main_~y~0))) .cse8 (or (not (= c_main_~y~0 .cse9)) .cse10 .cse11) (or (and (<= 0 .cse12) .cse3 .cse4) (and (or .cse6 (< 0 .cse13)) (or (< 0 .cse14) .cse10 .cse11)) (and (<= 0 .cse15) .cse2)) .cse16 (or (and .cse3 .cse4 (<= .cse14 0)) (and (<= .cse13 0) .cse2) (and .cse8 (let ((.cse17 (+ (* 2 c_main_~y~0) (* 2 (div (+ c_main_~x~0 4) 2)))) (.cse18 (* 4 .cse19))) (or (and .cse2 (<= .cse17 (+ .cse18 c_main_~x~0 5))) (and .cse3 .cse4 (<= .cse17 (+ .cse18 c_main_~x~0 9))))) .cse16))))))))) is different from true [2019-10-13 21:06:16,732 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse16 (div c_main_~y~0 2))) (let ((.cse0 (* 2 .cse16)) (.cse21 (* .cse16 (- 2)))) (let ((.cse18 (div (+ .cse21 c_main_~y~0 (- 2)) 4294967296)) (.cse20 (* 4294967296 (div c_main_~y~0 4294967296))) (.cse10 (= c_main_~y~0 .cse0)) (.cse19 (div (+ .cse21 c_main_~y~0) 4294967296))) (let ((.cse1 (* 4294967296 .cse19)) (.cse3 (not .cse10)) (.cse4 (< c_main_~y~0 .cse20)) (.cse5 (* 4294967296 .cse18))) (let ((.cse9 (+ .cse0 .cse5 2)) (.cse11 (<= .cse20 c_main_~y~0)) (.cse6 (and .cse3 .cse4)) (.cse7 (+ .cse0 .cse1))) (let ((.cse8 (or .cse6 (< .cse7 c_main_~y~0))) (.cse13 (+ .cse19 1)) (.cse12 (+ .cse18 1)) (.cse2 (or .cse10 .cse11)) (.cse17 (or (< .cse9 c_main_~y~0) .cse10 .cse11))) (and (or (and (<= c_main_~y~0 (+ .cse0 .cse1 4294967295)) .cse2) (and .cse3 .cse4 (<= c_main_~y~0 (+ .cse0 .cse5 4294967297)))) (or .cse6 (not (= .cse7 c_main_~y~0))) .cse8 (or (not (= c_main_~y~0 .cse9)) .cse10 .cse11) (or (and .cse3 .cse4 (<= .cse12 0)) (and (<= .cse13 0) .cse2) (and .cse8 (let ((.cse14 (+ (* 2 c_main_~y~0) (* 2 (div c_main_~x~0 2)))) (.cse15 (* 4 .cse16))) (or (and (<= .cse14 (+ .cse15 c_main_~x~0 1)) .cse2) (and (<= .cse14 (+ .cse15 c_main_~x~0 5)) .cse3 .cse4))) .cse17)) (or (and (<= 0 .cse18) .cse3 .cse4) (and (or .cse6 (< 0 .cse13)) (or (< 0 .cse12) .cse10 .cse11)) (and (<= 0 .cse19) .cse2)) .cse17))))))) is different from false