./Ultimate.py --spec ../../../trunk/examples/svcomp/ReachSafety.prp --file ../../../trunk/examples/svcomp/loop-acceleration/diamond_true-unreach-call2.i --full-output --rcfgbuilder.size.of.a.code.block SingleStatement --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0210da8c Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/config/TaipanReach.xml -i ../../../trunk/examples/svcomp/loop-acceleration/diamond_true-unreach-call2.i -s /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UTaipan-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3de88212c8693b9f87e164f2a8585947c848ea21 --rcfgbuilder.size.of.a.code.block SingleStatement ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-0210da8 [2018-10-22 09:49:11,963 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-22 09:49:11,965 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-22 09:49:11,977 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-22 09:49:11,977 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-22 09:49:11,979 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-22 09:49:11,980 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-22 09:49:11,982 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-22 09:49:11,984 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-22 09:49:11,985 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-22 09:49:11,986 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-22 09:49:11,986 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-22 09:49:11,988 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-22 09:49:11,989 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-22 09:49:11,990 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-22 09:49:11,991 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-22 09:49:11,992 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-22 09:49:11,994 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-22 09:49:11,996 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-22 09:49:11,999 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-22 09:49:12,000 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-22 09:49:12,001 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-22 09:49:12,004 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-22 09:49:12,005 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-22 09:49:12,005 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-22 09:49:12,006 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-22 09:49:12,012 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-22 09:49:12,013 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-22 09:49:12,013 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-22 09:49:12,018 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-22 09:49:12,018 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-22 09:49:12,021 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-22 09:49:12,021 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-22 09:49:12,022 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-22 09:49:12,023 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-22 09:49:12,023 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-22 09:49:12,024 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-10-22 09:49:12,057 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-22 09:49:12,058 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-22 09:49:12,058 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-22 09:49:12,059 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-22 09:49:12,059 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-22 09:49:12,059 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-22 09:49:12,059 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-22 09:49:12,059 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-22 09:49:12,059 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-22 09:49:12,060 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-22 09:49:12,060 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-22 09:49:12,060 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-22 09:49:12,061 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-22 09:49:12,065 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-22 09:49:12,066 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-22 09:49:12,066 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-22 09:49:12,066 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-22 09:49:12,066 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-22 09:49:12,066 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-22 09:49:12,066 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-22 09:49:12,067 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-22 09:49:12,069 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-22 09:49:12,069 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-22 09:49:12,069 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-22 09:49:12,070 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-22 09:49:12,070 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-22 09:49:12,070 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-22 09:49:12,070 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-22 09:49:12,070 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-22 09:49:12,071 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-22 09:49:12,073 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-22 09:49:12,073 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-22 09:49:12,073 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-22 09:49:12,074 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-22 09:49:12,074 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UTaipan-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3de88212c8693b9f87e164f2a8585947c848ea21 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> SingleStatement [2018-10-22 09:49:12,143 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-22 09:49:12,157 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-22 09:49:12,162 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-22 09:49:12,163 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-22 09:49:12,164 INFO L276 PluginConnector]: CDTParser initialized [2018-10-22 09:49:12,164 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/loop-acceleration/diamond_true-unreach-call2.i [2018-10-22 09:49:12,224 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/9461eddad/03ae72bfbd7342d3b3d36c54db142d70/FLAG576daacbe [2018-10-22 09:49:12,725 INFO L298 CDTParser]: Found 1 translation units. [2018-10-22 09:49:12,726 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/diamond_true-unreach-call2.i [2018-10-22 09:49:12,732 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/9461eddad/03ae72bfbd7342d3b3d36c54db142d70/FLAG576daacbe [2018-10-22 09:49:12,749 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/9461eddad/03ae72bfbd7342d3b3d36c54db142d70 [2018-10-22 09:49:12,753 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-22 09:49:12,755 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-22 09:49:12,756 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-22 09:49:12,757 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-22 09:49:12,761 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-22 09:49:12,762 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:49:12" (1/1) ... [2018-10-22 09:49:12,765 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@594b1b3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:49:12, skipping insertion in model container [2018-10-22 09:49:12,765 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:49:12" (1/1) ... [2018-10-22 09:49:12,775 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-22 09:49:12,798 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-22 09:49:13,008 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-22 09:49:13,015 INFO L189 MainTranslator]: Completed pre-run [2018-10-22 09:49:13,056 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-22 09:49:13,084 INFO L193 MainTranslator]: Completed translation [2018-10-22 09:49:13,084 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:49:13 WrapperNode [2018-10-22 09:49:13,084 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-22 09:49:13,086 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-22 09:49:13,086 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-22 09:49:13,086 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-22 09:49:13,097 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:49:13" (1/1) ... [2018-10-22 09:49:13,104 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:49:13" (1/1) ... [2018-10-22 09:49:13,124 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-22 09:49:13,126 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-22 09:49:13,126 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-22 09:49:13,126 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-22 09:49:13,142 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:49:13" (1/1) ... [2018-10-22 09:49:13,143 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:49:13" (1/1) ... [2018-10-22 09:49:13,144 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:49:13" (1/1) ... [2018-10-22 09:49:13,145 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:49:13" (1/1) ... [2018-10-22 09:49:13,156 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:49:13" (1/1) ... [2018-10-22 09:49:13,168 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:49:13" (1/1) ... [2018-10-22 09:49:13,170 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:49:13" (1/1) ... [2018-10-22 09:49:13,178 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-22 09:49:13,183 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-22 09:49:13,183 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-22 09:49:13,183 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-22 09:49:13,184 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:49:13" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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 [2018-10-22 09:49:13,327 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-22 09:49:13,327 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-22 09:49:13,327 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-22 09:49:13,327 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-22 09:49:13,328 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-22 09:49:13,328 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-22 09:49:13,328 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-10-22 09:49:13,328 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-10-22 09:49:13,870 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-22 09:49:13,871 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:49:13 BoogieIcfgContainer [2018-10-22 09:49:13,871 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-22 09:49:13,872 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-22 09:49:13,872 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-22 09:49:13,875 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-22 09:49:13,876 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 09:49:12" (1/3) ... [2018-10-22 09:49:13,876 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ee5af65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 09:49:13, skipping insertion in model container [2018-10-22 09:49:13,877 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:49:13" (2/3) ... [2018-10-22 09:49:13,877 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ee5af65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 09:49:13, skipping insertion in model container [2018-10-22 09:49:13,877 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:49:13" (3/3) ... [2018-10-22 09:49:13,879 INFO L112 eAbstractionObserver]: Analyzing ICFG diamond_true-unreach-call2.i [2018-10-22 09:49:13,888 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-22 09:49:13,897 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-22 09:49:13,912 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-22 09:49:13,946 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-22 09:49:13,947 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-22 09:49:13,947 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-22 09:49:13,947 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-22 09:49:13,947 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-22 09:49:13,948 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-22 09:49:13,948 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-22 09:49:13,948 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-22 09:49:13,948 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-22 09:49:13,968 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states. [2018-10-22 09:49:13,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-22 09:49:13,975 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 09:49:13,976 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 09:49:13,978 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 09:49:13,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 09:49:13,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1881663615, now seen corresponding path program 1 times [2018-10-22 09:49:13,987 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 09:49:14,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 09:49:14,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 09:49:14,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 09:49:14,042 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 09:49:14,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 09:49:14,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 09:49:14,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-22 09:49:14,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-22 09:49:14,109 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-22 09:49:14,115 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-22 09:49:14,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-22 09:49:14,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-22 09:49:14,131 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 2 states. [2018-10-22 09:49:14,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 09:49:14,156 INFO L93 Difference]: Finished difference Result 63 states and 76 transitions. [2018-10-22 09:49:14,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-22 09:49:14,158 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-10-22 09:49:14,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 09:49:14,168 INFO L225 Difference]: With dead ends: 63 [2018-10-22 09:49:14,168 INFO L226 Difference]: Without dead ends: 46 [2018-10-22 09:49:14,172 INFO L605 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 [2018-10-22 09:49:14,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-10-22 09:49:14,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-10-22 09:49:14,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-10-22 09:49:14,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 56 transitions. [2018-10-22 09:49:14,218 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 56 transitions. Word has length 12 [2018-10-22 09:49:14,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 09:49:14,218 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 56 transitions. [2018-10-22 09:49:14,218 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-22 09:49:14,219 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2018-10-22 09:49:14,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-22 09:49:14,219 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 09:49:14,220 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 09:49:14,220 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 09:49:14,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 09:49:14,221 INFO L82 PathProgramCache]: Analyzing trace with hash -875179187, now seen corresponding path program 1 times [2018-10-22 09:49:14,221 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 09:49:14,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 09:49:14,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 09:49:14,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 09:49:14,223 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 09:49:14,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 09:49:14,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 09:49:14,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-22 09:49:14,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-22 09:49:14,340 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-22 09:49:14,342 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-22 09:49:14,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-22 09:49:14,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-22 09:49:14,343 INFO L87 Difference]: Start difference. First operand 46 states and 56 transitions. Second operand 3 states. [2018-10-22 09:49:14,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 09:49:14,492 INFO L93 Difference]: Finished difference Result 57 states and 68 transitions. [2018-10-22 09:49:14,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-22 09:49:14,494 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-10-22 09:49:14,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 09:49:14,496 INFO L225 Difference]: With dead ends: 57 [2018-10-22 09:49:14,496 INFO L226 Difference]: Without dead ends: 52 [2018-10-22 09:49:14,497 INFO L605 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 [2018-10-22 09:49:14,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-10-22 09:49:14,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2018-10-22 09:49:14,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-10-22 09:49:14,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2018-10-22 09:49:14,507 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 13 [2018-10-22 09:49:14,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 09:49:14,508 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2018-10-22 09:49:14,508 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-22 09:49:14,508 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2018-10-22 09:49:14,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-10-22 09:49:14,510 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 09:49:14,510 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 09:49:14,511 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 09:49:14,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 09:49:14,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1607468733, now seen corresponding path program 1 times [2018-10-22 09:49:14,512 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 09:49:14,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 09:49:14,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 09:49:14,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 09:49:14,513 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 09:49:14,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 09:49:14,725 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 12 [2018-10-22 09:49:14,730 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 09:49:14,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-22 09:49:14,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-22 09:49:14,731 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-22 09:49:14,732 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-22 09:49:14,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-22 09:49:14,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-22 09:49:14,732 INFO L87 Difference]: Start difference. First operand 48 states and 58 transitions. Second operand 3 states. [2018-10-22 09:49:15,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 09:49:15,090 INFO L93 Difference]: Finished difference Result 100 states and 131 transitions. [2018-10-22 09:49:15,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-22 09:49:15,092 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-10-22 09:49:15,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 09:49:15,094 INFO L225 Difference]: With dead ends: 100 [2018-10-22 09:49:15,095 INFO L226 Difference]: Without dead ends: 61 [2018-10-22 09:49:15,096 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-22 09:49:15,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-10-22 09:49:15,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2018-10-22 09:49:15,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-10-22 09:49:15,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 71 transitions. [2018-10-22 09:49:15,105 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 71 transitions. Word has length 35 [2018-10-22 09:49:15,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 09:49:15,106 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 71 transitions. [2018-10-22 09:49:15,106 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-22 09:49:15,106 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2018-10-22 09:49:15,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-10-22 09:49:15,107 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 09:49:15,108 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 09:49:15,108 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 09:49:15,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 09:49:15,109 INFO L82 PathProgramCache]: Analyzing trace with hash 250662109, now seen corresponding path program 1 times [2018-10-22 09:49:15,109 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 09:49:15,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 09:49:15,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 09:49:15,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 09:49:15,110 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 09:49:15,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 09:49:15,721 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 09:49:15,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 09:49:15,722 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-22 09:49:15,723 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 36 with the following transitions: [2018-10-22 09:49:15,725 INFO L202 CegarAbsIntRunner]: [0], [4], [5], [6], [10], [14], [16], [19], [20], [29], [30], [37], [38], [45], [46], [53], [54], [61], [62], [69], [70], [77], [78], [85], [86], [93], [94], [104], [107], [109], [115], [116], [117], [119] [2018-10-22 09:49:15,779 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-22 09:49:15,779 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-22 09:49:15,897 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-22 09:49:16,782 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-22 09:49:16,783 INFO L272 AbstractInterpreter]: Visited 34 different actions 215 times. Merged at 23 different actions 159 times. Widened at 1 different actions 3 times. Found 1 fixpoints after 1 different actions. Largest state had 3 variables. [2018-10-22 09:49:16,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 09:49:16,832 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-22 09:49:16,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 09:49:16,832 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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 [2018-10-22 09:49:16,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 09:49:16,850 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-22 09:49:16,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 09:49:16,901 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 09:49:17,019 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 09:49:17,020 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-22 09:49:21,999 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 09:49:22,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 09:49:22,022 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-10-22 09:49:22,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 09:49:22,038 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-22 09:49:22,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 09:49:22,079 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 09:49:22,153 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 09:49:22,153 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-22 09:49:22,194 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 09:49:22,198 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-10-22 09:49:22,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13, 13, 13] total 24 [2018-10-22 09:49:22,199 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-22 09:49:22,199 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-22 09:49:22,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-22 09:49:22,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-10-22 09:49:22,202 INFO L87 Difference]: Start difference. First operand 60 states and 71 transitions. Second operand 13 states. [2018-10-22 09:49:22,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 09:49:22,716 INFO L93 Difference]: Finished difference Result 91 states and 103 transitions. [2018-10-22 09:49:22,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-22 09:49:22,723 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 35 [2018-10-22 09:49:22,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 09:49:22,725 INFO L225 Difference]: With dead ends: 91 [2018-10-22 09:49:22,725 INFO L226 Difference]: Without dead ends: 86 [2018-10-22 09:49:22,726 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 127 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-10-22 09:49:22,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-10-22 09:49:22,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 82. [2018-10-22 09:49:22,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-10-22 09:49:22,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 94 transitions. [2018-10-22 09:49:22,736 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 94 transitions. Word has length 35 [2018-10-22 09:49:22,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 09:49:22,736 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 94 transitions. [2018-10-22 09:49:22,737 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-22 09:49:22,737 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 94 transitions. [2018-10-22 09:49:22,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-22 09:49:22,738 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 09:49:22,739 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 09:49:22,739 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 09:49:22,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 09:49:22,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1721458082, now seen corresponding path program 1 times [2018-10-22 09:49:22,740 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 09:49:22,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 09:49:22,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 09:49:22,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 09:49:22,741 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 09:49:22,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 09:49:24,814 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse4 (div c_main_~y~0 2))) (let ((.cse1 (* 2 .cse4))) (let ((.cse2 (* (- 2) .cse4)) (.cse0 (= .cse1 c_main_~y~0)) (.cse3 (* 4294967296 (div c_main_~y~0 4294967296)))) (and (or .cse0 (not (= (+ .cse1 (* 4294967296 (div (+ c_main_~y~0 .cse2 (- 2)) 4294967296)) 2) c_main_~y~0)) (<= .cse3 c_main_~y~0)) (or (not (= (+ .cse1 (* 4294967296 (div (+ c_main_~y~0 .cse2) 4294967296))) c_main_~y~0)) (and (not .cse0) (< c_main_~y~0 .cse3))))))) is different from false [2018-10-22 09:49:24,821 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 09:49:24,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-22 09:49:24,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-22 09:49:24,822 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-22 09:49:24,823 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-22 09:49:24,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-22 09:49:24,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2018-10-22 09:49:24,823 INFO L87 Difference]: Start difference. First operand 82 states and 94 transitions. Second operand 3 states. [2018-10-22 09:49:24,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 09:49:24,828 INFO L93 Difference]: Finished difference Result 109 states and 121 transitions. [2018-10-22 09:49:24,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-22 09:49:24,829 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-10-22 09:49:24,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 09:49:24,830 INFO L225 Difference]: With dead ends: 109 [2018-10-22 09:49:24,830 INFO L226 Difference]: Without dead ends: 82 [2018-10-22 09:49:24,832 INFO L605 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 [2018-10-22 09:49:24,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-10-22 09:49:24,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-10-22 09:49:24,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-10-22 09:49:24,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 93 transitions. [2018-10-22 09:49:24,841 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 93 transitions. Word has length 37 [2018-10-22 09:49:24,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 09:49:24,842 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 93 transitions. [2018-10-22 09:49:24,843 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-22 09:49:24,843 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 93 transitions. [2018-10-22 09:49:24,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-22 09:49:24,844 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 09:49:24,844 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 09:49:24,846 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 09:49:24,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 09:49:24,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1923439390, now seen corresponding path program 1 times [2018-10-22 09:49:24,846 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 09:49:24,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 09:49:24,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 09:49:24,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 09:49:24,849 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 09:49:24,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 09:49:25,015 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 09:49:25,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-22 09:49:25,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-22 09:49:25,015 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-22 09:49:25,016 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-22 09:49:25,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-22 09:49:25,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-22 09:49:25,017 INFO L87 Difference]: Start difference. First operand 82 states and 93 transitions. Second operand 3 states. [2018-10-22 09:49:25,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 09:49:25,181 INFO L93 Difference]: Finished difference Result 110 states and 121 transitions. [2018-10-22 09:49:25,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-22 09:49:25,183 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-10-22 09:49:25,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 09:49:25,184 INFO L225 Difference]: With dead ends: 110 [2018-10-22 09:49:25,184 INFO L226 Difference]: Without dead ends: 83 [2018-10-22 09:49:25,185 INFO L605 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 [2018-10-22 09:49:25,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-10-22 09:49:25,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2018-10-22 09:49:25,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-10-22 09:49:25,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 84 transitions. [2018-10-22 09:49:25,194 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 84 transitions. Word has length 37 [2018-10-22 09:49:25,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 09:49:25,194 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 84 transitions. [2018-10-22 09:49:25,194 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-22 09:49:25,195 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 84 transitions. [2018-10-22 09:49:25,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-22 09:49:25,196 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 09:49:25,196 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 09:49:25,196 INFO L424 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 09:49:25,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 09:49:25,197 INFO L82 PathProgramCache]: Analyzing trace with hash 461751646, now seen corresponding path program 1 times [2018-10-22 09:49:25,197 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 09:49:25,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 09:49:25,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 09:49:25,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 09:49:25,198 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 09:49:25,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 09:49:27,578 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (* 2 (div c_main_~y~0 2)))) (let ((.cse1 (<= .cse0 c_main_~y~0)) (.cse2 (= c_main_~y~0 .cse0))) (and (or (and (or (<= c_main_~y~0 (+ .cse0 1)) (<= c_main_~y~0 .cse0)) (or .cse1 (< .cse0 c_main_~y~0))) .cse2) (< (* 4294967296 (div c_main_~y~0 4294967296)) (+ c_main_~y~0 1)) (or .cse1 (not .cse2)) (<= c_main_~x~0 0) (<= 0 c_main_~x~0)))) is different from false [2018-10-22 09:49:29,622 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (* 2 (div c_main_~y~0 2)))) (let ((.cse1 (<= .cse0 c_main_~y~0)) (.cse2 (= c_main_~y~0 .cse0))) (and (<= |c_main_#t~post1| 0) (or (and (or (<= c_main_~y~0 (+ .cse0 1)) (<= c_main_~y~0 .cse0)) (or .cse1 (< .cse0 c_main_~y~0))) .cse2) (< (* 4294967296 (div c_main_~y~0 4294967296)) (+ c_main_~y~0 1)) (or .cse1 (not .cse2)) (<= 0 |c_main_#t~post1|)))) is different from false [2018-10-22 09:49:31,634 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (* 2 (div c_main_~y~0 2)))) (let ((.cse1 (<= .cse0 c_main_~y~0)) (.cse2 (= c_main_~y~0 .cse0))) (and (<= c_main_~x~0 1) (or (and (or (<= c_main_~y~0 (+ .cse0 1)) (<= c_main_~y~0 .cse0)) (or .cse1 (< .cse0 c_main_~y~0))) .cse2) (< (* 4294967296 (div c_main_~y~0 4294967296)) (+ c_main_~y~0 1)) (<= 1 c_main_~x~0) (or .cse1 (not .cse2))))) is different from false [2018-10-22 09:49:33,676 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse18 (div c_main_~y~0 2))) (let ((.cse17 (* (- 2) .cse18)) (.cse0 (* 2 .cse18))) (let ((.cse16 (* 4294967296 (div c_main_~y~0 4294967296))) (.cse6 (= c_main_~y~0 .cse0)) (.cse13 (div (+ c_main_~y~0 .cse17) 4294967296)) (.cse12 (div (+ c_main_~y~0 .cse17 (- 2)) 4294967296))) (let ((.cse1 (* 4294967296 .cse12)) (.cse4 (* 4294967296 .cse13)) (.cse2 (not .cse6)) (.cse3 (< c_main_~y~0 .cse16)) (.cse9 (<= .cse16 c_main_~y~0))) (let ((.cse5 (or .cse6 .cse9)) (.cse10 (and .cse2 .cse3)) (.cse14 (+ .cse0 .cse4)) (.cse15 (+ .cse0 .cse1 2))) (let ((.cse7 (or (and (<= .cse14 c_main_~y~0) .cse5) (and (or (< .cse15 c_main_~y~0) .cse6 .cse9) (or .cse10 (< .cse14 c_main_~y~0))) (and (<= .cse15 c_main_~y~0) .cse2 .cse3)))) (and (or (and (or (and (or (and (<= c_main_~y~0 (+ .cse0 .cse1 4294967295)) .cse2 .cse3) (and (<= c_main_~y~0 (+ .cse0 .cse4 4294967295)) .cse5)) (or (and (<= c_main_~y~0 (+ .cse0 3)) .cse2 .cse3) (and (<= c_main_~y~0 (+ .cse0 1)) .cse5))) (<= c_main_~y~0 .cse0)) (or (<= .cse0 c_main_~y~0) (< .cse0 c_main_~y~0))) .cse6) (<= c_main_~x~0 1) .cse7 (or (let ((.cse8 (+ .cse12 1)) (.cse11 (+ .cse13 1))) (and (or (and (or (< 0 .cse8) .cse6 .cse9) (or .cse10 (< 0 .cse11))) (and .cse2 .cse3 (<= 0 .cse12)) (and (<= 0 .cse13) .cse5)) (or (and .cse2 .cse3 (<= .cse8 0)) (and (<= .cse11 0) .cse5) (and .cse7 (or .cse10 (and (<= c_main_~y~0 .cse14) .cse5) (and .cse2 .cse3 (<= c_main_~y~0 .cse15)) .cse6 .cse9))))) .cse2) (<= 1 c_main_~x~0) (or .cse6 (not (= .cse15 c_main_~y~0)) .cse9) (or .cse10 (not (= .cse14 c_main_~y~0)))))))))) is different from false [2018-10-22 09:49:37,822 WARN L179 SmtUtils]: Spent 4.12 s on a formula simplification. DAG size of input: 95 DAG size of output: 20 [2018-10-22 09:49:39,850 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse19 (div c_main_~y~0 2))) (let ((.cse13 (* 2 .cse19)) (.cse18 (* (- 2) .cse19))) (let ((.cse11 (div (+ c_main_~y~0 .cse18 (- 2)) 4294967296)) (.cse8 (= c_main_~y~0 .cse13)) (.cse12 (div (+ c_main_~y~0 .cse18) 4294967296)) (.cse17 (* 4294967296 (div c_main_~y~0 4294967296)))) (let ((.cse9 (<= .cse17 c_main_~y~0)) (.cse15 (* 4294967296 .cse12)) (.cse0 (not .cse8)) (.cse1 (< c_main_~y~0 .cse17)) (.cse14 (* 4294967296 .cse11))) (let ((.cse7 (+ .cse13 .cse14 2)) (.cse4 (and .cse0 .cse1)) (.cse5 (+ .cse13 .cse15)) (.cse6 (or .cse8 .cse9))) (let ((.cse3 (or (and (or (< .cse7 c_main_~y~0) .cse8 .cse9) (or .cse4 (< .cse5 c_main_~y~0))) (and (<= (+ .cse13 .cse14 3) c_main_~y~0) .cse0 .cse1) (and .cse6 (<= (+ .cse13 .cse15 1) c_main_~y~0)))) (.cse16 (+ c_main_~x~0 1))) (and (or .cse0 (let ((.cse2 (+ .cse11 1)) (.cse10 (+ .cse12 1))) (and (or (and .cse0 .cse1 (<= .cse2 0)) (and .cse3 (or .cse4 (and (<= c_main_~y~0 .cse5) .cse6) (and .cse0 .cse1 (<= c_main_~y~0 .cse7)) .cse8 .cse9)) (and (<= .cse10 0) .cse6)) (or (and (or (< 0 .cse2) .cse8 .cse9) (or .cse4 (< 0 .cse10))) (and .cse0 .cse1 (<= 0 .cse11)) (and (<= 0 .cse12) .cse6))))) .cse3 (or (and (or (and (or (and (<= c_main_~y~0 (+ .cse13 .cse14 4294967295)) .cse0 .cse1) (and (<= c_main_~y~0 (+ .cse13 .cse15 4294967295)) .cse6)) (or (and (<= c_main_~y~0 (+ .cse13 3)) .cse0 .cse1) (and (<= c_main_~y~0 (+ .cse13 1)) .cse6))) (<= c_main_~y~0 .cse13)) (or (<= .cse13 c_main_~y~0) (< .cse13 c_main_~y~0))) .cse8) (<= .cse16 0) (<= 0 .cse16)))))))) is different from false [2018-10-22 09:49:41,872 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse18 (div c_main_~y~0 2))) (let ((.cse13 (* 2 .cse18)) (.cse17 (* (- 2) .cse18))) (let ((.cse11 (div (+ c_main_~y~0 .cse17 (- 2)) 4294967296)) (.cse8 (= c_main_~y~0 .cse13)) (.cse12 (div (+ c_main_~y~0 .cse17) 4294967296)) (.cse16 (* 4294967296 (div c_main_~y~0 4294967296)))) (let ((.cse9 (<= .cse16 c_main_~y~0)) (.cse15 (* 4294967296 .cse12)) (.cse0 (not .cse8)) (.cse1 (< c_main_~y~0 .cse16)) (.cse14 (* 4294967296 .cse11))) (let ((.cse7 (+ .cse13 .cse14 2)) (.cse4 (and .cse0 .cse1)) (.cse5 (+ .cse13 .cse15)) (.cse6 (or .cse8 .cse9))) (let ((.cse3 (or (and (or (< .cse7 c_main_~y~0) .cse8 .cse9) (or .cse4 (< .cse5 c_main_~y~0))) (and (<= (+ .cse13 .cse14 3) c_main_~y~0) .cse0 .cse1) (and .cse6 (<= (+ .cse13 .cse15 1) c_main_~y~0))))) (and (or .cse0 (let ((.cse2 (+ .cse11 1)) (.cse10 (+ .cse12 1))) (and (or (and .cse0 .cse1 (<= .cse2 0)) (and .cse3 (or .cse4 (and (<= c_main_~y~0 .cse5) .cse6) (and .cse0 .cse1 (<= c_main_~y~0 .cse7)) .cse8 .cse9)) (and (<= .cse10 0) .cse6)) (or (and (or (< 0 .cse2) .cse8 .cse9) (or .cse4 (< 0 .cse10))) (and .cse0 .cse1 (<= 0 .cse11)) (and (<= 0 .cse12) .cse6))))) .cse3 (or (and (or (and (or (and (<= c_main_~y~0 (+ .cse13 .cse14 4294967295)) .cse0 .cse1) (and (<= c_main_~y~0 (+ .cse13 .cse15 4294967295)) .cse6)) (or (and (<= c_main_~y~0 (+ .cse13 3)) .cse0 .cse1) (and (<= c_main_~y~0 (+ .cse13 1)) .cse6))) (<= c_main_~y~0 .cse13)) (or (<= .cse13 c_main_~y~0) (< .cse13 c_main_~y~0))) .cse8) (<= c_main_~x~0 1) (<= 1 c_main_~x~0)))))))) is different from false [2018-10-22 09:49:43,909 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse19 (div c_main_~y~0 2))) (let ((.cse14 (* 2 .cse19)) (.cse18 (* (- 2) .cse19))) (let ((.cse11 (div (+ c_main_~y~0 .cse18 (- 2)) 4294967296)) (.cse8 (= c_main_~y~0 .cse14)) (.cse12 (div (+ c_main_~y~0 .cse18) 4294967296)) (.cse17 (* 4294967296 (div c_main_~y~0 4294967296)))) (let ((.cse9 (<= .cse17 c_main_~y~0)) (.cse16 (* 4294967296 .cse12)) (.cse0 (not .cse8)) (.cse1 (< c_main_~y~0 .cse17)) (.cse15 (* 4294967296 .cse11))) (let ((.cse7 (+ .cse14 .cse15 2)) (.cse4 (and .cse0 .cse1)) (.cse5 (+ .cse14 .cse16)) (.cse6 (or .cse8 .cse9))) (let ((.cse3 (or (and (or (< .cse7 c_main_~y~0) .cse8 .cse9) (or .cse4 (< .cse5 c_main_~y~0))) (and (<= (+ .cse14 .cse15 3) c_main_~y~0) .cse0 .cse1) (and .cse6 (<= (+ .cse14 .cse16 1) c_main_~y~0)))) (.cse13 (+ c_main_~x~0 3))) (and (or .cse0 (let ((.cse2 (+ .cse11 1)) (.cse10 (+ .cse12 1))) (and (or (and .cse0 .cse1 (<= .cse2 0)) (and .cse3 (or .cse4 (and (<= c_main_~y~0 .cse5) .cse6) (and .cse0 .cse1 (<= c_main_~y~0 .cse7)) .cse8 .cse9)) (and (<= .cse10 0) .cse6)) (or (and (or (< 0 .cse2) .cse8 .cse9) (or .cse4 (< 0 .cse10))) (and .cse0 .cse1 (<= 0 .cse11)) (and (<= 0 .cse12) .cse6))))) .cse3 (<= 0 .cse13) (or (and (or (and (or (and (<= c_main_~y~0 (+ .cse14 .cse15 4294967295)) .cse0 .cse1) (and (<= c_main_~y~0 (+ .cse14 .cse16 4294967295)) .cse6)) (or (and (<= c_main_~y~0 (+ .cse14 3)) .cse0 .cse1) (and (<= c_main_~y~0 (+ .cse14 1)) .cse6))) (<= c_main_~y~0 .cse14)) (or (<= .cse14 c_main_~y~0) (< .cse14 c_main_~y~0))) .cse8) (<= .cse13 0)))))))) is different from false [2018-10-22 09:49:45,935 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse18 (div c_main_~y~0 2))) (let ((.cse13 (* 2 .cse18)) (.cse17 (* (- 2) .cse18))) (let ((.cse11 (div (+ c_main_~y~0 .cse17 (- 2)) 4294967296)) (.cse8 (= c_main_~y~0 .cse13)) (.cse12 (div (+ c_main_~y~0 .cse17) 4294967296)) (.cse16 (* 4294967296 (div c_main_~y~0 4294967296)))) (let ((.cse9 (<= .cse16 c_main_~y~0)) (.cse15 (* 4294967296 .cse12)) (.cse0 (not .cse8)) (.cse1 (< c_main_~y~0 .cse16)) (.cse14 (* 4294967296 .cse11))) (let ((.cse7 (+ .cse13 .cse14 2)) (.cse4 (and .cse0 .cse1)) (.cse5 (+ .cse13 .cse15)) (.cse6 (or .cse8 .cse9))) (let ((.cse3 (or (and (or (< .cse7 c_main_~y~0) .cse8 .cse9) (or .cse4 (< .cse5 c_main_~y~0))) (and (<= (+ .cse13 .cse14 3) c_main_~y~0) .cse0 .cse1) (and .cse6 (<= (+ .cse13 .cse15 1) c_main_~y~0))))) (and (or .cse0 (let ((.cse2 (+ .cse11 1)) (.cse10 (+ .cse12 1))) (and (or (and .cse0 .cse1 (<= .cse2 0)) (and .cse3 (or .cse4 (and (<= c_main_~y~0 .cse5) .cse6) (and .cse0 .cse1 (<= c_main_~y~0 .cse7)) .cse8 .cse9)) (and (<= .cse10 0) .cse6)) (or (and (or (< 0 .cse2) .cse8 .cse9) (or .cse4 (< 0 .cse10))) (and .cse0 .cse1 (<= 0 .cse11)) (and (<= 0 .cse12) .cse6))))) .cse3 (<= c_main_~x~0 3) (or (and (or (and (or (and (<= c_main_~y~0 (+ .cse13 .cse14 4294967295)) .cse0 .cse1) (and (<= c_main_~y~0 (+ .cse13 .cse15 4294967295)) .cse6)) (or (and (<= c_main_~y~0 (+ .cse13 3)) .cse0 .cse1) (and (<= c_main_~y~0 (+ .cse13 1)) .cse6))) (<= c_main_~y~0 .cse13)) (or (<= .cse13 c_main_~y~0) (< .cse13 c_main_~y~0))) .cse8) (<= 3 c_main_~x~0)))))))) is different from false [2018-10-22 09:49:52,168 WARN L179 SmtUtils]: Spent 4.10 s on a formula simplification. DAG size of input: 95 DAG size of output: 12 [2018-10-22 09:49:54,192 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse21 (div c_main_~y~0 2))) (let ((.cse15 (* 2 .cse21)) (.cse20 (* (- 2) .cse21))) (let ((.cse9 (div (+ c_main_~y~0 .cse20 (- 2)) 4294967296)) (.cse3 (= c_main_~y~0 .cse15)) (.cse10 (div (+ c_main_~y~0 .cse20) 4294967296)) (.cse19 (* 4294967296 (div c_main_~y~0 4294967296)))) (let ((.cse4 (<= .cse19 c_main_~y~0)) (.cse17 (* 4294967296 .cse10)) (.cse7 (not .cse3)) (.cse8 (< c_main_~y~0 .cse19)) (.cse16 (* 4294967296 .cse9))) (let ((.cse13 (+ .cse15 .cse16 2)) (.cse5 (and .cse7 .cse8)) (.cse12 (+ .cse15 .cse17)) (.cse11 (or .cse3 .cse4))) (let ((.cse0 (or (and (or (< .cse13 c_main_~y~0) .cse3 .cse4) (or .cse5 (< .cse12 c_main_~y~0))) (and (<= (+ .cse15 .cse16 3) c_main_~y~0) .cse7 .cse8) (and .cse11 (<= (+ .cse15 .cse17 1) c_main_~y~0)))) (.cse1 (+ c_main_~x~0 5))) (and .cse0 (<= 0 .cse1) (let ((.cse14 (<= c_main_~y~0 .cse15))) (or (let ((.cse2 (+ .cse9 1)) (.cse6 (+ .cse10 1))) (and (or (and (or (< 0 .cse2) .cse3 .cse4) (or .cse5 (< 0 .cse6))) (and .cse7 .cse8 (<= 0 .cse9)) (and (<= 0 .cse10) .cse11)) (or (and .cse7 .cse8 (<= .cse2 0)) (and .cse0 (or (and (<= c_main_~y~0 .cse12) .cse11) (and .cse7 .cse8 (<= c_main_~y~0 .cse13)) (and .cse11 .cse14) (and (<= c_main_~y~0 (+ .cse15 2)) .cse7 .cse8))) (and (<= .cse6 0) .cse11)))) (let ((.cse18 (+ .cse15 1))) (and (or (and (or (and (<= c_main_~y~0 (+ .cse15 .cse16 4294967295)) .cse7 .cse8) (and (<= c_main_~y~0 (+ .cse15 .cse17 4294967295)) .cse11)) (or (and (<= c_main_~y~0 (+ .cse15 3)) .cse7 .cse8) (and (<= c_main_~y~0 .cse18) .cse11))) .cse14) (or (<= .cse18 c_main_~y~0) (< .cse15 c_main_~y~0)))))) (< (* 4294967296 (div c_main_~x~0 4294967296)) (+ c_main_~x~0 1)) (<= .cse1 0)))))))) is different from false [2018-10-22 09:49:54,233 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 09:49:54,233 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 09:49:54,234 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-22 09:49:54,234 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 38 with the following transitions: [2018-10-22 09:49:54,234 INFO L202 CegarAbsIntRunner]: [0], [4], [5], [6], [10], [14], [16], [22], [23], [24], [25], [32], [33], [40], [41], [48], [49], [56], [57], [64], [65], [72], [73], [80], [81], [88], [89], [96], [97], [104], [107], [109], [115], [116], [117], [119] [2018-10-22 09:49:54,238 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-22 09:49:54,239 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-22 09:49:54,245 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-22 09:49:54,303 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-22 09:49:54,304 INFO L272 AbstractInterpreter]: Visited 36 different actions 39 times. Merged at 2 different actions 2 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 4 variables. [2018-10-22 09:49:54,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 09:49:54,340 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-22 09:49:54,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 09:49:54,340 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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 [2018-10-22 09:49:54,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 09:49:54,354 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-22 09:49:54,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 09:49:54,389 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 09:49:54,875 WARN L179 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 10 [2018-10-22 09:49:56,431 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 09:49:56,431 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-22 09:49:57,142 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 09:49:57,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 09:49:57,170 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-10-22 09:49:57,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 09:49:57,187 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-22 09:49:57,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 09:49:57,223 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 09:49:57,626 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 09:49:57,626 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-22 09:49:58,003 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 09:49:58,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-10-22 09:49:58,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 8, 12, 9] total 30 [2018-10-22 09:49:58,005 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-22 09:49:58,005 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-22 09:49:58,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-22 09:49:58,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=365, Unknown=10, NotChecked=414, Total=870 [2018-10-22 09:49:58,006 INFO L87 Difference]: Start difference. First operand 82 states and 84 transitions. Second operand 21 states. [2018-10-22 09:50:00,370 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (* 2 (div c_main_~y~0 2)))) (let ((.cse1 (<= .cse0 c_main_~y~0)) (.cse2 (= c_main_~y~0 .cse0))) (and (or (and (or (<= c_main_~y~0 (+ .cse0 1)) (<= c_main_~y~0 .cse0)) (or .cse1 (< .cse0 c_main_~y~0))) .cse2) (< (* 4294967296 (div c_main_~y~0 4294967296)) (+ c_main_~y~0 1)) (not (= (mod c_main_~y~0 2) 0)) (or .cse1 (not .cse2)) (<= c_main_~x~0 0) (<= 0 c_main_~x~0)))) is different from false [2018-10-22 09:50:02,389 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (* 2 (div c_main_~y~0 2)))) (let ((.cse1 (<= .cse0 c_main_~y~0)) (.cse2 (= c_main_~y~0 .cse0))) (and (<= |c_main_#t~post1| 0) (or (and (or (<= c_main_~y~0 (+ .cse0 1)) (<= c_main_~y~0 .cse0)) (or .cse1 (< .cse0 c_main_~y~0))) .cse2) (< (* 4294967296 (div c_main_~y~0 4294967296)) (+ c_main_~y~0 1)) (not (= (mod c_main_~y~0 2) 0)) (or .cse1 (not .cse2)) (<= 0 |c_main_#t~post1|)))) is different from false [2018-10-22 09:50:04,404 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (* 2 (div c_main_~y~0 2)))) (let ((.cse1 (<= .cse0 c_main_~y~0)) (.cse2 (= c_main_~y~0 .cse0))) (and (<= c_main_~x~0 1) (or (and (or (<= c_main_~y~0 (+ .cse0 1)) (<= c_main_~y~0 .cse0)) (or .cse1 (< .cse0 c_main_~y~0))) .cse2) (< (* 4294967296 (div c_main_~y~0 4294967296)) (+ c_main_~y~0 1)) (<= 1 c_main_~x~0) (not (= (mod c_main_~y~0 2) 0)) (or .cse1 (not .cse2))))) is different from false [2018-10-22 09:50:06,426 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse18 (div c_main_~y~0 2))) (let ((.cse17 (* (- 2) .cse18)) (.cse0 (* 2 .cse18))) (let ((.cse16 (* 4294967296 (div c_main_~y~0 4294967296))) (.cse6 (= c_main_~y~0 .cse0)) (.cse13 (div (+ c_main_~y~0 .cse17) 4294967296)) (.cse12 (div (+ c_main_~y~0 .cse17 (- 2)) 4294967296))) (let ((.cse1 (* 4294967296 .cse12)) (.cse4 (* 4294967296 .cse13)) (.cse2 (not .cse6)) (.cse3 (< c_main_~y~0 .cse16)) (.cse9 (<= .cse16 c_main_~y~0))) (let ((.cse5 (or .cse6 .cse9)) (.cse10 (and .cse2 .cse3)) (.cse14 (+ .cse0 .cse4)) (.cse15 (+ .cse0 .cse1 2))) (let ((.cse7 (or (and (<= .cse14 c_main_~y~0) .cse5) (and (or (< .cse15 c_main_~y~0) .cse6 .cse9) (or .cse10 (< .cse14 c_main_~y~0))) (and (<= .cse15 c_main_~y~0) .cse2 .cse3)))) (and (or (and (or (and (or (and (<= c_main_~y~0 (+ .cse0 .cse1 4294967295)) .cse2 .cse3) (and (<= c_main_~y~0 (+ .cse0 .cse4 4294967295)) .cse5)) (or (and (<= c_main_~y~0 (+ .cse0 3)) .cse2 .cse3) (and (<= c_main_~y~0 (+ .cse0 1)) .cse5))) (<= c_main_~y~0 .cse0)) (or (<= .cse0 c_main_~y~0) (< .cse0 c_main_~y~0))) .cse6) (<= c_main_~x~0 1) .cse7 (or (let ((.cse8 (+ .cse12 1)) (.cse11 (+ .cse13 1))) (and (or (and (or (< 0 .cse8) .cse6 .cse9) (or .cse10 (< 0 .cse11))) (and .cse2 .cse3 (<= 0 .cse12)) (and (<= 0 .cse13) .cse5)) (or (and .cse2 .cse3 (<= .cse8 0)) (and (<= .cse11 0) .cse5) (and .cse7 (or .cse10 (and (<= c_main_~y~0 .cse14) .cse5) (and .cse2 .cse3 (<= c_main_~y~0 .cse15)) .cse6 .cse9))))) .cse2) (<= 1 c_main_~x~0) (or .cse6 (not (= .cse15 c_main_~y~0)) .cse9) (not (= (mod c_main_~y~0 2) 0)) (or .cse10 (not (= .cse14 c_main_~y~0)))))))))) is different from false [2018-10-22 09:50:08,464 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse19 (div c_main_~y~0 2))) (let ((.cse13 (* 2 .cse19)) (.cse18 (* (- 2) .cse19))) (let ((.cse11 (div (+ c_main_~y~0 .cse18 (- 2)) 4294967296)) (.cse8 (= c_main_~y~0 .cse13)) (.cse12 (div (+ c_main_~y~0 .cse18) 4294967296)) (.cse17 (* 4294967296 (div c_main_~y~0 4294967296)))) (let ((.cse9 (<= .cse17 c_main_~y~0)) (.cse15 (* 4294967296 .cse12)) (.cse0 (not .cse8)) (.cse1 (< c_main_~y~0 .cse17)) (.cse14 (* 4294967296 .cse11))) (let ((.cse7 (+ .cse13 .cse14 2)) (.cse4 (and .cse0 .cse1)) (.cse5 (+ .cse13 .cse15)) (.cse6 (or .cse8 .cse9))) (let ((.cse3 (or (and (or (< .cse7 c_main_~y~0) .cse8 .cse9) (or .cse4 (< .cse5 c_main_~y~0))) (and (<= (+ .cse13 .cse14 3) c_main_~y~0) .cse0 .cse1) (and .cse6 (<= (+ .cse13 .cse15 1) c_main_~y~0)))) (.cse16 (+ c_main_~x~0 1))) (and (or .cse0 (let ((.cse2 (+ .cse11 1)) (.cse10 (+ .cse12 1))) (and (or (and .cse0 .cse1 (<= .cse2 0)) (and .cse3 (or .cse4 (and (<= c_main_~y~0 .cse5) .cse6) (and .cse0 .cse1 (<= c_main_~y~0 .cse7)) .cse8 .cse9)) (and (<= .cse10 0) .cse6)) (or (and (or (< 0 .cse2) .cse8 .cse9) (or .cse4 (< 0 .cse10))) (and .cse0 .cse1 (<= 0 .cse11)) (and (<= 0 .cse12) .cse6))))) .cse3 (or (and (or (and (or (and (<= c_main_~y~0 (+ .cse13 .cse14 4294967295)) .cse0 .cse1) (and (<= c_main_~y~0 (+ .cse13 .cse15 4294967295)) .cse6)) (or (and (<= c_main_~y~0 (+ .cse13 3)) .cse0 .cse1) (and (<= c_main_~y~0 (+ .cse13 1)) .cse6))) (<= c_main_~y~0 .cse13)) (or (<= .cse13 c_main_~y~0) (< .cse13 c_main_~y~0))) .cse8) (<= .cse16 0) (not (= .cse5 c_main_~y~0)) (<= 0 .cse16)))))))) is different from false [2018-10-22 09:50:14,603 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse19 (div c_main_~y~0 2))) (let ((.cse14 (* 2 .cse19)) (.cse18 (* (- 2) .cse19))) (let ((.cse11 (div (+ c_main_~y~0 .cse18 (- 2)) 4294967296)) (.cse8 (= c_main_~y~0 .cse14)) (.cse12 (div (+ c_main_~y~0 .cse18) 4294967296)) (.cse17 (* 4294967296 (div c_main_~y~0 4294967296)))) (let ((.cse9 (<= .cse17 c_main_~y~0)) (.cse16 (* 4294967296 .cse12)) (.cse0 (not .cse8)) (.cse1 (< c_main_~y~0 .cse17)) (.cse15 (* 4294967296 .cse11))) (let ((.cse7 (+ .cse14 .cse15 2)) (.cse4 (and .cse0 .cse1)) (.cse5 (+ .cse14 .cse16)) (.cse6 (or .cse8 .cse9))) (let ((.cse3 (or (and (or (< .cse7 c_main_~y~0) .cse8 .cse9) (or .cse4 (< .cse5 c_main_~y~0))) (and (<= (+ .cse14 .cse15 3) c_main_~y~0) .cse0 .cse1) (and .cse6 (<= (+ .cse14 .cse16 1) c_main_~y~0)))) (.cse13 (+ c_main_~x~0 3))) (and (or .cse0 (let ((.cse2 (+ .cse11 1)) (.cse10 (+ .cse12 1))) (and (or (and .cse0 .cse1 (<= .cse2 0)) (and .cse3 (or .cse4 (and (<= c_main_~y~0 .cse5) .cse6) (and .cse0 .cse1 (<= c_main_~y~0 .cse7)) .cse8 .cse9)) (and (<= .cse10 0) .cse6)) (or (and (or (< 0 .cse2) .cse8 .cse9) (or .cse4 (< 0 .cse10))) (and .cse0 .cse1 (<= 0 .cse11)) (and (<= 0 .cse12) .cse6))))) .cse3 (<= 0 .cse13) (or (and (or (and (or (and (<= c_main_~y~0 (+ .cse14 .cse15 4294967295)) .cse0 .cse1) (and (<= c_main_~y~0 (+ .cse14 .cse16 4294967295)) .cse6)) (or (and (<= c_main_~y~0 (+ .cse14 3)) .cse0 .cse1) (and (<= c_main_~y~0 (+ .cse14 1)) .cse6))) (<= c_main_~y~0 .cse14)) (or (<= .cse14 c_main_~y~0) (< .cse14 c_main_~y~0))) .cse8) (<= .cse13 0) (not (= (mod c_main_~y~0 2) 0))))))))) is different from false [2018-10-22 09:50:16,680 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse18 (div c_main_~y~0 2))) (let ((.cse13 (* 2 .cse18)) (.cse17 (* (- 2) .cse18))) (let ((.cse11 (div (+ c_main_~y~0 .cse17 (- 2)) 4294967296)) (.cse8 (= c_main_~y~0 .cse13)) (.cse12 (div (+ c_main_~y~0 .cse17) 4294967296)) (.cse16 (* 4294967296 (div c_main_~y~0 4294967296)))) (let ((.cse9 (<= .cse16 c_main_~y~0)) (.cse15 (* 4294967296 .cse12)) (.cse0 (not .cse8)) (.cse1 (< c_main_~y~0 .cse16)) (.cse14 (* 4294967296 .cse11))) (let ((.cse7 (+ .cse13 .cse14 2)) (.cse4 (and .cse0 .cse1)) (.cse5 (+ .cse13 .cse15)) (.cse6 (or .cse8 .cse9))) (let ((.cse3 (or (and (or (< .cse7 c_main_~y~0) .cse8 .cse9) (or .cse4 (< .cse5 c_main_~y~0))) (and (<= (+ .cse13 .cse14 3) c_main_~y~0) .cse0 .cse1) (and .cse6 (<= (+ .cse13 .cse15 1) c_main_~y~0))))) (and (or .cse0 (let ((.cse2 (+ .cse11 1)) (.cse10 (+ .cse12 1))) (and (or (and .cse0 .cse1 (<= .cse2 0)) (and .cse3 (or .cse4 (and (<= c_main_~y~0 .cse5) .cse6) (and .cse0 .cse1 (<= c_main_~y~0 .cse7)) .cse8 .cse9)) (and (<= .cse10 0) .cse6)) (or (and (or (< 0 .cse2) .cse8 .cse9) (or .cse4 (< 0 .cse10))) (and .cse0 .cse1 (<= 0 .cse11)) (and (<= 0 .cse12) .cse6))))) .cse3 (<= c_main_~x~0 3) (or (and (or (and (or (and (<= c_main_~y~0 (+ .cse13 .cse14 4294967295)) .cse0 .cse1) (and (<= c_main_~y~0 (+ .cse13 .cse15 4294967295)) .cse6)) (or (and (<= c_main_~y~0 (+ .cse13 3)) .cse0 .cse1) (and (<= c_main_~y~0 (+ .cse13 1)) .cse6))) (<= c_main_~y~0 .cse13)) (or (<= .cse13 c_main_~y~0) (< .cse13 c_main_~y~0))) .cse8) (not (= (mod c_main_~y~0 2) 0)) (<= 3 c_main_~x~0)))))))) is different from false [2018-10-22 09:50:16,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 09:50:16,762 INFO L93 Difference]: Finished difference Result 113 states and 115 transitions. [2018-10-22 09:50:16,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-22 09:50:16,764 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 37 [2018-10-22 09:50:16,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 09:50:16,765 INFO L225 Difference]: With dead ends: 113 [2018-10-22 09:50:16,765 INFO L226 Difference]: Without dead ends: 58 [2018-10-22 09:50:16,767 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 116 SyntacticMatches, 25 SemanticMatches, 36 ConstructedPredicates, 16 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 49.9s TimeCoverageRelationStatistics Valid=101, Invalid=408, Unknown=17, NotChecked=880, Total=1406 [2018-10-22 09:50:16,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-10-22 09:50:16,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-10-22 09:50:16,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-10-22 09:50:16,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-10-22 09:50:16,773 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 37 [2018-10-22 09:50:16,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 09:50:16,774 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-10-22 09:50:16,774 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-22 09:50:16,774 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-10-22 09:50:16,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-10-22 09:50:16,776 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 09:50:16,776 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 09:50:16,776 INFO L424 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 09:50:16,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 09:50:16,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1669252499, now seen corresponding path program 2 times [2018-10-22 09:50:16,777 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 09:50:16,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 09:50:16,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 09:50:16,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 09:50:16,778 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 09:50:16,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 09:50:17,789 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 09:50:17,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 09:50:17,790 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-22 09:50:17,790 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-22 09:50:17,790 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-22 09:50:17,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 09:50:17,791 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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 [2018-10-22 09:50:17,800 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-22 09:50:17,800 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-10-22 09:50:17,834 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-22 09:50:17,834 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-22 09:50:17,839 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 09:50:17,912 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 09:50:17,912 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-22 09:50:28,984 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 09:50:29,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 09:50:29,004 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-10-22 09:50:29,020 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-22 09:50:29,020 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-10-22 09:50:29,075 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-22 09:50:29,075 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-22 09:50:29,080 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 09:50:29,120 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 09:50:29,120 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-22 09:50:29,184 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 09:50:29,190 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-10-22 09:50:29,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23, 23, 23] total 44 [2018-10-22 09:50:29,190 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-22 09:50:29,191 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-22 09:50:29,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-22 09:50:29,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=526, Invalid=1366, Unknown=0, NotChecked=0, Total=1892 [2018-10-22 09:50:29,193 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 23 states. [2018-10-22 09:50:29,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 09:50:29,709 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-10-22 09:50:29,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-22 09:50:29,710 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 57 [2018-10-22 09:50:29,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 09:50:29,712 INFO L225 Difference]: With dead ends: 87 [2018-10-22 09:50:29,712 INFO L226 Difference]: Without dead ends: 82 [2018-10-22 09:50:29,714 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 205 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=526, Invalid=1366, Unknown=0, NotChecked=0, Total=1892 [2018-10-22 09:50:29,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-10-22 09:50:29,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80. [2018-10-22 09:50:29,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-10-22 09:50:29,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-10-22 09:50:29,720 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 57 [2018-10-22 09:50:29,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 09:50:29,721 INFO L481 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-10-22 09:50:29,721 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-22 09:50:29,721 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-10-22 09:50:29,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-10-22 09:50:29,723 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 09:50:29,724 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 09:50:29,724 INFO L424 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 09:50:29,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 09:50:29,724 INFO L82 PathProgramCache]: Analyzing trace with hash 2016943101, now seen corresponding path program 3 times [2018-10-22 09:50:29,724 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 09:50:29,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 09:50:29,726 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-22 09:50:29,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 09:50:29,727 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 09:50:29,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 09:50:30,510 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 09:50:30,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 09:50:30,511 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-22 09:50:30,511 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-22 09:50:30,511 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-22 09:50:30,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 09:50:30,511 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-22 09:50:30,524 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-22 09:50:30,524 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-22 09:50:30,552 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-22 09:50:30,552 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-22 09:50:30,557 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 09:50:30,593 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 09:50:30,593 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-22 09:50:46,082 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 09:50:46,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 09:50:46,103 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-10-22 09:50:46,119 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-22 09:50:46,119 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-22 09:50:46,205 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-22 09:50:46,205 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-22 09:50:46,210 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 09:50:46,284 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 09:50:46,284 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-22 09:50:46,343 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 09:50:46,346 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-10-22 09:50:46,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33, 33, 33] total 64 [2018-10-22 09:50:46,347 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-22 09:50:46,347 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-22 09:50:46,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-22 09:50:46,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1020, Invalid=3012, Unknown=0, NotChecked=0, Total=4032 [2018-10-22 09:50:46,360 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 33 states. [2018-10-22 09:50:47,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 09:50:47,615 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2018-10-22 09:50:47,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-22 09:50:47,617 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 79 [2018-10-22 09:50:47,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 09:50:47,618 INFO L225 Difference]: With dead ends: 109 [2018-10-22 09:50:47,619 INFO L226 Difference]: Without dead ends: 104 [2018-10-22 09:50:47,620 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 283 SyntacticMatches, 3 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 16.2s TimeCoverageRelationStatistics Valid=1020, Invalid=3012, Unknown=0, NotChecked=0, Total=4032 [2018-10-22 09:50:47,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-10-22 09:50:47,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 102. [2018-10-22 09:50:47,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-10-22 09:50:47,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2018-10-22 09:50:47,629 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 79 [2018-10-22 09:50:47,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 09:50:47,630 INFO L481 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2018-10-22 09:50:47,630 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-22 09:50:47,630 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2018-10-22 09:50:47,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-10-22 09:50:47,635 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 09:50:47,635 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 09:50:47,635 INFO L424 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 09:50:47,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 09:50:47,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1527148941, now seen corresponding path program 4 times [2018-10-22 09:50:47,637 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 09:50:47,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 09:50:47,638 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-22 09:50:47,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 09:50:47,638 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 09:50:47,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 09:50:49,163 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 09:50:49,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 09:50:49,164 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-22 09:50:49,164 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-22 09:50:49,164 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-22 09:50:49,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 09:50:49,164 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-22 09:50:49,174 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-22 09:50:49,174 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-22 09:50:49,214 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-22 09:50:49,214 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-22 09:50:49,218 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 09:50:49,261 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 09:50:49,262 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-22 09:51:14,290 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 09:51:14,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 09:51:14,311 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/cvc4nyu Starting monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-10-22 09:51:14,328 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-22 09:51:14,328 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-22 09:51:14,405 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-22 09:51:14,405 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-22 09:51:14,411 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 09:51:14,446 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 09:51:14,446 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-22 09:51:14,521 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 09:51:14,525 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-10-22 09:51:14,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43, 43, 43] total 84 [2018-10-22 09:51:14,525 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-22 09:51:14,525 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-22 09:51:14,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-22 09:51:14,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1350, Invalid=5622, Unknown=0, NotChecked=0, Total=6972 [2018-10-22 09:51:14,531 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 43 states. [2018-10-22 09:51:16,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 09:51:16,149 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2018-10-22 09:51:16,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-22 09:51:16,150 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 101 [2018-10-22 09:51:16,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 09:51:16,152 INFO L225 Difference]: With dead ends: 131 [2018-10-22 09:51:16,152 INFO L226 Difference]: Without dead ends: 126 [2018-10-22 09:51:16,154 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 446 GetRequests, 361 SyntacticMatches, 3 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 816 ImplicationChecksByTransitivity, 26.4s TimeCoverageRelationStatistics Valid=1350, Invalid=5622, Unknown=0, NotChecked=0, Total=6972 [2018-10-22 09:51:16,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-10-22 09:51:16,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2018-10-22 09:51:16,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-10-22 09:51:16,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 124 transitions. [2018-10-22 09:51:16,163 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 124 transitions. Word has length 101 [2018-10-22 09:51:16,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 09:51:16,163 INFO L481 AbstractCegarLoop]: Abstraction has 124 states and 124 transitions. [2018-10-22 09:51:16,164 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-22 09:51:16,164 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 124 transitions. [2018-10-22 09:51:16,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-10-22 09:51:16,167 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 09:51:16,167 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 09:51:16,167 INFO L424 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 09:51:16,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 09:51:16,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1125989149, now seen corresponding path program 5 times [2018-10-22 09:51:16,168 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 09:51:16,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 09:51:16,170 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-22 09:51:16,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 09:51:16,171 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 09:51:16,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 09:51:22,853 WARN L179 SmtUtils]: Spent 6.06 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-22 09:51:25,147 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-22 09:51:31,362 WARN L179 SmtUtils]: Spent 6.06 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-22 09:51:35,472 WARN L179 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-22 09:51:37,913 WARN L179 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-22 09:51:44,025 WARN L179 SmtUtils]: Spent 6.06 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-22 09:51:52,156 WARN L179 SmtUtils]: Spent 8.06 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-22 09:51:56,376 WARN L179 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-22 09:51:58,760 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-22 09:52:00,890 WARN L179 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-22 09:52:07,035 WARN L179 SmtUtils]: Spent 6.06 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-22 09:52:09,726 WARN L179 SmtUtils]: Spent 2.15 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-22 09:52:13,872 WARN L179 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-22 09:52:20,015 WARN L179 SmtUtils]: Spent 6.06 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-22 09:52:26,316 WARN L179 SmtUtils]: Spent 6.06 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-22 09:52:32,485 WARN L179 SmtUtils]: Spent 6.06 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-22 09:52:36,638 WARN L179 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-22 09:52:38,785 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-22 09:52:42,952 WARN L179 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-22 09:52:51,288 WARN L179 SmtUtils]: Spent 8.06 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-22 09:52:55,477 WARN L179 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-22 09:52:57,644 WARN L179 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-22 09:53:01,819 WARN L179 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-22 09:53:04,000 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-22 09:53:08,177 WARN L179 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-22 09:53:12,548 WARN L179 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-22 09:53:17,350 WARN L179 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-22 09:53:19,565 WARN L179 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-22 09:53:25,780 WARN L179 SmtUtils]: Spent 6.06 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-22 09:53:29,978 WARN L179 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-22 09:53:34,178 WARN L179 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-22 09:53:34,540 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 0 proven. 230 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 09:53:34,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 09:53:34,540 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-22 09:53:34,540 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-22 09:53:34,541 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-22 09:53:34,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 09:53:34,541 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-22 09:53:34,549 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-22 09:53:34,549 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder INSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-10-22 09:53:34,632 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-10-22 09:53:34,633 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-22 09:53:34,637 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 09:53:35,454 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 0 proven. 230 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 09:53:35,454 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-22 09:53:35,991 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2018-10-22 09:53:36,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 09:53:36,022 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/cvc4nyu Starting monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-10-22 09:53:36,046 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-22 09:53:36,046 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder INSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-10-22 09:53:36,231 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-10-22 09:53:36,231 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-22 09:53:36,264 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 09:53:37,228 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 0 proven. 230 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 09:53:37,229 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-22 09:53:37,767 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 56 proven. 30 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-10-22 09:53:37,769 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-10-22 09:53:37,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 6, 56, 7] total 68 [2018-10-22 09:53:37,770 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-22 09:53:37,770 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-22 09:53:37,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-22 09:53:37,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=4243, Unknown=0, NotChecked=0, Total=4556 [2018-10-22 09:53:37,773 INFO L87 Difference]: Start difference. First operand 124 states and 124 transitions. Second operand 63 states. [2018-10-22 09:53:43,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 09:53:43,604 INFO L93 Difference]: Finished difference Result 149 states and 150 transitions. [2018-10-22 09:53:43,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-22 09:53:43,604 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 123 [2018-10-22 09:53:43,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 09:53:43,605 INFO L225 Difference]: With dead ends: 149 [2018-10-22 09:53:43,605 INFO L226 Difference]: Without dead ends: 0 [2018-10-22 09:53:43,607 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 549 GetRequests, 465 SyntacticMatches, 17 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 140.2s TimeCoverageRelationStatistics Valid=319, Invalid=4373, Unknown=0, NotChecked=0, Total=4692 [2018-10-22 09:53:43,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-22 09:53:43,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-22 09:53:43,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-22 09:53:43,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-22 09:53:43,611 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 123 [2018-10-22 09:53:43,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 09:53:43,611 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-22 09:53:43,611 INFO L482 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-22 09:53:43,611 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-22 09:53:43,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-22 09:53:43,616 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-22 09:53:43,839 WARN L179 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 47 [2018-10-22 09:53:43,863 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-10-22 09:53:43,863 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-22 09:53:43,863 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-22 09:53:43,863 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-10-22 09:53:43,863 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-22 09:53:43,863 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-22 09:53:43,863 INFO L425 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-10-22 09:53:43,863 INFO L421 ceAbstractionStarter]: At program point L31-2(lines 12 33) the Hoare annotation is: (let ((.cse5 (div main_~y~0 2))) (let ((.cse2 (* 2 .cse5)) (.cse4 (* 4294967296 (div (+ main_~y~0 (* (- 2) .cse5)) 4294967296)))) (let ((.cse3 (+ .cse2 main_~x~0 .cse4)) (.cse0 (= (+ .cse2 .cse4) main_~y~0))) (or (and (<= main_~x~0 0) (<= 0 main_~x~0)) (and (<= 20 main_~x~0) .cse0 (<= main_~x~0 20)) (and (<= main_~x~0 60) (<= 60 main_~x~0) .cse0) (let ((.cse1 (+ main_~x~0 5))) (and (<= 0 .cse1) (<= .cse1 0) (< .cse2 main_~y~0))) (and (<= .cse3 (+ main_~y~0 100)) .cse0 (<= 100 main_~x~0)) (and (<= .cse3 (+ main_~y~0 40)) .cse0 (<= 40 main_~x~0)) (and (<= 80 main_~x~0) (<= main_~x~0 80) .cse0))))) [2018-10-22 09:53:43,864 INFO L425 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2018-10-22 09:53:43,864 INFO L425 ceAbstractionStarter]: For program point L27-2(lines 12 33) no Hoare annotation was computed. [2018-10-22 09:53:43,864 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 9 35) no Hoare annotation was computed. [2018-10-22 09:53:43,864 INFO L425 ceAbstractionStarter]: For program point L23(line 23) no Hoare annotation was computed. [2018-10-22 09:53:43,864 INFO L425 ceAbstractionStarter]: For program point L23-2(lines 12 33) no Hoare annotation was computed. [2018-10-22 09:53:43,864 INFO L425 ceAbstractionStarter]: For program point L19(line 19) no Hoare annotation was computed. [2018-10-22 09:53:43,864 INFO L425 ceAbstractionStarter]: For program point L19-2(lines 12 33) no Hoare annotation was computed. [2018-10-22 09:53:43,864 INFO L425 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. [2018-10-22 09:53:43,864 INFO L425 ceAbstractionStarter]: For program point L15-2(lines 12 33) no Hoare annotation was computed. [2018-10-22 09:53:43,864 INFO L425 ceAbstractionStarter]: For program point L11(line 11) no Hoare annotation was computed. [2018-10-22 09:53:43,864 INFO L425 ceAbstractionStarter]: For program point L11-1(line 11) no Hoare annotation was computed. [2018-10-22 09:53:43,864 INFO L425 ceAbstractionStarter]: For program point L32(line 32) no Hoare annotation was computed. [2018-10-22 09:53:43,864 INFO L425 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-10-22 09:53:43,864 INFO L425 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2018-10-22 09:53:43,864 INFO L425 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2018-10-22 09:53:43,864 INFO L425 ceAbstractionStarter]: For program point L16(line 16) no Hoare annotation was computed. [2018-10-22 09:53:43,865 INFO L425 ceAbstractionStarter]: For program point L12-1(lines 12 33) no Hoare annotation was computed. [2018-10-22 09:53:43,866 INFO L421 ceAbstractionStarter]: At program point L12-3(lines 12 33) the Hoare annotation is: (let ((.cse3 (div main_~y~0 2))) (let ((.cse1 (* 2 .cse3))) (or (let ((.cse0 (+ main_~x~0 5))) (and (<= 0 .cse0) (<= .cse0 0) (< .cse1 main_~y~0))) (let ((.cse2 (* 4294967296 (div (+ main_~y~0 (* (- 2) .cse3)) 4294967296)))) (and (<= main_~y~0 (+ .cse1 .cse2)) (<= (+ .cse1 main_~x~0 .cse2) (+ main_~y~0 100)) (<= 100 main_~x~0)))))) [2018-10-22 09:53:43,866 INFO L425 ceAbstractionStarter]: For program point L29(line 29) no Hoare annotation was computed. [2018-10-22 09:53:43,866 INFO L425 ceAbstractionStarter]: For program point L29-2(lines 12 33) no Hoare annotation was computed. [2018-10-22 09:53:43,866 INFO L425 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-10-22 09:53:43,866 INFO L425 ceAbstractionStarter]: For program point L25-2(lines 12 33) no Hoare annotation was computed. [2018-10-22 09:53:43,866 INFO L425 ceAbstractionStarter]: For program point L21(line 21) no Hoare annotation was computed. [2018-10-22 09:53:43,866 INFO L425 ceAbstractionStarter]: For program point L21-2(lines 12 33) no Hoare annotation was computed. [2018-10-22 09:53:43,866 INFO L425 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2018-10-22 09:53:43,866 INFO L425 ceAbstractionStarter]: For program point L17-2(lines 12 33) no Hoare annotation was computed. [2018-10-22 09:53:43,866 INFO L425 ceAbstractionStarter]: For program point L13(lines 13 14) no Hoare annotation was computed. [2018-10-22 09:53:43,867 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 9 35) no Hoare annotation was computed. [2018-10-22 09:53:43,867 INFO L425 ceAbstractionStarter]: For program point L13-1(line 13) no Hoare annotation was computed. [2018-10-22 09:53:43,867 INFO L425 ceAbstractionStarter]: For program point L13-3(lines 12 33) no Hoare annotation was computed. [2018-10-22 09:53:43,867 INFO L425 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2018-10-22 09:53:43,867 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 9 35) the Hoare annotation is: true [2018-10-22 09:53:43,867 INFO L425 ceAbstractionStarter]: For program point L26(line 26) no Hoare annotation was computed. [2018-10-22 09:53:43,867 INFO L425 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-10-22 09:53:43,867 INFO L425 ceAbstractionStarter]: For program point L18(line 18) no Hoare annotation was computed. [2018-10-22 09:53:43,867 INFO L425 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. [2018-10-22 09:53:43,867 INFO L425 ceAbstractionStarter]: For program point L14-1(line 14) no Hoare annotation was computed. [2018-10-22 09:53:43,868 INFO L425 ceAbstractionStarter]: For program point L14-2(line 14) no Hoare annotation was computed. [2018-10-22 09:53:43,868 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-10-22 09:53:43,868 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-10-22 09:53:43,868 INFO L425 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-10-22 09:53:43,868 INFO L425 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-10-22 09:53:43,868 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-10-22 09:53:43,868 INFO L425 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-10-22 09:53:43,888 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 09:53:43 BoogieIcfgContainer [2018-10-22 09:53:43,888 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-22 09:53:43,888 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-22 09:53:43,888 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-22 09:53:43,889 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-22 09:53:43,891 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:49:13" (3/4) ... [2018-10-22 09:53:43,895 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-10-22 09:53:43,900 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-10-22 09:53:43,901 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-10-22 09:53:43,901 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-10-22 09:53:43,906 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2018-10-22 09:53:43,911 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-10-22 09:53:43,911 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-10-22 09:53:43,965 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/witness.graphml [2018-10-22 09:53:43,965 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-22 09:53:43,966 INFO L168 Benchmark]: Toolchain (without parser) took 271212.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 218.1 MB). Free memory was 949.7 MB in the beginning and 1.1 GB in the end (delta: -149.6 MB). Peak memory consumption was 68.6 MB. Max. memory is 11.5 GB. [2018-10-22 09:53:43,968 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-22 09:53:43,968 INFO L168 Benchmark]: CACSL2BoogieTranslator took 328.79 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 939.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-10-22 09:53:43,969 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.95 ms. Allocated memory is still 1.0 GB. Free memory is still 939.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-22 09:53:43,969 INFO L168 Benchmark]: Boogie Preprocessor took 56.72 ms. Allocated memory is still 1.0 GB. Free memory was 939.0 MB in the beginning and 933.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-10-22 09:53:43,970 INFO L168 Benchmark]: RCFGBuilder took 688.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 933.6 MB in the beginning and 1.1 GB in the end (delta: -194.1 MB). Peak memory consumption was 20.2 MB. Max. memory is 11.5 GB. [2018-10-22 09:53:43,972 INFO L168 Benchmark]: TraceAbstraction took 270015.76 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 68.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.3 MB). Peak memory consumption was 89.0 MB. Max. memory is 11.5 GB. [2018-10-22 09:53:43,973 INFO L168 Benchmark]: Witness Printer took 77.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. [2018-10-22 09:53:43,978 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 328.79 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 939.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.95 ms. Allocated memory is still 1.0 GB. Free memory is still 939.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 56.72 ms. Allocated memory is still 1.0 GB. Free memory was 939.0 MB in the beginning and 933.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 688.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 933.6 MB in the beginning and 1.1 GB in the end (delta: -194.1 MB). Peak memory consumption was 20.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 270015.76 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 68.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.3 MB). Peak memory consumption was 89.0 MB. Max. memory is 11.5 GB. * Witness Printer took 77.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: 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 - InvariantResult [Line: 12]: Loop Invariant Derived loop invariant: ((((((x <= 0 && 0 <= x) || ((20 <= x && 2 * (y / 2) + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) == y) && x <= 20)) || ((x <= 60 && 60 <= x) && 2 * (y / 2) + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) == y)) || ((0 <= x + 5 && x + 5 <= 0) && 2 * (y / 2) < y)) || ((2 * (y / 2) + x + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) <= y + 100 && 2 * (y / 2) + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) == y) && 100 <= x)) || ((2 * (y / 2) + x + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) <= y + 40 && 2 * (y / 2) + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) == y) && 40 <= x)) || ((80 <= x && x <= 80) && 2 * (y / 2) + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) == y) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 52 locations, 1 error locations. SAFE Result, 269.9s OverallTime, 11 OverallIterations, 6 TraceHistogramMax, 29.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 498 SDtfs, 56 SDslu, 5768 SDs, 0 SdLazy, 10794 SolverSat, 29 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1937 GetRequests, 1567 SyntacticMatches, 55 SemanticMatches, 315 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 1593 ImplicationChecksByTransitivity, 252.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=124occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.2s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 16 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 19 PreInvPairs, 28 NumberOfFragments, 263 HoareAnnotationTreeSize, 19 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 184 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 237.3s InterpolantComputationTime, 1430 NumberOfCodeBlocks, 1430 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 2259 ConstructedInterpolants, 26 QuantifiedInterpolants, 3053857 SizeOfPredicates, 24 NumberOfNonLiveVariables, 1642 ConjunctsInSsa, 710 ConjunctsInUnsatCore, 35 InterpolantComputations, 5 PerfectInterpolantSequences, 414/2366 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...