./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/loop-acceleration/underapprox_true-unreach-call1_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/loop-acceleration/underapprox_true-unreach-call1_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 Automizer --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.24-0ed9222-m [2019-01-12 11:11:08,067 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 11:11:08,068 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 11:11:08,080 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 11:11:08,080 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 11:11:08,082 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 11:11:08,086 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 11:11:08,088 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 11:11:08,090 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 11:11:08,092 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 11:11:08,092 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 11:11:08,093 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 11:11:08,094 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 11:11:08,095 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 11:11:08,096 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 11:11:08,096 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 11:11:08,097 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 11:11:08,099 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 11:11:08,101 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 11:11:08,103 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 11:11:08,104 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 11:11:08,105 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 11:11:08,108 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 11:11:08,108 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 11:11:08,108 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 11:11:08,109 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 11:11:08,110 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 11:11:08,111 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 11:11:08,112 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 11:11:08,113 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 11:11:08,113 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 11:11:08,114 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 11:11:08,114 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 11:11:08,114 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 11:11:08,116 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 11:11:08,116 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 11:11:08,117 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 11:11:08,131 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 11:11:08,132 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 11:11:08,133 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 11:11:08,133 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 11:11:08,133 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 11:11:08,134 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 11:11:08,134 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 11:11:08,134 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 11:11:08,134 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 11:11:08,134 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 11:11:08,134 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 11:11:08,135 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 11:11:08,136 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 11:11:08,136 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 11:11:08,136 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 11:11:08,136 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 11:11:08,137 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 11:11:08,137 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 11:11:08,137 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 11:11:08,137 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 11:11:08,137 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 11:11:08,137 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 11:11:08,139 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 11:11:08,139 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 11:11:08,139 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 11:11:08,139 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 11:11:08,139 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 11:11:08,140 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 11:11:08,140 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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/UAutomizer-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 -> Automizer 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 [2019-01-12 11:11:08,175 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 11:11:08,188 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 11:11:08,191 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 11:11:08,193 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 11:11:08,194 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 11:11:08,194 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/loop-acceleration/underapprox_true-unreach-call1_true-termination.i [2019-01-12 11:11:08,251 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c95a3e78a/0df18b3b3f3442c3ab6a3cebb8cd3425/FLAGe88c8820f [2019-01-12 11:11:08,652 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 11:11:08,653 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/loop-acceleration/underapprox_true-unreach-call1_true-termination.i [2019-01-12 11:11:08,658 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c95a3e78a/0df18b3b3f3442c3ab6a3cebb8cd3425/FLAGe88c8820f [2019-01-12 11:11:09,039 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c95a3e78a/0df18b3b3f3442c3ab6a3cebb8cd3425 [2019-01-12 11:11:09,043 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 11:11:09,045 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 11:11:09,046 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 11:11:09,047 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 11:11:09,051 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 11:11:09,051 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 11:11:09" (1/1) ... [2019-01-12 11:11:09,055 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d04184c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:11:09, skipping insertion in model container [2019-01-12 11:11:09,055 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 11:11:09" (1/1) ... [2019-01-12 11:11:09,065 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 11:11:09,083 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 11:11:09,313 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 11:11:09,317 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 11:11:09,333 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 11:11:09,348 INFO L195 MainTranslator]: Completed translation [2019-01-12 11:11:09,348 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:11:09 WrapperNode [2019-01-12 11:11:09,349 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 11:11:09,350 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 11:11:09,350 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 11:11:09,350 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 11:11:09,359 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:11:09" (1/1) ... [2019-01-12 11:11:09,365 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:11:09" (1/1) ... [2019-01-12 11:11:09,384 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 11:11:09,385 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 11:11:09,385 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 11:11:09,385 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 11:11:09,394 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:11:09" (1/1) ... [2019-01-12 11:11:09,395 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:11:09" (1/1) ... [2019-01-12 11:11:09,395 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:11:09" (1/1) ... [2019-01-12 11:11:09,396 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:11:09" (1/1) ... [2019-01-12 11:11:09,398 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:11:09" (1/1) ... [2019-01-12 11:11:09,405 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:11:09" (1/1) ... [2019-01-12 11:11:09,406 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:11:09" (1/1) ... [2019-01-12 11:11:09,408 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 11:11:09,412 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 11:11:09,412 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 11:11:09,412 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 11:11:09,414 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:11:09" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 11:11:09,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 11:11:09,539 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 11:11:09,830 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 11:11:09,831 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-12 11:11:09,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 11:11:09 BoogieIcfgContainer [2019-01-12 11:11:09,832 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 11:11:09,835 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 11:11:09,835 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 11:11:09,838 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 11:11:09,839 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 11:11:09" (1/3) ... [2019-01-12 11:11:09,840 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f40124 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 11:11:09, skipping insertion in model container [2019-01-12 11:11:09,840 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:11:09" (2/3) ... [2019-01-12 11:11:09,841 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f40124 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 11:11:09, skipping insertion in model container [2019-01-12 11:11:09,842 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 11:11:09" (3/3) ... [2019-01-12 11:11:09,843 INFO L112 eAbstractionObserver]: Analyzing ICFG underapprox_true-unreach-call1_true-termination.i [2019-01-12 11:11:09,854 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 11:11:09,862 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 11:11:09,878 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 11:11:09,907 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 11:11:09,907 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 11:11:09,908 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 11:11:09,908 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 11:11:09,908 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 11:11:09,908 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 11:11:09,908 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 11:11:09,908 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 11:11:09,908 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 11:11:09,923 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2019-01-12 11:11:09,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-12 11:11:09,929 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:11:09,930 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-12 11:11:09,932 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:11:09,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:11:09,938 INFO L82 PathProgramCache]: Analyzing trace with hash 29805000, now seen corresponding path program 1 times [2019-01-12 11:11:09,940 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:11:09,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:11:09,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:11:09,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:11:09,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:11:10,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:11:10,254 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 5 [2019-01-12 11:11:10,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:11:10,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:11:10,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 11:11:10,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 11:11:10,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 11:11:10,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 11:11:10,276 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2019-01-12 11:11:10,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:11:10,312 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2019-01-12 11:11:10,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 11:11:10,314 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-01-12 11:11:10,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:11:10,324 INFO L225 Difference]: With dead ends: 17 [2019-01-12 11:11:10,324 INFO L226 Difference]: Without dead ends: 7 [2019-01-12 11:11:10,328 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 11:11:10,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-01-12 11:11:10,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-01-12 11:11:10,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-12 11:11:10,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-01-12 11:11:10,361 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-01-12 11:11:10,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:11:10,361 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-01-12 11:11:10,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 11:11:10,362 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-01-12 11:11:10,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-12 11:11:10,362 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:11:10,363 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-12 11:11:10,363 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:11:10,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:11:10,363 INFO L82 PathProgramCache]: Analyzing trace with hash 925620370, now seen corresponding path program 1 times [2019-01-12 11:11:10,364 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:11:10,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:11:10,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:11:10,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:11:10,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:11:10,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:11:10,514 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:11:10,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:11:10,515 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:11:10,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:11:10,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:11:10,556 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:11:10,618 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:11:10,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:11:10,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 4 [2019-01-12 11:11:10,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 11:11:10,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 11:11:10,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 11:11:10,647 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 5 states. [2019-01-12 11:11:10,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:11:10,695 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-01-12 11:11:10,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 11:11:10,696 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-01-12 11:11:10,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:11:10,697 INFO L225 Difference]: With dead ends: 12 [2019-01-12 11:11:10,697 INFO L226 Difference]: Without dead ends: 8 [2019-01-12 11:11:10,699 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 11:11:10,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-01-12 11:11:10,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-01-12 11:11:10,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-12 11:11:10,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-01-12 11:11:10,702 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-01-12 11:11:10,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:11:10,702 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-01-12 11:11:10,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 11:11:10,702 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-01-12 11:11:10,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-12 11:11:10,703 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:11:10,703 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-01-12 11:11:10,703 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:11:10,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:11:10,703 INFO L82 PathProgramCache]: Analyzing trace with hash -1368874232, now seen corresponding path program 2 times [2019-01-12 11:11:10,704 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:11:10,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:11:10,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:11:10,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:11:10,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:11:10,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:11:10,897 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:11:10,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:11:10,898 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:11:10,910 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 11:11:10,937 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 11:11:10,938 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:11:10,941 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:11:10,998 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:11:11,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:11:11,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-01-12 11:11:11,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 11:11:11,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 11:11:11,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-12 11:11:11,030 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 6 states. [2019-01-12 11:11:11,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:11:11,090 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-01-12 11:11:11,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 11:11:11,090 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2019-01-12 11:11:11,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:11:11,091 INFO L225 Difference]: With dead ends: 13 [2019-01-12 11:11:11,091 INFO L226 Difference]: Without dead ends: 9 [2019-01-12 11:11:11,092 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-12 11:11:11,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-01-12 11:11:11,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-01-12 11:11:11,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-12 11:11:11,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-01-12 11:11:11,095 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-01-12 11:11:11,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:11:11,095 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-01-12 11:11:11,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 11:11:11,096 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-01-12 11:11:11,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-12 11:11:11,096 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:11:11,096 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1] [2019-01-12 11:11:11,096 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:11:11,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:11:11,097 INFO L82 PathProgramCache]: Analyzing trace with hash 516237138, now seen corresponding path program 3 times [2019-01-12 11:11:11,097 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:11:11,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:11:11,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:11:11,098 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:11:11,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:11:11,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:11:11,488 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:11:11,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:11:11,489 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:11:11,499 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 11:11:11,530 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-12 11:11:11,530 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:11:11,532 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:11:11,586 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:11:11,605 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:11:11,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-01-12 11:11:11,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 11:11:11,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 11:11:11,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-12 11:11:11,606 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 7 states. [2019-01-12 11:11:11,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:11:11,744 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-01-12 11:11:11,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 11:11:11,746 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2019-01-12 11:11:11,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:11:11,746 INFO L225 Difference]: With dead ends: 14 [2019-01-12 11:11:11,747 INFO L226 Difference]: Without dead ends: 10 [2019-01-12 11:11:11,747 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-12 11:11:11,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-01-12 11:11:11,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-01-12 11:11:11,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-12 11:11:11,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-01-12 11:11:11,750 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-01-12 11:11:11,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:11:11,751 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-01-12 11:11:11,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 11:11:11,751 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-01-12 11:11:11,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-12 11:11:11,752 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:11:11,752 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1] [2019-01-12 11:11:11,752 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:11:11,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:11:11,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1174852536, now seen corresponding path program 4 times [2019-01-12 11:11:11,753 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:11:11,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:11:11,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:11:11,754 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:11:11,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:11:11,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:11:11,926 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:11:11,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:11:11,927 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:11:11,938 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 11:11:11,950 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 11:11:11,950 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:11:11,951 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:11:11,988 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:11:12,007 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:11:12,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-01-12 11:11:12,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 11:11:12,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 11:11:12,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-01-12 11:11:12,009 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 8 states. [2019-01-12 11:11:12,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:11:12,076 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-01-12 11:11:12,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 11:11:12,077 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-01-12 11:11:12,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:11:12,078 INFO L225 Difference]: With dead ends: 15 [2019-01-12 11:11:12,078 INFO L226 Difference]: Without dead ends: 11 [2019-01-12 11:11:12,078 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-01-12 11:11:12,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-01-12 11:11:12,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-01-12 11:11:12,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-12 11:11:12,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-01-12 11:11:12,083 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-01-12 11:11:12,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:11:12,083 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-01-12 11:11:12,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 11:11:12,083 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-01-12 11:11:12,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-12 11:11:12,084 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:11:12,084 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1] [2019-01-12 11:11:12,084 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:11:12,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:11:12,085 INFO L82 PathProgramCache]: Analyzing trace with hash -2059024878, now seen corresponding path program 5 times [2019-01-12 11:11:12,085 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:11:12,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:11:12,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:11:12,086 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:11:12,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:11:12,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:11:12,598 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:11:12,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:11:12,598 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:11:12,609 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-12 11:11:12,621 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-01-12 11:11:12,621 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:11:12,624 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:11:12,666 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:11:12,685 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:11:12,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-01-12 11:11:12,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 11:11:12,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 11:11:12,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-01-12 11:11:12,687 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 9 states. [2019-01-12 11:11:12,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:11:12,785 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-01-12 11:11:12,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 11:11:12,787 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 10 [2019-01-12 11:11:12,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:11:12,787 INFO L225 Difference]: With dead ends: 16 [2019-01-12 11:11:12,787 INFO L226 Difference]: Without dead ends: 12 [2019-01-12 11:11:12,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-01-12 11:11:12,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-01-12 11:11:12,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-01-12 11:11:12,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-12 11:11:12,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-01-12 11:11:12,792 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-01-12 11:11:12,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:11:12,792 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-01-12 11:11:12,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 11:11:12,792 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-01-12 11:11:12,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-12 11:11:12,793 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:11:12,793 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1] [2019-01-12 11:11:12,793 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:11:12,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:11:12,794 INFO L82 PathProgramCache]: Analyzing trace with hash 596403592, now seen corresponding path program 6 times [2019-01-12 11:11:12,794 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:11:12,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:11:12,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:11:12,795 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:11:12,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:11:12,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:11:25,721 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 18 refuted. 3 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:11:25,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:11:25,722 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:11:25,731 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-12 11:11:25,773 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-01-12 11:11:25,773 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:11:25,775 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:11:26,830 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:11:26,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:11:26,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2019-01-12 11:11:26,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-12 11:11:26,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-12 11:11:26,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=222, Unknown=5, NotChecked=0, Total=272 [2019-01-12 11:11:26,849 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 17 states. [2019-01-12 11:11:29,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:11:29,223 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2019-01-12 11:11:29,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-12 11:11:29,224 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 11 [2019-01-12 11:11:29,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:11:29,225 INFO L225 Difference]: With dead ends: 20 [2019-01-12 11:11:29,225 INFO L226 Difference]: Without dead ends: 14 [2019-01-12 11:11:29,227 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 15.9s TimeCoverageRelationStatistics Valid=56, Invalid=280, Unknown=6, NotChecked=0, Total=342 [2019-01-12 11:11:29,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-01-12 11:11:29,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-01-12 11:11:29,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-12 11:11:29,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-01-12 11:11:29,230 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2019-01-12 11:11:29,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:11:29,231 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-01-12 11:11:29,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-12 11:11:29,231 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-01-12 11:11:29,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-12 11:11:29,232 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:11:29,232 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1] [2019-01-12 11:11:29,232 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:11:29,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:11:29,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1966493384, now seen corresponding path program 7 times [2019-01-12 11:11:29,232 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:11:29,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:11:29,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:11:29,234 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:11:29,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:11:29,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:11:29,448 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 14 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-12 11:11:29,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:11:29,448 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:11:29,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:11:29,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:11:29,493 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:11:29,519 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 14 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-12 11:11:29,538 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:11:29,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-01-12 11:11:29,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-12 11:11:29,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-12 11:11:29,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-01-12 11:11:29,539 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 10 states. [2019-01-12 11:11:29,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:11:29,596 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-01-12 11:11:29,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 11:11:29,597 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 13 [2019-01-12 11:11:29,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:11:29,598 INFO L225 Difference]: With dead ends: 14 [2019-01-12 11:11:29,598 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 11:11:29,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-01-12 11:11:29,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 11:11:29,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 11:11:29,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 11:11:29,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 11:11:29,599 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2019-01-12 11:11:29,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:11:29,599 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 11:11:29,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-12 11:11:29,600 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 11:11:29,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 11:11:29,604 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 11:11:29,746 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-01-12 11:11:29,750 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 11:11:29,750 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2019-01-12 11:11:29,751 INFO L444 ceAbstractionStarter]: At program point L11-2(lines 11 14) the Hoare annotation is: (or (and (<= ULTIMATE.start_main_~x~0 3) (exists ((v_ULTIMATE.start_main_~y~0_7 Int)) (and (= (* 8 v_ULTIMATE.start_main_~y~0_7) ULTIMATE.start_main_~y~0) (<= v_ULTIMATE.start_main_~y~0_7 1) (<= 1 v_ULTIMATE.start_main_~y~0_7))) (<= 3 ULTIMATE.start_main_~x~0)) (and (<= ULTIMATE.start_main_~y~0 1) (<= ULTIMATE.start_main_~x~0 0) (<= 1 ULTIMATE.start_main_~y~0) (<= 0 ULTIMATE.start_main_~x~0)) (and (<= 1 ULTIMATE.start_main_~x~0) (exists ((v_ULTIMATE.start_main_~y~0_7 Int)) (and (= ULTIMATE.start_main_~y~0 (* 2 v_ULTIMATE.start_main_~y~0_7)) (<= v_ULTIMATE.start_main_~y~0_7 1) (<= 1 v_ULTIMATE.start_main_~y~0_7))) (<= ULTIMATE.start_main_~x~0 1)) (and (exists ((v_ULTIMATE.start_main_~y~0_7 Int)) (and (= ULTIMATE.start_main_~y~0 (* 16 v_ULTIMATE.start_main_~y~0_7)) (<= v_ULTIMATE.start_main_~y~0_7 1) (<= 1 v_ULTIMATE.start_main_~y~0_7))) (<= ULTIMATE.start_main_~x~0 4) (<= 4 ULTIMATE.start_main_~x~0)) (and (<= 6 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 6) (exists ((v_ULTIMATE.start_main_~y~0_7 Int)) (and (= ULTIMATE.start_main_~y~0 (* 64 v_ULTIMATE.start_main_~y~0_7)) (<= v_ULTIMATE.start_main_~y~0_7 1) (<= 1 v_ULTIMATE.start_main_~y~0_7)))) (and (<= ULTIMATE.start_main_~x~0 2) (<= 2 ULTIMATE.start_main_~x~0) (exists ((v_ULTIMATE.start_main_~y~0_7 Int)) (and (<= v_ULTIMATE.start_main_~y~0_7 1) (= ULTIMATE.start_main_~y~0 (* 4 v_ULTIMATE.start_main_~y~0_7)) (<= 1 v_ULTIMATE.start_main_~y~0_7)))) (and (exists ((v_ULTIMATE.start_main_~y~0_7 Int)) (and (= ULTIMATE.start_main_~y~0 (* 32 v_ULTIMATE.start_main_~y~0_7)) (<= v_ULTIMATE.start_main_~y~0_7 1) (<= 1 v_ULTIMATE.start_main_~y~0_7))) (<= 5 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 5))) [2019-01-12 11:11:29,751 INFO L448 ceAbstractionStarter]: For program point L11-3(lines 11 14) no Hoare annotation was computed. [2019-01-12 11:11:29,751 INFO L448 ceAbstractionStarter]: For program point L3(lines 3 5) no Hoare annotation was computed. [2019-01-12 11:11:29,751 INFO L451 ceAbstractionStarter]: At program point L3-2(lines 1 16) the Hoare annotation is: true [2019-01-12 11:11:29,751 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 11:11:29,752 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 11:11:29,752 INFO L448 ceAbstractionStarter]: For program point L4(line 4) no Hoare annotation was computed. [2019-01-12 11:11:29,759 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-12 11:11:29,760 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-12 11:11:29,760 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-12 11:11:29,760 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-12 11:11:29,761 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-12 11:11:29,761 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-12 11:11:29,762 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-12 11:11:29,762 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-12 11:11:29,762 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-12 11:11:29,763 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-12 11:11:29,763 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-12 11:11:29,763 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-12 11:11:29,763 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-12 11:11:29,763 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-12 11:11:29,764 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-12 11:11:29,764 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-12 11:11:29,764 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-12 11:11:29,764 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-12 11:11:29,771 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-12 11:11:29,772 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-12 11:11:29,772 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-12 11:11:29,772 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-12 11:11:29,772 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-12 11:11:29,774 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-12 11:11:29,774 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-12 11:11:29,774 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-12 11:11:29,774 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-12 11:11:29,775 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-12 11:11:29,775 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-12 11:11:29,775 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-12 11:11:29,775 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-12 11:11:29,775 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-12 11:11:29,777 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-12 11:11:29,778 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-12 11:11:29,778 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-12 11:11:29,778 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-12 11:11:29,782 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 11:11:29 BoogieIcfgContainer [2019-01-12 11:11:29,783 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 11:11:29,783 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 11:11:29,783 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 11:11:29,783 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 11:11:29,785 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 11:11:09" (3/4) ... [2019-01-12 11:11:29,789 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 11:11:29,799 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-01-12 11:11:29,800 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 11:11:29,823 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((x <= 3 && (\exists v_ULTIMATE.start_main_~y~0_7 : int :: (8 * v_ULTIMATE.start_main_~y~0_7 == y && v_ULTIMATE.start_main_~y~0_7 <= 1) && 1 <= v_ULTIMATE.start_main_~y~0_7)) && 3 <= x) || (((y <= 1 && x <= 0) && 1 <= y) && 0 <= x)) || ((1 <= x && (\exists v_ULTIMATE.start_main_~y~0_7 : int :: (y == 2 * v_ULTIMATE.start_main_~y~0_7 && v_ULTIMATE.start_main_~y~0_7 <= 1) && 1 <= v_ULTIMATE.start_main_~y~0_7)) && x <= 1)) || (((\exists v_ULTIMATE.start_main_~y~0_7 : int :: (y == 16 * v_ULTIMATE.start_main_~y~0_7 && v_ULTIMATE.start_main_~y~0_7 <= 1) && 1 <= v_ULTIMATE.start_main_~y~0_7) && x <= 4) && 4 <= x)) || ((6 <= x && x <= 6) && (\exists v_ULTIMATE.start_main_~y~0_7 : int :: (y == 64 * v_ULTIMATE.start_main_~y~0_7 && v_ULTIMATE.start_main_~y~0_7 <= 1) && 1 <= v_ULTIMATE.start_main_~y~0_7))) || ((x <= 2 && 2 <= x) && (\exists v_ULTIMATE.start_main_~y~0_7 : int :: (v_ULTIMATE.start_main_~y~0_7 <= 1 && y == 4 * v_ULTIMATE.start_main_~y~0_7) && 1 <= v_ULTIMATE.start_main_~y~0_7))) || (((\exists v_ULTIMATE.start_main_~y~0_7 : int :: (y == 32 * v_ULTIMATE.start_main_~y~0_7 && v_ULTIMATE.start_main_~y~0_7 <= 1) && 1 <= v_ULTIMATE.start_main_~y~0_7) && 5 <= x) && x <= 5) [2019-01-12 11:11:29,836 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 11:11:29,836 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 11:11:29,837 INFO L168 Benchmark]: Toolchain (without parser) took 20792.66 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.2 MB). Free memory was 951.4 MB in the beginning and 820.3 MB in the end (delta: 131.1 MB). Peak memory consumption was 244.3 MB. Max. memory is 11.5 GB. [2019-01-12 11:11:29,837 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 11:11:29,838 INFO L168 Benchmark]: CACSL2BoogieTranslator took 302.56 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-12 11:11:29,839 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.97 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 11:11:29,839 INFO L168 Benchmark]: Boogie Preprocessor took 26.96 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 11:11:29,840 INFO L168 Benchmark]: RCFGBuilder took 420.09 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.2 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -147.9 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. [2019-01-12 11:11:29,841 INFO L168 Benchmark]: TraceAbstraction took 19947.94 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 820.3 MB in the end (delta: 268.2 MB). Peak memory consumption was 268.2 MB. Max. memory is 11.5 GB. [2019-01-12 11:11:29,841 INFO L168 Benchmark]: Witness Printer took 52.85 ms. Allocated memory is still 1.1 GB. Free memory is still 820.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 11:11:29,846 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 302.56 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 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 34.97 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.96 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 420.09 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.2 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -147.9 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 19947.94 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 820.3 MB in the end (delta: 268.2 MB). Peak memory consumption was 268.2 MB. Max. memory is 11.5 GB. * Witness Printer took 52.85 ms. Allocated memory is still 1.1 GB. Free memory is still 820.3 MB. 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_ULTIMATE.start_main_~y~0_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,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: 1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 11]: Loop Invariant [2019-01-12 11:11:29,855 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-12 11:11:29,855 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-12 11:11:29,855 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-12 11:11:29,856 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-12 11:11:29,864 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-12 11:11:29,864 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-12 11:11:29,864 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-12 11:11:29,864 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-12 11:11:29,865 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-12 11:11:29,865 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-12 11:11:29,865 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-12 11:11:29,865 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-12 11:11:29,865 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-12 11:11:29,866 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-12 11:11:29,869 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-12 11:11:29,869 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-12 11:11:29,869 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-12 11:11:29,869 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-12 11:11:29,871 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-12 11:11:29,871 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-12 11:11:29,871 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-12 11:11:29,871 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-12 11:11:29,872 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-12 11:11:29,872 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-12 11:11:29,872 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-12 11:11:29,872 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-12 11:11:29,872 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-12 11:11:29,873 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-12 11:11:29,873 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-12 11:11:29,873 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-12 11:11:29,873 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-12 11:11:29,873 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-12 11:11:29,874 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-12 11:11:29,874 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-12 11:11:29,874 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] [2019-01-12 11:11:29,874 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~y~0_7,QUANTIFIED] Derived loop invariant: (((((((x <= 3 && (\exists v_ULTIMATE.start_main_~y~0_7 : int :: (8 * v_ULTIMATE.start_main_~y~0_7 == y && v_ULTIMATE.start_main_~y~0_7 <= 1) && 1 <= v_ULTIMATE.start_main_~y~0_7)) && 3 <= x) || (((y <= 1 && x <= 0) && 1 <= y) && 0 <= x)) || ((1 <= x && (\exists v_ULTIMATE.start_main_~y~0_7 : int :: (y == 2 * v_ULTIMATE.start_main_~y~0_7 && v_ULTIMATE.start_main_~y~0_7 <= 1) && 1 <= v_ULTIMATE.start_main_~y~0_7)) && x <= 1)) || (((\exists v_ULTIMATE.start_main_~y~0_7 : int :: (y == 16 * v_ULTIMATE.start_main_~y~0_7 && v_ULTIMATE.start_main_~y~0_7 <= 1) && 1 <= v_ULTIMATE.start_main_~y~0_7) && x <= 4) && 4 <= x)) || ((6 <= x && x <= 6) && (\exists v_ULTIMATE.start_main_~y~0_7 : int :: (y == 64 * v_ULTIMATE.start_main_~y~0_7 && v_ULTIMATE.start_main_~y~0_7 <= 1) && 1 <= v_ULTIMATE.start_main_~y~0_7))) || ((x <= 2 && 2 <= x) && (\exists v_ULTIMATE.start_main_~y~0_7 : int :: (v_ULTIMATE.start_main_~y~0_7 <= 1 && y == 4 * v_ULTIMATE.start_main_~y~0_7) && 1 <= v_ULTIMATE.start_main_~y~0_7))) || (((\exists v_ULTIMATE.start_main_~y~0_7 : int :: (y == 32 * v_ULTIMATE.start_main_~y~0_7 && v_ULTIMATE.start_main_~y~0_7 <= 1) && 1 <= v_ULTIMATE.start_main_~y~0_7) && 5 <= x) && x <= 5) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 1 error locations. SAFE Result, 19.8s OverallTime, 8 OverallIterations, 8 TraceHistogramMax, 2.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 38 SDtfs, 2 SDslu, 99 SDs, 0 SdLazy, 267 SolverSat, 22 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 103 GetRequests, 45 SyntacticMatches, 7 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 17.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 10 NumberOfFragments, 135 HoareAnnotationTreeSize, 2 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 15.9s InterpolantComputationTime, 133 NumberOfCodeBlocks, 133 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 118 ConstructedInterpolants, 8 QuantifiedInterpolants, 7010 SizeOfPredicates, 8 NumberOfNonLiveVariables, 243 ConjunctsInSsa, 80 ConjunctsInUnsatCore, 15 InterpolantComputations, 1 PerfectInterpolantSequences, 30/184 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...