java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-acceleration/diamond_2-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 23:14:05,810 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 23:14:05,812 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 23:14:05,823 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 23:14:05,823 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 23:14:05,824 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 23:14:05,826 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 23:14:05,827 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 23:14:05,829 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 23:14:05,830 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 23:14:05,832 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 23:14:05,833 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 23:14:05,833 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 23:14:05,834 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 23:14:05,835 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 23:14:05,836 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 23:14:05,837 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 23:14:05,838 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 23:14:05,840 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 23:14:05,842 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 23:14:05,843 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 23:14:05,844 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 23:14:05,846 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 23:14:05,846 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 23:14:05,849 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 23:14:05,849 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 23:14:05,850 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 23:14:05,851 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 23:14:05,851 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 23:14:05,852 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 23:14:05,852 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 23:14:05,853 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 23:14:05,854 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 23:14:05,855 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 23:14:05,856 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 23:14:05,856 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 23:14:05,857 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 23:14:05,857 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 23:14:05,857 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 23:14:05,858 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 23:14:05,859 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 23:14:05,860 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-14 23:14:05,875 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 23:14:05,875 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 23:14:05,876 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 23:14:05,877 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 23:14:05,877 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 23:14:05,877 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 23:14:05,877 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 23:14:05,877 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 23:14:05,878 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 23:14:05,878 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 23:14:05,878 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 23:14:05,878 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 23:14:05,878 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 23:14:05,878 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 23:14:05,879 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 23:14:05,879 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 23:14:05,879 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 23:14:05,879 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 23:14:05,879 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 23:14:05,880 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 23:14:05,880 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 23:14:05,880 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:14:05,880 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 23:14:05,880 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 23:14:05,881 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 23:14:05,881 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 23:14:05,881 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 23:14:05,881 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 23:14:05,882 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 23:14:06,145 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 23:14:06,157 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 23:14:06,161 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 23:14:06,162 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 23:14:06,162 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 23:14:06,163 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-14 23:14:06,251 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87cf0d468/1e0afb8b15a04e87aba338d5e5fd389e/FLAG08b85afb5 [2019-10-14 23:14:06,731 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 23:14:06,732 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/diamond_2-2.c [2019-10-14 23:14:06,744 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87cf0d468/1e0afb8b15a04e87aba338d5e5fd389e/FLAG08b85afb5 [2019-10-14 23:14:07,103 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87cf0d468/1e0afb8b15a04e87aba338d5e5fd389e [2019-10-14 23:14:07,114 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 23:14:07,116 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 23:14:07,117 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 23:14:07,117 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 23:14:07,121 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 23:14:07,122 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:14:07" (1/1) ... [2019-10-14 23:14:07,125 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14f2c9b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:14:07, skipping insertion in model container [2019-10-14 23:14:07,125 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:14:07" (1/1) ... [2019-10-14 23:14:07,132 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 23:14:07,147 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 23:14:07,303 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:14:07,307 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 23:14:07,331 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:14:07,347 INFO L192 MainTranslator]: Completed translation [2019-10-14 23:14:07,347 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:14:07 WrapperNode [2019-10-14 23:14:07,347 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 23:14:07,348 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 23:14:07,348 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 23:14:07,349 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 23:14:07,447 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:14:07" (1/1) ... [2019-10-14 23:14:07,447 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:14:07" (1/1) ... [2019-10-14 23:14:07,453 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:14:07" (1/1) ... [2019-10-14 23:14:07,454 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:14:07" (1/1) ... [2019-10-14 23:14:07,459 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:14:07" (1/1) ... [2019-10-14 23:14:07,465 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:14:07" (1/1) ... [2019-10-14 23:14:07,467 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:14:07" (1/1) ... [2019-10-14 23:14:07,468 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 23:14:07,469 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 23:14:07,469 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 23:14:07,469 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 23:14:07,470 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:14:07" (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-14 23:14:07,525 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 23:14:07,526 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 23:14:07,526 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-14 23:14:07,526 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 23:14:07,526 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 23:14:07,526 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2019-10-14 23:14:07,527 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-14 23:14:07,527 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 23:14:07,527 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 23:14:07,527 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 23:14:07,790 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 23:14:07,790 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-14 23:14:07,791 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:14:07 BoogieIcfgContainer [2019-10-14 23:14:07,792 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 23:14:07,793 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 23:14:07,793 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 23:14:07,796 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 23:14:07,796 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:14:07" (1/3) ... [2019-10-14 23:14:07,797 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c55bc22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:14:07, skipping insertion in model container [2019-10-14 23:14:07,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:14:07" (2/3) ... [2019-10-14 23:14:07,798 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c55bc22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:14:07, skipping insertion in model container [2019-10-14 23:14:07,798 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:14:07" (3/3) ... [2019-10-14 23:14:07,800 INFO L109 eAbstractionObserver]: Analyzing ICFG diamond_2-2.c [2019-10-14 23:14:07,809 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 23:14:07,817 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 23:14:07,827 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 23:14:07,852 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 23:14:07,852 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 23:14:07,852 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 23:14:07,853 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 23:14:07,853 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 23:14:07,853 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 23:14:07,853 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 23:14:07,853 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 23:14:07,868 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2019-10-14 23:14:07,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-14 23:14:07,872 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:14:07,873 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:14:07,874 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:14:07,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:14:07,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1906239810, now seen corresponding path program 1 times [2019-10-14 23:14:07,885 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:14:07,886 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748338226] [2019-10-14 23:14:07,886 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:14:07,886 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:14:07,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:14:07,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:14:07,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:14:07,978 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-14 23:14:07,979 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748338226] [2019-10-14 23:14:07,979 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:14:07,980 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-14 23:14:07,980 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739913464] [2019-10-14 23:14:07,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-14 23:14:07,984 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:14:07,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-14 23:14:07,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-14 23:14:08,001 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 2 states. [2019-10-14 23:14:08,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:14:08,027 INFO L93 Difference]: Finished difference Result 38 states and 51 transitions. [2019-10-14 23:14:08,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-14 23:14:08,029 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-10-14 23:14:08,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:14:08,037 INFO L225 Difference]: With dead ends: 38 [2019-10-14 23:14:08,038 INFO L226 Difference]: Without dead ends: 21 [2019-10-14 23:14:08,041 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 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-14 23:14:08,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-10-14 23:14:08,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-10-14 23:14:08,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-14 23:14:08,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 31 transitions. [2019-10-14 23:14:08,081 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 31 transitions. Word has length 10 [2019-10-14 23:14:08,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:14:08,082 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 31 transitions. [2019-10-14 23:14:08,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-14 23:14:08,082 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 31 transitions. [2019-10-14 23:14:08,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-14 23:14:08,083 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:14:08,083 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:14:08,084 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:14:08,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:14:08,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1847134466, now seen corresponding path program 1 times [2019-10-14 23:14:08,085 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:14:08,085 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625188720] [2019-10-14 23:14:08,085 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:14:08,085 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:14:08,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:14:08,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:14:08,334 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 5 [2019-10-14 23:14:08,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:14:08,341 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-14 23:14:08,341 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625188720] [2019-10-14 23:14:08,341 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:14:08,342 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:14:08,342 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043614737] [2019-10-14 23:14:08,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:14:08,344 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:14:08,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:14:08,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:14:08,345 INFO L87 Difference]: Start difference. First operand 21 states and 31 transitions. Second operand 3 states. [2019-10-14 23:14:08,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:14:08,441 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2019-10-14 23:14:08,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:14:08,442 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-10-14 23:14:08,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:14:08,445 INFO L225 Difference]: With dead ends: 28 [2019-10-14 23:14:08,445 INFO L226 Difference]: Without dead ends: 23 [2019-10-14 23:14:08,447 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:14:08,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-10-14 23:14:08,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-10-14 23:14:08,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-14 23:14:08,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 32 transitions. [2019-10-14 23:14:08,455 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 32 transitions. Word has length 10 [2019-10-14 23:14:08,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:14:08,455 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 32 transitions. [2019-10-14 23:14:08,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:14:08,456 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 32 transitions. [2019-10-14 23:14:08,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-14 23:14:08,457 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:14:08,457 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:14:08,457 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:14:08,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:14:08,458 INFO L82 PathProgramCache]: Analyzing trace with hash -129940435, now seen corresponding path program 1 times [2019-10-14 23:14:08,458 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:14:08,459 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047122996] [2019-10-14 23:14:08,459 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:14:08,459 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:14:08,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:14:08,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:14:08,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:14:08,583 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-14 23:14:08,584 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047122996] [2019-10-14 23:14:08,584 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:14:08,584 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:14:08,584 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812042724] [2019-10-14 23:14:08,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:14:08,585 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:14:08,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:14:08,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:14:08,586 INFO L87 Difference]: Start difference. First operand 22 states and 32 transitions. Second operand 3 states. [2019-10-14 23:14:08,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:14:08,721 INFO L93 Difference]: Finished difference Result 50 states and 81 transitions. [2019-10-14 23:14:08,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:14:08,724 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-14 23:14:08,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:14:08,725 INFO L225 Difference]: With dead ends: 50 [2019-10-14 23:14:08,726 INFO L226 Difference]: Without dead ends: 34 [2019-10-14 23:14:08,726 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-14 23:14:08,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-10-14 23:14:08,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-10-14 23:14:08,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-14 23:14:08,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2019-10-14 23:14:08,734 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 21 [2019-10-14 23:14:08,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:14:08,734 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2019-10-14 23:14:08,735 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:14:08,735 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2019-10-14 23:14:08,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-14 23:14:08,736 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:14:08,736 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:14:08,736 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:14:08,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:14:08,737 INFO L82 PathProgramCache]: Analyzing trace with hash 263086575, now seen corresponding path program 1 times [2019-10-14 23:14:08,737 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:14:08,737 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580271080] [2019-10-14 23:14:08,737 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:14:08,737 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:14:08,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:14:08,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:14:09,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:14:09,085 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-14 23:14:09,089 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580271080] [2019-10-14 23:14:09,090 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [672061517] [2019-10-14 23:14:09,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:14:09,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:14:09,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-14 23:14:09,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:14:09,223 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-14 23:14:09,224 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:14:09,224 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-10-14 23:14:09,224 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367323542] [2019-10-14 23:14:09,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-14 23:14:09,226 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:14:09,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-14 23:14:09,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-10-14 23:14:09,228 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. Second operand 14 states. [2019-10-14 23:14:09,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:14:09,443 INFO L93 Difference]: Finished difference Result 51 states and 64 transitions. [2019-10-14 23:14:09,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-14 23:14:09,445 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 21 [2019-10-14 23:14:09,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:14:09,446 INFO L225 Difference]: With dead ends: 51 [2019-10-14 23:14:09,447 INFO L226 Difference]: Without dead ends: 46 [2019-10-14 23:14:09,449 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-10-14 23:14:09,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-10-14 23:14:09,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2019-10-14 23:14:09,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-10-14 23:14:09,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2019-10-14 23:14:09,462 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 56 transitions. Word has length 21 [2019-10-14 23:14:09,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:14:09,462 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 56 transitions. [2019-10-14 23:14:09,466 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-14 23:14:09,466 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2019-10-14 23:14:09,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-14 23:14:09,467 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:14:09,468 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:14:09,674 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:14:09,675 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:14:09,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:14:09,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1016777103, now seen corresponding path program 1 times [2019-10-14 23:14:09,676 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:14:09,677 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619317208] [2019-10-14 23:14:09,677 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:14:09,678 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:14:09,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:14:09,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:14:11,766 WARN L191 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 29 DAG size of output: 13 [2019-10-14 23:14:11,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:14:11,770 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-14 23:14:11,771 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619317208] [2019-10-14 23:14:11,771 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:14:11,771 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:14:11,771 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746571304] [2019-10-14 23:14:11,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:14:11,772 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:14:11,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:14:11,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:14:11,773 INFO L87 Difference]: Start difference. First operand 44 states and 56 transitions. Second operand 3 states. [2019-10-14 23:14:11,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:14:11,857 INFO L93 Difference]: Finished difference Result 61 states and 73 transitions. [2019-10-14 23:14:11,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:14:11,858 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-14 23:14:11,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:14:11,859 INFO L225 Difference]: With dead ends: 61 [2019-10-14 23:14:11,859 INFO L226 Difference]: Without dead ends: 45 [2019-10-14 23:14:11,860 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:14:11,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-14 23:14:11,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2019-10-14 23:14:11,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-10-14 23:14:11,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2019-10-14 23:14:11,866 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 21 [2019-10-14 23:14:11,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:14:11,867 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2019-10-14 23:14:11,867 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:14:11,867 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2019-10-14 23:14:11,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-14 23:14:11,868 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:14:11,868 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:14:11,868 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:14:11,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:14:11,869 INFO L82 PathProgramCache]: Analyzing trace with hash -345519953, now seen corresponding path program 1 times [2019-10-14 23:14:11,869 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:14:11,869 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486782943] [2019-10-14 23:14:11,870 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:14:11,870 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:14:11,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:14:11,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:14:14,239 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse8 (div c_main_~y~0 2))) (let ((.cse18 (* 2 .cse8))) (let ((.cse15 (* 4294967296 (div c_main_~y~0 4294967296))) (.cse13 (= c_main_~y~0 .cse18)) (.cse19 (* .cse8 (- 2)))) (let ((.cse17 (div (+ .cse19 c_main_~y~0) 4294967296)) (.cse1 (not .cse13)) (.cse2 (< c_main_~y~0 .cse15)) (.cse16 (div (+ .cse19 c_main_~y~0 (- 2)) 4294967296))) (let ((.cse0 (+ .cse18 (* 4294967296 .cse16) 2)) (.cse14 (<= .cse15 c_main_~y~0)) (.cse12 (and .cse1 .cse2)) (.cse11 (+ .cse18 (* 4294967296 .cse17)))) (let ((.cse4 (or .cse12 (< .cse11 c_main_~y~0))) (.cse10 (+ .cse17 1)) (.cse3 (+ .cse16 1)) (.cse7 (or .cse13 .cse14)) (.cse9 (or (< .cse0 c_main_~y~0) .cse13 .cse14))) (and (or (and (<= c_main_~y~0 .cse0) .cse1 .cse2) (and .cse1 .cse2 (<= .cse3 0)) (and .cse4 (let ((.cse5 (* 2 c_main_~y~0)) (.cse6 (* 4 .cse8))) (or (and .cse1 .cse2 (<= (+ .cse5 (* 2 (div (+ c_main_~x~0 2) 2))) (+ .cse6 c_main_~x~0 5))) (and (<= (+ .cse5 (* 2 (div c_main_~x~0 2))) (+ .cse6 c_main_~x~0 1)) .cse7))) .cse9) (and (<= .cse10 0) .cse7) (and (<= c_main_~y~0 .cse11) .cse7)) (or .cse12 (not (= .cse11 c_main_~y~0))) .cse4 (or (not (= c_main_~y~0 .cse0)) .cse13 .cse14) (< .cse15 (+ c_main_~y~0 1)) (or .cse12 .cse13 .cse14) (or (and (<= 0 .cse16) .cse1 .cse2) (and (or .cse12 (< 0 .cse10)) (or (< 0 .cse3) .cse13 .cse14)) (and (<= 0 .cse17) .cse7)) .cse9))))))) is different from false [2019-10-14 23:14:16,265 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse8 (div c_main_~y~0 2))) (let ((.cse18 (* 2 .cse8))) (let ((.cse15 (* 4294967296 (div c_main_~y~0 4294967296))) (.cse13 (= c_main_~y~0 .cse18)) (.cse19 (* .cse8 (- 2)))) (let ((.cse17 (div (+ .cse19 c_main_~y~0) 4294967296)) (.cse1 (not .cse13)) (.cse2 (< c_main_~y~0 .cse15)) (.cse16 (div (+ .cse19 c_main_~y~0 (- 2)) 4294967296))) (let ((.cse0 (+ .cse18 (* 4294967296 .cse16) 2)) (.cse14 (<= .cse15 c_main_~y~0)) (.cse12 (and .cse1 .cse2)) (.cse11 (+ .cse18 (* 4294967296 .cse17)))) (let ((.cse4 (or .cse12 (< .cse11 c_main_~y~0))) (.cse10 (+ .cse17 1)) (.cse3 (+ .cse16 1)) (.cse7 (or .cse13 .cse14)) (.cse9 (or (< .cse0 c_main_~y~0) .cse13 .cse14))) (and (or (and (<= c_main_~y~0 .cse0) .cse1 .cse2) (and .cse1 .cse2 (<= .cse3 0)) (and .cse4 (let ((.cse5 (* 2 c_main_~y~0)) (.cse6 (* 4 .cse8))) (or (and .cse1 .cse2 (<= (+ .cse5 (* 2 (div (+ c_main_~x~0 2) 2))) (+ .cse6 c_main_~x~0 5))) (and (<= (+ .cse5 (* 2 (div c_main_~x~0 2))) (+ .cse6 c_main_~x~0 1)) .cse7))) .cse9) (and (<= .cse10 0) .cse7) (and (<= c_main_~y~0 .cse11) .cse7)) (or .cse12 (not (= .cse11 c_main_~y~0))) .cse4 (or (not (= c_main_~y~0 .cse0)) .cse13 .cse14) (< .cse15 (+ c_main_~y~0 1)) (or .cse12 .cse13 .cse14) (or (and (<= 0 .cse16) .cse1 .cse2) (and (or .cse12 (< 0 .cse10)) (or (< 0 .cse3) .cse13 .cse14)) (and (<= 0 .cse17) .cse7)) .cse9))))))) is different from true [2019-10-14 23:14:18,296 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse12 (div c_main_~y~0 2))) (let ((.cse18 (* 2 .cse12))) (let ((.cse15 (* 4294967296 (div c_main_~y~0 4294967296))) (.cse4 (= c_main_~y~0 .cse18)) (.cse19 (* .cse12 (- 2)))) (let ((.cse17 (div (+ .cse19 c_main_~y~0) 4294967296)) (.cse6 (not .cse4)) (.cse7 (< c_main_~y~0 .cse15)) (.cse16 (div (+ .cse19 c_main_~y~0 (- 2)) 4294967296))) (let ((.cse3 (+ .cse18 (* 4294967296 .cse16) 2)) (.cse5 (<= .cse15 c_main_~y~0)) (.cse0 (and .cse6 .cse7)) (.cse1 (+ .cse18 (* 4294967296 .cse17)))) (let ((.cse2 (or .cse0 (< .cse1 c_main_~y~0))) (.cse14 (+ .cse17 1)) (.cse13 (+ .cse16 1)) (.cse11 (or .cse4 .cse5)) (.cse8 (or (< .cse3 c_main_~y~0) .cse4 .cse5))) (and (or .cse0 (not (= .cse1 c_main_~y~0))) .cse2 (or (not (= c_main_~y~0 .cse3)) .cse4 .cse5) (or (and (<= c_main_~y~0 .cse3) .cse6 .cse7) (and .cse2 .cse8 (let ((.cse9 (* 2 c_main_~y~0)) (.cse10 (* 4 .cse12))) (or (and .cse6 .cse7 (<= (+ .cse9 (* 2 (div (+ c_main_~x~0 4) 2))) (+ .cse10 c_main_~x~0 7))) (and (<= (+ .cse9 (* 2 (div (+ c_main_~x~0 2) 2))) (+ .cse10 c_main_~x~0 3)) .cse11)))) (and .cse6 .cse7 (<= .cse13 0)) (and (<= .cse14 0) .cse11) (and (<= c_main_~y~0 .cse1) .cse11)) (< .cse15 (+ c_main_~y~0 1)) (or .cse0 .cse4 .cse5) (or (and (<= 0 .cse16) .cse6 .cse7) (and (or .cse0 (< 0 .cse14)) (or (< 0 .cse13) .cse4 .cse5)) (and (<= 0 .cse17) .cse11)) .cse8))))))) is different from false [2019-10-14 23:14:20,305 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse12 (div c_main_~y~0 2))) (let ((.cse18 (* 2 .cse12))) (let ((.cse15 (* 4294967296 (div c_main_~y~0 4294967296))) (.cse4 (= c_main_~y~0 .cse18)) (.cse19 (* .cse12 (- 2)))) (let ((.cse17 (div (+ .cse19 c_main_~y~0) 4294967296)) (.cse6 (not .cse4)) (.cse7 (< c_main_~y~0 .cse15)) (.cse16 (div (+ .cse19 c_main_~y~0 (- 2)) 4294967296))) (let ((.cse3 (+ .cse18 (* 4294967296 .cse16) 2)) (.cse5 (<= .cse15 c_main_~y~0)) (.cse0 (and .cse6 .cse7)) (.cse1 (+ .cse18 (* 4294967296 .cse17)))) (let ((.cse2 (or .cse0 (< .cse1 c_main_~y~0))) (.cse14 (+ .cse17 1)) (.cse13 (+ .cse16 1)) (.cse11 (or .cse4 .cse5)) (.cse8 (or (< .cse3 c_main_~y~0) .cse4 .cse5))) (and (or .cse0 (not (= .cse1 c_main_~y~0))) .cse2 (or (not (= c_main_~y~0 .cse3)) .cse4 .cse5) (or (and (<= c_main_~y~0 .cse3) .cse6 .cse7) (and .cse2 .cse8 (let ((.cse9 (* 2 c_main_~y~0)) (.cse10 (* 4 .cse12))) (or (and .cse6 .cse7 (<= (+ .cse9 (* 2 (div (+ c_main_~x~0 4) 2))) (+ .cse10 c_main_~x~0 7))) (and (<= (+ .cse9 (* 2 (div (+ c_main_~x~0 2) 2))) (+ .cse10 c_main_~x~0 3)) .cse11)))) (and .cse6 .cse7 (<= .cse13 0)) (and (<= .cse14 0) .cse11) (and (<= c_main_~y~0 .cse1) .cse11)) (< .cse15 (+ c_main_~y~0 1)) (or .cse0 .cse4 .cse5) (or (and (<= 0 .cse16) .cse6 .cse7) (and (or .cse0 (< 0 .cse14)) (or (< 0 .cse13) .cse4 .cse5)) (and (<= 0 .cse17) .cse11)) .cse8))))))) is different from true [2019-10-14 23:14:22,354 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse19 (div c_main_~y~0 2))) (let ((.cse0 (* 2 .cse19)) (.cse21 (* .cse19 (- 2)))) (let ((.cse12 (div (+ .cse21 c_main_~y~0 (- 2)) 4294967296)) (.cse20 (* 4294967296 (div c_main_~y~0 4294967296))) (.cse10 (= c_main_~y~0 .cse0)) (.cse15 (div (+ .cse21 c_main_~y~0) 4294967296))) (let ((.cse1 (* 4294967296 .cse15)) (.cse3 (not .cse10)) (.cse4 (< c_main_~y~0 .cse20)) (.cse5 (* 4294967296 .cse12))) (let ((.cse9 (+ .cse0 .cse5 2)) (.cse11 (<= .cse20 c_main_~y~0)) (.cse6 (and .cse3 .cse4)) (.cse7 (+ .cse0 .cse1))) (let ((.cse14 (+ .cse12 1)) (.cse13 (+ .cse15 1)) (.cse8 (or .cse6 (< .cse7 c_main_~y~0))) (.cse2 (or .cse10 .cse11)) (.cse16 (or (< .cse9 c_main_~y~0) .cse10 .cse11))) (and (or (and (<= c_main_~y~0 (+ .cse0 .cse1 4294967295)) .cse2) (and .cse3 .cse4 (<= c_main_~y~0 (+ .cse0 .cse5 4294967297)))) (or .cse6 (not (= .cse7 c_main_~y~0))) .cse8 (or (not (= c_main_~y~0 .cse9)) .cse10 .cse11) (or (and (<= 0 .cse12) .cse3 .cse4) (and (or .cse6 (< 0 .cse13)) (or (< 0 .cse14) .cse10 .cse11)) (and (<= 0 .cse15) .cse2)) .cse16 (or (and .cse3 .cse4 (<= .cse14 0)) (and (<= .cse13 0) .cse2) (and .cse8 (let ((.cse17 (+ (* 2 c_main_~y~0) (* 2 (div (+ c_main_~x~0 4) 2)))) (.cse18 (* 4 .cse19))) (or (and .cse2 (<= .cse17 (+ .cse18 c_main_~x~0 5))) (and .cse3 .cse4 (<= .cse17 (+ .cse18 c_main_~x~0 9))))) .cse16))))))))) is different from true [2019-10-14 23:14:24,382 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse16 (div c_main_~y~0 2))) (let ((.cse0 (* 2 .cse16)) (.cse21 (* .cse16 (- 2)))) (let ((.cse18 (div (+ .cse21 c_main_~y~0 (- 2)) 4294967296)) (.cse20 (* 4294967296 (div c_main_~y~0 4294967296))) (.cse10 (= c_main_~y~0 .cse0)) (.cse19 (div (+ .cse21 c_main_~y~0) 4294967296))) (let ((.cse1 (* 4294967296 .cse19)) (.cse3 (not .cse10)) (.cse4 (< c_main_~y~0 .cse20)) (.cse5 (* 4294967296 .cse18))) (let ((.cse9 (+ .cse0 .cse5 2)) (.cse11 (<= .cse20 c_main_~y~0)) (.cse6 (and .cse3 .cse4)) (.cse7 (+ .cse0 .cse1))) (let ((.cse8 (or .cse6 (< .cse7 c_main_~y~0))) (.cse13 (+ .cse19 1)) (.cse12 (+ .cse18 1)) (.cse2 (or .cse10 .cse11)) (.cse17 (or (< .cse9 c_main_~y~0) .cse10 .cse11))) (and (or (and (<= c_main_~y~0 (+ .cse0 .cse1 4294967295)) .cse2) (and .cse3 .cse4 (<= c_main_~y~0 (+ .cse0 .cse5 4294967297)))) (or .cse6 (not (= .cse7 c_main_~y~0))) .cse8 (or (not (= c_main_~y~0 .cse9)) .cse10 .cse11) (or (and .cse3 .cse4 (<= .cse12 0)) (and (<= .cse13 0) .cse2) (and .cse8 (let ((.cse14 (+ (* 2 c_main_~y~0) (* 2 (div c_main_~x~0 2)))) (.cse15 (* 4 .cse16))) (or (and (<= .cse14 (+ .cse15 c_main_~x~0 1)) .cse2) (and (<= .cse14 (+ .cse15 c_main_~x~0 5)) .cse3 .cse4))) .cse17)) (or (and (<= 0 .cse18) .cse3 .cse4) (and (or .cse6 (< 0 .cse13)) (or (< 0 .cse12) .cse10 .cse11)) (and (<= 0 .cse19) .cse2)) .cse17))))))) is different from false [2019-10-14 23:14:36,554 WARN L191 SmtUtils]: Spent 12.15 s on a formula simplification. DAG size of input: 80 DAG size of output: 24 [2019-10-14 23:14:38,583 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse16 (div c_main_~y~0 2))) (let ((.cse0 (* 2 .cse16))) (let ((.cse18 (* 4294967296 (div c_main_~y~0 4294967296))) (.cse11 (= c_main_~y~0 .cse0)) (.cse19 (* .cse16 (- 2)))) (let ((.cse13 (div (+ .cse19 c_main_~y~0) 4294967296)) (.cse3 (not .cse11)) (.cse4 (< c_main_~y~0 .cse18)) (.cse7 (div (+ .cse19 c_main_~y~0 (- 2)) 4294967296))) (let ((.cse5 (* 4294967296 .cse7)) (.cse12 (<= .cse18 c_main_~y~0)) (.cse8 (and .cse3 .cse4)) (.cse1 (* 4294967296 .cse13))) (let ((.cse6 (or .cse8 (< (+ .cse0 .cse1) c_main_~y~0))) (.cse10 (+ .cse7 1)) (.cse9 (+ .cse13 1)) (.cse2 (or .cse11 .cse12)) (.cse17 (or (< (+ .cse0 .cse5 2) c_main_~y~0) .cse11 .cse12))) (and (or (and (<= c_main_~y~0 (+ .cse0 .cse1 4294967295)) .cse2) (and .cse3 .cse4 (<= c_main_~y~0 (+ .cse0 .cse5 4294967297)))) .cse6 (or (and (<= 0 .cse7) .cse3 .cse4) (and (or .cse8 (< 0 .cse9)) (or (< 0 .cse10) .cse11 .cse12)) (and (<= 0 .cse13) .cse2)) (or (and .cse6 (let ((.cse14 (+ (* 2 c_main_~y~0) (* 2 (div (+ c_main_~x~0 2) 2)))) (.cse15 (* 4 .cse16))) (or (and (<= .cse14 (+ .cse15 c_main_~x~0 7)) .cse3 .cse4) (and (<= .cse14 (+ .cse15 c_main_~x~0 3)) .cse2))) .cse17) (and .cse3 .cse4 (<= .cse10 0)) (and (<= .cse9 0) .cse2)) .cse17))))))) is different from false [2019-10-14 23:14:40,593 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse16 (div c_main_~y~0 2))) (let ((.cse0 (* 2 .cse16))) (let ((.cse18 (* 4294967296 (div c_main_~y~0 4294967296))) (.cse11 (= c_main_~y~0 .cse0)) (.cse19 (* .cse16 (- 2)))) (let ((.cse13 (div (+ .cse19 c_main_~y~0) 4294967296)) (.cse3 (not .cse11)) (.cse4 (< c_main_~y~0 .cse18)) (.cse7 (div (+ .cse19 c_main_~y~0 (- 2)) 4294967296))) (let ((.cse5 (* 4294967296 .cse7)) (.cse12 (<= .cse18 c_main_~y~0)) (.cse8 (and .cse3 .cse4)) (.cse1 (* 4294967296 .cse13))) (let ((.cse6 (or .cse8 (< (+ .cse0 .cse1) c_main_~y~0))) (.cse10 (+ .cse7 1)) (.cse9 (+ .cse13 1)) (.cse2 (or .cse11 .cse12)) (.cse17 (or (< (+ .cse0 .cse5 2) c_main_~y~0) .cse11 .cse12))) (and (or (and (<= c_main_~y~0 (+ .cse0 .cse1 4294967295)) .cse2) (and .cse3 .cse4 (<= c_main_~y~0 (+ .cse0 .cse5 4294967297)))) .cse6 (or (and (<= 0 .cse7) .cse3 .cse4) (and (or .cse8 (< 0 .cse9)) (or (< 0 .cse10) .cse11 .cse12)) (and (<= 0 .cse13) .cse2)) (or (and .cse6 (let ((.cse14 (+ (* 2 c_main_~y~0) (* 2 (div (+ c_main_~x~0 2) 2)))) (.cse15 (* 4 .cse16))) (or (and (<= .cse14 (+ .cse15 c_main_~x~0 7)) .cse3 .cse4) (and (<= .cse14 (+ .cse15 c_main_~x~0 3)) .cse2))) .cse17) (and .cse3 .cse4 (<= .cse10 0)) (and (<= .cse9 0) .cse2)) .cse17))))))) is different from true [2019-10-14 23:14:42,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:14:42,768 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-14 23:14:42,768 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486782943] [2019-10-14 23:14:42,768 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838301476] [2019-10-14 23:14:42,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:14:42,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:14:42,820 WARN L254 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-14 23:14:42,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:14:43,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:14:43,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:14:43,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:14:43,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:14:43,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:14:43,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:14:43,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:14:43,091 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-14 23:14:43,092 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:14:43,092 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2019-10-14 23:14:43,093 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320951573] [2019-10-14 23:14:43,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-14 23:14:43,094 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:14:43,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-14 23:14:43,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=151, Unknown=8, NotChecked=140, Total=342 [2019-10-14 23:14:43,096 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand 19 states. [2019-10-14 23:14:45,146 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse8 (div c_main_~y~0 2))) (let ((.cse18 (* 2 .cse8))) (let ((.cse15 (* 4294967296 (div c_main_~y~0 4294967296))) (.cse13 (= c_main_~y~0 .cse18)) (.cse19 (* .cse8 (- 2)))) (let ((.cse17 (div (+ .cse19 c_main_~y~0) 4294967296)) (.cse1 (not .cse13)) (.cse2 (< c_main_~y~0 .cse15)) (.cse16 (div (+ .cse19 c_main_~y~0 (- 2)) 4294967296))) (let ((.cse0 (+ .cse18 (* 4294967296 .cse16) 2)) (.cse14 (<= .cse15 c_main_~y~0)) (.cse12 (and .cse1 .cse2)) (.cse11 (+ .cse18 (* 4294967296 .cse17)))) (let ((.cse4 (or .cse12 (< .cse11 c_main_~y~0))) (.cse10 (+ .cse17 1)) (.cse3 (+ .cse16 1)) (.cse7 (or .cse13 .cse14)) (.cse9 (or (< .cse0 c_main_~y~0) .cse13 .cse14))) (and (or (and (<= c_main_~y~0 .cse0) .cse1 .cse2) (and .cse1 .cse2 (<= .cse3 0)) (and .cse4 (let ((.cse5 (* 2 c_main_~y~0)) (.cse6 (* 4 .cse8))) (or (and .cse1 .cse2 (<= (+ .cse5 (* 2 (div (+ c_main_~x~0 2) 2))) (+ .cse6 c_main_~x~0 5))) (and (<= (+ .cse5 (* 2 (div c_main_~x~0 2))) (+ .cse6 c_main_~x~0 1)) .cse7))) .cse9) (and (<= .cse10 0) .cse7) (and (<= c_main_~y~0 .cse11) .cse7)) (or .cse12 (not (= .cse11 c_main_~y~0))) .cse4 (= c_main_~x~0 1) (or (not (= c_main_~y~0 .cse0)) .cse13 .cse14) (< .cse15 (+ c_main_~y~0 1)) (or .cse12 .cse13 .cse14) (or (and (<= 0 .cse16) .cse1 .cse2) (and (or .cse12 (< 0 .cse10)) (or (< 0 .cse3) .cse13 .cse14)) (and (<= 0 .cse17) .cse7)) (not (= (mod c_main_~y~0 2) 0)) .cse9))))))) is different from false [2019-10-14 23:14:47,182 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse12 (div c_main_~y~0 2))) (let ((.cse18 (* 2 .cse12))) (let ((.cse15 (* 4294967296 (div c_main_~y~0 4294967296))) (.cse4 (= c_main_~y~0 .cse18)) (.cse19 (* .cse12 (- 2)))) (let ((.cse17 (div (+ .cse19 c_main_~y~0) 4294967296)) (.cse6 (not .cse4)) (.cse7 (< c_main_~y~0 .cse15)) (.cse16 (div (+ .cse19 c_main_~y~0 (- 2)) 4294967296))) (let ((.cse3 (+ .cse18 (* 4294967296 .cse16) 2)) (.cse5 (<= .cse15 c_main_~y~0)) (.cse0 (and .cse6 .cse7)) (.cse1 (+ .cse18 (* 4294967296 .cse17)))) (let ((.cse2 (or .cse0 (< .cse1 c_main_~y~0))) (.cse14 (+ .cse17 1)) (.cse13 (+ .cse16 1)) (.cse11 (or .cse4 .cse5)) (.cse8 (or (< .cse3 c_main_~y~0) .cse4 .cse5))) (and (or .cse0 (not (= .cse1 c_main_~y~0))) .cse2 (or (not (= c_main_~y~0 .cse3)) .cse4 .cse5) (or (and (<= c_main_~y~0 .cse3) .cse6 .cse7) (and .cse2 .cse8 (let ((.cse9 (* 2 c_main_~y~0)) (.cse10 (* 4 .cse12))) (or (and .cse6 .cse7 (<= (+ .cse9 (* 2 (div (+ c_main_~x~0 4) 2))) (+ .cse10 c_main_~x~0 7))) (and (<= (+ .cse9 (* 2 (div (+ c_main_~x~0 2) 2))) (+ .cse10 c_main_~x~0 3)) .cse11)))) (and .cse6 .cse7 (<= .cse13 0)) (and (<= .cse14 0) .cse11) (and (<= c_main_~y~0 .cse1) .cse11)) (< .cse15 (+ c_main_~y~0 1)) (or .cse0 .cse4 .cse5) (or (and (<= 0 .cse16) .cse6 .cse7) (and (or .cse0 (< 0 .cse14)) (or (< 0 .cse13) .cse4 .cse5)) (and (<= 0 .cse17) .cse11)) (not (= (mod c_main_~y~0 2) 0)) (= (+ c_main_~x~0 1) 0) .cse8))))))) is different from false