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/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/loop-acceleration/diamond_2-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 02:31:22,426 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 02:31:22,428 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 02:31:22,440 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 02:31:22,440 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 02:31:22,441 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 02:31:22,443 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 02:31:22,445 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 02:31:22,446 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 02:31:22,447 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 02:31:22,448 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 02:31:22,450 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 02:31:22,450 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 02:31:22,451 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 02:31:22,452 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 02:31:22,453 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 02:31:22,454 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 02:31:22,455 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 02:31:22,457 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 02:31:22,459 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 02:31:22,461 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 02:31:22,462 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 02:31:22,463 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 02:31:22,464 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 02:31:22,467 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 02:31:22,468 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 02:31:22,468 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 02:31:22,469 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 02:31:22,469 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 02:31:22,472 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 02:31:22,472 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 02:31:22,473 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 02:31:22,476 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 02:31:22,477 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 02:31:22,478 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 02:31:22,478 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 02:31:22,479 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 02:31:22,480 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 02:31:22,480 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 02:31:22,481 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 02:31:22,485 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 02:31:22,485 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-10-03 02:31:22,511 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 02:31:22,511 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 02:31:22,512 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 02:31:22,513 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 02:31:22,513 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 02:31:22,513 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 02:31:22,514 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 02:31:22,514 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 02:31:22,514 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 02:31:22,514 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 02:31:22,516 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 02:31:22,517 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 02:31:22,517 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 02:31:22,517 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 02:31:22,518 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 02:31:22,518 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 02:31:22,518 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 02:31:22,518 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 02:31:22,518 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 02:31:22,519 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 02:31:22,519 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 02:31:22,519 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 02:31:22,519 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 02:31:22,520 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:31:22,520 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 02:31:22,520 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 02:31:22,520 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 02:31:22,521 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 02:31:22,521 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 02:31:22,521 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 02:31:22,558 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 02:31:22,569 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 02:31:22,575 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 02:31:22,577 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 02:31:22,578 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 02:31:22,579 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-03 02:31:22,643 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b04b4259b/357658920dfe45a8af41746fafa9a036/FLAGab70fd24c [2019-10-03 02:31:23,144 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 02:31:23,145 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/diamond_2-2.c [2019-10-03 02:31:23,152 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b04b4259b/357658920dfe45a8af41746fafa9a036/FLAGab70fd24c [2019-10-03 02:31:23,456 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b04b4259b/357658920dfe45a8af41746fafa9a036 [2019-10-03 02:31:23,467 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 02:31:23,469 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 02:31:23,470 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 02:31:23,470 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 02:31:23,474 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 02:31:23,475 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:31:23" (1/1) ... [2019-10-03 02:31:23,478 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d1b2de6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:31:23, skipping insertion in model container [2019-10-03 02:31:23,478 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:31:23" (1/1) ... [2019-10-03 02:31:23,486 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 02:31:23,505 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 02:31:23,684 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:31:23,689 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 02:31:23,714 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:31:23,729 INFO L192 MainTranslator]: Completed translation [2019-10-03 02:31:23,730 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:31:23 WrapperNode [2019-10-03 02:31:23,730 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 02:31:23,731 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 02:31:23,731 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 02:31:23,731 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 02:31:23,838 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:31:23" (1/1) ... [2019-10-03 02:31:23,840 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:31:23" (1/1) ... [2019-10-03 02:31:23,846 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:31:23" (1/1) ... [2019-10-03 02:31:23,847 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:31:23" (1/1) ... [2019-10-03 02:31:23,852 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:31:23" (1/1) ... [2019-10-03 02:31:23,859 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:31:23" (1/1) ... [2019-10-03 02:31:23,860 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:31:23" (1/1) ... [2019-10-03 02:31:23,862 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 02:31:23,863 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 02:31:23,863 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 02:31:23,863 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 02:31:23,864 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:31:23" (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-03 02:31:23,921 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 02:31:23,921 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 02:31:23,921 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-03 02:31:23,921 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 02:31:23,921 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 02:31:23,922 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2019-10-03 02:31:23,922 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-03 02:31:23,922 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 02:31:23,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 02:31:23,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 02:31:24,245 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 02:31:24,246 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-03 02:31:24,248 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:31:24 BoogieIcfgContainer [2019-10-03 02:31:24,248 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 02:31:24,258 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 02:31:24,258 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 02:31:24,262 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 02:31:24,262 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 02:31:23" (1/3) ... [2019-10-03 02:31:24,270 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d7fb357 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:31:24, skipping insertion in model container [2019-10-03 02:31:24,271 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:31:23" (2/3) ... [2019-10-03 02:31:24,271 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d7fb357 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:31:24, skipping insertion in model container [2019-10-03 02:31:24,271 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:31:24" (3/3) ... [2019-10-03 02:31:24,274 INFO L109 eAbstractionObserver]: Analyzing ICFG diamond_2-2.c [2019-10-03 02:31:24,286 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 02:31:24,295 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-03 02:31:24,323 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-03 02:31:24,350 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 02:31:24,351 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 02:31:24,351 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 02:31:24,351 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 02:31:24,351 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 02:31:24,351 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 02:31:24,351 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 02:31:24,352 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 02:31:24,369 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2019-10-03 02:31:24,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-03 02:31:24,378 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:24,379 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:31:24,381 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:24,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:24,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1906239810, now seen corresponding path program 1 times [2019-10-03 02:31:24,387 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:24,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:24,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:24,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:24,435 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:24,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:24,493 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-03 02:31:24,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:24,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-03 02:31:24,496 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:24,500 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-03 02:31:24,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-03 02:31:24,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:31:24,515 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 2 states. [2019-10-03 02:31:24,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:24,533 INFO L93 Difference]: Finished difference Result 27 states and 37 transitions. [2019-10-03 02:31:24,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-03 02:31:24,535 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-10-03 02:31:24,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:24,546 INFO L225 Difference]: With dead ends: 27 [2019-10-03 02:31:24,547 INFO L226 Difference]: Without dead ends: 21 [2019-10-03 02:31:24,551 INFO L640 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-03 02:31:24,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-10-03 02:31:24,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-10-03 02:31:24,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-03 02:31:24,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 31 transitions. [2019-10-03 02:31:24,597 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 31 transitions. Word has length 10 [2019-10-03 02:31:24,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:24,598 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 31 transitions. [2019-10-03 02:31:24,598 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-03 02:31:24,598 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 31 transitions. [2019-10-03 02:31:24,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-03 02:31:24,600 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:24,600 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:31:24,601 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:24,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:24,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1847134466, now seen corresponding path program 1 times [2019-10-03 02:31:24,603 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:24,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:24,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:24,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:24,607 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:24,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:24,799 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-03 02:31:24,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:24,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:31:24,801 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:24,802 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:31:24,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:31:24,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:31:24,805 INFO L87 Difference]: Start difference. First operand 21 states and 31 transitions. Second operand 3 states. [2019-10-03 02:31:24,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:24,896 INFO L93 Difference]: Finished difference Result 23 states and 34 transitions. [2019-10-03 02:31:24,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:31:24,897 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-10-03 02:31:24,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:24,900 INFO L225 Difference]: With dead ends: 23 [2019-10-03 02:31:24,900 INFO L226 Difference]: Without dead ends: 23 [2019-10-03 02:31:24,901 INFO L640 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-03 02:31:24,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-10-03 02:31:24,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-10-03 02:31:24,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-03 02:31:24,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 32 transitions. [2019-10-03 02:31:24,907 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 32 transitions. Word has length 10 [2019-10-03 02:31:24,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:24,907 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 32 transitions. [2019-10-03 02:31:24,908 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:31:24,908 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 32 transitions. [2019-10-03 02:31:24,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-03 02:31:24,909 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:24,909 INFO L411 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-03 02:31:24,909 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:24,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:24,910 INFO L82 PathProgramCache]: Analyzing trace with hash -129940435, now seen corresponding path program 1 times [2019-10-03 02:31:24,910 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:24,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:24,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:24,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:24,912 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:24,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:25,065 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-03 02:31:25,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:25,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:31:25,066 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:25,067 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:31:25,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:31:25,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:31:25,068 INFO L87 Difference]: Start difference. First operand 22 states and 32 transitions. Second operand 3 states. [2019-10-03 02:31:25,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:25,209 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2019-10-03 02:31:25,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:31:25,209 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-03 02:31:25,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:25,211 INFO L225 Difference]: With dead ends: 34 [2019-10-03 02:31:25,211 INFO L226 Difference]: Without dead ends: 34 [2019-10-03 02:31:25,212 INFO L640 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-03 02:31:25,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-10-03 02:31:25,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-10-03 02:31:25,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-03 02:31:25,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2019-10-03 02:31:25,219 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 21 [2019-10-03 02:31:25,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:25,219 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2019-10-03 02:31:25,219 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:31:25,220 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2019-10-03 02:31:25,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-03 02:31:25,221 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:25,221 INFO L411 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-03 02:31:25,221 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:25,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:25,222 INFO L82 PathProgramCache]: Analyzing trace with hash 263086575, now seen corresponding path program 1 times [2019-10-03 02:31:25,222 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:25,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:25,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:25,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:25,224 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:25,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:25,558 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-03 02:31:25,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:31:25,559 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:31:25,560 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2019-10-03 02:31:25,562 INFO L207 CegarAbsIntRunner]: [0], [4], [11], [13], [16], [22], [28], [34], [40], [46], [52], [58], [64], [70], [79], [82], [84], [90], [91], [92], [94] [2019-10-03 02:31:25,607 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 02:31:25,608 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 02:31:25,679 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 02:31:26,339 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 02:31:26,342 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-03 02:31:26,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:26,347 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 02:31:26,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:31:26,348 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 02:31:26,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:26,366 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 02:31:26,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:26,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-03 02:31:26,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:31:26,455 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-03 02:31:26,456 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:31:27,947 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-03 02:31:27,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:31:27,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2019-10-03 02:31:27,954 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:31:27,954 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-03 02:31:27,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-03 02:31:27,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2019-10-03 02:31:27,960 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. Second operand 14 states. [2019-10-03 02:31:28,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:28,200 INFO L93 Difference]: Finished difference Result 46 states and 59 transitions. [2019-10-03 02:31:28,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-03 02:31:28,201 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 21 [2019-10-03 02:31:28,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:28,202 INFO L225 Difference]: With dead ends: 46 [2019-10-03 02:31:28,202 INFO L226 Difference]: Without dead ends: 46 [2019-10-03 02:31:28,203 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2019-10-03 02:31:28,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-10-03 02:31:28,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2019-10-03 02:31:28,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-10-03 02:31:28,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2019-10-03 02:31:28,209 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 56 transitions. Word has length 21 [2019-10-03 02:31:28,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:28,210 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 56 transitions. [2019-10-03 02:31:28,210 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-03 02:31:28,210 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2019-10-03 02:31:28,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-03 02:31:28,211 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:28,211 INFO L411 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-03 02:31:28,212 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:28,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:28,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1016777103, now seen corresponding path program 1 times [2019-10-03 02:31:28,212 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:28,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:28,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:28,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:28,215 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:28,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:30,264 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (div c_main_~y~0 2))) (let ((.cse0 (* 2 .cse4))) (let ((.cse1 (* (- 2) .cse4)) (.cse2 (= .cse0 c_main_~y~0)) (.cse3 (* 4294967296 (div c_main_~y~0 4294967296)))) (and (or (not (= c_main_~y~0 (+ .cse0 (* 4294967296 (div (+ .cse1 c_main_~y~0 (- 2)) 4294967296)) 2))) .cse2 (<= .cse3 c_main_~y~0)) (or (not (= (+ .cse0 (* 4294967296 (div (+ .cse1 c_main_~y~0) 4294967296))) c_main_~y~0)) (and (not .cse2) (< c_main_~y~0 .cse3))))))) is different from false [2019-10-03 02:31:30,269 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-03 02:31:30,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:30,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:31:30,270 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:30,270 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:31:30,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:31:30,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2019-10-03 02:31:30,271 INFO L87 Difference]: Start difference. First operand 44 states and 56 transitions. Second operand 3 states. [2019-10-03 02:31:30,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:30,274 INFO L93 Difference]: Finished difference Result 44 states and 55 transitions. [2019-10-03 02:31:30,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:31:30,274 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-03 02:31:30,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:30,275 INFO L225 Difference]: With dead ends: 44 [2019-10-03 02:31:30,275 INFO L226 Difference]: Without dead ends: 44 [2019-10-03 02:31:30,275 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2019-10-03 02:31:30,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-10-03 02:31:30,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-10-03 02:31:30,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-10-03 02:31:30,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 55 transitions. [2019-10-03 02:31:30,281 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 55 transitions. Word has length 21 [2019-10-03 02:31:30,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:30,281 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 55 transitions. [2019-10-03 02:31:30,281 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:31:30,282 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 55 transitions. [2019-10-03 02:31:30,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-03 02:31:30,283 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:30,283 INFO L411 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-03 02:31:30,283 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:30,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:30,283 INFO L82 PathProgramCache]: Analyzing trace with hash -2027894353, now seen corresponding path program 1 times [2019-10-03 02:31:30,284 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:30,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:30,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:30,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:30,285 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:30,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:32,329 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (div c_main_~y~0 2))) (let ((.cse0 (* 2 .cse4))) (let ((.cse1 (* (- 2) .cse4)) (.cse2 (= .cse0 c_main_~y~0)) (.cse3 (* 4294967296 (div c_main_~y~0 4294967296)))) (and (or (not (= c_main_~y~0 (+ .cse0 (* 4294967296 (div (+ .cse1 c_main_~y~0 (- 2)) 4294967296)) 2))) .cse2 (<= .cse3 c_main_~y~0)) (or (not (= (+ .cse0 (* 4294967296 (div (+ .cse1 c_main_~y~0) 4294967296))) c_main_~y~0)) (and (not .cse2) (< c_main_~y~0 .cse3))))))) is different from false [2019-10-03 02:31:32,334 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-03 02:31:32,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:32,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:31:32,335 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:32,335 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:31:32,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:31:32,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2019-10-03 02:31:32,336 INFO L87 Difference]: Start difference. First operand 44 states and 55 transitions. Second operand 3 states. [2019-10-03 02:31:32,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:32,339 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2019-10-03 02:31:32,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:31:32,339 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-03 02:31:32,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:32,340 INFO L225 Difference]: With dead ends: 44 [2019-10-03 02:31:32,340 INFO L226 Difference]: Without dead ends: 44 [2019-10-03 02:31:32,340 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2019-10-03 02:31:32,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-10-03 02:31:32,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-10-03 02:31:32,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-10-03 02:31:32,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 54 transitions. [2019-10-03 02:31:32,346 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 54 transitions. Word has length 21 [2019-10-03 02:31:32,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:32,346 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 54 transitions. [2019-10-03 02:31:32,346 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:31:32,346 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2019-10-03 02:31:32,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-03 02:31:32,347 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:32,347 INFO L411 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-03 02:31:32,348 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:32,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:32,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1680266929, now seen corresponding path program 1 times [2019-10-03 02:31:32,348 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:32,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:32,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:32,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:32,350 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:32,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:34,397 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (div c_main_~y~0 2))) (let ((.cse0 (* 2 .cse4))) (let ((.cse1 (* (- 2) .cse4)) (.cse2 (= .cse0 c_main_~y~0)) (.cse3 (* 4294967296 (div c_main_~y~0 4294967296)))) (and (or (not (= c_main_~y~0 (+ .cse0 (* 4294967296 (div (+ .cse1 c_main_~y~0 (- 2)) 4294967296)) 2))) .cse2 (<= .cse3 c_main_~y~0)) (or (not (= (+ .cse0 (* 4294967296 (div (+ .cse1 c_main_~y~0) 4294967296))) c_main_~y~0)) (and (not .cse2) (< c_main_~y~0 .cse3))))))) is different from false [2019-10-03 02:31:34,401 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-03 02:31:34,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:34,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:31:34,402 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:34,402 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:31:34,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:31:34,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2019-10-03 02:31:34,403 INFO L87 Difference]: Start difference. First operand 44 states and 54 transitions. Second operand 3 states. [2019-10-03 02:31:34,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:34,406 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2019-10-03 02:31:34,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:31:34,407 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-03 02:31:34,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:34,407 INFO L225 Difference]: With dead ends: 44 [2019-10-03 02:31:34,407 INFO L226 Difference]: Without dead ends: 44 [2019-10-03 02:31:34,408 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2019-10-03 02:31:34,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-10-03 02:31:34,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-10-03 02:31:34,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-10-03 02:31:34,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2019-10-03 02:31:34,417 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 21 [2019-10-03 02:31:34,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:34,418 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2019-10-03 02:31:34,418 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:31:34,418 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2019-10-03 02:31:34,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-03 02:31:34,419 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:34,419 INFO L411 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-03 02:31:34,419 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:34,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:34,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1938432367, now seen corresponding path program 1 times [2019-10-03 02:31:34,420 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:34,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:34,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:34,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:34,422 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:34,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:36,469 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (div c_main_~y~0 2))) (let ((.cse0 (* 2 .cse4))) (let ((.cse1 (* (- 2) .cse4)) (.cse2 (= .cse0 c_main_~y~0)) (.cse3 (* 4294967296 (div c_main_~y~0 4294967296)))) (and (or (not (= c_main_~y~0 (+ .cse0 (* 4294967296 (div (+ .cse1 c_main_~y~0 (- 2)) 4294967296)) 2))) .cse2 (<= .cse3 c_main_~y~0)) (or (not (= (+ .cse0 (* 4294967296 (div (+ .cse1 c_main_~y~0) 4294967296))) c_main_~y~0)) (and (not .cse2) (< c_main_~y~0 .cse3))))))) is different from false [2019-10-03 02:31:36,474 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-03 02:31:36,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:36,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:31:36,474 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:36,475 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:31:36,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:31:36,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2019-10-03 02:31:36,475 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand 3 states. [2019-10-03 02:31:36,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:36,478 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2019-10-03 02:31:36,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:31:36,479 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-03 02:31:36,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:36,479 INFO L225 Difference]: With dead ends: 44 [2019-10-03 02:31:36,480 INFO L226 Difference]: Without dead ends: 44 [2019-10-03 02:31:36,480 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2019-10-03 02:31:36,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-10-03 02:31:36,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-10-03 02:31:36,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-10-03 02:31:36,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2019-10-03 02:31:36,485 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 21 [2019-10-03 02:31:36,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:36,485 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2019-10-03 02:31:36,485 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:31:36,486 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2019-10-03 02:31:36,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-03 02:31:36,486 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:36,487 INFO L411 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-03 02:31:36,487 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:36,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:36,487 INFO L82 PathProgramCache]: Analyzing trace with hash -2048497361, now seen corresponding path program 1 times [2019-10-03 02:31:36,487 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:36,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:36,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:36,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:36,489 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:36,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:38,544 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (div c_main_~y~0 2))) (let ((.cse0 (* 2 .cse4))) (let ((.cse1 (* (- 2) .cse4)) (.cse2 (= .cse0 c_main_~y~0)) (.cse3 (* 4294967296 (div c_main_~y~0 4294967296)))) (and (or (not (= c_main_~y~0 (+ .cse0 (* 4294967296 (div (+ .cse1 c_main_~y~0 (- 2)) 4294967296)) 2))) .cse2 (<= .cse3 c_main_~y~0)) (or (not (= (+ .cse0 (* 4294967296 (div (+ .cse1 c_main_~y~0) 4294967296))) c_main_~y~0)) (and (not .cse2) (< c_main_~y~0 .cse3))))))) is different from false [2019-10-03 02:31:38,548 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-03 02:31:38,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:38,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:31:38,548 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:38,549 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:31:38,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:31:38,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2019-10-03 02:31:38,550 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand 3 states. [2019-10-03 02:31:38,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:38,552 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2019-10-03 02:31:38,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:31:38,552 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-03 02:31:38,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:38,553 INFO L225 Difference]: With dead ends: 44 [2019-10-03 02:31:38,553 INFO L226 Difference]: Without dead ends: 44 [2019-10-03 02:31:38,554 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2019-10-03 02:31:38,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-10-03 02:31:38,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-10-03 02:31:38,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-10-03 02:31:38,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2019-10-03 02:31:38,558 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 21 [2019-10-03 02:31:38,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:38,559 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2019-10-03 02:31:38,559 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:31:38,559 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2019-10-03 02:31:38,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-03 02:31:38,560 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:38,560 INFO L411 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-03 02:31:38,560 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:38,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:38,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1368438991, now seen corresponding path program 1 times [2019-10-03 02:31:38,561 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:38,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:38,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:38,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:38,563 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:38,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:40,613 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (div c_main_~y~0 2))) (let ((.cse0 (* 2 .cse4))) (let ((.cse1 (* (- 2) .cse4)) (.cse2 (= .cse0 c_main_~y~0)) (.cse3 (* 4294967296 (div c_main_~y~0 4294967296)))) (and (or (not (= c_main_~y~0 (+ .cse0 (* 4294967296 (div (+ .cse1 c_main_~y~0 (- 2)) 4294967296)) 2))) .cse2 (<= .cse3 c_main_~y~0)) (or (not (= (+ .cse0 (* 4294967296 (div (+ .cse1 c_main_~y~0) 4294967296))) c_main_~y~0)) (and (not .cse2) (< c_main_~y~0 .cse3))))))) is different from false [2019-10-03 02:31:40,619 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-03 02:31:40,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:40,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:31:40,619 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:40,620 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:31:40,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:31:40,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2019-10-03 02:31:40,620 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand 3 states. [2019-10-03 02:31:40,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:40,622 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2019-10-03 02:31:40,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:31:40,623 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-03 02:31:40,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:40,624 INFO L225 Difference]: With dead ends: 44 [2019-10-03 02:31:40,624 INFO L226 Difference]: Without dead ends: 44 [2019-10-03 02:31:40,624 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2019-10-03 02:31:40,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-10-03 02:31:40,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-10-03 02:31:40,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-10-03 02:31:40,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2019-10-03 02:31:40,628 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 21 [2019-10-03 02:31:40,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:40,629 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2019-10-03 02:31:40,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:31:40,629 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2019-10-03 02:31:40,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-03 02:31:40,629 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:40,630 INFO L411 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-03 02:31:40,630 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:40,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:40,630 INFO L82 PathProgramCache]: Analyzing trace with hash 2117181679, now seen corresponding path program 1 times [2019-10-03 02:31:40,630 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:40,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:40,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:40,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:40,632 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:40,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:42,686 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (div c_main_~y~0 2))) (let ((.cse0 (* 2 .cse4))) (let ((.cse1 (* (- 2) .cse4)) (.cse2 (= .cse0 c_main_~y~0)) (.cse3 (* 4294967296 (div c_main_~y~0 4294967296)))) (and (or (not (= c_main_~y~0 (+ .cse0 (* 4294967296 (div (+ .cse1 c_main_~y~0 (- 2)) 4294967296)) 2))) .cse2 (<= .cse3 c_main_~y~0)) (or (not (= (+ .cse0 (* 4294967296 (div (+ .cse1 c_main_~y~0) 4294967296))) c_main_~y~0)) (and (not .cse2) (< c_main_~y~0 .cse3))))))) is different from false [2019-10-03 02:31:42,693 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-03 02:31:42,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:42,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:31:42,694 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:42,694 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:31:42,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:31:42,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2019-10-03 02:31:42,695 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand 3 states. [2019-10-03 02:31:42,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:42,697 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2019-10-03 02:31:42,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:31:42,698 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-03 02:31:42,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:42,699 INFO L225 Difference]: With dead ends: 44 [2019-10-03 02:31:42,699 INFO L226 Difference]: Without dead ends: 44 [2019-10-03 02:31:42,699 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2019-10-03 02:31:42,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-10-03 02:31:42,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-10-03 02:31:42,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-10-03 02:31:42,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2019-10-03 02:31:42,704 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 21 [2019-10-03 02:31:42,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:42,704 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2019-10-03 02:31:42,705 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:31:42,705 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2019-10-03 02:31:42,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-03 02:31:42,706 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:42,706 INFO L411 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-03 02:31:42,706 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:42,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:42,707 INFO L82 PathProgramCache]: Analyzing trace with hash -402778255, now seen corresponding path program 1 times [2019-10-03 02:31:42,707 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:42,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:42,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:42,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:42,708 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:42,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:44,758 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (div c_main_~y~0 2))) (let ((.cse0 (* 2 .cse4))) (let ((.cse1 (* (- 2) .cse4)) (.cse2 (= .cse0 c_main_~y~0)) (.cse3 (* 4294967296 (div c_main_~y~0 4294967296)))) (and (or (not (= c_main_~y~0 (+ .cse0 (* 4294967296 (div (+ .cse1 c_main_~y~0 (- 2)) 4294967296)) 2))) .cse2 (<= .cse3 c_main_~y~0)) (or (not (= (+ .cse0 (* 4294967296 (div (+ .cse1 c_main_~y~0) 4294967296))) c_main_~y~0)) (and (not .cse2) (< c_main_~y~0 .cse3))))))) is different from false [2019-10-03 02:31:44,765 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-03 02:31:44,765 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:44,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:31:44,766 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:44,766 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:31:44,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:31:44,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2019-10-03 02:31:44,767 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 3 states. [2019-10-03 02:31:44,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:44,769 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2019-10-03 02:31:44,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:31:44,769 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-03 02:31:44,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:44,770 INFO L225 Difference]: With dead ends: 44 [2019-10-03 02:31:44,770 INFO L226 Difference]: Without dead ends: 44 [2019-10-03 02:31:44,771 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2019-10-03 02:31:44,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-10-03 02:31:44,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-10-03 02:31:44,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-10-03 02:31:44,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2019-10-03 02:31:44,775 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 21 [2019-10-03 02:31:44,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:44,775 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2019-10-03 02:31:44,775 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:31:44,775 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2019-10-03 02:31:44,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-03 02:31:44,776 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:44,777 INFO L411 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-03 02:31:44,777 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:44,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:44,777 INFO L82 PathProgramCache]: Analyzing trace with hash -345519953, now seen corresponding path program 1 times [2019-10-03 02:31:44,777 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:44,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:44,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:44,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:44,779 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:44,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:47,036 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse9 (div c_main_~y~0 2))) (let ((.cse5 (* 2 .cse9))) (let ((.cse7 (* (- 2) .cse9)) (.cse8 (= .cse5 c_main_~y~0)) (.cse6 (* 4294967296 (div c_main_~y~0 4294967296)))) (let ((.cse0 (or .cse8 (<= .cse6 c_main_~y~0))) (.cse1 (div (+ .cse7 c_main_~y~0) 4294967296)) (.cse2 (not .cse8)) (.cse3 (div (+ .cse7 c_main_~y~0 (- 2)) 4294967296)) (.cse4 (< c_main_~y~0 .cse6))) (and (or (and .cse0 (<= (+ .cse1 1) 0)) (and .cse2 (<= (+ .cse3 1) 0) .cse4) (<= c_main_~x~0 0)) (or (and .cse0 (<= c_main_~y~0 (+ .cse5 (* 4294967296 .cse1)))) (and .cse2 (<= c_main_~y~0 (+ .cse5 (* 4294967296 .cse3) 2)) .cse4) (<= 0 c_main_~x~0))))))) is different from true [2019-10-03 02:31:49,070 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse11 (div c_main_~y~0 2))) (let ((.cse18 (* 2 .cse11))) (let ((.cse4 (* 4294967296 (div c_main_~y~0 4294967296))) (.cse0 (= .cse18 c_main_~y~0)) (.cse19 (* (- 2) .cse11))) (let ((.cse17 (div (+ .cse19 c_main_~y~0) 4294967296)) (.cse7 (not .cse0)) (.cse8 (< c_main_~y~0 .cse4)) (.cse16 (div (+ .cse19 c_main_~y~0 (- 2)) 4294967296))) (let ((.cse3 (+ .cse18 (* 4294967296 .cse16) 2)) (.cse1 (and .cse7 .cse8)) (.cse6 (+ .cse18 (* 4294967296 .cse17))) (.cse2 (<= .cse4 c_main_~y~0))) (let ((.cse14 (+ .cse17 1)) (.cse15 (+ .cse16 1)) (.cse5 (or .cse0 .cse2)) (.cse12 (or .cse1 (< .cse6 c_main_~y~0))) (.cse13 (or .cse0 (< .cse3 c_main_~y~0) .cse2))) (and (or .cse0 .cse1 .cse2) (or (not (= c_main_~y~0 .cse3)) .cse0 .cse2) (< .cse4 (+ c_main_~y~0 1)) (or (and .cse5 (<= c_main_~y~0 .cse6)) (and .cse7 (<= c_main_~y~0 .cse3) .cse8) (and (let ((.cse9 (* 2 c_main_~y~0)) (.cse10 (* 4 .cse11))) (or (and .cse7 .cse8 (<= (+ .cse9 (* 2 (div (+ c_main_~x~0 2) 2))) (+ .cse10 c_main_~x~0 5))) (and .cse5 (<= (+ .cse9 (* 2 (div c_main_~x~0 2))) (+ .cse10 c_main_~x~0 1))))) .cse12 .cse13) (and .cse5 (<= .cse14 0)) (and .cse7 (<= .cse15 0) .cse8)) (or (not (= .cse6 c_main_~y~0)) .cse1) (or (and .cse7 (<= 0 .cse16) .cse8) (and (or (< 0 .cse14) .cse1) (or .cse0 (< 0 .cse15) .cse2)) (and .cse5 (<= 0 .cse17))) .cse12 .cse13))))))) is different from false [2019-10-03 02:31:51,088 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse11 (div c_main_~y~0 2))) (let ((.cse18 (* 2 .cse11))) (let ((.cse4 (* 4294967296 (div c_main_~y~0 4294967296))) (.cse0 (= .cse18 c_main_~y~0)) (.cse19 (* (- 2) .cse11))) (let ((.cse17 (div (+ .cse19 c_main_~y~0) 4294967296)) (.cse7 (not .cse0)) (.cse8 (< c_main_~y~0 .cse4)) (.cse16 (div (+ .cse19 c_main_~y~0 (- 2)) 4294967296))) (let ((.cse3 (+ .cse18 (* 4294967296 .cse16) 2)) (.cse1 (and .cse7 .cse8)) (.cse6 (+ .cse18 (* 4294967296 .cse17))) (.cse2 (<= .cse4 c_main_~y~0))) (let ((.cse14 (+ .cse17 1)) (.cse15 (+ .cse16 1)) (.cse5 (or .cse0 .cse2)) (.cse12 (or .cse1 (< .cse6 c_main_~y~0))) (.cse13 (or .cse0 (< .cse3 c_main_~y~0) .cse2))) (and (or .cse0 .cse1 .cse2) (or (not (= c_main_~y~0 .cse3)) .cse0 .cse2) (< .cse4 (+ c_main_~y~0 1)) (or (and .cse5 (<= c_main_~y~0 .cse6)) (and .cse7 (<= c_main_~y~0 .cse3) .cse8) (and (let ((.cse9 (* 2 c_main_~y~0)) (.cse10 (* 4 .cse11))) (or (and .cse7 .cse8 (<= (+ .cse9 (* 2 (div (+ c_main_~x~0 2) 2))) (+ .cse10 c_main_~x~0 5))) (and .cse5 (<= (+ .cse9 (* 2 (div c_main_~x~0 2))) (+ .cse10 c_main_~x~0 1))))) .cse12 .cse13) (and .cse5 (<= .cse14 0)) (and .cse7 (<= .cse15 0) .cse8)) (or (not (= .cse6 c_main_~y~0)) .cse1) (or (and .cse7 (<= 0 .cse16) .cse8) (and (or (< 0 .cse14) .cse1) (or .cse0 (< 0 .cse15) .cse2)) (and .cse5 (<= 0 .cse17))) .cse12 .cse13))))))) is different from true [2019-10-03 02:31:53,129 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse10 (div c_main_~y~0 2))) (let ((.cse18 (* 2 .cse10))) (let ((.cse15 (* 4294967296 (div c_main_~y~0 4294967296))) (.cse12 (= .cse18 c_main_~y~0)) (.cse19 (* (- 2) .cse10))) (let ((.cse17 (div (+ .cse19 c_main_~y~0) 4294967296)) (.cse2 (not .cse12)) (.cse4 (< c_main_~y~0 .cse15)) (.cse16 (div (+ .cse19 c_main_~y~0 (- 2)) 4294967296))) (let ((.cse3 (+ .cse18 (* 4294967296 .cse16) 2)) (.cse13 (and .cse2 .cse4)) (.cse1 (+ .cse18 (* 4294967296 .cse17))) (.cse14 (<= .cse15 c_main_~y~0))) (let ((.cse5 (+ .cse17 1)) (.cse6 (+ .cse16 1)) (.cse0 (or .cse12 .cse14)) (.cse7 (or .cse13 (< .cse1 c_main_~y~0))) (.cse11 (or .cse12 (< .cse3 c_main_~y~0) .cse14))) (and (or (and .cse0 (<= c_main_~y~0 .cse1)) (and .cse2 (<= c_main_~y~0 .cse3) .cse4) (and .cse0 (<= .cse5 0)) (and .cse2 (<= .cse6 0) .cse4) (and .cse7 (let ((.cse8 (* 2 c_main_~y~0)) (.cse9 (* 4 .cse10))) (or (and .cse0 (<= (+ .cse8 (* 2 (div (+ c_main_~x~0 2) 2))) (+ .cse9 c_main_~x~0 3))) (and .cse2 .cse4 (<= (+ .cse8 (* 2 (div (+ c_main_~x~0 4) 2))) (+ .cse9 c_main_~x~0 7))))) .cse11)) (or .cse12 .cse13 .cse14) (or (not (= c_main_~y~0 .cse3)) .cse12 .cse14) (< .cse15 (+ c_main_~y~0 1)) (or (not (= .cse1 c_main_~y~0)) .cse13) (or (and .cse2 (<= 0 .cse16) .cse4) (and (or (< 0 .cse5) .cse13) (or .cse12 (< 0 .cse6) .cse14)) (and .cse0 (<= 0 .cse17))) .cse7 .cse11))))))) is different from false [2019-10-03 02:31:55,169 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (div c_main_~y~0 2))) (let ((.cse17 (* 2 .cse7)) (.cse21 (* (- 2) .cse7))) (let ((.cse15 (div (+ .cse21 c_main_~y~0 (- 2)) 4294967296)) (.cse20 (* 4294967296 (div c_main_~y~0 4294967296))) (.cse11 (= .cse17 c_main_~y~0)) (.cse16 (div (+ .cse21 c_main_~y~0) 4294967296))) (let ((.cse19 (* 4294967296 .cse16)) (.cse2 (not .cse11)) (.cse4 (< c_main_~y~0 .cse20)) (.cse18 (* 4294967296 .cse15))) (let ((.cse10 (+ .cse17 .cse18 2)) (.cse12 (<= .cse20 c_main_~y~0)) (.cse14 (and .cse2 .cse4)) (.cse13 (+ .cse17 .cse19))) (let ((.cse1 (+ .cse16 1)) (.cse3 (+ .cse15 1)) (.cse8 (or .cse14 (< .cse13 c_main_~y~0))) (.cse0 (or .cse11 .cse12)) (.cse9 (or .cse11 (< .cse10 c_main_~y~0) .cse12))) (and (or (and .cse0 (<= .cse1 0)) (and .cse2 (<= .cse3 0) .cse4) (and (let ((.cse5 (+ (* 2 c_main_~y~0) (* 2 (div (+ c_main_~x~0 4) 2)))) (.cse6 (* 4 .cse7))) (or (and .cse2 .cse4 (<= .cse5 (+ .cse6 c_main_~x~0 9))) (and .cse0 (<= .cse5 (+ .cse6 c_main_~x~0 5))))) .cse8 .cse9)) (or (not (= c_main_~y~0 .cse10)) .cse11 .cse12) (or (not (= .cse13 c_main_~y~0)) .cse14) (or (and .cse2 (<= 0 .cse15) .cse4) (and (or (< 0 .cse1) .cse14) (or .cse11 (< 0 .cse3) .cse12)) (and .cse0 (<= 0 .cse16))) .cse8 (or (and .cse2 (<= c_main_~y~0 (+ .cse17 .cse18 4294967297)) .cse4) (and .cse0 (<= c_main_~y~0 (+ .cse17 .cse19 4294967295)))) .cse9))))))) is different from false [2019-10-03 02:31:57,195 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse10 (div c_main_~y~0 2))) (let ((.cse17 (* 2 .cse10)) (.cse21 (* (- 2) .cse10))) (let ((.cse15 (div (+ .cse21 c_main_~y~0 (- 2)) 4294967296)) (.cse20 (* 4294967296 (div c_main_~y~0 4294967296))) (.cse1 (= .cse17 c_main_~y~0)) (.cse16 (div (+ .cse21 c_main_~y~0) 4294967296))) (let ((.cse19 (* 4294967296 .cse16)) (.cse5 (not .cse1)) (.cse8 (< c_main_~y~0 .cse20)) (.cse18 (* 4294967296 .cse15))) (let ((.cse0 (+ .cse17 .cse18 2)) (.cse2 (<= .cse20 c_main_~y~0)) (.cse4 (and .cse5 .cse8)) (.cse3 (+ .cse17 .cse19))) (let ((.cse13 (+ .cse16 1)) (.cse14 (+ .cse15 1)) (.cse11 (or .cse4 (< .cse3 c_main_~y~0))) (.cse9 (or .cse1 .cse2)) (.cse12 (or .cse1 (< .cse0 c_main_~y~0) .cse2))) (and (or (not (= c_main_~y~0 .cse0)) .cse1 .cse2) (or (not (= .cse3 c_main_~y~0)) .cse4) (or (and (let ((.cse6 (+ (* 2 c_main_~y~0) (* 2 (div c_main_~x~0 2)))) (.cse7 (* 4 .cse10))) (or (and .cse5 (<= .cse6 (+ .cse7 c_main_~x~0 5)) .cse8) (and .cse9 (<= .cse6 (+ .cse7 c_main_~x~0 1))))) .cse11 .cse12) (and .cse9 (<= .cse13 0)) (and .cse5 (<= .cse14 0) .cse8)) (or (and .cse5 (<= 0 .cse15) .cse8) (and (or (< 0 .cse13) .cse4) (or .cse1 (< 0 .cse14) .cse2)) (and .cse9 (<= 0 .cse16))) .cse11 (or (and .cse5 (<= c_main_~y~0 (+ .cse17 .cse18 4294967297)) .cse8) (and .cse9 (<= c_main_~y~0 (+ .cse17 .cse19 4294967295)))) .cse12))))))) is different from false [2019-10-03 02:31:59,207 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse10 (div c_main_~y~0 2))) (let ((.cse17 (* 2 .cse10)) (.cse21 (* (- 2) .cse10))) (let ((.cse15 (div (+ .cse21 c_main_~y~0 (- 2)) 4294967296)) (.cse20 (* 4294967296 (div c_main_~y~0 4294967296))) (.cse1 (= .cse17 c_main_~y~0)) (.cse16 (div (+ .cse21 c_main_~y~0) 4294967296))) (let ((.cse19 (* 4294967296 .cse16)) (.cse5 (not .cse1)) (.cse8 (< c_main_~y~0 .cse20)) (.cse18 (* 4294967296 .cse15))) (let ((.cse0 (+ .cse17 .cse18 2)) (.cse2 (<= .cse20 c_main_~y~0)) (.cse4 (and .cse5 .cse8)) (.cse3 (+ .cse17 .cse19))) (let ((.cse13 (+ .cse16 1)) (.cse14 (+ .cse15 1)) (.cse11 (or .cse4 (< .cse3 c_main_~y~0))) (.cse9 (or .cse1 .cse2)) (.cse12 (or .cse1 (< .cse0 c_main_~y~0) .cse2))) (and (or (not (= c_main_~y~0 .cse0)) .cse1 .cse2) (or (not (= .cse3 c_main_~y~0)) .cse4) (or (and (let ((.cse6 (+ (* 2 c_main_~y~0) (* 2 (div c_main_~x~0 2)))) (.cse7 (* 4 .cse10))) (or (and .cse5 (<= .cse6 (+ .cse7 c_main_~x~0 5)) .cse8) (and .cse9 (<= .cse6 (+ .cse7 c_main_~x~0 1))))) .cse11 .cse12) (and .cse9 (<= .cse13 0)) (and .cse5 (<= .cse14 0) .cse8)) (or (and .cse5 (<= 0 .cse15) .cse8) (and (or (< 0 .cse13) .cse4) (or .cse1 (< 0 .cse14) .cse2)) (and .cse9 (<= 0 .cse16))) .cse11 (or (and .cse5 (<= c_main_~y~0 (+ .cse17 .cse18 4294967297)) .cse8) (and .cse9 (<= c_main_~y~0 (+ .cse17 .cse19 4294967295)))) .cse12))))))) is different from true [2019-10-03 02:32:01,232 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse7 (div c_main_~y~0 2))) (let ((.cse18 (* 2 .cse7)) (.cse22 (* (- 2) .cse7))) (let ((.cse16 (div (+ .cse22 c_main_~y~0 (- 2)) 4294967296)) (.cse21 (* 4294967296 (div c_main_~y~0 4294967296))) (.cse12 (= .cse18 c_main_~y~0)) (.cse17 (div (+ .cse22 c_main_~y~0) 4294967296))) (let ((.cse20 (* 4294967296 .cse17)) (.cse5 (not .cse12)) (.cse6 (< c_main_~y~0 .cse21)) (.cse19 (* 4294967296 .cse16))) (let ((.cse11 (+ .cse18 .cse19 2)) (.cse13 (<= .cse21 c_main_~y~0)) (.cse15 (and .cse5 .cse6)) (.cse14 (+ .cse18 .cse20))) (let ((.cse9 (+ .cse17 1)) (.cse10 (+ .cse16 1)) (.cse0 (or .cse15 (< .cse14 c_main_~y~0))) (.cse1 (or .cse12 .cse13)) (.cse8 (or .cse12 (< .cse11 c_main_~y~0) .cse13))) (and (or (and .cse0 (let ((.cse2 (* 2 (div (+ c_main_~x~0 (- 2)) 2))) (.cse3 (* 2 c_main_~y~0)) (.cse4 (* 4 .cse7))) (or (and .cse1 (<= (+ .cse2 .cse3 1) (+ .cse4 c_main_~x~0))) (and .cse5 (<= (+ .cse2 .cse3) (+ .cse4 c_main_~x~0 3)) .cse6))) .cse8) (and .cse1 (<= .cse9 0)) (and .cse5 (<= .cse10 0) .cse6)) (or (not (= c_main_~y~0 .cse11)) .cse12 .cse13) (or (not (= .cse14 c_main_~y~0)) .cse15) (or (and .cse5 (<= 0 .cse16) .cse6) (and (or (< 0 .cse9) .cse15) (or .cse12 (< 0 .cse10) .cse13)) (and .cse1 (<= 0 .cse17))) .cse0 (or (and .cse5 (<= c_main_~y~0 (+ .cse18 .cse19 4294967297)) .cse6) (and .cse1 (<= c_main_~y~0 (+ .cse18 .cse20 4294967295)))) .cse8))))))) is different from true [2019-10-03 02:32:03,270 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (div c_main_~y~0 2))) (let ((.cse15 (* 2 .cse5))) (let ((.cse18 (* 4294967296 (div c_main_~y~0 4294967296))) (.cse12 (= .cse15 c_main_~y~0)) (.cse19 (* (- 2) .cse5))) (let ((.cse14 (div (+ .cse19 c_main_~y~0) 4294967296)) (.cse3 (not .cse12)) (.cse4 (< c_main_~y~0 .cse18)) (.cse10 (div (+ .cse19 c_main_~y~0 (- 2)) 4294967296))) (let ((.cse16 (* 4294967296 .cse10)) (.cse13 (<= .cse18 c_main_~y~0)) (.cse11 (and .cse3 .cse4)) (.cse17 (* 4294967296 .cse14))) (let ((.cse8 (+ .cse14 1)) (.cse9 (+ .cse10 1)) (.cse6 (or .cse11 (< (+ .cse15 .cse17) c_main_~y~0))) (.cse0 (or .cse12 .cse13)) (.cse7 (or .cse12 (< (+ .cse15 .cse16 2) c_main_~y~0) .cse13))) (and (or (and (let ((.cse1 (+ (* 2 c_main_~y~0) (* 2 (div (+ c_main_~x~0 2) 2)))) (.cse2 (* 4 .cse5))) (or (and .cse0 (<= .cse1 (+ .cse2 c_main_~x~0 3))) (and .cse3 (<= .cse1 (+ .cse2 c_main_~x~0 7)) .cse4))) .cse6 .cse7) (and .cse0 (<= .cse8 0)) (and .cse3 (<= .cse9 0) .cse4)) (or (and .cse3 (<= 0 .cse10) .cse4) (and (or (< 0 .cse8) .cse11) (or .cse12 (< 0 .cse9) .cse13)) (and .cse0 (<= 0 .cse14))) .cse6 (or (and .cse3 (<= c_main_~y~0 (+ .cse15 .cse16 4294967297)) .cse4) (and .cse0 (<= c_main_~y~0 (+ .cse15 .cse17 4294967295)))) .cse7))))))) is different from false [2019-10-03 02:32:05,284 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse5 (div c_main_~y~0 2))) (let ((.cse15 (* 2 .cse5))) (let ((.cse18 (* 4294967296 (div c_main_~y~0 4294967296))) (.cse12 (= .cse15 c_main_~y~0)) (.cse19 (* (- 2) .cse5))) (let ((.cse14 (div (+ .cse19 c_main_~y~0) 4294967296)) (.cse3 (not .cse12)) (.cse4 (< c_main_~y~0 .cse18)) (.cse10 (div (+ .cse19 c_main_~y~0 (- 2)) 4294967296))) (let ((.cse16 (* 4294967296 .cse10)) (.cse13 (<= .cse18 c_main_~y~0)) (.cse11 (and .cse3 .cse4)) (.cse17 (* 4294967296 .cse14))) (let ((.cse8 (+ .cse14 1)) (.cse9 (+ .cse10 1)) (.cse6 (or .cse11 (< (+ .cse15 .cse17) c_main_~y~0))) (.cse0 (or .cse12 .cse13)) (.cse7 (or .cse12 (< (+ .cse15 .cse16 2) c_main_~y~0) .cse13))) (and (or (and (let ((.cse1 (+ (* 2 c_main_~y~0) (* 2 (div (+ c_main_~x~0 2) 2)))) (.cse2 (* 4 .cse5))) (or (and .cse0 (<= .cse1 (+ .cse2 c_main_~x~0 3))) (and .cse3 (<= .cse1 (+ .cse2 c_main_~x~0 7)) .cse4))) .cse6 .cse7) (and .cse0 (<= .cse8 0)) (and .cse3 (<= .cse9 0) .cse4)) (or (and .cse3 (<= 0 .cse10) .cse4) (and (or (< 0 .cse8) .cse11) (or .cse12 (< 0 .cse9) .cse13)) (and .cse0 (<= 0 .cse14))) .cse6 (or (and .cse3 (<= c_main_~y~0 (+ .cse15 .cse16 4294967297)) .cse4) (and .cse0 (<= c_main_~y~0 (+ .cse15 .cse17 4294967295)))) .cse7))))))) is different from true [2019-10-03 02:32:33,632 WARN L191 SmtUtils]: Spent 28.32 s on a formula simplification. DAG size of input: 177 DAG size of output: 29 [2019-10-03 02:32:33,713 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2019-10-03 02:32:33,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:32:33,713 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:32:33,714 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2019-10-03 02:32:33,714 INFO L207 CegarAbsIntRunner]: [0], [4], [11], [13], [18], [24], [30], [36], [42], [48], [54], [60], [66], [72], [79], [82], [84], [90], [91], [92], [94] [2019-10-03 02:32:33,716 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 02:32:33,717 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 02:32:33,718 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 02:32:34,440 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 02:32:34,440 INFO L272 AbstractInterpreter]: Visited 21 different actions 69 times. Merged at 12 different actions 36 times. Widened at 1 different actions 1 times. Performed 224 root evaluator evaluations with a maximum evaluation depth of 13. Performed 224 inverse root evaluator evaluations with a maximum inverse evaluation depth of 13. Found 1 fixpoints after 1 different actions. Largest state had 4 variables. [2019-10-03 02:32:34,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:34,441 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 02:32:34,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:32:34,441 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 02:32:34,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:34,459 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 02:32:34,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:34,474 WARN L254 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-03 02:32:34,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:32:34,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:32:34,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:32:34,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:32:34,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:32:34,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:32:34,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:32:34,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:32:34,665 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-03 02:32:34,666 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:32:34,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 02:32:34,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:32:34,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:32:34,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:32:34,805 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-03 02:32:34,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:32:34,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 6] total 22 [2019-10-03 02:32:34,810 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:32:34,810 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-03 02:32:34,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-03 02:32:34,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=173, Unknown=10, NotChecked=224, Total=462 [2019-10-03 02:32:34,811 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 20 states. [2019-10-03 02:32:36,888 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse11 (div c_main_~y~0 2))) (let ((.cse18 (* 2 .cse11))) (let ((.cse4 (* 4294967296 (div c_main_~y~0 4294967296))) (.cse0 (= .cse18 c_main_~y~0)) (.cse19 (* (- 2) .cse11))) (let ((.cse17 (div (+ .cse19 c_main_~y~0) 4294967296)) (.cse7 (not .cse0)) (.cse8 (< c_main_~y~0 .cse4)) (.cse16 (div (+ .cse19 c_main_~y~0 (- 2)) 4294967296))) (let ((.cse3 (+ .cse18 (* 4294967296 .cse16) 2)) (.cse1 (and .cse7 .cse8)) (.cse6 (+ .cse18 (* 4294967296 .cse17))) (.cse2 (<= .cse4 c_main_~y~0))) (let ((.cse14 (+ .cse17 1)) (.cse15 (+ .cse16 1)) (.cse5 (or .cse0 .cse2)) (.cse12 (or .cse1 (< .cse6 c_main_~y~0))) (.cse13 (or .cse0 (< .cse3 c_main_~y~0) .cse2))) (and (= c_main_~x~0 1) (or .cse0 .cse1 .cse2) (or (not (= c_main_~y~0 .cse3)) .cse0 .cse2) (< .cse4 (+ c_main_~y~0 1)) (or (and .cse5 (<= c_main_~y~0 .cse6)) (and .cse7 (<= c_main_~y~0 .cse3) .cse8) (and (let ((.cse9 (* 2 c_main_~y~0)) (.cse10 (* 4 .cse11))) (or (and .cse7 .cse8 (<= (+ .cse9 (* 2 (div (+ c_main_~x~0 2) 2))) (+ .cse10 c_main_~x~0 5))) (and .cse5 (<= (+ .cse9 (* 2 (div c_main_~x~0 2))) (+ .cse10 c_main_~x~0 1))))) .cse12 .cse13) (and .cse5 (<= .cse14 0)) (and .cse7 (<= .cse15 0) .cse8)) (or (not (= .cse6 c_main_~y~0)) .cse1) (not (= (mod c_main_~y~0 2) 0)) (or (and .cse7 (<= 0 .cse16) .cse8) (and (or (< 0 .cse14) .cse1) (or .cse0 (< 0 .cse15) .cse2)) (and .cse5 (<= 0 .cse17))) .cse12 .cse13))))))) is different from false [2019-10-03 02:32:38,923 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse11 (div c_main_~y~0 2))) (let ((.cse18 (* 2 .cse11))) (let ((.cse4 (* 4294967296 (div c_main_~y~0 4294967296))) (.cse0 (= .cse18 c_main_~y~0)) (.cse19 (* (- 2) .cse11))) (let ((.cse17 (div (+ .cse19 c_main_~y~0) 4294967296)) (.cse7 (not .cse0)) (.cse8 (< c_main_~y~0 .cse4)) (.cse16 (div (+ .cse19 c_main_~y~0 (- 2)) 4294967296))) (let ((.cse3 (+ .cse18 (* 4294967296 .cse16) 2)) (.cse1 (and .cse7 .cse8)) (.cse6 (+ .cse18 (* 4294967296 .cse17))) (.cse2 (<= .cse4 c_main_~y~0))) (let ((.cse14 (+ .cse17 1)) (.cse15 (+ .cse16 1)) (.cse5 (or .cse0 .cse2)) (.cse12 (or .cse1 (< .cse6 c_main_~y~0))) (.cse13 (or .cse0 (< .cse3 c_main_~y~0) .cse2))) (and (= c_main_~x~0 1) (or .cse0 .cse1 .cse2) (or (not (= c_main_~y~0 .cse3)) .cse0 .cse2) (< .cse4 (+ c_main_~y~0 1)) (or (and .cse5 (<= c_main_~y~0 .cse6)) (and .cse7 (<= c_main_~y~0 .cse3) .cse8) (and (let ((.cse9 (* 2 c_main_~y~0)) (.cse10 (* 4 .cse11))) (or (and .cse7 .cse8 (<= (+ .cse9 (* 2 (div (+ c_main_~x~0 2) 2))) (+ .cse10 c_main_~x~0 5))) (and .cse5 (<= (+ .cse9 (* 2 (div c_main_~x~0 2))) (+ .cse10 c_main_~x~0 1))))) .cse12 .cse13) (and .cse5 (<= .cse14 0)) (and .cse7 (<= .cse15 0) .cse8)) (or (not (= .cse6 c_main_~y~0)) .cse1) (not (= (mod c_main_~y~0 2) 0)) (or (and .cse7 (<= 0 .cse16) .cse8) (and (or (< 0 .cse14) .cse1) (or .cse0 (< 0 .cse15) .cse2)) (and .cse5 (<= 0 .cse17))) .cse12 .cse13))))))) is different from true [2019-10-03 02:32:40,950 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse10 (div c_main_~y~0 2))) (let ((.cse18 (* 2 .cse10))) (let ((.cse15 (* 4294967296 (div c_main_~y~0 4294967296))) (.cse12 (= .cse18 c_main_~y~0)) (.cse19 (* (- 2) .cse10))) (let ((.cse17 (div (+ .cse19 c_main_~y~0) 4294967296)) (.cse2 (not .cse12)) (.cse4 (< c_main_~y~0 .cse15)) (.cse16 (div (+ .cse19 c_main_~y~0 (- 2)) 4294967296))) (let ((.cse3 (+ .cse18 (* 4294967296 .cse16) 2)) (.cse13 (and .cse2 .cse4)) (.cse1 (+ .cse18 (* 4294967296 .cse17))) (.cse14 (<= .cse15 c_main_~y~0))) (let ((.cse5 (+ .cse17 1)) (.cse6 (+ .cse16 1)) (.cse0 (or .cse12 .cse14)) (.cse7 (or .cse13 (< .cse1 c_main_~y~0))) (.cse11 (or .cse12 (< .cse3 c_main_~y~0) .cse14))) (and (or (and .cse0 (<= c_main_~y~0 .cse1)) (and .cse2 (<= c_main_~y~0 .cse3) .cse4) (and .cse0 (<= .cse5 0)) (and .cse2 (<= .cse6 0) .cse4) (and .cse7 (let ((.cse8 (* 2 c_main_~y~0)) (.cse9 (* 4 .cse10))) (or (and .cse0 (<= (+ .cse8 (* 2 (div (+ c_main_~x~0 2) 2))) (+ .cse9 c_main_~x~0 3))) (and .cse2 .cse4 (<= (+ .cse8 (* 2 (div (+ c_main_~x~0 4) 2))) (+ .cse9 c_main_~x~0 7))))) .cse11)) (or .cse12 .cse13 .cse14) (or (not (= c_main_~y~0 .cse3)) .cse12 .cse14) (< .cse15 (+ c_main_~y~0 1)) (or (not (= .cse1 c_main_~y~0)) .cse13) (not (= (mod c_main_~y~0 2) 0)) (or (and .cse2 (<= 0 .cse16) .cse4) (and (or (< 0 .cse5) .cse13) (or .cse12 (< 0 .cse6) .cse14)) (and .cse0 (<= 0 .cse17))) .cse7 (= (+ c_main_~x~0 1) 0) .cse11))))))) is different from false [2019-10-03 02:32:47,107 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse10 (div c_main_~y~0 2))) (let ((.cse17 (* 2 .cse10)) (.cse21 (* (- 2) .cse10))) (let ((.cse15 (div (+ .cse21 c_main_~y~0 (- 2)) 4294967296)) (.cse20 (* 4294967296 (div c_main_~y~0 4294967296))) (.cse1 (= .cse17 c_main_~y~0)) (.cse16 (div (+ .cse21 c_main_~y~0) 4294967296))) (let ((.cse19 (* 4294967296 .cse16)) (.cse5 (not .cse1)) (.cse8 (< c_main_~y~0 .cse20)) (.cse18 (* 4294967296 .cse15))) (let ((.cse0 (+ .cse17 .cse18 2)) (.cse2 (<= .cse20 c_main_~y~0)) (.cse4 (and .cse5 .cse8)) (.cse3 (+ .cse17 .cse19))) (let ((.cse13 (+ .cse16 1)) (.cse14 (+ .cse15 1)) (.cse11 (or .cse4 (< .cse3 c_main_~y~0))) (.cse9 (or .cse1 .cse2)) (.cse12 (or .cse1 (< .cse0 c_main_~y~0) .cse2))) (and (= c_main_~x~0 1) (or (not (= c_main_~y~0 .cse0)) .cse1 .cse2) (or (not (= .cse3 c_main_~y~0)) .cse4) (not (= (mod c_main_~y~0 2) 0)) (or (and (let ((.cse6 (+ (* 2 c_main_~y~0) (* 2 (div c_main_~x~0 2)))) (.cse7 (* 4 .cse10))) (or (and .cse5 (<= .cse6 (+ .cse7 c_main_~x~0 5)) .cse8) (and .cse9 (<= .cse6 (+ .cse7 c_main_~x~0 1))))) .cse11 .cse12) (and .cse9 (<= .cse13 0)) (and .cse5 (<= .cse14 0) .cse8)) (or (and .cse5 (<= 0 .cse15) .cse8) (and (or (< 0 .cse13) .cse4) (or .cse1 (< 0 .cse14) .cse2)) (and .cse9 (<= 0 .cse16))) .cse11 (or (and .cse5 (<= c_main_~y~0 (+ .cse17 .cse18 4294967297)) .cse8) (and .cse9 (<= c_main_~y~0 (+ .cse17 .cse19 4294967295)))) .cse12))))))) is different from false [2019-10-03 02:32:57,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:57,302 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2019-10-03 02:32:57,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-03 02:32:57,303 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 21 [2019-10-03 02:32:57,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:57,304 INFO L225 Difference]: With dead ends: 46 [2019-10-03 02:32:57,304 INFO L226 Difference]: Without dead ends: 38 [2019-10-03 02:32:57,304 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 35 SyntacticMatches, 7 SemanticMatches, 24 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 71.2s TimeCoverageRelationStatistics Valid=67, Invalid=199, Unknown=14, NotChecked=370, Total=650 [2019-10-03 02:32:57,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-10-03 02:32:57,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2019-10-03 02:32:57,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-03 02:32:57,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2019-10-03 02:32:57,310 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 21 [2019-10-03 02:32:57,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:57,311 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2019-10-03 02:32:57,311 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-03 02:32:57,311 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2019-10-03 02:32:57,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-03 02:32:57,315 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:57,315 INFO L411 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-03 02:32:57,315 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:57,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:57,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1655470351, now seen corresponding path program 1 times [2019-10-03 02:32:57,316 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:57,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:57,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:57,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:57,319 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:57,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:59,369 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (div c_main_~y~0 2))) (let ((.cse0 (* 2 .cse4))) (let ((.cse1 (* (- 2) .cse4)) (.cse2 (= .cse0 c_main_~y~0)) (.cse3 (* 4294967296 (div c_main_~y~0 4294967296)))) (and (or (not (= c_main_~y~0 (+ .cse0 (* 4294967296 (div (+ .cse1 c_main_~y~0 (- 2)) 4294967296)) 2))) .cse2 (<= .cse3 c_main_~y~0)) (or (not (= (+ .cse0 (* 4294967296 (div (+ .cse1 c_main_~y~0) 4294967296))) c_main_~y~0)) (and (not .cse2) (< c_main_~y~0 .cse3))))))) is different from false [2019-10-03 02:32:59,373 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-03 02:32:59,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:32:59,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:32:59,374 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:59,374 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:32:59,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:32:59,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2019-10-03 02:32:59,375 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 3 states. [2019-10-03 02:32:59,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:59,376 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-10-03 02:32:59,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:32:59,376 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-03 02:32:59,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:59,377 INFO L225 Difference]: With dead ends: 40 [2019-10-03 02:32:59,377 INFO L226 Difference]: Without dead ends: 33 [2019-10-03 02:32:59,377 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2019-10-03 02:32:59,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-10-03 02:32:59,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-10-03 02:32:59,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-03 02:32:59,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-10-03 02:32:59,381 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 21 [2019-10-03 02:32:59,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:59,381 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-10-03 02:32:59,381 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:32:59,381 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-10-03 02:32:59,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-03 02:32:59,382 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:59,382 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:59,382 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:59,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:59,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1061692130, now seen corresponding path program 2 times [2019-10-03 02:32:59,383 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:59,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:59,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:59,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:59,384 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:59,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:59,764 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:59,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:32:59,764 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:32:59,765 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:32:59,765 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:32:59,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:32:59,765 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 02:32:59,790 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-03 02:32:59,790 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-10-03 02:32:59,811 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-03 02:32:59,811 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-03 02:32:59,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 43 conjunts are in the unsatisfiable core [2019-10-03 02:32:59,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:32:59,853 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:59,853 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:33:03,863 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:33:03,866 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:33:03,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2019-10-03 02:33:03,867 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:33:03,867 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-03 02:33:03,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-03 02:33:03,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=570, Invalid=1410, Unknown=0, NotChecked=0, Total=1980 [2019-10-03 02:33:03,868 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 24 states. [2019-10-03 02:33:04,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:33:04,450 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-10-03 02:33:04,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-03 02:33:04,451 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 32 [2019-10-03 02:33:04,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:33:04,452 INFO L225 Difference]: With dead ends: 45 [2019-10-03 02:33:04,452 INFO L226 Difference]: Without dead ends: 45 [2019-10-03 02:33:04,453 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=570, Invalid=1410, Unknown=0, NotChecked=0, Total=1980 [2019-10-03 02:33:04,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-03 02:33:04,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2019-10-03 02:33:04,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-10-03 02:33:04,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-10-03 02:33:04,456 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 32 [2019-10-03 02:33:04,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:33:04,457 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-10-03 02:33:04,457 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-03 02:33:04,457 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-10-03 02:33:04,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-03 02:33:04,458 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:33:04,458 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:33:04,459 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:33:04,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:33:04,459 INFO L82 PathProgramCache]: Analyzing trace with hash 263609359, now seen corresponding path program 3 times [2019-10-03 02:33:04,459 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:33:04,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:33:04,460 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 02:33:04,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:33:04,460 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:33:04,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:33:05,149 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:33:05,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:33:05,149 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:33:05,149 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:33:05,150 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:33:05,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:33:05,150 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 02:33:05,170 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-03 02:33:05,171 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-10-03 02:33:05,207 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-03 02:33:05,207 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-03 02:33:05,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 63 conjunts are in the unsatisfiable core [2019-10-03 02:33:05,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:33:05,270 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:33:05,270 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:33:09,912 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:33:09,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:33:09,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2019-10-03 02:33:09,916 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:33:09,916 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-10-03 02:33:09,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-10-03 02:33:09,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1073, Invalid=3087, Unknown=0, NotChecked=0, Total=4160 [2019-10-03 02:33:09,926 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 34 states. [2019-10-03 02:33:10,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:33:10,991 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-10-03 02:33:10,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-10-03 02:33:10,992 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 43 [2019-10-03 02:33:10,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:33:10,993 INFO L225 Difference]: With dead ends: 56 [2019-10-03 02:33:10,993 INFO L226 Difference]: Without dead ends: 56 [2019-10-03 02:33:10,995 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=1073, Invalid=3087, Unknown=0, NotChecked=0, Total=4160 [2019-10-03 02:33:10,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-10-03 02:33:10,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2019-10-03 02:33:10,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-10-03 02:33:10,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-10-03 02:33:10,998 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 43 [2019-10-03 02:33:10,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:33:10,999 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-10-03 02:33:10,999 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-10-03 02:33:10,999 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-10-03 02:33:11,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-03 02:33:11,000 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:33:11,001 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:33:11,001 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:33:11,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:33:11,001 INFO L82 PathProgramCache]: Analyzing trace with hash 915707074, now seen corresponding path program 4 times [2019-10-03 02:33:11,001 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:33:11,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:33:11,003 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 02:33:11,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:33:11,003 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:33:11,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:33:12,305 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:33:12,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:33:12,305 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:33:12,306 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:33:12,306 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:33:12,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:33:12,306 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 02:33:12,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:33:12,326 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 02:33:12,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:33:12,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 83 conjunts are in the unsatisfiable core [2019-10-03 02:33:12,359 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:33:12,423 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:33:12,423 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:33:16,122 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:33:16,126 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:33:16,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2019-10-03 02:33:16,127 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:33:16,127 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-10-03 02:33:16,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-10-03 02:33:16,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1403, Invalid=5737, Unknown=0, NotChecked=0, Total=7140 [2019-10-03 02:33:16,130 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 44 states. [2019-10-03 02:33:17,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:33:17,853 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-10-03 02:33:17,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-10-03 02:33:17,854 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 54 [2019-10-03 02:33:17,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:33:17,855 INFO L225 Difference]: With dead ends: 67 [2019-10-03 02:33:17,856 INFO L226 Difference]: Without dead ends: 67 [2019-10-03 02:33:17,858 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 858 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=1403, Invalid=5737, Unknown=0, NotChecked=0, Total=7140 [2019-10-03 02:33:17,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-10-03 02:33:17,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2019-10-03 02:33:17,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-10-03 02:33:17,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-10-03 02:33:17,861 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 54 [2019-10-03 02:33:17,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:33:17,862 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-10-03 02:33:17,862 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-10-03 02:33:17,862 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-10-03 02:33:17,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-03 02:33:17,863 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:33:17,864 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:33:17,864 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:33:17,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:33:17,864 INFO L82 PathProgramCache]: Analyzing trace with hash -161874385, now seen corresponding path program 5 times [2019-10-03 02:33:17,864 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:33:17,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:33:17,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:33:17,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:33:17,866 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:33:17,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:33:20,055 WARN L191 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 38 DAG size of output: 18 [2019-10-03 02:33:22,132 WARN L191 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 40 DAG size of output: 19 [2019-10-03 02:33:24,195 WARN L191 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-10-03 02:33:26,285 WARN L191 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-10-03 02:33:28,414 WARN L191 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-10-03 02:33:32,738 WARN L191 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-10-03 02:33:34,833 WARN L191 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-10-03 02:33:36,938 WARN L191 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-10-03 02:33:41,045 WARN L191 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-10-03 02:33:43,142 WARN L191 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-10-03 02:33:45,251 WARN L191 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-10-03 02:33:47,264 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse9 (div c_main_~y~0 2))) (let ((.cse2 (* 2 .cse9))) (let ((.cse7 (* (- 2) .cse9)) (.cse8 (= .cse2 c_main_~y~0)) (.cse6 (* 4294967296 (div c_main_~y~0 4294967296)))) (let ((.cse4 (or .cse8 (<= .cse6 c_main_~y~0))) (.cse5 (* 4294967296 (div (+ .cse7 c_main_~y~0) 4294967296))) (.cse0 (not .cse8)) (.cse3 (* 4294967296 (div (+ .cse7 c_main_~y~0 (- 2)) 4294967296))) (.cse1 (< c_main_~y~0 .cse6))) (and (or (and .cse0 .cse1 (<= (+ .cse2 c_main_~x~0 .cse3) (+ c_main_~y~0 30))) (and .cse4 (<= (+ .cse2 c_main_~x~0 .cse5) (+ c_main_~y~0 32)))) (<= 32 c_main_~x~0) (or (and .cse4 (<= c_main_~y~0 (+ .cse2 .cse5))) (and .cse0 (<= c_main_~y~0 (+ .cse2 .cse3 2)) .cse1))))))) is different from true [2019-10-03 02:33:51,476 WARN L191 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-10-03 02:33:55,627 WARN L191 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-10-03 02:33:57,872 WARN L191 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-10-03 02:34:02,421 WARN L191 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-10-03 02:34:04,700 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse9 (div c_main_~y~0 2))) (let ((.cse1 (* 2 .cse9))) (let ((.cse7 (* (- 2) .cse9)) (.cse8 (= .cse1 c_main_~y~0)) (.cse6 (* 4294967296 (div c_main_~y~0 4294967296)))) (let ((.cse0 (or .cse8 (<= .cse6 c_main_~y~0))) (.cse2 (* 4294967296 (div (+ .cse7 c_main_~y~0) 4294967296))) (.cse3 (not .cse8)) (.cse4 (* 4294967296 (div (+ .cse7 c_main_~y~0 (- 2)) 4294967296))) (.cse5 (< c_main_~y~0 .cse6))) (and (or (and .cse0 (<= (+ .cse1 c_main_~x~0 .cse2) (+ c_main_~y~0 56))) (and .cse3 (<= (+ .cse1 c_main_~x~0 .cse4) (+ c_main_~y~0 54)) .cse5)) (or (and .cse0 (<= c_main_~y~0 (+ .cse1 .cse2))) (and .cse3 (<= c_main_~y~0 (+ .cse1 .cse4 2)) .cse5)) (<= 56 c_main_~x~0)))))) is different from true [2019-10-03 02:34:06,864 WARN L191 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-10-03 02:34:11,764 WARN L191 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-10-03 02:34:13,937 WARN L191 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-10-03 02:34:16,778 WARN L191 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-10-03 02:34:20,967 WARN L191 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-10-03 02:34:23,368 WARN L191 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-10-03 02:34:25,564 WARN L191 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-10-03 02:34:27,787 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse9 (div c_main_~y~0 2))) (let ((.cse1 (* 2 .cse9))) (let ((.cse7 (* (- 2) .cse9)) (.cse8 (= .cse1 c_main_~y~0)) (.cse6 (* 4294967296 (div c_main_~y~0 4294967296)))) (let ((.cse0 (or .cse8 (<= .cse6 c_main_~y~0))) (.cse2 (* 4294967296 (div (+ .cse7 c_main_~y~0) 4294967296))) (.cse3 (not .cse8)) (.cse5 (* 4294967296 (div (+ .cse7 c_main_~y~0 (- 2)) 4294967296))) (.cse4 (< c_main_~y~0 .cse6))) (and (<= 94 c_main_~x~0) (or (and .cse0 (<= (+ .cse1 c_main_~x~0 .cse2) (+ c_main_~y~0 94))) (and .cse3 .cse4 (<= (+ .cse1 c_main_~x~0 .cse5) (+ c_main_~y~0 92)))) (or (and .cse0 (<= c_main_~y~0 (+ .cse1 .cse2))) (and .cse3 (<= c_main_~y~0 (+ .cse1 .cse5 2)) .cse4))))))) is different from true [2019-10-03 02:34:30,011 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse9 (div c_main_~y~0 2))) (let ((.cse1 (* 2 .cse9))) (let ((.cse7 (* (- 2) .cse9)) (.cse8 (= .cse1 c_main_~y~0)) (.cse6 (* 4294967296 (div c_main_~y~0 4294967296)))) (let ((.cse0 (or .cse8 (<= .cse6 c_main_~y~0))) (.cse2 (* 4294967296 (div (+ .cse7 c_main_~y~0) 4294967296))) (.cse3 (not .cse8)) (.cse4 (* 4294967296 (div (+ .cse7 c_main_~y~0 (- 2)) 4294967296))) (.cse5 (< c_main_~y~0 .cse6))) (and (or (and .cse0 (<= (+ .cse1 c_main_~x~0 .cse2) (+ c_main_~y~0 98))) (and .cse3 (<= (+ .cse1 c_main_~x~0 .cse4) (+ c_main_~y~0 96)) .cse5)) (or (and .cse0 (<= c_main_~y~0 (+ .cse1 .cse2))) (and .cse3 (<= c_main_~y~0 (+ .cse1 .cse4 2)) .cse5)) (<= 98 c_main_~x~0)))))) is different from true [2019-10-03 02:34:32,026 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (div c_main_~x~0 2))) (let ((.cse9 (* 2 .cse5)) (.cse31 (* 4294967296 (div c_main_~x~0 4294967296)))) (let ((.cse30 (* (- 2) .cse5)) (.cse16 (<= .cse31 c_main_~x~0)) (.cse19 (= c_main_~x~0 .cse9))) (let ((.cse2 (not .cse19)) (.cse3 (< c_main_~x~0 .cse31)) (.cse0 (or .cse16 .cse19)) (.cse4 (div (+ c_main_~x~0 .cse30 (- 2)) 4294967296)) (.cse1 (div (+ c_main_~x~0 .cse30) 4294967296))) (or (and .cse0 (<= (+ .cse1 1) 0)) (and .cse2 .cse3 (<= (+ .cse4 1) 0)) (and (or (< 49 .cse5) (<= 100 c_main_~x~0)) (or (<= .cse5 49) (let ((.cse29 (div c_main_~y~0 2))) (let ((.cse11 (* 2 .cse29)) (.cse27 (* 4294967296 (div c_main_~y~0 4294967296))) (.cse28 (* (- 2) .cse29))) (let ((.cse26 (* 4294967296 (div (+ .cse28 c_main_~y~0) 4294967296))) (.cse10 (* 4294967296 .cse1)) (.cse15 (<= .cse27 c_main_~y~0)) (.cse14 (= .cse11 c_main_~y~0)) (.cse12 (* 4294967296 (div (+ .cse28 c_main_~y~0 (- 2)) 4294967296))) (.cse17 (* 4294967296 .cse4))) (let ((.cse24 (+ c_main_~y~0 .cse17 .cse9)) (.cse18 (+ .cse11 c_main_~x~0 .cse12)) (.cse25 (+ c_main_~y~0 .cse17 .cse9 2)) (.cse20 (not .cse14)) (.cse21 (< c_main_~y~0 .cse27)) (.cse23 (+ .cse11 c_main_~x~0 .cse12 2)) (.cse22 (or .cse14 .cse15)) (.cse13 (+ c_main_~y~0 .cse9 .cse10)) (.cse8 (+ .cse11 c_main_~x~0 .cse26))) (and (let ((.cse6 (and .cse2 .cse3)) (.cse7 (and .cse20 .cse21))) (or (and (or .cse6 (and (or .cse7 (< .cse8 (+ c_main_~y~0 .cse9 .cse10 1))) (or (< (+ .cse11 c_main_~x~0 .cse12 1) .cse13) .cse14 .cse15))) (or .cse16 (and (or (< .cse8 (+ c_main_~y~0 .cse17 .cse9 3)) .cse7) (or (< .cse18 (+ c_main_~y~0 .cse17 .cse9 1)) .cse14 .cse15)) .cse19)) (and .cse20 .cse21 (<= .cse18 (+ c_main_~y~0 98))) (and .cse22 (<= .cse8 (+ c_main_~y~0 100))) (and (or .cse6 (and (or (< .cse8 .cse13) .cse7) (or .cse14 .cse15 (< .cse23 .cse13)))) (or .cse16 (and (or (< .cse18 .cse24) .cse14 .cse15) (or .cse7 (< .cse8 .cse25))) .cse19)))) (or (and .cse22 (<= c_main_~y~0 (+ .cse11 .cse26))) (and .cse20 (<= c_main_~y~0 (+ .cse11 .cse12 2)) .cse21) (and .cse2 (or (and .cse20 (<= .cse24 .cse18) .cse21) (and .cse22 (<= .cse25 .cse8))) .cse3) (and .cse0 (or (and .cse20 .cse21 (<= .cse13 .cse23)) (and .cse22 (<= .cse13 .cse8))))))))))))))))) is different from false [2019-10-03 02:34:34,048 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (* 4294967296 (div c_main_~x~0 4294967296)))) (and (< .cse0 (+ c_main_~x~0 1)) (let ((.cse6 (div c_main_~x~0 2))) (let ((.cse10 (* 2 .cse6))) (let ((.cse31 (* (- 2) .cse6)) (.cse17 (<= .cse0 c_main_~x~0)) (.cse20 (= c_main_~x~0 .cse10))) (let ((.cse3 (not .cse20)) (.cse4 (< c_main_~x~0 .cse0)) (.cse1 (or .cse17 .cse20)) (.cse5 (div (+ c_main_~x~0 .cse31 (- 2)) 4294967296)) (.cse2 (div (+ c_main_~x~0 .cse31) 4294967296))) (or (and .cse1 (<= (+ .cse2 1) 0)) (and .cse3 .cse4 (<= (+ .cse5 1) 0)) (and (or (< 49 .cse6) (<= 100 c_main_~x~0)) (or (<= .cse6 49) (let ((.cse30 (div c_main_~y~0 2))) (let ((.cse12 (* 2 .cse30)) (.cse28 (* 4294967296 (div c_main_~y~0 4294967296))) (.cse29 (* (- 2) .cse30))) (let ((.cse27 (* 4294967296 (div (+ .cse29 c_main_~y~0) 4294967296))) (.cse11 (* 4294967296 .cse2)) (.cse16 (<= .cse28 c_main_~y~0)) (.cse15 (= .cse12 c_main_~y~0)) (.cse13 (* 4294967296 (div (+ .cse29 c_main_~y~0 (- 2)) 4294967296))) (.cse18 (* 4294967296 .cse5))) (let ((.cse25 (+ c_main_~y~0 .cse18 .cse10)) (.cse19 (+ .cse12 c_main_~x~0 .cse13)) (.cse26 (+ c_main_~y~0 .cse18 .cse10 2)) (.cse21 (not .cse15)) (.cse22 (< c_main_~y~0 .cse28)) (.cse24 (+ .cse12 c_main_~x~0 .cse13 2)) (.cse23 (or .cse15 .cse16)) (.cse14 (+ c_main_~y~0 .cse10 .cse11)) (.cse9 (+ .cse12 c_main_~x~0 .cse27))) (and (let ((.cse7 (and .cse3 .cse4)) (.cse8 (and .cse21 .cse22))) (or (and (or .cse7 (and (or .cse8 (< .cse9 (+ c_main_~y~0 .cse10 .cse11 1))) (or (< (+ .cse12 c_main_~x~0 .cse13 1) .cse14) .cse15 .cse16))) (or .cse17 (and (or (< .cse9 (+ c_main_~y~0 .cse18 .cse10 3)) .cse8) (or (< .cse19 (+ c_main_~y~0 .cse18 .cse10 1)) .cse15 .cse16)) .cse20)) (and .cse21 .cse22 (<= .cse19 (+ c_main_~y~0 98))) (and .cse23 (<= .cse9 (+ c_main_~y~0 100))) (and (or .cse7 (and (or (< .cse9 .cse14) .cse8) (or .cse15 .cse16 (< .cse24 .cse14)))) (or .cse17 (and (or (< .cse19 .cse25) .cse15 .cse16) (or .cse8 (< .cse9 .cse26))) .cse20)))) (or (and .cse23 (<= c_main_~y~0 (+ .cse12 .cse27))) (and .cse21 (<= c_main_~y~0 (+ .cse12 .cse13 2)) .cse22) (and .cse3 (or (and .cse21 (<= .cse25 .cse19) .cse22) (and .cse23 (<= .cse26 .cse9))) .cse4) (and .cse1 (or (and .cse21 .cse22 (<= .cse14 .cse24)) (and .cse23 (<= .cse14 .cse9))))))))))))))))))) is different from true [2019-10-03 02:34:34,215 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 21 not checked. [2019-10-03 02:34:34,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:34:34,215 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:34:34,215 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:34:34,216 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:34:34,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:34:34,216 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 02:34:34,238 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-03 02:34:34,238 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-10-03 02:34:34,323 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-10-03 02:34:34,323 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-03 02:34:34,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 109 conjunts are in the unsatisfiable core [2019-10-03 02:34:34,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:34:38,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:34:38,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:34:38,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:34:38,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:34:38,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:34:38,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:34:38,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:34:38,272 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:34:38,272 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:34:38,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:34:38,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:34:38,860 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (7)] Exception during sending of exit command (exit): Broken pipe [2019-10-03 02:34:38,871 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:34:38,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 55, 6] total 103 [2019-10-03 02:34:38,872 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:34:38,874 INFO L454 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-10-03 02:34:38,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-10-03 02:34:38,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=380, Invalid=8950, Unknown=6, NotChecked=1170, Total=10506 [2019-10-03 02:34:38,878 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 101 states. [2019-10-03 02:34:45,021 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse34 (div c_main_~y~0 2))) (let ((.cse31 (* (- 2) .cse34))) (let ((.cse13 (* 2 .cse34)) (.cse33 (* 4294967296 (div (+ .cse31 c_main_~y~0) 4294967296)))) (let ((.cse10 (+ .cse13 c_main_~x~0 .cse33))) (let ((.cse0 (* 4294967296 (div c_main_~x~0 4294967296))) (.cse25 (<= .cse10 (+ c_main_~y~0 100))) (.cse29 (<= c_main_~y~0 (+ .cse13 .cse33))) (.cse7 (<= 100 c_main_~x~0))) (and (< .cse0 (+ c_main_~x~0 1)) (let ((.cse6 (div c_main_~x~0 2))) (let ((.cse11 (* 2 .cse6))) (let ((.cse32 (* (- 2) .cse6)) (.cse18 (<= .cse0 c_main_~x~0)) (.cse21 (= c_main_~x~0 .cse11))) (let ((.cse3 (not .cse21)) (.cse4 (< c_main_~x~0 .cse0)) (.cse1 (or .cse18 .cse21)) (.cse5 (div (+ c_main_~x~0 .cse32 (- 2)) 4294967296)) (.cse2 (div (+ c_main_~x~0 .cse32) 4294967296))) (or (and .cse1 (<= (+ .cse2 1) 0)) (and .cse3 .cse4 (<= (+ .cse5 1) 0)) (and (or (< 49 .cse6) .cse7) (or (<= .cse6 49) (let ((.cse30 (* 4294967296 (div c_main_~y~0 4294967296)))) (let ((.cse12 (* 4294967296 .cse2)) (.cse17 (<= .cse30 c_main_~y~0)) (.cse16 (= .cse13 c_main_~y~0)) (.cse14 (* 4294967296 (div (+ .cse31 c_main_~y~0 (- 2)) 4294967296))) (.cse19 (* 4294967296 .cse5))) (let ((.cse27 (+ c_main_~y~0 .cse19 .cse11)) (.cse20 (+ .cse13 c_main_~x~0 .cse14)) (.cse28 (+ c_main_~y~0 .cse19 .cse11 2)) (.cse22 (not .cse16)) (.cse23 (< c_main_~y~0 .cse30)) (.cse26 (+ .cse13 c_main_~x~0 .cse14 2)) (.cse24 (or .cse16 .cse17)) (.cse15 (+ c_main_~y~0 .cse11 .cse12))) (and (let ((.cse8 (and .cse3 .cse4)) (.cse9 (and .cse22 .cse23))) (or (and (or .cse8 (and (or .cse9 (< .cse10 (+ c_main_~y~0 .cse11 .cse12 1))) (or (< (+ .cse13 c_main_~x~0 .cse14 1) .cse15) .cse16 .cse17))) (or .cse18 (and (or (< .cse10 (+ c_main_~y~0 .cse19 .cse11 3)) .cse9) (or (< .cse20 (+ c_main_~y~0 .cse19 .cse11 1)) .cse16 .cse17)) .cse21)) (and .cse22 .cse23 (<= .cse20 (+ c_main_~y~0 98))) (and .cse24 .cse25) (and (or .cse8 (and (or (< .cse10 .cse15) .cse9) (or .cse16 .cse17 (< .cse26 .cse15)))) (or .cse18 (and (or (< .cse20 .cse27) .cse16 .cse17) (or .cse9 (< .cse10 .cse28))) .cse21)))) (or (and .cse24 .cse29) (and .cse22 (<= c_main_~y~0 (+ .cse13 .cse14 2)) .cse23) (and .cse3 (or (and .cse22 (<= .cse27 .cse20) .cse23) (and .cse24 (<= .cse28 .cse10))) .cse4) (and .cse1 (or (and .cse22 .cse23 (<= .cse15 .cse26)) (and .cse24 (<= .cse15 .cse10)))))))))))))))) .cse25 .cse29 .cse7)))))) is different from true [2019-10-03 02:34:45,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:34:45,127 INFO L93 Difference]: Finished difference Result 64 states and 63 transitions. [2019-10-03 02:34:45,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-10-03 02:34:45,127 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 65 [2019-10-03 02:34:45,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:34:45,128 INFO L225 Difference]: With dead ends: 64 [2019-10-03 02:34:45,128 INFO L226 Difference]: Without dead ends: 0 [2019-10-03 02:34:45,132 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 82 SyntacticMatches, 5 SemanticMatches, 105 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 996 ImplicationChecksByTransitivity, 83.7s TimeCoverageRelationStatistics Valid=398, Invalid=9523, Unknown=7, NotChecked=1414, Total=11342 [2019-10-03 02:34:45,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-03 02:34:45,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-03 02:34:45,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-03 02:34:45,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-03 02:34:45,133 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 65 [2019-10-03 02:34:45,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:34:45,133 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-03 02:34:45,133 INFO L476 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-10-03 02:34:45,133 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-03 02:34:45,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-03 02:34:45,138 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 02:34:45 BoogieIcfgContainer [2019-10-03 02:34:45,139 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-03 02:34:45,140 INFO L168 Benchmark]: Toolchain (without parser) took 201671.78 ms. Allocated memory was 137.9 MB in the beginning and 420.0 MB in the end (delta: 282.1 MB). Free memory was 85.6 MB in the beginning and 242.7 MB in the end (delta: -157.0 MB). Peak memory consumption was 125.0 MB. Max. memory is 7.1 GB. [2019-10-03 02:34:45,141 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 137.9 MB. Free memory was 104.0 MB in the beginning and 103.8 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-03 02:34:45,142 INFO L168 Benchmark]: CACSL2BoogieTranslator took 260.82 ms. Allocated memory is still 137.9 MB. Free memory was 85.4 MB in the beginning and 75.4 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2019-10-03 02:34:45,142 INFO L168 Benchmark]: Boogie Preprocessor took 131.31 ms. Allocated memory was 137.9 MB in the beginning and 198.2 MB in the end (delta: 60.3 MB). Free memory was 75.4 MB in the beginning and 175.6 MB in the end (delta: -100.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 7.1 GB. [2019-10-03 02:34:45,143 INFO L168 Benchmark]: RCFGBuilder took 385.35 ms. Allocated memory is still 198.2 MB. Free memory was 175.0 MB in the beginning and 159.6 MB in the end (delta: 15.4 MB). Peak memory consumption was 15.4 MB. Max. memory is 7.1 GB. [2019-10-03 02:34:45,144 INFO L168 Benchmark]: TraceAbstraction took 200880.61 ms. Allocated memory was 198.2 MB in the beginning and 420.0 MB in the end (delta: 221.8 MB). Free memory was 159.0 MB in the beginning and 242.7 MB in the end (delta: -83.7 MB). Peak memory consumption was 138.1 MB. Max. memory is 7.1 GB. [2019-10-03 02:34:45,147 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 137.9 MB. Free memory was 104.0 MB in the beginning and 103.8 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 260.82 ms. Allocated memory is still 137.9 MB. Free memory was 85.4 MB in the beginning and 75.4 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 131.31 ms. Allocated memory was 137.9 MB in the beginning and 198.2 MB in the end (delta: 60.3 MB). Free memory was 75.4 MB in the beginning and 175.6 MB in the end (delta: -100.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 385.35 ms. Allocated memory is still 198.2 MB. Free memory was 175.0 MB in the beginning and 159.6 MB in the end (delta: 15.4 MB). Peak memory consumption was 15.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 200880.61 ms. Allocated memory was 198.2 MB in the beginning and 420.0 MB in the end (delta: 221.8 MB). Free memory was 159.0 MB in the beginning and 242.7 MB in the end (delta: -83.7 MB). Peak memory consumption was 138.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 6]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 27 locations, 1 error locations. SAFE Result, 200.7s OverallTime, 18 OverallIterations, 5 TraceHistogramMax, 32.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 402 SDtfs, 27 SDslu, 1250 SDs, 0 SdLazy, 7202 SolverSat, 124 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 706 GetRequests, 333 SyntacticMatches, 21 SemanticMatches, 352 ConstructedPredicates, 26 IntricatePredicates, 0 DeprecatedPredicates, 2308 ImplicationChecksByTransitivity, 189.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred in iteration=17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.5s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 8 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 165.3s InterpolantComputationTime, 702 NumberOfCodeBlocks, 702 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 908 ConstructedInterpolants, 48 QuantifiedInterpolants, 698238 SizeOfPredicates, 10 NumberOfNonLiveVariables, 790 ConjunctsInSsa, 350 ConjunctsInUnsatCore, 30 InterpolantComputations, 12 PerfectInterpolantSequences, 84/718 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...