./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/loop-invgen/apache-escape-absolute_true-unreach-call.i.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa 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-invgen/apache-escape-absolute_true-unreach-call.i.v+cfa-reducer.c -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 e55536c26dc3d2371d51cd4bd073d4d19c2d7077 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-31 06:12:31,014 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 06:12:31,016 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 06:12:31,029 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 06:12:31,030 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 06:12:31,030 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 06:12:31,032 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 06:12:31,034 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 06:12:31,036 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 06:12:31,036 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 06:12:31,038 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 06:12:31,038 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 06:12:31,039 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 06:12:31,040 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 06:12:31,041 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 06:12:31,042 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 06:12:31,043 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 06:12:31,045 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 06:12:31,049 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 06:12:31,056 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 06:12:31,057 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 06:12:31,061 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 06:12:31,064 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 06:12:31,064 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 06:12:31,065 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 06:12:31,066 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 06:12:31,067 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 06:12:31,067 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 06:12:31,068 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 06:12:31,072 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 06:12:31,073 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 06:12:31,075 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 06:12:31,076 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 06:12:31,076 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 06:12:31,077 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 06:12:31,078 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 06:12:31,080 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 06:12:31,111 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 06:12:31,112 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 06:12:31,113 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 06:12:31,113 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 06:12:31,113 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 06:12:31,113 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 06:12:31,115 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 06:12:31,115 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 06:12:31,115 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 06:12:31,115 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 06:12:31,116 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 06:12:31,116 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 06:12:31,116 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 06:12:31,116 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 06:12:31,116 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 06:12:31,116 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 06:12:31,119 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 06:12:31,119 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 06:12:31,119 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 06:12:31,120 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 06:12:31,120 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 06:12:31,120 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 06:12:31,120 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 06:12:31,121 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 06:12:31,121 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 06:12:31,122 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 06:12:31,122 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 06:12:31,122 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 06:12:31,122 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 -> e55536c26dc3d2371d51cd4bd073d4d19c2d7077 [2018-12-31 06:12:31,182 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 06:12:31,196 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 06:12:31,202 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 06:12:31,206 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 06:12:31,207 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 06:12:31,208 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/loop-invgen/apache-escape-absolute_true-unreach-call.i.v+cfa-reducer.c [2018-12-31 06:12:31,275 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c49fcf6ce/8828b72e857c46fa95283689dec4019e/FLAGf9c52fa44 [2018-12-31 06:12:31,767 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 06:12:31,768 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/loop-invgen/apache-escape-absolute_true-unreach-call.i.v+cfa-reducer.c [2018-12-31 06:12:31,776 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c49fcf6ce/8828b72e857c46fa95283689dec4019e/FLAGf9c52fa44 [2018-12-31 06:12:32,109 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c49fcf6ce/8828b72e857c46fa95283689dec4019e [2018-12-31 06:12:32,114 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 06:12:32,115 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 06:12:32,116 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 06:12:32,116 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 06:12:32,121 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 06:12:32,121 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 06:12:32" (1/1) ... [2018-12-31 06:12:32,124 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fa0a9c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:12:32, skipping insertion in model container [2018-12-31 06:12:32,125 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 06:12:32" (1/1) ... [2018-12-31 06:12:32,133 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 06:12:32,174 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 06:12:32,413 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 06:12:32,420 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 06:12:32,461 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 06:12:32,479 INFO L195 MainTranslator]: Completed translation [2018-12-31 06:12:32,479 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:12:32 WrapperNode [2018-12-31 06:12:32,480 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 06:12:32,480 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 06:12:32,481 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 06:12:32,481 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 06:12:32,491 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:12:32" (1/1) ... [2018-12-31 06:12:32,502 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:12:32" (1/1) ... [2018-12-31 06:12:32,550 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 06:12:32,550 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 06:12:32,550 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 06:12:32,550 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 06:12:32,560 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:12:32" (1/1) ... [2018-12-31 06:12:32,560 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:12:32" (1/1) ... [2018-12-31 06:12:32,563 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:12:32" (1/1) ... [2018-12-31 06:12:32,563 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:12:32" (1/1) ... [2018-12-31 06:12:32,568 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:12:32" (1/1) ... [2018-12-31 06:12:32,638 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:12:32" (1/1) ... [2018-12-31 06:12:32,640 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:12:32" (1/1) ... [2018-12-31 06:12:32,642 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 06:12:32,643 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 06:12:32,643 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 06:12:32,643 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 06:12:32,644 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:12:32" (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 [2018-12-31 06:12:32,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 06:12:32,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 06:12:33,459 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 06:12:33,459 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-12-31 06:12:33,460 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 06:12:33 BoogieIcfgContainer [2018-12-31 06:12:33,460 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 06:12:33,461 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 06:12:33,461 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 06:12:33,464 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 06:12:33,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 06:12:32" (1/3) ... [2018-12-31 06:12:33,465 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b8f59b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 06:12:33, skipping insertion in model container [2018-12-31 06:12:33,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:12:32" (2/3) ... [2018-12-31 06:12:33,466 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b8f59b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 06:12:33, skipping insertion in model container [2018-12-31 06:12:33,466 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 06:12:33" (3/3) ... [2018-12-31 06:12:33,468 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute_true-unreach-call.i.v+cfa-reducer.c [2018-12-31 06:12:33,479 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 06:12:33,487 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 18 error locations. [2018-12-31 06:12:33,505 INFO L257 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2018-12-31 06:12:33,541 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 06:12:33,542 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 06:12:33,543 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 06:12:33,543 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 06:12:33,543 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 06:12:33,543 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 06:12:33,544 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 06:12:33,544 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 06:12:33,544 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 06:12:33,564 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states. [2018-12-31 06:12:33,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-31 06:12:33,572 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 06:12:33,573 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 06:12:33,576 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 06:12:33,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 06:12:33,582 INFO L82 PathProgramCache]: Analyzing trace with hash -2034435078, now seen corresponding path program 1 times [2018-12-31 06:12:33,585 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 06:12:33,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 06:12:33,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:12:33,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 06:12:33,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:12:33,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:12:33,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 06:12:33,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 06:12:33,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 06:12:33,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 06:12:33,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 06:12:33,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 06:12:33,800 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 3 states. [2018-12-31 06:12:33,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 06:12:33,836 INFO L93 Difference]: Finished difference Result 88 states and 123 transitions. [2018-12-31 06:12:33,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 06:12:33,839 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-12-31 06:12:33,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 06:12:33,851 INFO L225 Difference]: With dead ends: 88 [2018-12-31 06:12:33,851 INFO L226 Difference]: Without dead ends: 76 [2018-12-31 06:12:33,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 06:12:33,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-31 06:12:33,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-12-31 06:12:33,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-31 06:12:33,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2018-12-31 06:12:33,897 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 15 [2018-12-31 06:12:33,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 06:12:33,898 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2018-12-31 06:12:33,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 06:12:33,898 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2018-12-31 06:12:33,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-31 06:12:33,899 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 06:12:33,899 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 06:12:33,900 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 06:12:33,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 06:12:33,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1357026114, now seen corresponding path program 1 times [2018-12-31 06:12:33,900 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 06:12:33,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 06:12:33,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:12:33,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 06:12:33,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:12:33,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:12:34,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 06:12:34,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 06:12:34,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 06:12:34,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 06:12:34,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 06:12:34,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-31 06:12:34,110 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand 6 states. [2018-12-31 06:12:34,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 06:12:34,328 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2018-12-31 06:12:34,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 06:12:34,329 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-12-31 06:12:34,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 06:12:34,331 INFO L225 Difference]: With dead ends: 76 [2018-12-31 06:12:34,331 INFO L226 Difference]: Without dead ends: 74 [2018-12-31 06:12:34,332 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-31 06:12:34,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-12-31 06:12:34,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-12-31 06:12:34,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-31 06:12:34,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2018-12-31 06:12:34,341 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 16 [2018-12-31 06:12:34,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 06:12:34,342 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2018-12-31 06:12:34,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 06:12:34,342 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2018-12-31 06:12:34,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-31 06:12:34,343 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 06:12:34,343 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 06:12:34,344 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 06:12:34,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 06:12:34,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1567835227, now seen corresponding path program 1 times [2018-12-31 06:12:34,344 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 06:12:34,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 06:12:34,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:12:34,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 06:12:34,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:12:34,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:12:34,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 06:12:34,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 06:12:34,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 06:12:34,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 06:12:34,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 06:12:34,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-31 06:12:34,542 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand 5 states. [2018-12-31 06:12:34,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 06:12:34,788 INFO L93 Difference]: Finished difference Result 112 states and 117 transitions. [2018-12-31 06:12:34,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 06:12:34,789 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-12-31 06:12:34,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 06:12:34,791 INFO L225 Difference]: With dead ends: 112 [2018-12-31 06:12:34,792 INFO L226 Difference]: Without dead ends: 110 [2018-12-31 06:12:34,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-31 06:12:34,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-12-31 06:12:34,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 72. [2018-12-31 06:12:34,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-31 06:12:34,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 75 transitions. [2018-12-31 06:12:34,807 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 75 transitions. Word has length 18 [2018-12-31 06:12:34,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 06:12:34,808 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 75 transitions. [2018-12-31 06:12:34,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 06:12:34,808 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2018-12-31 06:12:34,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-31 06:12:34,810 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 06:12:34,810 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 06:12:34,811 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 06:12:34,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 06:12:34,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1358247672, now seen corresponding path program 1 times [2018-12-31 06:12:34,814 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 06:12:34,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 06:12:34,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:12:34,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 06:12:34,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:12:34,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:12:34,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 06:12:34,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 06:12:34,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 06:12:34,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 06:12:34,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 06:12:34,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-31 06:12:34,964 INFO L87 Difference]: Start difference. First operand 72 states and 75 transitions. Second operand 6 states. [2018-12-31 06:12:35,231 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-31 06:12:35,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 06:12:35,396 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2018-12-31 06:12:35,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 06:12:35,397 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-12-31 06:12:35,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 06:12:35,399 INFO L225 Difference]: With dead ends: 72 [2018-12-31 06:12:35,399 INFO L226 Difference]: Without dead ends: 70 [2018-12-31 06:12:35,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-12-31 06:12:35,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-12-31 06:12:35,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-12-31 06:12:35,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-12-31 06:12:35,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2018-12-31 06:12:35,407 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 19 [2018-12-31 06:12:35,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 06:12:35,407 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2018-12-31 06:12:35,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 06:12:35,407 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2018-12-31 06:12:35,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-31 06:12:35,408 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 06:12:35,408 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 06:12:35,409 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 06:12:35,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 06:12:35,410 INFO L82 PathProgramCache]: Analyzing trace with hash -665385716, now seen corresponding path program 1 times [2018-12-31 06:12:35,410 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 06:12:35,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 06:12:35,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:12:35,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 06:12:35,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:12:35,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:12:35,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 06:12:35,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 06:12:35,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 06:12:35,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 06:12:35,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 06:12:35,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 06:12:35,492 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand 5 states. [2018-12-31 06:12:35,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 06:12:35,791 INFO L93 Difference]: Finished difference Result 137 states and 143 transitions. [2018-12-31 06:12:35,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 06:12:35,792 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-12-31 06:12:35,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 06:12:35,794 INFO L225 Difference]: With dead ends: 137 [2018-12-31 06:12:35,794 INFO L226 Difference]: Without dead ends: 135 [2018-12-31 06:12:35,795 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-31 06:12:35,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-12-31 06:12:35,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 73. [2018-12-31 06:12:35,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-31 06:12:35,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2018-12-31 06:12:35,804 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 22 [2018-12-31 06:12:35,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 06:12:35,805 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2018-12-31 06:12:35,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 06:12:35,805 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2018-12-31 06:12:35,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-31 06:12:35,806 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 06:12:35,806 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 06:12:35,807 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 06:12:35,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 06:12:35,807 INFO L82 PathProgramCache]: Analyzing trace with hash -661217951, now seen corresponding path program 1 times [2018-12-31 06:12:35,807 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 06:12:35,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 06:12:35,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:12:35,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 06:12:35,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:12:35,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:12:35,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 06:12:35,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 06:12:35,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 06:12:35,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 06:12:35,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 06:12:35,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 06:12:35,900 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand 5 states. [2018-12-31 06:12:36,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 06:12:36,404 INFO L93 Difference]: Finished difference Result 104 states and 110 transitions. [2018-12-31 06:12:36,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 06:12:36,405 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-12-31 06:12:36,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 06:12:36,407 INFO L225 Difference]: With dead ends: 104 [2018-12-31 06:12:36,407 INFO L226 Difference]: Without dead ends: 102 [2018-12-31 06:12:36,408 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-31 06:12:36,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-12-31 06:12:36,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 75. [2018-12-31 06:12:36,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-31 06:12:36,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2018-12-31 06:12:36,417 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 22 [2018-12-31 06:12:36,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 06:12:36,418 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2018-12-31 06:12:36,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 06:12:36,418 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2018-12-31 06:12:36,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-31 06:12:36,419 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 06:12:36,419 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 06:12:36,420 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 06:12:36,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 06:12:36,420 INFO L82 PathProgramCache]: Analyzing trace with hash 847883539, now seen corresponding path program 1 times [2018-12-31 06:12:36,420 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 06:12:36,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 06:12:36,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:12:36,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 06:12:36,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:12:36,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:12:36,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 06:12:36,534 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 06:12:36,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 06:12:36,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 06:12:36,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 06:12:36,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 06:12:36,535 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand 5 states. [2018-12-31 06:12:36,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 06:12:36,708 INFO L93 Difference]: Finished difference Result 117 states and 123 transitions. [2018-12-31 06:12:36,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 06:12:36,709 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-12-31 06:12:36,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 06:12:36,711 INFO L225 Difference]: With dead ends: 117 [2018-12-31 06:12:36,711 INFO L226 Difference]: Without dead ends: 115 [2018-12-31 06:12:36,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-31 06:12:36,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-12-31 06:12:36,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 73. [2018-12-31 06:12:36,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-31 06:12:36,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2018-12-31 06:12:36,720 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 23 [2018-12-31 06:12:36,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 06:12:36,721 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2018-12-31 06:12:36,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 06:12:36,721 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2018-12-31 06:12:36,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-31 06:12:36,722 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 06:12:36,722 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 06:12:36,723 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 06:12:36,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 06:12:36,723 INFO L82 PathProgramCache]: Analyzing trace with hash 977084131, now seen corresponding path program 1 times [2018-12-31 06:12:36,723 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 06:12:36,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 06:12:36,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:12:36,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 06:12:36,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:12:36,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:12:36,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 06:12:36,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 06:12:36,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 06:12:36,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 06:12:36,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 06:12:36,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 06:12:36,813 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand 5 states. [2018-12-31 06:12:36,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 06:12:36,951 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2018-12-31 06:12:36,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 06:12:36,952 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-12-31 06:12:36,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 06:12:36,953 INFO L225 Difference]: With dead ends: 73 [2018-12-31 06:12:36,954 INFO L226 Difference]: Without dead ends: 71 [2018-12-31 06:12:36,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-31 06:12:36,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-12-31 06:12:36,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-12-31 06:12:36,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-12-31 06:12:36,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 76 transitions. [2018-12-31 06:12:36,962 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 76 transitions. Word has length 23 [2018-12-31 06:12:36,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 06:12:36,962 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 76 transitions. [2018-12-31 06:12:36,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 06:12:36,963 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2018-12-31 06:12:36,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-31 06:12:36,963 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 06:12:36,964 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 06:12:36,964 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 06:12:36,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 06:12:36,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1619855478, now seen corresponding path program 1 times [2018-12-31 06:12:36,965 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 06:12:36,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 06:12:36,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:12:36,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 06:12:36,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:12:36,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:12:37,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 06:12:37,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 06:12:37,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 06:12:37,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 06:12:37,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 06:12:37,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 06:12:37,054 INFO L87 Difference]: Start difference. First operand 71 states and 76 transitions. Second operand 3 states. [2018-12-31 06:12:37,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 06:12:37,198 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2018-12-31 06:12:37,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 06:12:37,200 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-31 06:12:37,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 06:12:37,201 INFO L225 Difference]: With dead ends: 111 [2018-12-31 06:12:37,201 INFO L226 Difference]: Without dead ends: 71 [2018-12-31 06:12:37,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 06:12:37,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-12-31 06:12:37,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-12-31 06:12:37,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-12-31 06:12:37,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2018-12-31 06:12:37,208 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 25 [2018-12-31 06:12:37,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 06:12:37,209 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2018-12-31 06:12:37,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 06:12:37,209 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2018-12-31 06:12:37,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-31 06:12:37,210 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 06:12:37,210 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 06:12:37,211 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 06:12:37,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 06:12:37,211 INFO L82 PathProgramCache]: Analyzing trace with hash 595608307, now seen corresponding path program 1 times [2018-12-31 06:12:37,211 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 06:12:37,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 06:12:37,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:12:37,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 06:12:37,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:12:37,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:12:37,325 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-31 06:12:37,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 06:12:37,325 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 [2018-12-31 06:12:37,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 06:12:37,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:12:37,372 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 06:12:37,497 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-31 06:12:37,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 06:12:37,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2018-12-31 06:12:37,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-31 06:12:37,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-31 06:12:37,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-12-31 06:12:37,517 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand 9 states. [2018-12-31 06:12:37,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 06:12:37,800 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2018-12-31 06:12:37,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 06:12:37,801 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-12-31 06:12:37,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 06:12:37,802 INFO L225 Difference]: With dead ends: 111 [2018-12-31 06:12:37,802 INFO L226 Difference]: Without dead ends: 109 [2018-12-31 06:12:37,802 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2018-12-31 06:12:37,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-31 06:12:37,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 68. [2018-12-31 06:12:37,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-31 06:12:37,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2018-12-31 06:12:37,810 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 26 [2018-12-31 06:12:37,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 06:12:37,811 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2018-12-31 06:12:37,811 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-31 06:12:37,811 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2018-12-31 06:12:37,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-31 06:12:37,812 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 06:12:37,812 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 06:12:37,815 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 06:12:37,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 06:12:37,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1780382557, now seen corresponding path program 1 times [2018-12-31 06:12:37,816 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 06:12:37,816 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 06:12:37,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:12:37,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 06:12:37,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:12:37,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:12:37,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 06:12:37,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 06:12:37,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 06:12:37,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 06:12:37,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 06:12:37,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-31 06:12:37,954 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand 7 states. [2018-12-31 06:12:38,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 06:12:38,157 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2018-12-31 06:12:38,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 06:12:38,159 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-12-31 06:12:38,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 06:12:38,160 INFO L225 Difference]: With dead ends: 69 [2018-12-31 06:12:38,160 INFO L226 Difference]: Without dead ends: 67 [2018-12-31 06:12:38,161 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2018-12-31 06:12:38,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-31 06:12:38,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2018-12-31 06:12:38,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-31 06:12:38,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2018-12-31 06:12:38,167 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 26 [2018-12-31 06:12:38,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 06:12:38,167 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2018-12-31 06:12:38,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 06:12:38,167 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2018-12-31 06:12:38,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-31 06:12:38,168 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 06:12:38,168 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 06:12:38,169 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 06:12:38,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 06:12:38,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1280139623, now seen corresponding path program 1 times [2018-12-31 06:12:38,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 06:12:38,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 06:12:38,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:12:38,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 06:12:38,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:12:38,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:12:38,289 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-31 06:12:38,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 06:12:38,290 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 [2018-12-31 06:12:38,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 06:12:38,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:12:38,361 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 06:12:38,488 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-31 06:12:38,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 06:12:38,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2018-12-31 06:12:38,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-31 06:12:38,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-31 06:12:38,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-12-31 06:12:38,509 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand 9 states. [2018-12-31 06:12:38,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 06:12:38,620 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2018-12-31 06:12:38,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 06:12:38,621 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2018-12-31 06:12:38,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 06:12:38,621 INFO L225 Difference]: With dead ends: 67 [2018-12-31 06:12:38,621 INFO L226 Difference]: Without dead ends: 65 [2018-12-31 06:12:38,622 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2018-12-31 06:12:38,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-31 06:12:38,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 60. [2018-12-31 06:12:38,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-31 06:12:38,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2018-12-31 06:12:38,627 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 27 [2018-12-31 06:12:38,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 06:12:38,627 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2018-12-31 06:12:38,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-31 06:12:38,627 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2018-12-31 06:12:38,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-31 06:12:38,628 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 06:12:38,628 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 06:12:38,629 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 06:12:38,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 06:12:38,629 INFO L82 PathProgramCache]: Analyzing trace with hash -642711428, now seen corresponding path program 1 times [2018-12-31 06:12:38,629 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 06:12:38,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 06:12:38,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:12:38,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 06:12:38,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:12:38,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:12:38,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 06:12:38,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 06:12:38,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 06:12:38,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 06:12:38,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 06:12:38,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-31 06:12:38,737 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 6 states. [2018-12-31 06:12:38,857 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-31 06:12:38,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 06:12:38,963 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2018-12-31 06:12:38,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 06:12:38,964 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-12-31 06:12:38,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 06:12:38,965 INFO L225 Difference]: With dead ends: 60 [2018-12-31 06:12:38,965 INFO L226 Difference]: Without dead ends: 58 [2018-12-31 06:12:38,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-12-31 06:12:38,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-31 06:12:38,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-12-31 06:12:38,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-31 06:12:38,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2018-12-31 06:12:38,971 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 27 [2018-12-31 06:12:38,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 06:12:38,971 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2018-12-31 06:12:38,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 06:12:38,971 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2018-12-31 06:12:38,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-31 06:12:38,972 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 06:12:38,972 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 06:12:38,973 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 06:12:38,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 06:12:38,973 INFO L82 PathProgramCache]: Analyzing trace with hash -47880409, now seen corresponding path program 1 times [2018-12-31 06:12:38,973 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 06:12:38,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 06:12:38,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:12:38,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 06:12:38,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:12:38,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:12:39,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 06:12:39,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 06:12:39,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 06:12:39,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 06:12:39,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 06:12:39,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-31 06:12:39,094 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 7 states. [2018-12-31 06:12:39,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 06:12:39,428 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2018-12-31 06:12:39,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 06:12:39,429 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-12-31 06:12:39,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 06:12:39,430 INFO L225 Difference]: With dead ends: 59 [2018-12-31 06:12:39,430 INFO L226 Difference]: Without dead ends: 57 [2018-12-31 06:12:39,430 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2018-12-31 06:12:39,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-31 06:12:39,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2018-12-31 06:12:39,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-31 06:12:39,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2018-12-31 06:12:39,434 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 30 [2018-12-31 06:12:39,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 06:12:39,434 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2018-12-31 06:12:39,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 06:12:39,434 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2018-12-31 06:12:39,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-31 06:12:39,435 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 06:12:39,435 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 06:12:39,436 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 06:12:39,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 06:12:39,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1484288504, now seen corresponding path program 1 times [2018-12-31 06:12:39,436 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 06:12:39,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 06:12:39,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:12:39,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 06:12:39,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:12:39,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:12:39,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 06:12:39,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 06:12:39,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 06:12:39,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 06:12:39,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 06:12:39,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-31 06:12:39,971 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 7 states. [2018-12-31 06:12:40,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 06:12:40,172 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2018-12-31 06:12:40,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 06:12:40,173 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2018-12-31 06:12:40,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 06:12:40,174 INFO L225 Difference]: With dead ends: 67 [2018-12-31 06:12:40,174 INFO L226 Difference]: Without dead ends: 65 [2018-12-31 06:12:40,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-12-31 06:12:40,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-31 06:12:40,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 54. [2018-12-31 06:12:40,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-31 06:12:40,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2018-12-31 06:12:40,179 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 31 [2018-12-31 06:12:40,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 06:12:40,179 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2018-12-31 06:12:40,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 06:12:40,179 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2018-12-31 06:12:40,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-31 06:12:40,182 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 06:12:40,183 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 06:12:40,184 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 06:12:40,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 06:12:40,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1746453711, now seen corresponding path program 1 times [2018-12-31 06:12:40,184 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 06:12:40,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 06:12:40,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:12:40,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 06:12:40,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:12:40,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:12:40,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 06:12:40,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 06:12:40,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 06:12:40,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 06:12:40,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 06:12:40,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-31 06:12:40,521 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand 6 states. [2018-12-31 06:12:40,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 06:12:40,665 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2018-12-31 06:12:40,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 06:12:40,666 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-12-31 06:12:40,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 06:12:40,666 INFO L225 Difference]: With dead ends: 87 [2018-12-31 06:12:40,667 INFO L226 Difference]: Without dead ends: 85 [2018-12-31 06:12:40,667 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-12-31 06:12:40,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-31 06:12:40,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 57. [2018-12-31 06:12:40,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-31 06:12:40,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2018-12-31 06:12:40,672 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 34 [2018-12-31 06:12:40,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 06:12:40,672 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2018-12-31 06:12:40,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 06:12:40,672 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2018-12-31 06:12:40,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-31 06:12:40,673 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 06:12:40,673 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 06:12:40,673 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 06:12:40,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 06:12:40,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1694514003, now seen corresponding path program 1 times [2018-12-31 06:12:40,674 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 06:12:40,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 06:12:40,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:12:40,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 06:12:40,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:12:40,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:12:40,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 06:12:40,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 06:12:40,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 06:12:40,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 06:12:40,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 06:12:40,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-31 06:12:40,940 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand 6 states. [2018-12-31 06:12:41,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 06:12:41,252 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2018-12-31 06:12:41,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 06:12:41,253 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-12-31 06:12:41,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 06:12:41,254 INFO L225 Difference]: With dead ends: 57 [2018-12-31 06:12:41,254 INFO L226 Difference]: Without dead ends: 55 [2018-12-31 06:12:41,255 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-12-31 06:12:41,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-31 06:12:41,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-12-31 06:12:41,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-31 06:12:41,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2018-12-31 06:12:41,260 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 35 [2018-12-31 06:12:41,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 06:12:41,260 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2018-12-31 06:12:41,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 06:12:41,260 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2018-12-31 06:12:41,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-31 06:12:41,261 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 06:12:41,261 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 06:12:41,262 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 06:12:41,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 06:12:41,262 INFO L82 PathProgramCache]: Analyzing trace with hash 635482230, now seen corresponding path program 1 times [2018-12-31 06:12:41,262 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 06:12:41,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 06:12:41,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:12:41,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 06:12:41,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:12:41,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:12:41,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 06:12:41,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 06:12:41,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 06:12:41,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 06:12:41,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 06:12:41,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 06:12:41,324 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand 5 states. [2018-12-31 06:12:41,523 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-31 06:12:41,696 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-12-31 06:12:41,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 06:12:41,756 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2018-12-31 06:12:41,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 06:12:41,757 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-12-31 06:12:41,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 06:12:41,757 INFO L225 Difference]: With dead ends: 66 [2018-12-31 06:12:41,757 INFO L226 Difference]: Without dead ends: 64 [2018-12-31 06:12:41,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-31 06:12:41,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-31 06:12:41,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 53. [2018-12-31 06:12:41,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-31 06:12:41,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2018-12-31 06:12:41,762 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 37 [2018-12-31 06:12:41,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 06:12:41,762 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2018-12-31 06:12:41,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 06:12:41,763 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2018-12-31 06:12:41,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-31 06:12:41,763 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 06:12:41,763 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 06:12:41,764 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 06:12:41,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 06:12:41,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1774883137, now seen corresponding path program 1 times [2018-12-31 06:12:41,764 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 06:12:41,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 06:12:41,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:12:41,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 06:12:41,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:12:41,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:12:41,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 06:12:41,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 06:12:41,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 06:12:41,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 06:12:41,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 06:12:41,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 06:12:41,843 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 6 states. [2018-12-31 06:12:42,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 06:12:42,073 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2018-12-31 06:12:42,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 06:12:42,074 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2018-12-31 06:12:42,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 06:12:42,075 INFO L225 Difference]: With dead ends: 62 [2018-12-31 06:12:42,075 INFO L226 Difference]: Without dead ends: 60 [2018-12-31 06:12:42,075 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-12-31 06:12:42,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-31 06:12:42,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 51. [2018-12-31 06:12:42,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-31 06:12:42,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2018-12-31 06:12:42,080 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 38 [2018-12-31 06:12:42,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 06:12:42,080 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2018-12-31 06:12:42,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 06:12:42,080 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2018-12-31 06:12:42,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-31 06:12:42,081 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 06:12:42,081 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 06:12:42,082 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 06:12:42,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 06:12:42,082 INFO L82 PathProgramCache]: Analyzing trace with hash 813201821, now seen corresponding path program 1 times [2018-12-31 06:12:42,082 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 06:12:42,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 06:12:42,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:12:42,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 06:12:42,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:12:42,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:12:42,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 06:12:42,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 06:12:42,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 06:12:42,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 06:12:42,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 06:12:42,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-31 06:12:42,493 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand 6 states. [2018-12-31 06:12:42,741 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-12-31 06:12:42,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 06:12:42,989 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2018-12-31 06:12:42,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 06:12:42,990 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2018-12-31 06:12:42,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 06:12:42,991 INFO L225 Difference]: With dead ends: 84 [2018-12-31 06:12:42,991 INFO L226 Difference]: Without dead ends: 82 [2018-12-31 06:12:42,991 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-12-31 06:12:42,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-31 06:12:42,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 56. [2018-12-31 06:12:42,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-31 06:12:42,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2018-12-31 06:12:42,997 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 39 [2018-12-31 06:12:42,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 06:12:42,997 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2018-12-31 06:12:42,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 06:12:42,997 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2018-12-31 06:12:42,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-31 06:12:42,998 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 06:12:42,998 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 06:12:42,998 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 06:12:42,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 06:12:42,998 INFO L82 PathProgramCache]: Analyzing trace with hash -560543098, now seen corresponding path program 1 times [2018-12-31 06:12:42,999 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 06:12:42,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 06:12:42,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:12:43,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 06:12:43,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:12:43,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:12:43,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 06:12:43,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 06:12:43,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 06:12:43,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 06:12:43,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 06:12:43,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-31 06:12:43,220 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand 6 states. [2018-12-31 06:12:43,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 06:12:43,387 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-12-31 06:12:43,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 06:12:43,388 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2018-12-31 06:12:43,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 06:12:43,389 INFO L225 Difference]: With dead ends: 69 [2018-12-31 06:12:43,389 INFO L226 Difference]: Without dead ends: 67 [2018-12-31 06:12:43,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-12-31 06:12:43,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-31 06:12:43,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 54. [2018-12-31 06:12:43,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-31 06:12:43,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2018-12-31 06:12:43,399 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 40 [2018-12-31 06:12:43,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 06:12:43,399 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2018-12-31 06:12:43,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 06:12:43,399 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2018-12-31 06:12:43,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-31 06:12:43,400 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 06:12:43,400 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 06:12:43,403 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 06:12:43,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 06:12:43,403 INFO L82 PathProgramCache]: Analyzing trace with hash 375780089, now seen corresponding path program 1 times [2018-12-31 06:12:43,403 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 06:12:43,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 06:12:43,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:12:43,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 06:12:43,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:12:43,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:12:43,707 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-31 06:12:43,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 06:12:43,707 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 [2018-12-31 06:12:43,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 06:12:43,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:12:43,745 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 06:12:43,798 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 06:12:43,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 06:12:43,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2018-12-31 06:12:43,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-31 06:12:43,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-31 06:12:43,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-12-31 06:12:43,817 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand 9 states. [2018-12-31 06:12:43,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 06:12:43,968 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2018-12-31 06:12:43,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 06:12:43,969 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 40 [2018-12-31 06:12:43,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 06:12:43,970 INFO L225 Difference]: With dead ends: 54 [2018-12-31 06:12:43,970 INFO L226 Difference]: Without dead ends: 52 [2018-12-31 06:12:43,970 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2018-12-31 06:12:43,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-31 06:12:43,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-12-31 06:12:43,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-31 06:12:43,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2018-12-31 06:12:43,978 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 40 [2018-12-31 06:12:43,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 06:12:43,979 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2018-12-31 06:12:43,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-31 06:12:43,979 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2018-12-31 06:12:43,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-31 06:12:43,979 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 06:12:43,979 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 06:12:43,980 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 06:12:43,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 06:12:43,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1394778411, now seen corresponding path program 1 times [2018-12-31 06:12:43,980 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 06:12:43,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 06:12:43,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:12:43,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 06:12:43,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:12:43,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:12:44,156 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-31 06:12:44,191 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-31 06:12:44,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 06:12:44,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 06:12:44,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 06:12:44,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 06:12:44,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 06:12:44,192 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 5 states. [2018-12-31 06:12:44,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 06:12:44,350 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2018-12-31 06:12:44,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 06:12:44,351 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-12-31 06:12:44,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 06:12:44,352 INFO L225 Difference]: With dead ends: 71 [2018-12-31 06:12:44,352 INFO L226 Difference]: Without dead ends: 0 [2018-12-31 06:12:44,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-31 06:12:44,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-31 06:12:44,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-31 06:12:44,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-31 06:12:44,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-31 06:12:44,354 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2018-12-31 06:12:44,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 06:12:44,354 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-31 06:12:44,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 06:12:44,354 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-31 06:12:44,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-31 06:12:44,359 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-31 06:12:44,397 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 06:12:44,471 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 06:12:45,915 WARN L181 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 45 DAG size of output: 30 [2018-12-31 06:12:46,420 WARN L181 SmtUtils]: Spent 501.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 66 [2018-12-31 06:12:46,672 WARN L181 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 27 [2018-12-31 06:12:47,159 WARN L181 SmtUtils]: Spent 485.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 72 [2018-12-31 06:12:47,163 INFO L448 ceAbstractionStarter]: For program point L250(line 250) no Hoare annotation was computed. [2018-12-31 06:12:47,163 INFO L448 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-12-31 06:12:47,163 INFO L448 ceAbstractionStarter]: For program point L118(lines 118 398) no Hoare annotation was computed. [2018-12-31 06:12:47,164 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 238) no Hoare annotation was computed. [2018-12-31 06:12:47,164 INFO L448 ceAbstractionStarter]: For program point L267(line 267) no Hoare annotation was computed. [2018-12-31 06:12:47,164 INFO L448 ceAbstractionStarter]: For program point L36(lines 36 430) no Hoare annotation was computed. [2018-12-31 06:12:47,164 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-12-31 06:12:47,164 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 152) no Hoare annotation was computed. [2018-12-31 06:12:47,164 INFO L448 ceAbstractionStarter]: For program point L152(line 152) no Hoare annotation was computed. [2018-12-31 06:12:47,164 INFO L448 ceAbstractionStarter]: For program point L367(lines 367 390) no Hoare annotation was computed. [2018-12-31 06:12:47,164 INFO L448 ceAbstractionStarter]: For program point L301(lines 301 311) no Hoare annotation was computed. [2018-12-31 06:12:47,164 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION(line 369) no Hoare annotation was computed. [2018-12-31 06:12:47,164 INFO L448 ceAbstractionStarter]: For program point L219(lines 219 339) no Hoare annotation was computed. [2018-12-31 06:12:47,165 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 209) no Hoare annotation was computed. [2018-12-31 06:12:47,165 INFO L448 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2018-12-31 06:12:47,165 INFO L448 ceAbstractionStarter]: For program point L54(lines 54 427) no Hoare annotation was computed. [2018-12-31 06:12:47,165 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 92) no Hoare annotation was computed. [2018-12-31 06:12:47,165 INFO L448 ceAbstractionStarter]: For program point L236(lines 236 326) no Hoare annotation was computed. [2018-12-31 06:12:47,165 INFO L448 ceAbstractionStarter]: For program point L170(lines 170 352) no Hoare annotation was computed. [2018-12-31 06:12:47,165 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 120) no Hoare annotation was computed. [2018-12-31 06:12:47,165 INFO L448 ceAbstractionStarter]: For program point L369(line 369) no Hoare annotation was computed. [2018-12-31 06:12:47,165 INFO L448 ceAbstractionStarter]: For program point L303(line 303) no Hoare annotation was computed. [2018-12-31 06:12:47,165 INFO L448 ceAbstractionStarter]: For program point L138(lines 138 357) no Hoare annotation was computed. [2018-12-31 06:12:47,166 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 108) no Hoare annotation was computed. [2018-12-31 06:12:47,167 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 303) no Hoare annotation was computed. [2018-12-31 06:12:47,167 INFO L448 ceAbstractionStarter]: For program point L221(line 221) no Hoare annotation was computed. [2018-12-31 06:12:47,167 INFO L448 ceAbstractionStarter]: For program point L56(lines 56 422) no Hoare annotation was computed. [2018-12-31 06:12:47,167 INFO L448 ceAbstractionStarter]: For program point L238(line 238) no Hoare annotation was computed. [2018-12-31 06:12:47,167 INFO L448 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-12-31 06:12:47,167 INFO L448 ceAbstractionStarter]: For program point L106(lines 106 400) no Hoare annotation was computed. [2018-12-31 06:12:47,167 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 291) no Hoare annotation was computed. [2018-12-31 06:12:47,168 INFO L444 ceAbstractionStarter]: At program point L387(lines 124 398) the Hoare annotation is: (and (let ((.cse0 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~1 0))) (.cse1 (< 0 ULTIMATE.start_main_~main__scheme~0)) (.cse2 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~3))) (or (and (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~2) .cse0 .cse1 .cse2) (and (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~17 0)) .cse0 .cse1 .cse2 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~16) (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~2 0))))) (<= 1 ULTIMATE.start_main_~main__cp~0) (<= (+ ULTIMATE.start_main_~main__cp~0 1) ULTIMATE.start_main_~main__urilen~0) (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~0)) [2018-12-31 06:12:47,168 INFO L448 ceAbstractionStarter]: For program point L189(lines 189 349) no Hoare annotation was computed. [2018-12-31 06:12:47,168 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION(line 381) no Hoare annotation was computed. [2018-12-31 06:12:47,168 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 184) no Hoare annotation was computed. [2018-12-31 06:12:47,168 INFO L448 ceAbstractionStarter]: For program point L90(lines 90 407) no Hoare annotation was computed. [2018-12-31 06:12:47,168 INFO L448 ceAbstractionStarter]: For program point L24(lines 24 432) no Hoare annotation was computed. [2018-12-31 06:12:47,168 INFO L448 ceAbstractionStarter]: For program point L140(line 140) no Hoare annotation was computed. [2018-12-31 06:12:47,169 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 80) no Hoare annotation was computed. [2018-12-31 06:12:47,169 INFO L444 ceAbstractionStarter]: At program point L322(lines 257 323) the Hoare annotation is: (and (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~10) (let ((.cse0 (let ((.cse1 (and (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~4) (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~8 0)) (<= 2 ULTIMATE.start_main_~main__cp~0) (and (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~5 0)) (and (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~1 0)) (< 0 ULTIMATE.start_main_~main__scheme~0) (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~2 0))) (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~3)) (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~10 0)) (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~7 0)) (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~6 0)) (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~0) (< (+ ULTIMATE.start_main_~main__cp~0 1) ULTIMATE.start_main_~main__urilen~0) (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~9 0)))) (.cse2 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~11 0)))) (or (and .cse1 (<= (+ ULTIMATE.start_main_~main__c~0 2) ULTIMATE.start_main_~main__tokenlen~0) .cse2) (and .cse1 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~12 0)) .cse2))))) (or (and (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~13 0)) .cse0 (<= 1 ULTIMATE.start_main_~main__c~0)) (and .cse0 (= ULTIMATE.start_main_~main__c~0 0))))) [2018-12-31 06:12:47,169 INFO L448 ceAbstractionStarter]: For program point L289(lines 289 313) no Hoare annotation was computed. [2018-12-31 06:12:47,169 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-31 06:12:47,169 INFO L448 ceAbstractionStarter]: For program point L157(lines 157 354) no Hoare annotation was computed. [2018-12-31 06:12:47,169 INFO L448 ceAbstractionStarter]: For program point L58(lines 58 417) no Hoare annotation was computed. [2018-12-31 06:12:47,169 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 250) no Hoare annotation was computed. [2018-12-31 06:12:47,169 INFO L444 ceAbstractionStarter]: At program point L405(lines 99 406) the Hoare annotation is: (= ULTIMATE.start_main_~__VERIFIER_assert__cond~0 1) [2018-12-31 06:12:47,169 INFO L448 ceAbstractionStarter]: For program point L207(lines 207 341) no Hoare annotation was computed. [2018-12-31 06:12:47,170 INFO L448 ceAbstractionStarter]: For program point L108(line 108) no Hoare annotation was computed. [2018-12-31 06:12:47,170 INFO L448 ceAbstractionStarter]: For program point L42(lines 42 429) no Hoare annotation was computed. [2018-12-31 06:12:47,170 INFO L448 ceAbstractionStarter]: For program point L257(lines 257 323) no Hoare annotation was computed. [2018-12-31 06:12:47,170 INFO L448 ceAbstractionStarter]: For program point L92(line 92) no Hoare annotation was computed. [2018-12-31 06:12:47,170 INFO L448 ceAbstractionStarter]: For program point L291(line 291) no Hoare annotation was computed. [2018-12-31 06:12:47,170 INFO L448 ceAbstractionStarter]: For program point L60(lines 60 412) no Hoare annotation was computed. [2018-12-31 06:12:47,170 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 279) no Hoare annotation was computed. [2018-12-31 06:12:47,170 INFO L448 ceAbstractionStarter]: For program point L209(line 209) no Hoare annotation was computed. [2018-12-31 06:12:47,170 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-31 06:12:47,170 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 267) no Hoare annotation was computed. [2018-12-31 06:12:47,171 INFO L448 ceAbstractionStarter]: For program point L78(lines 78 409) no Hoare annotation was computed. [2018-12-31 06:12:47,172 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 172) no Hoare annotation was computed. [2018-12-31 06:12:47,172 INFO L444 ceAbstractionStarter]: At program point L310(lines 225 339) the Hoare annotation is: (let ((.cse7 (+ ULTIMATE.start_main_~main__cp~0 1))) (let ((.cse2 (<= 2 ULTIMATE.start_main_~main__cp~0)) (.cse5 (and (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~8 0)) (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~7 0)) (and (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~4) (and (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~6 0)) (and (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~5 0)) (and (= ULTIMATE.start_main_~__VERIFIER_assert__cond~0 1) (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~1 0)) (<= 1 ULTIMATE.start_main_~main__cp~0) (< 0 ULTIMATE.start_main_~main__scheme~0) (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~2 0))) (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~3) (<= .cse7 ULTIMATE.start_main_~main__urilen~0)))))) (.cse1 (= ULTIMATE.start_main_~main__c~0 0)) (.cse6 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~9 0)))) (or (and (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~10) (let ((.cse0 (let ((.cse3 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~11 0))) (.cse4 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~10 0)))) (or (and (<= (+ ULTIMATE.start_main_~main__c~0 2) ULTIMATE.start_main_~main__tokenlen~0) .cse2 .cse3 .cse4 .cse5 .cse6) (and (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~12 0)) .cse2 .cse3 .cse4 .cse5 .cse6))))) (or (and .cse0 .cse1) (and (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~13 0)) .cse0 (<= 1 ULTIMATE.start_main_~main__c~0))))) (and .cse2 .cse5 .cse1 (< .cse7 ULTIMATE.start_main_~main__urilen~0) .cse6)))) [2018-12-31 06:12:47,172 INFO L448 ceAbstractionStarter]: For program point L277(lines 277 315) no Hoare annotation was computed. [2018-12-31 06:12:47,173 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 140) no Hoare annotation was computed. [2018-12-31 06:12:47,173 INFO L451 ceAbstractionStarter]: At program point L426(lines 8 434) the Hoare annotation is: true [2018-12-31 06:12:47,173 INFO L448 ceAbstractionStarter]: For program point L30(lines 30 431) no Hoare annotation was computed. [2018-12-31 06:12:47,173 INFO L448 ceAbstractionStarter]: For program point L80(line 80) no Hoare annotation was computed. [2018-12-31 06:12:47,173 INFO L448 ceAbstractionStarter]: For program point L229(lines 229 333) no Hoare annotation was computed. [2018-12-31 06:12:47,173 INFO L448 ceAbstractionStarter]: For program point L130(lines 130 392) no Hoare annotation was computed. [2018-12-31 06:12:47,173 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 221) no Hoare annotation was computed. [2018-12-31 06:12:47,173 INFO L448 ceAbstractionStarter]: For program point L279(line 279) no Hoare annotation was computed. [2018-12-31 06:12:47,173 INFO L448 ceAbstractionStarter]: For program point L48(lines 48 428) no Hoare annotation was computed. [2018-12-31 06:12:47,173 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-12-31 06:12:47,173 INFO L448 ceAbstractionStarter]: For program point L379(lines 379 388) no Hoare annotation was computed. [2018-12-31 06:12:47,174 INFO L444 ceAbstractionStarter]: At program point L396(lines 126 397) the Hoare annotation is: (and (< ULTIMATE.start_main_~main__cp~0 ULTIMATE.start_main_~main__urilen~0) (let ((.cse0 (= ULTIMATE.start_main_~__VERIFIER_assert__cond~0 1)) (.cse1 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~1 0))) (.cse2 (<= 1 ULTIMATE.start_main_~main__cp~0)) (.cse3 (< 0 ULTIMATE.start_main_~main__scheme~0))) (or (and (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~2) .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~16 0)) (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~2 0))))) (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~3)) [2018-12-31 06:12:47,174 INFO L448 ceAbstractionStarter]: For program point L99(lines 99 406) no Hoare annotation was computed. [2018-12-31 06:12:47,174 INFO L448 ceAbstractionStarter]: For program point L66(lines 66 411) no Hoare annotation was computed. [2018-12-31 06:12:47,174 INFO L448 ceAbstractionStarter]: For program point L248(lines 248 324) no Hoare annotation was computed. [2018-12-31 06:12:47,174 INFO L448 ceAbstractionStarter]: For program point L182(lines 182 350) no Hoare annotation was computed. [2018-12-31 06:12:47,174 INFO L448 ceAbstractionStarter]: For program point L265(lines 265 317) no Hoare annotation was computed. [2018-12-31 06:12:47,174 INFO L448 ceAbstractionStarter]: For program point L199(lines 199 348) no Hoare annotation was computed. [2018-12-31 06:12:47,174 INFO L448 ceAbstractionStarter]: For program point L381(line 381) no Hoare annotation was computed. [2018-12-31 06:12:47,174 INFO L448 ceAbstractionStarter]: For program point L150(lines 150 355) no Hoare annotation was computed. [2018-12-31 06:12:47,174 INFO L448 ceAbstractionStarter]: For program point L18(lines 18 433) no Hoare annotation was computed. [2018-12-31 06:12:47,215 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 06:12:47 BoogieIcfgContainer [2018-12-31 06:12:47,215 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 06:12:47,215 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 06:12:47,215 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 06:12:47,215 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 06:12:47,216 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 06:12:33" (3/4) ... [2018-12-31 06:12:47,222 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-31 06:12:47,239 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-12-31 06:12:47,240 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-31 06:12:47,361 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 06:12:47,366 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 06:12:47,367 INFO L168 Benchmark]: Toolchain (without parser) took 15252.32 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 288.4 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -144.3 MB). Peak memory consumption was 144.0 MB. Max. memory is 11.5 GB. [2018-12-31 06:12:47,368 INFO L168 Benchmark]: CDTParser took 0.18 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. [2018-12-31 06:12:47,368 INFO L168 Benchmark]: CACSL2BoogieTranslator took 363.71 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 936.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-12-31 06:12:47,368 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.36 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 06:12:47,369 INFO L168 Benchmark]: Boogie Preprocessor took 92.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -178.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. [2018-12-31 06:12:47,369 INFO L168 Benchmark]: RCFGBuilder took 816.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.5 MB). Peak memory consumption was 25.5 MB. Max. memory is 11.5 GB. [2018-12-31 06:12:47,369 INFO L168 Benchmark]: TraceAbstraction took 13754.23 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 162.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -17.1 MB). Peak memory consumption was 370.3 MB. Max. memory is 11.5 GB. [2018-12-31 06:12:47,369 INFO L168 Benchmark]: Witness Printer took 150.47 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 11.5 GB. [2018-12-31 06:12:47,375 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.18 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 363.71 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 936.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 69.36 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 92.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -178.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 816.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.5 MB). Peak memory consumption was 25.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 13754.23 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 162.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -17.1 MB). Peak memory consumption was 370.3 MB. Max. memory is 11.5 GB. * Witness Printer took 150.47 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 381]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 120]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 172]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 108]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 209]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 267]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 303]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 80]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 221]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 152]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 140]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 279]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 92]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 238]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 184]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 369]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 250]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 291]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold - InvariantResult [Line: 124]: Loop Invariant Derived loop invariant: ((((((1 == __VERIFIER_assert__cond && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && 1 == __VERIFIER_assert__cond) || (((((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && 1 == __VERIFIER_assert__cond) && 1 == __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0))) && 1 <= main__cp) && main__cp + 1 <= main__urilen) && 1 == __VERIFIER_assert__cond - InvariantResult [Line: 257]: Loop Invariant Derived loop invariant: 1 == __VERIFIER_assert__cond && (((!(__VERIFIER_assert__cond == 0) && ((((((((((((1 == __VERIFIER_assert__cond && !(__VERIFIER_assert__cond == 0)) && 2 <= main__cp) && (!(__VERIFIER_assert__cond == 0) && (!(__VERIFIER_assert__cond == 0) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 == __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 == __VERIFIER_assert__cond) && main__cp + 1 < main__urilen) && !(__VERIFIER_assert__cond == 0)) && main__c + 2 <= main__tokenlen) && !(__VERIFIER_assert__cond == 0)) || (((((((((((1 == __VERIFIER_assert__cond && !(__VERIFIER_assert__cond == 0)) && 2 <= main__cp) && (!(__VERIFIER_assert__cond == 0) && (!(__VERIFIER_assert__cond == 0) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 == __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 == __VERIFIER_assert__cond) && main__cp + 1 < main__urilen) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)))) && 1 <= main__c) || (((((((((((((1 == __VERIFIER_assert__cond && !(__VERIFIER_assert__cond == 0)) && 2 <= main__cp) && (!(__VERIFIER_assert__cond == 0) && (!(__VERIFIER_assert__cond == 0) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 == __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 == __VERIFIER_assert__cond) && main__cp + 1 < main__urilen) && !(__VERIFIER_assert__cond == 0)) && main__c + 2 <= main__tokenlen) && !(__VERIFIER_assert__cond == 0)) || (((((((((((1 == __VERIFIER_assert__cond && !(__VERIFIER_assert__cond == 0)) && 2 <= main__cp) && (!(__VERIFIER_assert__cond == 0) && (!(__VERIFIER_assert__cond == 0) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 == __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 == __VERIFIER_assert__cond) && main__cp + 1 < main__urilen) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0))) && main__c == 0)) - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: (main__cp < main__urilen && (((((1 == __VERIFIER_assert__cond && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && 0 < main__scheme) || (((((__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)))) && 1 == __VERIFIER_assert__cond - InvariantResult [Line: 225]: Loop Invariant Derived loop invariant: (1 == __VERIFIER_assert__cond && ((((((((main__c + 2 <= main__tokenlen && 2 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && (!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && 1 == __VERIFIER_assert__cond && !(__VERIFIER_assert__cond == 0) && ((!(__VERIFIER_assert__cond == 0) && (((__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 == __VERIFIER_assert__cond) && main__cp + 1 <= main__urilen) && !(__VERIFIER_assert__cond == 0)) || (((((!(__VERIFIER_assert__cond == 0) && 2 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && (!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && 1 == __VERIFIER_assert__cond && !(__VERIFIER_assert__cond == 0) && ((!(__VERIFIER_assert__cond == 0) && (((__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 == __VERIFIER_assert__cond) && main__cp + 1 <= main__urilen) && !(__VERIFIER_assert__cond == 0))) && main__c == 0) || ((!(__VERIFIER_assert__cond == 0) && ((((((main__c + 2 <= main__tokenlen && 2 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && (!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && 1 == __VERIFIER_assert__cond && !(__VERIFIER_assert__cond == 0) && ((!(__VERIFIER_assert__cond == 0) && (((__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 == __VERIFIER_assert__cond) && main__cp + 1 <= main__urilen) && !(__VERIFIER_assert__cond == 0)) || (((((!(__VERIFIER_assert__cond == 0) && 2 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && (!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && 1 == __VERIFIER_assert__cond && !(__VERIFIER_assert__cond == 0) && ((!(__VERIFIER_assert__cond == 0) && (((__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 == __VERIFIER_assert__cond) && main__cp + 1 <= main__urilen) && !(__VERIFIER_assert__cond == 0)))) && 1 <= main__c))) || ((((2 <= main__cp && (!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && 1 == __VERIFIER_assert__cond && !(__VERIFIER_assert__cond == 0) && ((!(__VERIFIER_assert__cond == 0) && (((__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 == __VERIFIER_assert__cond) && main__cp + 1 <= main__urilen) && main__c == 0) && main__cp + 1 < main__urilen) && !(__VERIFIER_assert__cond == 0)) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: __VERIFIER_assert__cond == 1 - InvariantResult [Line: 8]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 82 locations, 18 error locations. SAFE Result, 13.6s OverallTime, 23 OverallIterations, 2 TraceHistogramMax, 5.7s AutomataDifference, 0.0s DeadEndRemovalTime, 2.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 1246 SDtfs, 2836 SDslu, 1555 SDs, 0 SdLazy, 1119 SolverSat, 159 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 310 GetRequests, 151 SyntacticMatches, 4 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 5.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82occurred in iteration=0, 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.1s AutomataMinimizationTime, 23 MinimizatonAttempts, 315 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 16 NumberOfFragments, 742 HoareAnnotationTreeSize, 6 FomulaSimplifications, 239048 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 6 FomulaSimplificationsInter, 147118 FormulaSimplificationTreeSizeReductionInter, 2.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 751 NumberOfCodeBlocks, 751 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 725 ConstructedInterpolants, 0 QuantifiedInterpolants, 48258 SizeOfPredicates, 21 NumberOfNonLiveVariables, 311 ConjunctsInSsa, 47 ConjunctsInUnsatCore, 26 InterpolantComputations, 20 PerfectInterpolantSequences, 10/21 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...