./Ultimate.py --spec ../../../trunk/examples/svcomp/ReachSafety.prp --file ../../../trunk/examples/svcomp/loop-acceleration/underapprox_true-unreach-call1_true-termination.i --full-output --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/underapprox_true-unreach-call1_true-termination.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 6a0edfd90480f917557019c272eaa2ec2221428a .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-0210da8 [2018-10-21 12:34:17,961 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-21 12:34:17,962 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-21 12:34:17,974 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-21 12:34:17,975 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-21 12:34:17,976 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-21 12:34:17,977 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-21 12:34:17,979 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-21 12:34:17,981 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-21 12:34:17,981 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-21 12:34:17,982 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-21 12:34:17,983 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-21 12:34:17,984 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-21 12:34:17,985 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-21 12:34:17,986 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-21 12:34:17,987 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-21 12:34:17,988 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-21 12:34:17,990 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-21 12:34:17,992 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-21 12:34:17,993 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-21 12:34:17,995 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-21 12:34:17,996 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-21 12:34:17,998 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-21 12:34:17,999 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-21 12:34:17,999 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-21 12:34:18,000 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-21 12:34:18,001 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-21 12:34:18,002 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-21 12:34:18,003 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-21 12:34:18,004 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-21 12:34:18,005 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-21 12:34:18,005 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-21 12:34:18,005 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-21 12:34:18,006 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-21 12:34:18,007 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-21 12:34:18,008 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-21 12:34:18,008 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-10-21 12:34:18,026 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-21 12:34:18,026 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-21 12:34:18,027 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-21 12:34:18,027 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-21 12:34:18,027 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-21 12:34:18,028 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-21 12:34:18,028 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-21 12:34:18,028 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-21 12:34:18,028 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-21 12:34:18,028 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-21 12:34:18,028 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-21 12:34:18,030 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-21 12:34:18,030 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-21 12:34:18,030 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-21 12:34:18,031 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-21 12:34:18,031 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-21 12:34:18,031 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-21 12:34:18,031 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-21 12:34:18,031 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-21 12:34:18,031 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-21 12:34:18,032 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-21 12:34:18,033 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-21 12:34:18,033 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-21 12:34:18,033 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-21 12:34:18,033 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-21 12:34:18,033 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-21 12:34:18,034 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-21 12:34:18,034 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-21 12:34:18,035 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-21 12:34:18,035 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-21 12:34:18,035 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-21 12:34:18,035 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-21 12:34:18,035 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-21 12:34:18,035 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-21 12:34:18,036 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 -> 6a0edfd90480f917557019c272eaa2ec2221428a [2018-10-21 12:34:18,087 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-21 12:34:18,098 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-21 12:34:18,102 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-21 12:34:18,104 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-21 12:34:18,104 INFO L276 PluginConnector]: CDTParser initialized [2018-10-21 12:34:18,105 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/loop-acceleration/underapprox_true-unreach-call1_true-termination.i [2018-10-21 12:34:18,161 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/5da1ef662/440657de02ee4e7bbc50aa389656677d/FLAG7f05e35c1 [2018-10-21 12:34:18,621 INFO L298 CDTParser]: Found 1 translation units. [2018-10-21 12:34:18,623 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/underapprox_true-unreach-call1_true-termination.i [2018-10-21 12:34:18,630 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/5da1ef662/440657de02ee4e7bbc50aa389656677d/FLAG7f05e35c1 [2018-10-21 12:34:18,652 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/5da1ef662/440657de02ee4e7bbc50aa389656677d [2018-10-21 12:34:18,656 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-21 12:34:18,658 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-21 12:34:18,659 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-21 12:34:18,660 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-21 12:34:18,664 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-21 12:34:18,664 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 12:34:18" (1/1) ... [2018-10-21 12:34:18,667 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16da99dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 12:34:18, skipping insertion in model container [2018-10-21 12:34:18,668 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 12:34:18" (1/1) ... [2018-10-21 12:34:18,676 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-21 12:34:18,695 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-21 12:34:18,855 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-21 12:34:18,859 INFO L189 MainTranslator]: Completed pre-run [2018-10-21 12:34:18,876 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-21 12:34:18,891 INFO L193 MainTranslator]: Completed translation [2018-10-21 12:34:18,891 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 12:34:18 WrapperNode [2018-10-21 12:34:18,892 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-21 12:34:18,893 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-21 12:34:18,893 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-21 12:34:18,893 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-21 12:34:18,903 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 12:34:18" (1/1) ... [2018-10-21 12:34:18,908 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 12:34:18" (1/1) ... [2018-10-21 12:34:18,914 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-21 12:34:18,914 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-21 12:34:18,915 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-21 12:34:18,915 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-21 12:34:18,925 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 12:34:18" (1/1) ... [2018-10-21 12:34:18,925 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 12:34:18" (1/1) ... [2018-10-21 12:34:18,925 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 12:34:18" (1/1) ... [2018-10-21 12:34:18,926 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 12:34:18" (1/1) ... [2018-10-21 12:34:18,929 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 12:34:18" (1/1) ... [2018-10-21 12:34:18,935 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 12:34:18" (1/1) ... [2018-10-21 12:34:18,935 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 12:34:18" (1/1) ... [2018-10-21 12:34:18,937 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-21 12:34:18,938 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-21 12:34:18,938 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-21 12:34:18,938 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-21 12:34:18,939 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 12:34:18" (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-21 12:34:19,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-21 12:34:19,055 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-21 12:34:19,055 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-21 12:34:19,055 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-21 12:34:19,055 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-21 12:34:19,055 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-21 12:34:19,055 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-10-21 12:34:19,055 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-10-21 12:34:19,290 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-21 12:34:19,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 12:34:19 BoogieIcfgContainer [2018-10-21 12:34:19,291 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-21 12:34:19,292 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-21 12:34:19,292 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-21 12:34:19,295 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-21 12:34:19,295 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.10 12:34:18" (1/3) ... [2018-10-21 12:34:19,296 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f364915 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 12:34:19, skipping insertion in model container [2018-10-21 12:34:19,296 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 12:34:18" (2/3) ... [2018-10-21 12:34:19,297 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f364915 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 12:34:19, skipping insertion in model container [2018-10-21 12:34:19,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 12:34:19" (3/3) ... [2018-10-21 12:34:19,298 INFO L112 eAbstractionObserver]: Analyzing ICFG underapprox_true-unreach-call1_true-termination.i [2018-10-21 12:34:19,306 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-21 12:34:19,312 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-21 12:34:19,325 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-21 12:34:19,354 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-21 12:34:19,355 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-21 12:34:19,355 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-21 12:34:19,355 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-21 12:34:19,355 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-21 12:34:19,355 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-21 12:34:19,356 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-21 12:34:19,356 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-21 12:34:19,356 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-21 12:34:19,373 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2018-10-21 12:34:19,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-21 12:34:19,379 INFO L367 BasicCegarLoop]: Found error trace [2018-10-21 12:34:19,380 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-21 12:34:19,382 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-21 12:34:19,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-21 12:34:19,389 INFO L82 PathProgramCache]: Analyzing trace with hash -10373566, now seen corresponding path program 1 times [2018-10-21 12:34:19,391 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-21 12:34:19,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:34:19,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-21 12:34:19,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:34:19,439 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-21 12:34:19,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-21 12:34:19,496 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-21 12:34:19,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-21 12:34:19,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-21 12:34:19,499 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-21 12:34:19,504 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-21 12:34:19,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-21 12:34:19,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-21 12:34:19,523 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2018-10-21 12:34:19,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-21 12:34:19,545 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2018-10-21 12:34:19,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-21 12:34:19,547 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-10-21 12:34:19,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-21 12:34:19,556 INFO L225 Difference]: With dead ends: 29 [2018-10-21 12:34:19,556 INFO L226 Difference]: Without dead ends: 12 [2018-10-21 12:34:19,559 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-21 12:34:19,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-10-21 12:34:19,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-10-21 12:34:19,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-10-21 12:34:19,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-10-21 12:34:19,592 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-10-21 12:34:19,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-21 12:34:19,593 INFO L481 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-10-21 12:34:19,593 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-21 12:34:19,593 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-10-21 12:34:19,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-21 12:34:19,594 INFO L367 BasicCegarLoop]: Found error trace [2018-10-21 12:34:19,594 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-21 12:34:19,594 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-21 12:34:19,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-21 12:34:19,595 INFO L82 PathProgramCache]: Analyzing trace with hash -571410792, now seen corresponding path program 1 times [2018-10-21 12:34:19,595 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-21 12:34:19,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:34:19,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-21 12:34:19,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:34:19,596 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-21 12:34:19,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-21 12:34:19,746 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-21 12:34:19,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-21 12:34:19,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-21 12:34:19,747 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-21 12:34:19,749 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-21 12:34:19,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-21 12:34:19,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-21 12:34:19,750 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 3 states. [2018-10-21 12:34:19,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-21 12:34:19,805 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-10-21 12:34:19,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-21 12:34:19,807 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-10-21 12:34:19,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-21 12:34:19,808 INFO L225 Difference]: With dead ends: 19 [2018-10-21 12:34:19,808 INFO L226 Difference]: Without dead ends: 14 [2018-10-21 12:34:19,810 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-21 12:34:19,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-10-21 12:34:19,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-10-21 12:34:19,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-10-21 12:34:19,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-10-21 12:34:19,818 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2018-10-21 12:34:19,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-21 12:34:19,818 INFO L481 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-10-21 12:34:19,819 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-21 12:34:19,819 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-10-21 12:34:19,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-21 12:34:19,819 INFO L367 BasicCegarLoop]: Found error trace [2018-10-21 12:34:19,820 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-21 12:34:19,821 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-21 12:34:19,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-21 12:34:19,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1625028318, now seen corresponding path program 1 times [2018-10-21 12:34:19,822 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-21 12:34:19,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:34:19,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-21 12:34:19,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:34:19,825 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-21 12:34:19,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-21 12:34:19,937 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-21 12:34:19,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-21 12:34:19,938 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-21 12:34:19,940 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 14 with the following transitions: [2018-10-21 12:34:19,942 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [14], [20], [23], [25], [31], [32], [33], [35] [2018-10-21 12:34:19,995 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-21 12:34:19,995 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-21 12:34:20,154 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-21 12:34:20,611 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-21 12:34:20,612 INFO L272 AbstractInterpreter]: Visited 12 different actions 81 times. Merged at 3 different actions 31 times. Widened at 1 different actions 7 times. Found 1 fixpoints after 1 different actions. Largest state had 3 variables. [2018-10-21 12:34:20,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-21 12:34:20,653 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-21 12:34:20,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-21 12:34:20,653 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-21 12:34:20,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-21 12:34:20,667 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-21 12:34:20,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-21 12:34:20,693 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-21 12:34:20,726 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-21 12:34:20,726 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-21 12:34:20,839 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-21 12:34:20,870 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-21 12:34:20,870 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-21 12:34:20,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-21 12:34:20,893 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-21 12:34:20,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-21 12:34:20,917 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-21 12:34:20,936 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-21 12:34:20,936 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-21 12:34:20,955 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (3)] Exception during sending of exit command (exit): Broken pipe [2018-10-21 12:34:20,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-10-21 12:34:20,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 4, 4] total 6 [2018-10-21 12:34:20,957 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-21 12:34:20,957 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-21 12:34:20,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-21 12:34:20,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-21 12:34:20,959 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 4 states. [2018-10-21 12:34:21,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-21 12:34:21,012 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-10-21 12:34:21,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-21 12:34:21,013 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-10-21 12:34:21,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-21 12:34:21,013 INFO L225 Difference]: With dead ends: 21 [2018-10-21 12:34:21,014 INFO L226 Difference]: Without dead ends: 16 [2018-10-21 12:34:21,014 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-21 12:34:21,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-10-21 12:34:21,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-10-21 12:34:21,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-10-21 12:34:21,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-10-21 12:34:21,020 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 13 [2018-10-21 12:34:21,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-21 12:34:21,020 INFO L481 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-10-21 12:34:21,021 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-21 12:34:21,021 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-10-21 12:34:21,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-21 12:34:21,021 INFO L367 BasicCegarLoop]: Found error trace [2018-10-21 12:34:21,021 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-21 12:34:21,024 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-21 12:34:21,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-21 12:34:21,025 INFO L82 PathProgramCache]: Analyzing trace with hash -720896604, now seen corresponding path program 2 times [2018-10-21 12:34:21,025 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-21 12:34:21,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:34:21,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-21 12:34:21,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:34:21,026 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-21 12:34:21,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-21 12:34:21,218 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-21 12:34:21,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-21 12:34:21,219 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-21 12:34:21,219 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-21 12:34:21,219 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-21 12:34:21,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-21 12:34:21,220 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-21 12:34:21,230 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-21 12:34:21,230 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-10-21 12:34:21,271 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-21 12:34:21,271 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-21 12:34:21,274 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-21 12:34:21,340 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-21 12:34:21,340 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-21 12:34:21,509 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-21 12:34:21,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-21 12:34:21,529 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-21 12:34:21,548 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-21 12:34:21,548 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-10-21 12:34:21,569 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-21 12:34:21,570 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-21 12:34:21,573 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-21 12:34:21,592 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-21 12:34:21,592 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-21 12:34:21,615 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-21 12:34:21,618 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-10-21 12:34:21,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5] total 8 [2018-10-21 12:34:21,618 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-21 12:34:21,618 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-21 12:34:21,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-21 12:34:21,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-10-21 12:34:21,619 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 5 states. [2018-10-21 12:34:21,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-21 12:34:21,661 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-10-21 12:34:21,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-21 12:34:21,662 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-10-21 12:34:21,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-21 12:34:21,663 INFO L225 Difference]: With dead ends: 23 [2018-10-21 12:34:21,663 INFO L226 Difference]: Without dead ends: 18 [2018-10-21 12:34:21,663 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-10-21 12:34:21,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-10-21 12:34:21,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-10-21 12:34:21,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-10-21 12:34:21,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-10-21 12:34:21,667 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 15 [2018-10-21 12:34:21,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-21 12:34:21,668 INFO L481 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-10-21 12:34:21,668 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-21 12:34:21,668 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-10-21 12:34:21,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-21 12:34:21,669 INFO L367 BasicCegarLoop]: Found error trace [2018-10-21 12:34:21,669 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-21 12:34:21,669 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-21 12:34:21,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-21 12:34:21,669 INFO L82 PathProgramCache]: Analyzing trace with hash -296916246, now seen corresponding path program 3 times [2018-10-21 12:34:21,669 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-21 12:34:21,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:34:21,671 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-21 12:34:21,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:34:21,671 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-21 12:34:21,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-21 12:34:21,819 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-21 12:34:21,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-21 12:34:21,820 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-21 12:34:21,820 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-21 12:34:21,820 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-21 12:34:21,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-21 12:34:21,820 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-21 12:34:21,835 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-21 12:34:21,835 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-21 12:34:21,899 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-21 12:34:21,899 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-21 12:34:21,902 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-21 12:34:21,918 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-21 12:34:21,918 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-21 12:34:22,005 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-21 12:34:22,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-21 12:34:22,027 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-21 12:34:22,042 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-21 12:34:22,043 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-21 12:34:22,079 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-21 12:34:22,079 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-21 12:34:22,083 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-21 12:34:22,135 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-21 12:34:22,135 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-21 12:34:22,171 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-21 12:34:22,172 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-10-21 12:34:22,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6, 6] total 10 [2018-10-21 12:34:22,173 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-21 12:34:22,173 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-21 12:34:22,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-21 12:34:22,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-10-21 12:34:22,175 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 6 states. [2018-10-21 12:34:22,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-21 12:34:22,269 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-10-21 12:34:22,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-21 12:34:22,270 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-10-21 12:34:22,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-21 12:34:22,271 INFO L225 Difference]: With dead ends: 25 [2018-10-21 12:34:22,271 INFO L226 Difference]: Without dead ends: 20 [2018-10-21 12:34:22,272 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-10-21 12:34:22,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-10-21 12:34:22,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-10-21 12:34:22,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-21 12:34:22,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-10-21 12:34:22,277 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 17 [2018-10-21 12:34:22,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-21 12:34:22,277 INFO L481 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-10-21 12:34:22,278 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-21 12:34:22,278 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-10-21 12:34:22,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-21 12:34:22,278 INFO L367 BasicCegarLoop]: Found error trace [2018-10-21 12:34:22,279 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-21 12:34:22,279 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-21 12:34:22,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-21 12:34:22,279 INFO L82 PathProgramCache]: Analyzing trace with hash -873685328, now seen corresponding path program 4 times [2018-10-21 12:34:22,279 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-21 12:34:22,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:34:22,280 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-21 12:34:22,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:34:22,281 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-21 12:34:22,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-21 12:34:22,558 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-21 12:34:22,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-21 12:34:22,559 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-21 12:34:22,559 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-21 12:34:22,559 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-21 12:34:22,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-21 12:34:22,561 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) [2018-10-21 12:34:22,574 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-21 12:34:22,575 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-21 12:34:22,615 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-21 12:34:22,615 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-21 12:34:22,617 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-21 12:34:22,690 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-21 12:34:22,693 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-21 12:34:22,892 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-21 12:34:22,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-21 12:34:22,913 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-21 12:34:22,929 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-21 12:34:22,930 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-21 12:34:22,950 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-21 12:34:22,951 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-21 12:34:22,954 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-21 12:34:22,968 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-21 12:34:22,968 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-21 12:34:22,977 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-21 12:34:22,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-10-21 12:34:22,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 7, 7] total 12 [2018-10-21 12:34:22,979 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-21 12:34:22,979 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-21 12:34:22,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-21 12:34:22,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-10-21 12:34:22,980 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 7 states. [2018-10-21 12:34:23,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-21 12:34:23,136 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-10-21 12:34:23,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-21 12:34:23,136 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-10-21 12:34:23,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-21 12:34:23,137 INFO L225 Difference]: With dead ends: 27 [2018-10-21 12:34:23,137 INFO L226 Difference]: Without dead ends: 22 [2018-10-21 12:34:23,138 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-10-21 12:34:23,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-10-21 12:34:23,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-10-21 12:34:23,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-21 12:34:23,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-10-21 12:34:23,142 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 19 [2018-10-21 12:34:23,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-21 12:34:23,143 INFO L481 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-10-21 12:34:23,143 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-21 12:34:23,143 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-10-21 12:34:23,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-21 12:34:23,144 INFO L367 BasicCegarLoop]: Found error trace [2018-10-21 12:34:23,144 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-21 12:34:23,144 INFO L424 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-21 12:34:23,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-21 12:34:23,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1097991946, now seen corresponding path program 5 times [2018-10-21 12:34:23,145 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-21 12:34:23,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:34:23,153 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-21 12:34:23,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:34:23,153 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-21 12:34:23,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-21 12:34:23,339 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-21 12:34:23,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-21 12:34:23,340 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-21 12:34:23,340 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-21 12:34:23,341 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-21 12:34:23,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-21 12:34:23,341 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-21 12:34:23,350 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-21 12:34:23,350 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder INSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-10-21 12:34:23,372 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-10-21 12:34:23,373 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-21 12:34:23,375 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-21 12:34:23,398 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-21 12:34:23,398 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-21 12:34:23,533 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-21 12:34:23,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-21 12:34:23,562 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-21 12:34:23,579 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-21 12:34:23,579 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder INSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-10-21 12:34:23,623 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-10-21 12:34:23,623 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-21 12:34:23,627 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-21 12:34:23,655 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-21 12:34:23,655 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-21 12:34:23,667 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-21 12:34:23,672 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-10-21 12:34:23,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 8] total 14 [2018-10-21 12:34:23,672 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-21 12:34:23,672 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-21 12:34:23,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-21 12:34:23,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-10-21 12:34:23,673 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 8 states. [2018-10-21 12:34:23,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-21 12:34:23,754 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-10-21 12:34:23,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-21 12:34:23,757 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-10-21 12:34:23,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-21 12:34:23,758 INFO L225 Difference]: With dead ends: 29 [2018-10-21 12:34:23,758 INFO L226 Difference]: Without dead ends: 24 [2018-10-21 12:34:23,759 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 76 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-10-21 12:34:23,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-10-21 12:34:23,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-10-21 12:34:23,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-21 12:34:23,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-10-21 12:34:23,763 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 21 [2018-10-21 12:34:23,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-21 12:34:23,763 INFO L481 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-10-21 12:34:23,763 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-21 12:34:23,764 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-10-21 12:34:23,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-21 12:34:23,764 INFO L367 BasicCegarLoop]: Found error trace [2018-10-21 12:34:23,764 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-21 12:34:23,765 INFO L424 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-21 12:34:23,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-21 12:34:23,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1908287044, now seen corresponding path program 6 times [2018-10-21 12:34:23,765 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-21 12:34:23,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:34:23,766 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-21 12:34:23,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:34:23,766 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-21 12:34:23,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-21 12:34:26,023 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* 178956971 c_main_~y~0) 89478484))) (<= .cse0 (* 268435456 (div .cse0 268435456)))) is different from false [2018-10-21 12:34:53,995 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 9 [2018-10-21 12:34:54,419 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 20 refuted. 10 times theorem prover too weak. 0 trivial. 12 not checked. [2018-10-21 12:34:54,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-21 12:34:54,419 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-21 12:34:54,419 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-21 12:34:54,419 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-21 12:34:54,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-21 12:34:54,420 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-21 12:34:54,428 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-21 12:34:54,429 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder MIX_INSIDE_OUTSIDE (IT: FPandBP) [2018-10-21 12:34:54,468 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-21 12:34:54,468 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-21 12:34:54,470 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-21 12:35:05,750 WARN L179 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 19 [2018-10-21 12:35:06,128 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-21 12:35:06,129 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-21 12:36:06,962 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 40 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-21 12:36:06,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-21 12:36:06,983 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-21 12:36:06,998 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-21 12:36:06,998 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder MIX_INSIDE_OUTSIDE (IT: FPandBP) [2018-10-21 12:36:07,074 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-21 12:36:07,074 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-21 12:36:07,078 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-21 12:36:13,741 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-21 12:36:13,741 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-21 12:36:15,427 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 40 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-21 12:36:15,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-10-21 12:36:15,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11, 11, 11] total 26 [2018-10-21 12:36:15,429 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-21 12:36:15,429 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-21 12:36:15,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-21 12:36:15,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=450, Unknown=36, NotChecked=46, Total=650 [2018-10-21 12:36:15,431 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 19 states. [2018-10-21 12:36:16,065 WARN L179 SmtUtils]: Spent 286.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-10-21 12:36:16,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-21 12:36:16,087 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-10-21 12:36:16,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-21 12:36:16,087 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 23 [2018-10-21 12:36:16,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-21 12:36:16,088 INFO L225 Difference]: With dead ends: 31 [2018-10-21 12:36:16,088 INFO L226 Difference]: Without dead ends: 26 [2018-10-21 12:36:16,089 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 71 SyntacticMatches, 7 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 111.6s TimeCoverageRelationStatistics Valid=124, Invalid=494, Unknown=36, NotChecked=48, Total=702 [2018-10-21 12:36:16,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-10-21 12:36:16,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-10-21 12:36:16,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-21 12:36:16,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-10-21 12:36:16,094 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 23 [2018-10-21 12:36:16,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-21 12:36:16,095 INFO L481 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-10-21 12:36:16,095 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-21 12:36:16,095 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-10-21 12:36:16,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-21 12:36:16,096 INFO L367 BasicCegarLoop]: Found error trace [2018-10-21 12:36:16,096 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-21 12:36:16,096 INFO L424 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-21 12:36:16,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-21 12:36:16,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1082171650, now seen corresponding path program 7 times [2018-10-21 12:36:16,096 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-21 12:36:16,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:36:16,097 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-21 12:36:16,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:36:16,098 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-21 12:36:16,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-21 12:36:16,507 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 14 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-21 12:36:16,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-21 12:36:16,507 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-21 12:36:16,508 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-21 12:36:16,508 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-21 12:36:16,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-21 12:36:16,508 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 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-21 12:36:16,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-21 12:36:16,520 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-21 12:36:16,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-21 12:36:16,533 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-21 12:36:16,565 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 14 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-21 12:36:16,565 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-21 12:36:16,710 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 14 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-21 12:36:16,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-21 12:36:16,730 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 15 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 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-10-21 12:36:16,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-21 12:36:16,747 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-21 12:36:16,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-21 12:36:16,778 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-21 12:36:16,797 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 14 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-21 12:36:16,797 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-21 12:36:16,852 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 14 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-21 12:36:16,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-10-21 12:36:16,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 9, 9] total 16 [2018-10-21 12:36:16,857 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-21 12:36:16,858 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-21 12:36:16,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-21 12:36:16,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2018-10-21 12:36:16,858 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 9 states. [2018-10-21 12:36:16,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-21 12:36:16,950 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-10-21 12:36:16,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-21 12:36:16,953 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2018-10-21 12:36:16,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-21 12:36:16,954 INFO L225 Difference]: With dead ends: 26 [2018-10-21 12:36:16,954 INFO L226 Difference]: Without dead ends: 0 [2018-10-21 12:36:16,955 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 91 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2018-10-21 12:36:16,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-21 12:36:16,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-21 12:36:16,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-21 12:36:16,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-21 12:36:16,955 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2018-10-21 12:36:16,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-21 12:36:16,956 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-21 12:36:16,958 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-21 12:36:16,958 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-21 12:36:16,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-21 12:36:16,962 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-21 12:36:17,076 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-10-21 12:36:17,076 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-21 12:36:17,076 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-21 12:36:17,076 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-10-21 12:36:17,076 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-21 12:36:17,076 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-21 12:36:17,076 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 8 16) the Hoare annotation is: true [2018-10-21 12:36:17,077 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 8 16) no Hoare annotation was computed. [2018-10-21 12:36:17,077 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 8 16) no Hoare annotation was computed. [2018-10-21 12:36:17,077 INFO L425 ceAbstractionStarter]: For program point L11-1(lines 11 14) no Hoare annotation was computed. [2018-10-21 12:36:17,077 INFO L421 ceAbstractionStarter]: At program point L11-3(lines 11 14) the Hoare annotation is: (or (and (exists ((v_main_~y~0_46 Int)) (and (= (* 4 v_main_~y~0_46) main_~y~0) (<= 1 v_main_~y~0_46) (<= v_main_~y~0_46 1))) (<= 2 main_~x~0) (<= main_~x~0 2)) (and (<= 5 main_~x~0) (exists ((v_main_~y~0_46 Int)) (and (<= 1 v_main_~y~0_46) (= main_~y~0 (* 32 v_main_~y~0_46)) (<= v_main_~y~0_46 1))) (<= main_~x~0 5)) (and (<= 1 main_~y~0) (<= main_~x~0 0) (<= main_~y~0 1) (<= 0 main_~x~0)) (and (<= main_~x~0 6) (exists ((v_main_~y~0_46 Int)) (and (<= 1 v_main_~y~0_46) (= main_~y~0 (* 64 v_main_~y~0_46)) (<= v_main_~y~0_46 1))) (<= 6 main_~x~0)) (and (<= main_~x~0 3) (exists ((v_main_~y~0_46 Int)) (and (<= 1 v_main_~y~0_46) (= main_~y~0 (* 8 v_main_~y~0_46)) (<= v_main_~y~0_46 1))) (<= 3 main_~x~0)) (and (<= 4 main_~x~0) (exists ((v_main_~y~0_46 Int)) (and (= main_~y~0 (* 16 v_main_~y~0_46)) (<= 1 v_main_~y~0_46) (<= v_main_~y~0_46 1))) (<= main_~x~0 4)) (and (exists ((v_main_~y~0_46 Int)) (and (<= 1 v_main_~y~0_46) (= (* 2 v_main_~y~0_46) main_~y~0) (<= v_main_~y~0_46 1))) (<= main_~x~0 1) (<= 1 main_~x~0))) [2018-10-21 12:36:17,077 INFO L421 ceAbstractionStarter]: At program point L11-4(lines 11 14) the Hoare annotation is: (exists ((v_main_~y~0_46 Int)) (and (<= 1 v_main_~y~0_46) (= main_~y~0 (* 64 v_main_~y~0_46)) (<= v_main_~y~0_46 1))) [2018-10-21 12:36:17,077 INFO L425 ceAbstractionStarter]: For program point L3-2(lines 2 7) no Hoare annotation was computed. [2018-10-21 12:36:17,077 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 2 7) the Hoare annotation is: true [2018-10-21 12:36:17,077 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 2 7) no Hoare annotation was computed. [2018-10-21 12:36:17,078 INFO L425 ceAbstractionStarter]: For program point L4(line 4) no Hoare annotation was computed. [2018-10-21 12:36:17,078 INFO L425 ceAbstractionStarter]: For program point L3(lines 3 5) no Hoare annotation was computed. [2018-10-21 12:36:17,078 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2018-10-21 12:36:17,084 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] [2018-10-21 12:36:17,085 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] [2018-10-21 12:36:17,085 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] [2018-10-21 12:36:17,085 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] [2018-10-21 12:36:17,086 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] [2018-10-21 12:36:17,086 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] [2018-10-21 12:36:17,086 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] [2018-10-21 12:36:17,086 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] [2018-10-21 12:36:17,086 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] [2018-10-21 12:36:17,087 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] [2018-10-21 12:36:17,089 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] [2018-10-21 12:36:17,089 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] [2018-10-21 12:36:17,089 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] [2018-10-21 12:36:17,090 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] [2018-10-21 12:36:17,090 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] [2018-10-21 12:36:17,090 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] [2018-10-21 12:36:17,090 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] [2018-10-21 12:36:17,090 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] [2018-10-21 12:36:17,101 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] [2018-10-21 12:36:17,102 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] [2018-10-21 12:36:17,102 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] [2018-10-21 12:36:17,102 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] [2018-10-21 12:36:17,103 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] [2018-10-21 12:36:17,103 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] [2018-10-21 12:36:17,103 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] [2018-10-21 12:36:17,103 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] [2018-10-21 12:36:17,103 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] [2018-10-21 12:36:17,104 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] [2018-10-21 12:36:17,106 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] [2018-10-21 12:36:17,106 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] [2018-10-21 12:36:17,106 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] [2018-10-21 12:36:17,107 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] [2018-10-21 12:36:17,107 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] [2018-10-21 12:36:17,107 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] [2018-10-21 12:36:17,107 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] [2018-10-21 12:36:17,107 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] [2018-10-21 12:36:17,112 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.10 12:36:17 BoogieIcfgContainer [2018-10-21 12:36:17,112 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-21 12:36:17,112 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-21 12:36:17,112 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-21 12:36:17,113 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-21 12:36:17,114 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 12:34:19" (3/4) ... [2018-10-21 12:36:17,118 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-10-21 12:36:17,125 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-10-21 12:36:17,125 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-10-21 12:36:17,125 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-10-21 12:36:17,130 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2018-10-21 12:36:17,130 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-10-21 12:36:17,130 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-10-21 12:36:17,160 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((\exists v_main_~y~0_46 : int :: (4 * v_main_~y~0_46 == y && 1 <= v_main_~y~0_46) && v_main_~y~0_46 <= 1) && 2 <= x) && x <= 2) || ((5 <= x && (\exists v_main_~y~0_46 : int :: (1 <= v_main_~y~0_46 && y == 32 * v_main_~y~0_46) && v_main_~y~0_46 <= 1)) && x <= 5)) || (((1 <= y && x <= 0) && y <= 1) && 0 <= x)) || ((x <= 6 && (\exists v_main_~y~0_46 : int :: (1 <= v_main_~y~0_46 && y == 64 * v_main_~y~0_46) && v_main_~y~0_46 <= 1)) && 6 <= x)) || ((x <= 3 && (\exists v_main_~y~0_46 : int :: (1 <= v_main_~y~0_46 && y == 8 * v_main_~y~0_46) && v_main_~y~0_46 <= 1)) && 3 <= x)) || ((4 <= x && (\exists v_main_~y~0_46 : int :: (y == 16 * v_main_~y~0_46 && 1 <= v_main_~y~0_46) && v_main_~y~0_46 <= 1)) && x <= 4)) || (((\exists v_main_~y~0_46 : int :: (1 <= v_main_~y~0_46 && 2 * v_main_~y~0_46 == y) && v_main_~y~0_46 <= 1) && x <= 1) && 1 <= x) [2018-10-21 12:36:17,174 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/witness.graphml [2018-10-21 12:36:17,175 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-21 12:36:17,175 INFO L168 Benchmark]: Toolchain (without parser) took 118517.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 216.5 MB). Free memory was 953.2 MB in the beginning and 1.0 GB in the end (delta: -78.3 MB). Peak memory consumption was 138.2 MB. Max. memory is 11.5 GB. [2018-10-21 12:36:17,177 INFO L168 Benchmark]: CDTParser took 0.19 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-21 12:36:17,178 INFO L168 Benchmark]: CACSL2BoogieTranslator took 232.88 ms. Allocated memory is still 1.0 GB. Free memory was 953.2 MB in the beginning and 942.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-10-21 12:36:17,178 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.45 ms. Allocated memory is still 1.0 GB. Free memory is still 942.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-21 12:36:17,180 INFO L168 Benchmark]: Boogie Preprocessor took 22.84 ms. Allocated memory is still 1.0 GB. Free memory is still 942.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-21 12:36:17,180 INFO L168 Benchmark]: RCFGBuilder took 353.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.0 MB). Free memory was 942.5 MB in the beginning and 1.1 GB in the end (delta: -202.8 MB). Peak memory consumption was 26.5 MB. Max. memory is 11.5 GB. [2018-10-21 12:36:17,181 INFO L168 Benchmark]: TraceAbstraction took 117820.23 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 55.6 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 113.7 MB). Peak memory consumption was 169.3 MB. Max. memory is 11.5 GB. [2018-10-21 12:36:17,183 INFO L168 Benchmark]: Witness Printer took 62.31 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-21 12:36:17,188 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.19 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 232.88 ms. Allocated memory is still 1.0 GB. Free memory was 953.2 MB in the beginning and 942.5 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 21.45 ms. Allocated memory is still 1.0 GB. Free memory is still 942.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.84 ms. Allocated memory is still 1.0 GB. Free memory is still 942.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 353.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.0 MB). Free memory was 942.5 MB in the beginning and 1.1 GB in the end (delta: -202.8 MB). Peak memory consumption was 26.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 117820.23 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 55.6 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 113.7 MB). Peak memory consumption was 169.3 MB. Max. memory is 11.5 GB. * Witness Printer took 62.31 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4]: 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: 11]: Loop Invariant [2018-10-21 12:36:17,203 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] [2018-10-21 12:36:17,203 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] [2018-10-21 12:36:17,203 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] [2018-10-21 12:36:17,203 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] [2018-10-21 12:36:17,204 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] [2018-10-21 12:36:17,204 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] [2018-10-21 12:36:17,204 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] [2018-10-21 12:36:17,204 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] [2018-10-21 12:36:17,204 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] [2018-10-21 12:36:17,204 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] [2018-10-21 12:36:17,205 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] [2018-10-21 12:36:17,208 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] [2018-10-21 12:36:17,208 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] [2018-10-21 12:36:17,208 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] [2018-10-21 12:36:17,208 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] [2018-10-21 12:36:17,208 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] [2018-10-21 12:36:17,209 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] [2018-10-21 12:36:17,209 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] [2018-10-21 12:36:17,210 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] [2018-10-21 12:36:17,213 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] [2018-10-21 12:36:17,213 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] [2018-10-21 12:36:17,213 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] [2018-10-21 12:36:17,213 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] [2018-10-21 12:36:17,213 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] [2018-10-21 12:36:17,214 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] [2018-10-21 12:36:17,214 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] [2018-10-21 12:36:17,214 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] [2018-10-21 12:36:17,214 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] [2018-10-21 12:36:17,214 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] [2018-10-21 12:36:17,214 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] [2018-10-21 12:36:17,215 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] [2018-10-21 12:36:17,215 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] [2018-10-21 12:36:17,215 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] [2018-10-21 12:36:17,215 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] [2018-10-21 12:36:17,215 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] [2018-10-21 12:36:17,215 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_46,QUANTIFIED] Derived loop invariant: ((((((((\exists v_main_~y~0_46 : int :: (4 * v_main_~y~0_46 == y && 1 <= v_main_~y~0_46) && v_main_~y~0_46 <= 1) && 2 <= x) && x <= 2) || ((5 <= x && (\exists v_main_~y~0_46 : int :: (1 <= v_main_~y~0_46 && y == 32 * v_main_~y~0_46) && v_main_~y~0_46 <= 1)) && x <= 5)) || (((1 <= y && x <= 0) && y <= 1) && 0 <= x)) || ((x <= 6 && (\exists v_main_~y~0_46 : int :: (1 <= v_main_~y~0_46 && y == 64 * v_main_~y~0_46) && v_main_~y~0_46 <= 1)) && 6 <= x)) || ((x <= 3 && (\exists v_main_~y~0_46 : int :: (1 <= v_main_~y~0_46 && y == 8 * v_main_~y~0_46) && v_main_~y~0_46 <= 1)) && 3 <= x)) || ((4 <= x && (\exists v_main_~y~0_46 : int :: (y == 16 * v_main_~y~0_46 && 1 <= v_main_~y~0_46) && v_main_~y~0_46 <= 1)) && x <= 4)) || (((\exists v_main_~y~0_46 : int :: (1 <= v_main_~y~0_46 && 2 * v_main_~y~0_46 == y) && v_main_~y~0_46 <= 1) && x <= 1) && 1 <= x) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 18 locations, 1 error locations. SAFE Result, 117.7s OverallTime, 9 OverallIterations, 8 TraceHistogramMax, 1.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 127 SDtfs, 2 SDslu, 518 SDs, 0 SdLazy, 304 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 575 GetRequests, 476 SyntacticMatches, 19 SemanticMatches, 80 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 113.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.7s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 15 PreInvPairs, 23 NumberOfFragments, 152 HoareAnnotationTreeSize, 15 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 114.2s InterpolantComputationTime, 420 NumberOfCodeBlocks, 420 NumberOfCodeBlocksAsserted, 55 NumberOfCheckSat, 649 ConstructedInterpolants, 30 QuantifiedInterpolants, 64069 SizeOfPredicates, 14 NumberOfNonLiveVariables, 686 ConjunctsInSsa, 160 ConjunctsInUnsatCore, 37 InterpolantComputations, 2 PerfectInterpolantSequences, 70/840 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...