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 --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/loop-acceleration/nested_1-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 22:57:28,324 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 22:57:28,326 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 22:57:28,337 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 22:57:28,338 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 22:57:28,339 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 22:57:28,340 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 22:57:28,342 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 22:57:28,344 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 22:57:28,345 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 22:57:28,346 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 22:57:28,347 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 22:57:28,347 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 22:57:28,348 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 22:57:28,349 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 22:57:28,351 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 22:57:28,352 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 22:57:28,353 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 22:57:28,355 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 22:57:28,357 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 22:57:28,359 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 22:57:28,360 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 22:57:28,361 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 22:57:28,362 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 22:57:28,365 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 22:57:28,365 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 22:57:28,365 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 22:57:28,366 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 22:57:28,367 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 22:57:28,368 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 22:57:28,368 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 22:57:28,369 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 22:57:28,370 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 22:57:28,370 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 22:57:28,371 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 22:57:28,372 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 22:57:28,372 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 22:57:28,373 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 22:57:28,373 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 22:57:28,375 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 22:57:28,376 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 22:57:28,379 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 22:57:28,406 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 22:57:28,407 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 22:57:28,408 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 22:57:28,409 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 22:57:28,409 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 22:57:28,409 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 22:57:28,409 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 22:57:28,409 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 22:57:28,410 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 22:57:28,410 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 22:57:28,411 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 22:57:28,411 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 22:57:28,411 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 22:57:28,412 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 22:57:28,412 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 22:57:28,412 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 22:57:28,412 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 22:57:28,412 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 22:57:28,412 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 22:57:28,413 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 22:57:28,413 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 22:57:28,413 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 22:57:28,413 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 22:57:28,414 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 22:57:28,414 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 22:57:28,414 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 22:57:28,415 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 22:57:28,415 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 22:57:28,415 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-13 22:57:28,686 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 22:57:28,705 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 22:57:28,708 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 22:57:28,710 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 22:57:28,711 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 22:57:28,711 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/nested_1-1.c [2019-10-13 22:57:28,785 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20b57f184/53d72cbeb46a495ea0ae611d1f124794/FLAGbdc5b8311 [2019-10-13 22:57:29,266 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 22:57:29,269 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/nested_1-1.c [2019-10-13 22:57:29,275 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20b57f184/53d72cbeb46a495ea0ae611d1f124794/FLAGbdc5b8311 [2019-10-13 22:57:29,668 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20b57f184/53d72cbeb46a495ea0ae611d1f124794 [2019-10-13 22:57:29,679 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 22:57:29,681 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 22:57:29,682 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 22:57:29,683 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 22:57:29,686 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 22:57:29,687 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:57:29" (1/1) ... [2019-10-13 22:57:29,690 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d20a304 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:57:29, skipping insertion in model container [2019-10-13 22:57:29,690 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:57:29" (1/1) ... [2019-10-13 22:57:29,699 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 22:57:29,712 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 22:57:29,875 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 22:57:29,878 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 22:57:29,892 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 22:57:29,904 INFO L192 MainTranslator]: Completed translation [2019-10-13 22:57:29,904 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:57:29 WrapperNode [2019-10-13 22:57:29,905 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 22:57:29,905 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 22:57:29,905 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 22:57:29,906 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 22:57:29,998 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:57:29" (1/1) ... [2019-10-13 22:57:29,999 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:57:29" (1/1) ... [2019-10-13 22:57:30,003 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:57:29" (1/1) ... [2019-10-13 22:57:30,004 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:57:29" (1/1) ... [2019-10-13 22:57:30,007 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:57:29" (1/1) ... [2019-10-13 22:57:30,013 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:57:29" (1/1) ... [2019-10-13 22:57:30,014 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:57:29" (1/1) ... [2019-10-13 22:57:30,015 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 22:57:30,016 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 22:57:30,016 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 22:57:30,016 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 22:57:30,018 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:57: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 22:57:30,067 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 22:57:30,067 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 22:57:30,067 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-13 22:57:30,068 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 22:57:30,068 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 22:57:30,068 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-13 22:57:30,068 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 22:57:30,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 22:57:30,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 22:57:30,274 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 22:57:30,275 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-13 22:57:30,276 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:57:30 BoogieIcfgContainer [2019-10-13 22:57:30,276 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 22:57:30,277 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 22:57:30,278 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 22:57:30,281 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 22:57:30,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 10:57:29" (1/3) ... [2019-10-13 22:57:30,282 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@182b2f56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:57:30, skipping insertion in model container [2019-10-13 22:57:30,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:57:29" (2/3) ... [2019-10-13 22:57:30,283 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@182b2f56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:57:30, skipping insertion in model container [2019-10-13 22:57:30,283 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:57:30" (3/3) ... [2019-10-13 22:57:30,285 INFO L109 eAbstractionObserver]: Analyzing ICFG nested_1-1.c [2019-10-13 22:57:30,295 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 22:57:30,303 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 22:57:30,338 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 22:57:30,381 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 22:57:30,381 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 22:57:30,384 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 22:57:30,384 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 22:57:30,384 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 22:57:30,385 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 22:57:30,385 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 22:57:30,385 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 22:57:30,410 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2019-10-13 22:57:30,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-13 22:57:30,417 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:57:30,418 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:57:30,420 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:57:30,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:57:30,424 INFO L82 PathProgramCache]: Analyzing trace with hash -838692905, now seen corresponding path program 1 times [2019-10-13 22:57:30,431 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:57:30,431 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411052745] [2019-10-13 22:57:30,431 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:57:30,431 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:57:30,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:57:30,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:57:30,633 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 22:57:30,634 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411052745] [2019-10-13 22:57:30,635 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:57:30,635 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 22:57:30,635 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576344884] [2019-10-13 22:57:30,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 22:57:30,639 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:57:30,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 22:57:30,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 22:57:30,653 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2019-10-13 22:57:30,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:57:30,696 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2019-10-13 22:57:30,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 22:57:30,698 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-10-13 22:57:30,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:57:30,705 INFO L225 Difference]: With dead ends: 31 [2019-10-13 22:57:30,705 INFO L226 Difference]: Without dead ends: 14 [2019-10-13 22:57:30,708 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 22:57:30,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-10-13 22:57:30,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-10-13 22:57:30,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-10-13 22:57:30,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-10-13 22:57:30,746 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2019-10-13 22:57:30,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:57:30,747 INFO L462 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-10-13 22:57:30,747 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 22:57:30,747 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-10-13 22:57:30,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-13 22:57:30,748 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:57:30,749 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:57:30,749 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:57:30,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:57:30,750 INFO L82 PathProgramCache]: Analyzing trace with hash -284821231, now seen corresponding path program 1 times [2019-10-13 22:57:30,750 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:57:30,750 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477388889] [2019-10-13 22:57:30,751 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:57:30,751 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:57:30,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:57:30,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:57:30,821 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 22:57:30,822 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477388889] [2019-10-13 22:57:30,822 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:57:30,823 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 22:57:30,823 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256088587] [2019-10-13 22:57:30,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 22:57:30,825 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:57:30,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 22:57:30,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 22:57:30,826 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 3 states. [2019-10-13 22:57:30,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:57:30,841 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2019-10-13 22:57:30,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 22:57:30,842 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-10-13 22:57:30,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:57:30,843 INFO L225 Difference]: With dead ends: 21 [2019-10-13 22:57:30,843 INFO L226 Difference]: Without dead ends: 14 [2019-10-13 22:57:30,844 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 22:57:30,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-10-13 22:57:30,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-10-13 22:57:30,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-10-13 22:57:30,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-10-13 22:57:30,849 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 12 [2019-10-13 22:57:30,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:57:30,849 INFO L462 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-10-13 22:57:30,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 22:57:30,850 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-10-13 22:57:30,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-13 22:57:30,851 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:57:30,851 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:57:30,851 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:57:30,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:57:30,852 INFO L82 PathProgramCache]: Analyzing trace with hash -147777241, now seen corresponding path program 1 times [2019-10-13 22:57:30,852 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:57:30,852 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884885586] [2019-10-13 22:57:30,852 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:57:30,853 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:57:30,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:57:30,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:57:30,946 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:57:30,947 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884885586] [2019-10-13 22:57:30,947 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1779523278] [2019-10-13 22:57:30,947 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 22:57:30,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:57:30,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-13 22:57:30,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 22:57:31,045 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:57:31,045 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 22:57:31,100 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 22:57:31,101 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1718824738] [2019-10-13 22:57:31,125 INFO L162 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-10-13 22:57:31,125 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 22:57:31,131 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 22:57:31,141 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 22:57:31,142 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 22:57:31,203 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 1 for LOIs [2019-10-13 22:57:31,655 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 39 for LOIs [2019-10-13 22:57:31,685 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 1 for LOIs [2019-10-13 22:57:31,691 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 22:57:31,700 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 22:57:31,700 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 156#(and (or (<= 1 main_~x~0) (and (<= main_~x~0 0) (<= main_~y~0 0))) (<= 0 main_~y~0) (<= 0 main_~x~0)) [2019-10-13 22:57:31,701 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#true [2019-10-13 22:57:31,701 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#true [2019-10-13 22:57:31,702 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 184#true [2019-10-13 22:57:31,702 INFO L193 IcfgInterpreter]: Reachable states at location L14-2 satisfy 133#(and (or (and (not (< (mod main_~y~0 4294967296) 10)) (<= 1 main_~x~0)) (and (= main_~y~0 0) (= main_~x~0 0) (<= main_~x~0 0) (<= 0 main_~x~0) (<= main_~y~0 0))) (<= 0 main_~y~0)) [2019-10-13 22:57:31,703 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 22:57:31,703 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initFINAL satisfy 179#true [2019-10-13 22:57:31,703 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 170#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_main_~x~0_BEFORE_CALL_1 Int)) (or (and (= (mod v_main_~x~0_BEFORE_CALL_1 2) |__VERIFIER_assert_#in~cond|) (not (< (mod v_main_~x~0_BEFORE_CALL_1 4294967296) 268435455)) (not (< (mod v_main_~x~0_BEFORE_CALL_1 4294967296) 0)) (<= 1 v_main_~x~0_BEFORE_CALL_1) (<= (mod v_main_~x~0_BEFORE_CALL_1 2) 2147483647)) (and (not (< (mod v_main_~x~0_BEFORE_CALL_1 4294967296) 268435455)) (not (< (mod v_main_~x~0_BEFORE_CALL_1 4294967296) 0)) (<= 1 v_main_~x~0_BEFORE_CALL_1) (= |__VERIFIER_assert_#in~cond| (+ (mod v_main_~x~0_BEFORE_CALL_1 2) (- 4294967296))) (not (<= (mod v_main_~x~0_BEFORE_CALL_1 2) 2147483647))) (and (= |__VERIFIER_assert_#in~cond| (+ (mod (+ (mod v_main_~x~0_BEFORE_CALL_1 2) 4294967294) 4294967296) (- 4294967296))) (not (<= (mod (+ (mod v_main_~x~0_BEFORE_CALL_1 2) 4294967294) 4294967296) 2147483647)) (not (< (mod v_main_~x~0_BEFORE_CALL_1 4294967296) 268435455)) (<= 1 v_main_~x~0_BEFORE_CALL_1) (not (= (mod v_main_~x~0_BEFORE_CALL_1 2) 0)) (< (mod v_main_~x~0_BEFORE_CALL_1 4294967296) 0)) (and (= |__VERIFIER_assert_#in~cond| (mod (+ (mod v_main_~x~0_BEFORE_CALL_1 2) 4294967294) 4294967296)) (not (< (mod v_main_~x~0_BEFORE_CALL_1 4294967296) 268435455)) (<= 1 v_main_~x~0_BEFORE_CALL_1) (not (= (mod v_main_~x~0_BEFORE_CALL_1 2) 0)) (< (mod v_main_~x~0_BEFORE_CALL_1 4294967296) 0) (<= (mod (+ (mod v_main_~x~0_BEFORE_CALL_1 2) 4294967294) 4294967296) 2147483647)) (and (= (mod v_main_~x~0_BEFORE_CALL_1 2) |__VERIFIER_assert_#in~cond|) (not (< (mod v_main_~x~0_BEFORE_CALL_1 4294967296) 268435455)) (= (mod v_main_~x~0_BEFORE_CALL_1 2) 0) (<= 1 v_main_~x~0_BEFORE_CALL_1) (<= (mod v_main_~x~0_BEFORE_CALL_1 2) 2147483647)) (and (not (< (mod v_main_~x~0_BEFORE_CALL_1 4294967296) 268435455)) (= (mod v_main_~x~0_BEFORE_CALL_1 2) 0) (<= 1 v_main_~x~0_BEFORE_CALL_1) (= |__VERIFIER_assert_#in~cond| (+ (mod v_main_~x~0_BEFORE_CALL_1 2) (- 4294967296))) (not (<= (mod v_main_~x~0_BEFORE_CALL_1 2) 2147483647))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 22:57:31,704 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 175#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_main_~x~0_BEFORE_CALL_1 Int)) (or (and (= (mod v_main_~x~0_BEFORE_CALL_1 2) |__VERIFIER_assert_#in~cond|) (not (< (mod v_main_~x~0_BEFORE_CALL_1 4294967296) 268435455)) (not (< (mod v_main_~x~0_BEFORE_CALL_1 4294967296) 0)) (<= 1 v_main_~x~0_BEFORE_CALL_1) (<= (mod v_main_~x~0_BEFORE_CALL_1 2) 2147483647)) (and (not (< (mod v_main_~x~0_BEFORE_CALL_1 4294967296) 268435455)) (not (< (mod v_main_~x~0_BEFORE_CALL_1 4294967296) 0)) (<= 1 v_main_~x~0_BEFORE_CALL_1) (= |__VERIFIER_assert_#in~cond| (+ (mod v_main_~x~0_BEFORE_CALL_1 2) (- 4294967296))) (not (<= (mod v_main_~x~0_BEFORE_CALL_1 2) 2147483647))) (and (= |__VERIFIER_assert_#in~cond| (+ (mod (+ (mod v_main_~x~0_BEFORE_CALL_1 2) 4294967294) 4294967296) (- 4294967296))) (not (<= (mod (+ (mod v_main_~x~0_BEFORE_CALL_1 2) 4294967294) 4294967296) 2147483647)) (not (< (mod v_main_~x~0_BEFORE_CALL_1 4294967296) 268435455)) (<= 1 v_main_~x~0_BEFORE_CALL_1) (not (= (mod v_main_~x~0_BEFORE_CALL_1 2) 0)) (< (mod v_main_~x~0_BEFORE_CALL_1 4294967296) 0)) (and (= |__VERIFIER_assert_#in~cond| (mod (+ (mod v_main_~x~0_BEFORE_CALL_1 2) 4294967294) 4294967296)) (not (< (mod v_main_~x~0_BEFORE_CALL_1 4294967296) 268435455)) (<= 1 v_main_~x~0_BEFORE_CALL_1) (not (= (mod v_main_~x~0_BEFORE_CALL_1 2) 0)) (< (mod v_main_~x~0_BEFORE_CALL_1 4294967296) 0) (<= (mod (+ (mod v_main_~x~0_BEFORE_CALL_1 2) 4294967294) 4294967296) 2147483647)) (and (= (mod v_main_~x~0_BEFORE_CALL_1 2) |__VERIFIER_assert_#in~cond|) (not (< (mod v_main_~x~0_BEFORE_CALL_1 4294967296) 268435455)) (= (mod v_main_~x~0_BEFORE_CALL_1 2) 0) (<= 1 v_main_~x~0_BEFORE_CALL_1) (<= (mod v_main_~x~0_BEFORE_CALL_1 2) 2147483647)) (and (not (< (mod v_main_~x~0_BEFORE_CALL_1 4294967296) 268435455)) (= (mod v_main_~x~0_BEFORE_CALL_1 2) 0) (<= 1 v_main_~x~0_BEFORE_CALL_1) (= |__VERIFIER_assert_#in~cond| (+ (mod v_main_~x~0_BEFORE_CALL_1 2) (- 4294967296))) (not (<= (mod v_main_~x~0_BEFORE_CALL_1 2) 2147483647))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 22:57:31,704 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 160#(exists ((v_main_~x~0_BEFORE_CALL_1 Int)) (or (and (= (mod v_main_~x~0_BEFORE_CALL_1 2) |__VERIFIER_assert_#in~cond|) (not (< (mod v_main_~x~0_BEFORE_CALL_1 4294967296) 268435455)) (not (< (mod v_main_~x~0_BEFORE_CALL_1 4294967296) 0)) (<= 1 v_main_~x~0_BEFORE_CALL_1) (<= (mod v_main_~x~0_BEFORE_CALL_1 2) 2147483647)) (and (not (< (mod v_main_~x~0_BEFORE_CALL_1 4294967296) 268435455)) (not (< (mod v_main_~x~0_BEFORE_CALL_1 4294967296) 0)) (<= 1 v_main_~x~0_BEFORE_CALL_1) (= |__VERIFIER_assert_#in~cond| (+ (mod v_main_~x~0_BEFORE_CALL_1 2) (- 4294967296))) (not (<= (mod v_main_~x~0_BEFORE_CALL_1 2) 2147483647))) (and (= |__VERIFIER_assert_#in~cond| (+ (mod (+ (mod v_main_~x~0_BEFORE_CALL_1 2) 4294967294) 4294967296) (- 4294967296))) (not (<= (mod (+ (mod v_main_~x~0_BEFORE_CALL_1 2) 4294967294) 4294967296) 2147483647)) (not (< (mod v_main_~x~0_BEFORE_CALL_1 4294967296) 268435455)) (<= 1 v_main_~x~0_BEFORE_CALL_1) (not (= (mod v_main_~x~0_BEFORE_CALL_1 2) 0)) (< (mod v_main_~x~0_BEFORE_CALL_1 4294967296) 0)) (and (= |__VERIFIER_assert_#in~cond| (mod (+ (mod v_main_~x~0_BEFORE_CALL_1 2) 4294967294) 4294967296)) (not (< (mod v_main_~x~0_BEFORE_CALL_1 4294967296) 268435455)) (<= 1 v_main_~x~0_BEFORE_CALL_1) (not (= (mod v_main_~x~0_BEFORE_CALL_1 2) 0)) (< (mod v_main_~x~0_BEFORE_CALL_1 4294967296) 0) (<= (mod (+ (mod v_main_~x~0_BEFORE_CALL_1 2) 4294967294) 4294967296) 2147483647)) (and (= (mod v_main_~x~0_BEFORE_CALL_1 2) |__VERIFIER_assert_#in~cond|) (not (< (mod v_main_~x~0_BEFORE_CALL_1 4294967296) 268435455)) (= (mod v_main_~x~0_BEFORE_CALL_1 2) 0) (<= 1 v_main_~x~0_BEFORE_CALL_1) (<= (mod v_main_~x~0_BEFORE_CALL_1 2) 2147483647)) (and (not (< (mod v_main_~x~0_BEFORE_CALL_1 4294967296) 268435455)) (= (mod v_main_~x~0_BEFORE_CALL_1 2) 0) (<= 1 v_main_~x~0_BEFORE_CALL_1) (= |__VERIFIER_assert_#in~cond| (+ (mod v_main_~x~0_BEFORE_CALL_1 2) (- 4294967296))) (not (<= (mod v_main_~x~0_BEFORE_CALL_1 2) 2147483647))))) [2019-10-13 22:57:31,705 INFO L193 IcfgInterpreter]: Reachable states at location L4 satisfy 165#(and (exists ((v_main_~x~0_BEFORE_CALL_1 Int)) (or (and (= (mod v_main_~x~0_BEFORE_CALL_1 2) |__VERIFIER_assert_#in~cond|) (not (< (mod v_main_~x~0_BEFORE_CALL_1 4294967296) 268435455)) (not (< (mod v_main_~x~0_BEFORE_CALL_1 4294967296) 0)) (<= 1 v_main_~x~0_BEFORE_CALL_1) (<= (mod v_main_~x~0_BEFORE_CALL_1 2) 2147483647)) (and (not (< (mod v_main_~x~0_BEFORE_CALL_1 4294967296) 268435455)) (not (< (mod v_main_~x~0_BEFORE_CALL_1 4294967296) 0)) (<= 1 v_main_~x~0_BEFORE_CALL_1) (= |__VERIFIER_assert_#in~cond| (+ (mod v_main_~x~0_BEFORE_CALL_1 2) (- 4294967296))) (not (<= (mod v_main_~x~0_BEFORE_CALL_1 2) 2147483647))) (and (= |__VERIFIER_assert_#in~cond| (+ (mod (+ (mod v_main_~x~0_BEFORE_CALL_1 2) 4294967294) 4294967296) (- 4294967296))) (not (<= (mod (+ (mod v_main_~x~0_BEFORE_CALL_1 2) 4294967294) 4294967296) 2147483647)) (not (< (mod v_main_~x~0_BEFORE_CALL_1 4294967296) 268435455)) (<= 1 v_main_~x~0_BEFORE_CALL_1) (not (= (mod v_main_~x~0_BEFORE_CALL_1 2) 0)) (< (mod v_main_~x~0_BEFORE_CALL_1 4294967296) 0)) (and (= |__VERIFIER_assert_#in~cond| (mod (+ (mod v_main_~x~0_BEFORE_CALL_1 2) 4294967294) 4294967296)) (not (< (mod v_main_~x~0_BEFORE_CALL_1 4294967296) 268435455)) (<= 1 v_main_~x~0_BEFORE_CALL_1) (not (= (mod v_main_~x~0_BEFORE_CALL_1 2) 0)) (< (mod v_main_~x~0_BEFORE_CALL_1 4294967296) 0) (<= (mod (+ (mod v_main_~x~0_BEFORE_CALL_1 2) 4294967294) 4294967296) 2147483647)) (and (= (mod v_main_~x~0_BEFORE_CALL_1 2) |__VERIFIER_assert_#in~cond|) (not (< (mod v_main_~x~0_BEFORE_CALL_1 4294967296) 268435455)) (= (mod v_main_~x~0_BEFORE_CALL_1 2) 0) (<= 1 v_main_~x~0_BEFORE_CALL_1) (<= (mod v_main_~x~0_BEFORE_CALL_1 2) 2147483647)) (and (not (< (mod v_main_~x~0_BEFORE_CALL_1 4294967296) 268435455)) (= (mod v_main_~x~0_BEFORE_CALL_1 2) 0) (<= 1 v_main_~x~0_BEFORE_CALL_1) (= |__VERIFIER_assert_#in~cond| (+ (mod v_main_~x~0_BEFORE_CALL_1 2) (- 4294967296))) (not (<= (mod v_main_~x~0_BEFORE_CALL_1 2) 2147483647))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 22:57:31,705 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 128#(and (<= 0 main_~y~0) (<= 0 main_~x~0)) [2019-10-13 22:57:31,955 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 22:57:31,955 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 4, 7] total 15 [2019-10-13 22:57:31,955 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843664483] [2019-10-13 22:57:31,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-13 22:57:31,957 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:57:31,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-13 22:57:31,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2019-10-13 22:57:31,958 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 15 states. [2019-10-13 22:57:32,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:57:32,576 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2019-10-13 22:57:32,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-13 22:57:32,576 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 13 [2019-10-13 22:57:32,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:57:32,577 INFO L225 Difference]: With dead ends: 35 [2019-10-13 22:57:32,578 INFO L226 Difference]: Without dead ends: 27 [2019-10-13 22:57:32,582 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=192, Invalid=620, Unknown=0, NotChecked=0, Total=812 [2019-10-13 22:57:32,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-10-13 22:57:32,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-10-13 22:57:32,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-13 22:57:32,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2019-10-13 22:57:32,594 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 13 [2019-10-13 22:57:32,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:57:32,595 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-10-13 22:57:32,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-13 22:57:32,595 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2019-10-13 22:57:32,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-13 22:57:32,597 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:57:32,597 INFO L380 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:57:32,801 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 22:57:32,801 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:57:32,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:57:32,802 INFO L82 PathProgramCache]: Analyzing trace with hash 689631679, now seen corresponding path program 2 times [2019-10-13 22:57:32,802 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:57:32,804 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50128099] [2019-10-13 22:57:32,804 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:57:32,804 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:57:32,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:57:32,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:57:32,953 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 31 proven. 3 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-13 22:57:32,954 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50128099] [2019-10-13 22:57:32,954 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [855444038] [2019-10-13 22:57:32,955 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 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-10-13 22:57:33,011 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-10-13 22:57:33,012 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 22:57:33,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-13 22:57:33,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 22:57:33,046 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 31 proven. 3 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-13 22:57:33,046 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 22:57:33,096 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 31 proven. 3 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-13 22:57:33,097 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1088828061] [2019-10-13 22:57:33,098 INFO L162 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-10-13 22:57:33,098 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 22:57:33,099 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 22:57:33,099 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 22:57:33,099 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 22:57:33,111 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 1 for LOIs [2019-10-13 22:57:33,409 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 87 for LOIs [2019-10-13 22:57:33,425 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 1 for LOIs [2019-10-13 22:57:33,427 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 22:57:33,427 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 22:57:33,428 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 156#(and (or (<= 1 main_~x~0) (and (<= main_~x~0 0) (<= main_~y~0 0))) (<= 0 main_~y~0) (<= 0 main_~x~0)) [2019-10-13 22:57:33,428 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#true [2019-10-13 22:57:33,428 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#true [2019-10-13 22:57:33,428 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 184#true [2019-10-13 22:57:33,429 INFO L193 IcfgInterpreter]: Reachable states at location L14-2 satisfy 133#(and (or (and (not (< (mod main_~y~0 4294967296) 10)) (<= 1 main_~x~0)) (and (= main_~y~0 0) (= main_~x~0 0) (<= main_~x~0 0) (<= 0 main_~x~0) (<= main_~y~0 0))) (<= 0 main_~y~0)) [2019-10-13 22:57:33,429 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 22:57:33,430 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initFINAL satisfy 179#true [2019-10-13 22:57:33,431 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 170#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (exists ((v_prenex_4 Int) (v_prenex_5 Int) (v_prenex_2 Int) (v_main_~x~0_BEFORE_CALL_2 Int) (v_prenex_3 Int) (v_prenex_1 Int)) (or (and (not (< (mod v_prenex_2 4294967296) 0)) (<= (mod v_prenex_2 2) 2147483647) (= |__VERIFIER_assert_#in~cond| (mod v_prenex_2 2)) (not (< (mod v_prenex_2 4294967296) 268435455)) (<= 1 v_prenex_2)) (and (= |__VERIFIER_assert_#in~cond| (mod v_prenex_1 2)) (= 0 (mod v_prenex_1 2)) (not (< (mod v_prenex_1 4294967296) 268435455)) (<= 1 v_prenex_1) (<= (mod v_prenex_1 2) 2147483647)) (and (not (< (mod v_prenex_5 4294967296) 0)) (<= 1 v_prenex_5) (= (+ (mod v_prenex_5 2) (- 4294967296)) |__VERIFIER_assert_#in~cond|) (not (<= (mod v_prenex_5 2) 2147483647)) (not (< (mod v_prenex_5 4294967296) 268435455))) (and (<= 1 v_prenex_3) (< (mod v_prenex_3 4294967296) 0) (= |__VERIFIER_assert_#in~cond| (mod (+ (mod v_prenex_3 2) 4294967294) 4294967296)) (not (< (mod v_prenex_3 4294967296) 268435455)) (not (= 0 (mod v_prenex_3 2))) (<= (mod (+ (mod v_prenex_3 2) 4294967294) 4294967296) 2147483647)) (and (<= 1 v_main_~x~0_BEFORE_CALL_2) (= 0 (mod v_main_~x~0_BEFORE_CALL_2 2)) (not (<= (mod v_main_~x~0_BEFORE_CALL_2 2) 2147483647)) (= (+ (mod v_main_~x~0_BEFORE_CALL_2 2) (- 4294967296)) |__VERIFIER_assert_#in~cond|) (not (< (mod v_main_~x~0_BEFORE_CALL_2 4294967296) 268435455))) (and (= |__VERIFIER_assert_#in~cond| (+ (mod (+ (mod v_prenex_4 2) 4294967294) 4294967296) (- 4294967296))) (not (<= (mod (+ (mod v_prenex_4 2) 4294967294) 4294967296) 2147483647)) (<= 1 v_prenex_4) (not (< (mod v_prenex_4 4294967296) 268435455)) (not (= 0 (mod v_prenex_4 2))) (< (mod v_prenex_4 4294967296) 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 22:57:33,431 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 175#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (exists ((v_prenex_4 Int) (v_prenex_5 Int) (v_prenex_2 Int) (v_main_~x~0_BEFORE_CALL_2 Int) (v_prenex_3 Int) (v_prenex_1 Int)) (or (and (not (< (mod v_prenex_2 4294967296) 0)) (<= (mod v_prenex_2 2) 2147483647) (= |__VERIFIER_assert_#in~cond| (mod v_prenex_2 2)) (not (< (mod v_prenex_2 4294967296) 268435455)) (<= 1 v_prenex_2)) (and (= |__VERIFIER_assert_#in~cond| (mod v_prenex_1 2)) (= 0 (mod v_prenex_1 2)) (not (< (mod v_prenex_1 4294967296) 268435455)) (<= 1 v_prenex_1) (<= (mod v_prenex_1 2) 2147483647)) (and (not (< (mod v_prenex_5 4294967296) 0)) (<= 1 v_prenex_5) (= (+ (mod v_prenex_5 2) (- 4294967296)) |__VERIFIER_assert_#in~cond|) (not (<= (mod v_prenex_5 2) 2147483647)) (not (< (mod v_prenex_5 4294967296) 268435455))) (and (<= 1 v_prenex_3) (< (mod v_prenex_3 4294967296) 0) (= |__VERIFIER_assert_#in~cond| (mod (+ (mod v_prenex_3 2) 4294967294) 4294967296)) (not (< (mod v_prenex_3 4294967296) 268435455)) (not (= 0 (mod v_prenex_3 2))) (<= (mod (+ (mod v_prenex_3 2) 4294967294) 4294967296) 2147483647)) (and (<= 1 v_main_~x~0_BEFORE_CALL_2) (= 0 (mod v_main_~x~0_BEFORE_CALL_2 2)) (not (<= (mod v_main_~x~0_BEFORE_CALL_2 2) 2147483647)) (= (+ (mod v_main_~x~0_BEFORE_CALL_2 2) (- 4294967296)) |__VERIFIER_assert_#in~cond|) (not (< (mod v_main_~x~0_BEFORE_CALL_2 4294967296) 268435455))) (and (= |__VERIFIER_assert_#in~cond| (+ (mod (+ (mod v_prenex_4 2) 4294967294) 4294967296) (- 4294967296))) (not (<= (mod (+ (mod v_prenex_4 2) 4294967294) 4294967296) 2147483647)) (<= 1 v_prenex_4) (not (< (mod v_prenex_4 4294967296) 268435455)) (not (= 0 (mod v_prenex_4 2))) (< (mod v_prenex_4 4294967296) 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 22:57:33,432 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 160#(exists ((v_prenex_4 Int) (v_prenex_5 Int) (v_prenex_2 Int) (v_main_~x~0_BEFORE_CALL_2 Int) (v_prenex_3 Int) (v_prenex_1 Int)) (or (and (not (< (mod v_prenex_2 4294967296) 0)) (<= (mod v_prenex_2 2) 2147483647) (= |__VERIFIER_assert_#in~cond| (mod v_prenex_2 2)) (not (< (mod v_prenex_2 4294967296) 268435455)) (<= 1 v_prenex_2)) (and (= |__VERIFIER_assert_#in~cond| (mod v_prenex_1 2)) (= 0 (mod v_prenex_1 2)) (not (< (mod v_prenex_1 4294967296) 268435455)) (<= 1 v_prenex_1) (<= (mod v_prenex_1 2) 2147483647)) (and (not (< (mod v_prenex_5 4294967296) 0)) (<= 1 v_prenex_5) (= (+ (mod v_prenex_5 2) (- 4294967296)) |__VERIFIER_assert_#in~cond|) (not (<= (mod v_prenex_5 2) 2147483647)) (not (< (mod v_prenex_5 4294967296) 268435455))) (and (<= 1 v_prenex_3) (< (mod v_prenex_3 4294967296) 0) (= |__VERIFIER_assert_#in~cond| (mod (+ (mod v_prenex_3 2) 4294967294) 4294967296)) (not (< (mod v_prenex_3 4294967296) 268435455)) (not (= 0 (mod v_prenex_3 2))) (<= (mod (+ (mod v_prenex_3 2) 4294967294) 4294967296) 2147483647)) (and (<= 1 v_main_~x~0_BEFORE_CALL_2) (= 0 (mod v_main_~x~0_BEFORE_CALL_2 2)) (not (<= (mod v_main_~x~0_BEFORE_CALL_2 2) 2147483647)) (= (+ (mod v_main_~x~0_BEFORE_CALL_2 2) (- 4294967296)) |__VERIFIER_assert_#in~cond|) (not (< (mod v_main_~x~0_BEFORE_CALL_2 4294967296) 268435455))) (and (= |__VERIFIER_assert_#in~cond| (+ (mod (+ (mod v_prenex_4 2) 4294967294) 4294967296) (- 4294967296))) (not (<= (mod (+ (mod v_prenex_4 2) 4294967294) 4294967296) 2147483647)) (<= 1 v_prenex_4) (not (< (mod v_prenex_4 4294967296) 268435455)) (not (= 0 (mod v_prenex_4 2))) (< (mod v_prenex_4 4294967296) 0)))) [2019-10-13 22:57:33,433 INFO L193 IcfgInterpreter]: Reachable states at location L4 satisfy 165#(and (exists ((v_prenex_4 Int) (v_prenex_5 Int) (v_prenex_2 Int) (v_main_~x~0_BEFORE_CALL_2 Int) (v_prenex_3 Int) (v_prenex_1 Int)) (or (and (not (< (mod v_prenex_2 4294967296) 0)) (<= (mod v_prenex_2 2) 2147483647) (= |__VERIFIER_assert_#in~cond| (mod v_prenex_2 2)) (not (< (mod v_prenex_2 4294967296) 268435455)) (<= 1 v_prenex_2)) (and (= |__VERIFIER_assert_#in~cond| (mod v_prenex_1 2)) (= 0 (mod v_prenex_1 2)) (not (< (mod v_prenex_1 4294967296) 268435455)) (<= 1 v_prenex_1) (<= (mod v_prenex_1 2) 2147483647)) (and (not (< (mod v_prenex_5 4294967296) 0)) (<= 1 v_prenex_5) (= (+ (mod v_prenex_5 2) (- 4294967296)) |__VERIFIER_assert_#in~cond|) (not (<= (mod v_prenex_5 2) 2147483647)) (not (< (mod v_prenex_5 4294967296) 268435455))) (and (<= 1 v_prenex_3) (< (mod v_prenex_3 4294967296) 0) (= |__VERIFIER_assert_#in~cond| (mod (+ (mod v_prenex_3 2) 4294967294) 4294967296)) (not (< (mod v_prenex_3 4294967296) 268435455)) (not (= 0 (mod v_prenex_3 2))) (<= (mod (+ (mod v_prenex_3 2) 4294967294) 4294967296) 2147483647)) (and (<= 1 v_main_~x~0_BEFORE_CALL_2) (= 0 (mod v_main_~x~0_BEFORE_CALL_2 2)) (not (<= (mod v_main_~x~0_BEFORE_CALL_2 2) 2147483647)) (= (+ (mod v_main_~x~0_BEFORE_CALL_2 2) (- 4294967296)) |__VERIFIER_assert_#in~cond|) (not (< (mod v_main_~x~0_BEFORE_CALL_2 4294967296) 268435455))) (and (= |__VERIFIER_assert_#in~cond| (+ (mod (+ (mod v_prenex_4 2) 4294967294) 4294967296) (- 4294967296))) (not (<= (mod (+ (mod v_prenex_4 2) 4294967294) 4294967296) 2147483647)) (<= 1 v_prenex_4) (not (< (mod v_prenex_4 4294967296) 268435455)) (not (= 0 (mod v_prenex_4 2))) (< (mod v_prenex_4 4294967296) 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 22:57:33,434 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 128#(and (<= 0 main_~y~0) (<= 0 main_~x~0)) [2019-10-13 22:57:33,694 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 22:57:33,695 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 7] total 15 [2019-10-13 22:57:33,695 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539997631] [2019-10-13 22:57:33,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-13 22:57:33,697 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:57:33,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-13 22:57:33,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2019-10-13 22:57:33,698 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 15 states. [2019-10-13 22:57:35,874 WARN L191 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 18 [2019-10-13 22:57:36,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:57:36,012 INFO L93 Difference]: Finished difference Result 61 states and 84 transitions. [2019-10-13 22:57:36,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-13 22:57:36,012 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 26 [2019-10-13 22:57:36,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:57:36,015 INFO L225 Difference]: With dead ends: 61 [2019-10-13 22:57:36,015 INFO L226 Difference]: Without dead ends: 43 [2019-10-13 22:57:36,016 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2019-10-13 22:57:36,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-10-13 22:57:36,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-10-13 22:57:36,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-13 22:57:36,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2019-10-13 22:57:36,030 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 26 [2019-10-13 22:57:36,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:57:36,031 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2019-10-13 22:57:36,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-13 22:57:36,031 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2019-10-13 22:57:36,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-13 22:57:36,035 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:57:36,036 INFO L380 BasicCegarLoop]: trace histogram [24, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:57:36,236 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 22:57:36,237 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:57:36,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:57:36,238 INFO L82 PathProgramCache]: Analyzing trace with hash -690259521, now seen corresponding path program 3 times [2019-10-13 22:57:36,238 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:57:36,239 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658567471] [2019-10-13 22:57:36,239 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:57:36,239 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:57:36,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:57:36,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:57:36,387 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 151 proven. 21 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2019-10-13 22:57:36,387 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658567471] [2019-10-13 22:57:36,388 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1159548590] [2019-10-13 22:57:36,388 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 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-10-13 22:57:36,464 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 22:57:36,464 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 22:57:36,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-13 22:57:36,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 22:57:36,622 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-10-13 22:57:36,623 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 22:57:36,964 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 10 proven. 314 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-10-13 22:57:36,965 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1012861737] [2019-10-13 22:57:36,966 INFO L162 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-10-13 22:57:36,966 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 22:57:36,967 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 22:57:36,967 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 22:57:36,967 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 22:57:36,979 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 1 for LOIs [2019-10-13 22:57:37,159 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 58 for LOIs [2019-10-13 22:57:37,168 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 1 for LOIs [2019-10-13 22:57:37,185 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 22:57:37,185 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 22:57:37,186 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 156#(and (or (<= 1 main_~x~0) (and (<= main_~x~0 0) (<= main_~y~0 0))) (<= 0 main_~y~0) (<= 0 main_~x~0)) [2019-10-13 22:57:37,186 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#true [2019-10-13 22:57:37,186 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#true [2019-10-13 22:57:37,186 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 184#true [2019-10-13 22:57:37,187 INFO L193 IcfgInterpreter]: Reachable states at location L14-2 satisfy 133#(and (or (and (not (< (mod main_~y~0 4294967296) 10)) (<= 1 main_~x~0)) (and (= main_~y~0 0) (= main_~x~0 0) (<= main_~x~0 0) (<= 0 main_~x~0) (<= main_~y~0 0))) (<= 0 main_~y~0)) [2019-10-13 22:57:37,187 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 22:57:37,188 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initFINAL satisfy 179#true [2019-10-13 22:57:37,188 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 170#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_main_~x~0_BEFORE_CALL_3 Int)) (or (and (not (< (mod v_prenex_6 4294967296) 268435455)) (<= 1 v_prenex_6) (not (<= (mod v_prenex_6 2) 2147483647)) (= (mod v_prenex_6 2) 0) (= (+ (mod v_prenex_6 2) (- 4294967296)) |__VERIFIER_assert_#in~cond|)) (and (not (< (mod v_prenex_7 4294967296) 268435455)) (not (= (mod v_prenex_7 2) 0)) (= |__VERIFIER_assert_#in~cond| (mod (+ (mod v_prenex_7 2) 4294967294) 4294967296)) (<= 1 v_prenex_7) (< (mod v_prenex_7 4294967296) 0) (<= (mod (+ (mod v_prenex_7 2) 4294967294) 4294967296) 2147483647)) (and (not (< (mod v_main_~x~0_BEFORE_CALL_3 4294967296) 268435455)) (= (+ (mod v_main_~x~0_BEFORE_CALL_3 2) (- 4294967296)) |__VERIFIER_assert_#in~cond|) (<= 1 v_main_~x~0_BEFORE_CALL_3) (not (<= (mod v_main_~x~0_BEFORE_CALL_3 2) 2147483647)) (not (< (mod v_main_~x~0_BEFORE_CALL_3 4294967296) 0))) (and (not (< (mod v_main_~x~0_BEFORE_CALL_3 4294967296) 268435455)) (<= 1 v_main_~x~0_BEFORE_CALL_3) (<= (mod v_main_~x~0_BEFORE_CALL_3 2) 2147483647) (not (< (mod v_main_~x~0_BEFORE_CALL_3 4294967296) 0)) (= |__VERIFIER_assert_#in~cond| (mod v_main_~x~0_BEFORE_CALL_3 2))) (and (= |__VERIFIER_assert_#in~cond| (mod v_prenex_6 2)) (not (< (mod v_prenex_6 4294967296) 268435455)) (<= 1 v_prenex_6) (= (mod v_prenex_6 2) 0) (<= (mod v_prenex_6 2) 2147483647)) (and (not (< (mod v_prenex_7 4294967296) 268435455)) (not (= (mod v_prenex_7 2) 0)) (<= 1 v_prenex_7) (= (+ (mod (+ (mod v_prenex_7 2) 4294967294) 4294967296) (- 4294967296)) |__VERIFIER_assert_#in~cond|) (< (mod v_prenex_7 4294967296) 0) (not (<= (mod (+ (mod v_prenex_7 2) 4294967294) 4294967296) 2147483647))))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 22:57:37,188 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 175#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_main_~x~0_BEFORE_CALL_3 Int)) (or (and (not (< (mod v_prenex_6 4294967296) 268435455)) (<= 1 v_prenex_6) (not (<= (mod v_prenex_6 2) 2147483647)) (= (mod v_prenex_6 2) 0) (= (+ (mod v_prenex_6 2) (- 4294967296)) |__VERIFIER_assert_#in~cond|)) (and (not (< (mod v_prenex_7 4294967296) 268435455)) (not (= (mod v_prenex_7 2) 0)) (= |__VERIFIER_assert_#in~cond| (mod (+ (mod v_prenex_7 2) 4294967294) 4294967296)) (<= 1 v_prenex_7) (< (mod v_prenex_7 4294967296) 0) (<= (mod (+ (mod v_prenex_7 2) 4294967294) 4294967296) 2147483647)) (and (not (< (mod v_main_~x~0_BEFORE_CALL_3 4294967296) 268435455)) (= (+ (mod v_main_~x~0_BEFORE_CALL_3 2) (- 4294967296)) |__VERIFIER_assert_#in~cond|) (<= 1 v_main_~x~0_BEFORE_CALL_3) (not (<= (mod v_main_~x~0_BEFORE_CALL_3 2) 2147483647)) (not (< (mod v_main_~x~0_BEFORE_CALL_3 4294967296) 0))) (and (not (< (mod v_main_~x~0_BEFORE_CALL_3 4294967296) 268435455)) (<= 1 v_main_~x~0_BEFORE_CALL_3) (<= (mod v_main_~x~0_BEFORE_CALL_3 2) 2147483647) (not (< (mod v_main_~x~0_BEFORE_CALL_3 4294967296) 0)) (= |__VERIFIER_assert_#in~cond| (mod v_main_~x~0_BEFORE_CALL_3 2))) (and (= |__VERIFIER_assert_#in~cond| (mod v_prenex_6 2)) (not (< (mod v_prenex_6 4294967296) 268435455)) (<= 1 v_prenex_6) (= (mod v_prenex_6 2) 0) (<= (mod v_prenex_6 2) 2147483647)) (and (not (< (mod v_prenex_7 4294967296) 268435455)) (not (= (mod v_prenex_7 2) 0)) (<= 1 v_prenex_7) (= (+ (mod (+ (mod v_prenex_7 2) 4294967294) 4294967296) (- 4294967296)) |__VERIFIER_assert_#in~cond|) (< (mod v_prenex_7 4294967296) 0) (not (<= (mod (+ (mod v_prenex_7 2) 4294967294) 4294967296) 2147483647))))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 22:57:37,195 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 160#(exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_main_~x~0_BEFORE_CALL_3 Int)) (or (and (not (< (mod v_prenex_6 4294967296) 268435455)) (<= 1 v_prenex_6) (not (<= (mod v_prenex_6 2) 2147483647)) (= (mod v_prenex_6 2) 0) (= (+ (mod v_prenex_6 2) (- 4294967296)) |__VERIFIER_assert_#in~cond|)) (and (not (< (mod v_prenex_7 4294967296) 268435455)) (not (= (mod v_prenex_7 2) 0)) (= |__VERIFIER_assert_#in~cond| (mod (+ (mod v_prenex_7 2) 4294967294) 4294967296)) (<= 1 v_prenex_7) (< (mod v_prenex_7 4294967296) 0) (<= (mod (+ (mod v_prenex_7 2) 4294967294) 4294967296) 2147483647)) (and (not (< (mod v_main_~x~0_BEFORE_CALL_3 4294967296) 268435455)) (= (+ (mod v_main_~x~0_BEFORE_CALL_3 2) (- 4294967296)) |__VERIFIER_assert_#in~cond|) (<= 1 v_main_~x~0_BEFORE_CALL_3) (not (<= (mod v_main_~x~0_BEFORE_CALL_3 2) 2147483647)) (not (< (mod v_main_~x~0_BEFORE_CALL_3 4294967296) 0))) (and (not (< (mod v_main_~x~0_BEFORE_CALL_3 4294967296) 268435455)) (<= 1 v_main_~x~0_BEFORE_CALL_3) (<= (mod v_main_~x~0_BEFORE_CALL_3 2) 2147483647) (not (< (mod v_main_~x~0_BEFORE_CALL_3 4294967296) 0)) (= |__VERIFIER_assert_#in~cond| (mod v_main_~x~0_BEFORE_CALL_3 2))) (and (= |__VERIFIER_assert_#in~cond| (mod v_prenex_6 2)) (not (< (mod v_prenex_6 4294967296) 268435455)) (<= 1 v_prenex_6) (= (mod v_prenex_6 2) 0) (<= (mod v_prenex_6 2) 2147483647)) (and (not (< (mod v_prenex_7 4294967296) 268435455)) (not (= (mod v_prenex_7 2) 0)) (<= 1 v_prenex_7) (= (+ (mod (+ (mod v_prenex_7 2) 4294967294) 4294967296) (- 4294967296)) |__VERIFIER_assert_#in~cond|) (< (mod v_prenex_7 4294967296) 0) (not (<= (mod (+ (mod v_prenex_7 2) 4294967294) 4294967296) 2147483647))))) [2019-10-13 22:57:37,196 INFO L193 IcfgInterpreter]: Reachable states at location L4 satisfy 165#(and (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_main_~x~0_BEFORE_CALL_3 Int)) (or (and (not (< (mod v_prenex_6 4294967296) 268435455)) (<= 1 v_prenex_6) (not (<= (mod v_prenex_6 2) 2147483647)) (= (mod v_prenex_6 2) 0) (= (+ (mod v_prenex_6 2) (- 4294967296)) |__VERIFIER_assert_#in~cond|)) (and (not (< (mod v_prenex_7 4294967296) 268435455)) (not (= (mod v_prenex_7 2) 0)) (= |__VERIFIER_assert_#in~cond| (mod (+ (mod v_prenex_7 2) 4294967294) 4294967296)) (<= 1 v_prenex_7) (< (mod v_prenex_7 4294967296) 0) (<= (mod (+ (mod v_prenex_7 2) 4294967294) 4294967296) 2147483647)) (and (not (< (mod v_main_~x~0_BEFORE_CALL_3 4294967296) 268435455)) (= (+ (mod v_main_~x~0_BEFORE_CALL_3 2) (- 4294967296)) |__VERIFIER_assert_#in~cond|) (<= 1 v_main_~x~0_BEFORE_CALL_3) (not (<= (mod v_main_~x~0_BEFORE_CALL_3 2) 2147483647)) (not (< (mod v_main_~x~0_BEFORE_CALL_3 4294967296) 0))) (and (not (< (mod v_main_~x~0_BEFORE_CALL_3 4294967296) 268435455)) (<= 1 v_main_~x~0_BEFORE_CALL_3) (<= (mod v_main_~x~0_BEFORE_CALL_3 2) 2147483647) (not (< (mod v_main_~x~0_BEFORE_CALL_3 4294967296) 0)) (= |__VERIFIER_assert_#in~cond| (mod v_main_~x~0_BEFORE_CALL_3 2))) (and (= |__VERIFIER_assert_#in~cond| (mod v_prenex_6 2)) (not (< (mod v_prenex_6 4294967296) 268435455)) (<= 1 v_prenex_6) (= (mod v_prenex_6 2) 0) (<= (mod v_prenex_6 2) 2147483647)) (and (not (< (mod v_prenex_7 4294967296) 268435455)) (not (= (mod v_prenex_7 2) 0)) (<= 1 v_prenex_7) (= (+ (mod (+ (mod v_prenex_7 2) 4294967294) 4294967296) (- 4294967296)) |__VERIFIER_assert_#in~cond|) (< (mod v_prenex_7 4294967296) 0) (not (<= (mod (+ (mod v_prenex_7 2) 4294967294) 4294967296) 2147483647))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 22:57:37,196 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 128#(and (<= 0 main_~y~0) (<= 0 main_~x~0)) [2019-10-13 22:57:37,618 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 22:57:37,618 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 12, 7] total 35 [2019-10-13 22:57:37,618 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940016154] [2019-10-13 22:57:37,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-13 22:57:37,620 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:57:37,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-13 22:57:37,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=983, Unknown=0, NotChecked=0, Total=1190 [2019-10-13 22:57:37,621 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 35 states. [2019-10-13 22:57:39,514 WARN L191 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 24 [2019-10-13 22:57:41,321 WARN L191 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 29 DAG size of output: 16 [2019-10-13 22:57:42,658 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 16 [2019-10-13 22:57:47,745 WARN L191 SmtUtils]: Spent 2.25 s on a formula simplification. DAG size of input: 31 DAG size of output: 24 [2019-10-13 22:57:52,072 WARN L191 SmtUtils]: Spent 4.23 s on a formula simplification. DAG size of input: 25 DAG size of output: 19 [2019-10-13 22:57:54,158 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 16 [2019-10-13 22:57:55,758 WARN L191 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 36 DAG size of output: 25 [2019-10-13 22:57:56,802 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 27 [2019-10-13 22:58:00,943 WARN L191 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 27 [2019-10-13 22:58:09,368 WARN L191 SmtUtils]: Spent 4.09 s on a formula simplification. DAG size of input: 39 DAG size of output: 28 [2019-10-13 22:58:18,633 WARN L191 SmtUtils]: Spent 2.68 s on a formula simplification. DAG size of input: 43 DAG size of output: 28