./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/bin/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 ../sv-benchmarks/c/loop-invgen/apache-escape-absolute.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.25-f470102 [2019-11-28 17:06:03,727 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 17:06:03,730 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 17:06:03,749 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 17:06:03,749 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 17:06:03,751 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 17:06:03,753 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 17:06:03,761 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 17:06:03,766 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 17:06:03,770 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 17:06:03,771 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 17:06:03,773 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 17:06:03,774 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 17:06:03,776 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 17:06:03,777 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 17:06:03,779 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 17:06:03,780 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 17:06:03,781 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 17:06:03,783 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 17:06:03,787 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 17:06:03,792 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 17:06:03,796 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 17:06:03,797 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 17:06:03,799 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 17:06:03,801 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 17:06:03,802 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 17:06:03,802 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 17:06:03,804 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 17:06:03,804 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 17:06:03,805 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 17:06:03,805 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 17:06:03,806 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 17:06:03,806 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 17:06:03,807 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 17:06:03,809 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 17:06:03,809 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 17:06:03,810 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 17:06:03,810 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 17:06:03,810 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 17:06:03,811 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 17:06:03,812 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 17:06:03,813 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 17:06:03,846 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 17:06:03,850 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 17:06:03,851 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 17:06:03,851 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 17:06:03,851 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 17:06:03,852 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 17:06:03,852 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 17:06:03,852 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 17:06:03,852 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 17:06:03,852 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 17:06:03,853 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 17:06:03,853 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 17:06:03,853 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 17:06:03,853 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 17:06:03,853 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 17:06:03,857 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 17:06:03,857 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 17:06:03,857 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 17:06:03,858 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 17:06:03,858 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 17:06:03,858 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 17:06:03,858 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 17:06:03,859 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 17:06:03,859 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 17:06:03,860 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 17:06:03,860 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 17:06:03,860 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 17:06:03,860 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 17:06:03,860 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 17:06:03,861 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 [2019-11-28 17:06:04,181 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 17:06:04,198 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 17:06:04,201 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 17:06:04,203 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 17:06:04,204 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 17:06:04,205 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c [2019-11-28 17:06:04,263 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c8425652/474c477086ca497cb5b57de6de4f867a/FLAGbd753384c [2019-11-28 17:06:04,708 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 17:06:04,708 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c [2019-11-28 17:06:04,719 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c8425652/474c477086ca497cb5b57de6de4f867a/FLAGbd753384c [2019-11-28 17:06:05,068 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c8425652/474c477086ca497cb5b57de6de4f867a [2019-11-28 17:06:05,071 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 17:06:05,073 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 17:06:05,074 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 17:06:05,074 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 17:06:05,077 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 17:06:05,078 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:06:05" (1/1) ... [2019-11-28 17:06:05,081 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b8d9329 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:06:05, skipping insertion in model container [2019-11-28 17:06:05,081 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:06:05" (1/1) ... [2019-11-28 17:06:05,089 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 17:06:05,118 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 17:06:05,341 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:06:05,349 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 17:06:05,394 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:06:05,472 INFO L208 MainTranslator]: Completed translation [2019-11-28 17:06:05,473 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:06:05 WrapperNode [2019-11-28 17:06:05,473 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 17:06:05,474 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 17:06:05,474 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 17:06:05,475 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 17:06:05,483 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:06:05" (1/1) ... [2019-11-28 17:06:05,492 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:06:05" (1/1) ... [2019-11-28 17:06:05,518 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 17:06:05,519 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 17:06:05,519 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 17:06:05,519 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 17:06:05,528 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:06:05" (1/1) ... [2019-11-28 17:06:05,529 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:06:05" (1/1) ... [2019-11-28 17:06:05,530 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:06:05" (1/1) ... [2019-11-28 17:06:05,531 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:06:05" (1/1) ... [2019-11-28 17:06:05,535 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:06:05" (1/1) ... [2019-11-28 17:06:05,539 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:06:05" (1/1) ... [2019-11-28 17:06:05,541 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:06:05" (1/1) ... [2019-11-28 17:06:05,544 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 17:06:05,545 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 17:06:05,545 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 17:06:05,545 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 17:06:05,546 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:06:05" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 17:06:05,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 17:06:05,604 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 17:06:06,013 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 17:06:06,013 INFO L287 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-28 17:06:06,014 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:06:06 BoogieIcfgContainer [2019-11-28 17:06:06,014 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 17:06:06,015 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 17:06:06,015 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 17:06:06,018 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 17:06:06,018 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 05:06:05" (1/3) ... [2019-11-28 17:06:06,019 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ef74d32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:06:06, skipping insertion in model container [2019-11-28 17:06:06,019 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:06:05" (2/3) ... [2019-11-28 17:06:06,020 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ef74d32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:06:06, skipping insertion in model container [2019-11-28 17:06:06,020 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:06:06" (3/3) ... [2019-11-28 17:06:06,022 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i.v+cfa-reducer.c [2019-11-28 17:06:06,031 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 17:06:06,038 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 18 error locations. [2019-11-28 17:06:06,050 INFO L249 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2019-11-28 17:06:06,074 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 17:06:06,074 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 17:06:06,075 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 17:06:06,075 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 17:06:06,075 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 17:06:06,075 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 17:06:06,075 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 17:06:06,075 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 17:06:06,092 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states. [2019-11-28 17:06:06,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 17:06:06,097 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:06:06,098 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:06:06,099 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:06:06,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:06:06,103 INFO L82 PathProgramCache]: Analyzing trace with hash -2034435078, now seen corresponding path program 1 times [2019-11-28 17:06:06,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:06:06,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495539590] [2019-11-28 17:06:06,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:06:06,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:06:06,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:06:06,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495539590] [2019-11-28 17:06:06,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:06:06,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:06:06,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127350372] [2019-11-28 17:06:06,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:06:06,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:06:06,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:06:06,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:06:06,283 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 3 states. [2019-11-28 17:06:06,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:06:06,321 INFO L93 Difference]: Finished difference Result 88 states and 123 transitions. [2019-11-28 17:06:06,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:06:06,323 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-28 17:06:06,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:06:06,333 INFO L225 Difference]: With dead ends: 88 [2019-11-28 17:06:06,333 INFO L226 Difference]: Without dead ends: 76 [2019-11-28 17:06:06,336 INFO L630 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 [2019-11-28 17:06:06,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-11-28 17:06:06,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-11-28 17:06:06,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-11-28 17:06:06,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2019-11-28 17:06:06,377 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 15 [2019-11-28 17:06:06,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:06:06,377 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2019-11-28 17:06:06,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:06:06,378 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2019-11-28 17:06:06,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 17:06:06,378 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:06:06,379 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:06:06,379 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:06:06,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:06:06,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1357026114, now seen corresponding path program 1 times [2019-11-28 17:06:06,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:06:06,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280851769] [2019-11-28 17:06:06,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:06:06,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:06:06,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:06:06,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280851769] [2019-11-28 17:06:06,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:06:06,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 17:06:06,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720849021] [2019-11-28 17:06:06,467 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 17:06:06,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:06:06,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 17:06:06,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 17:06:06,468 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand 6 states. [2019-11-28 17:06:06,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:06:06,574 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2019-11-28 17:06:06,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 17:06:06,575 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-11-28 17:06:06,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:06:06,576 INFO L225 Difference]: With dead ends: 76 [2019-11-28 17:06:06,577 INFO L226 Difference]: Without dead ends: 74 [2019-11-28 17:06:06,578 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-28 17:06:06,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-28 17:06:06,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-11-28 17:06:06,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-28 17:06:06,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2019-11-28 17:06:06,597 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 16 [2019-11-28 17:06:06,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:06:06,597 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2019-11-28 17:06:06,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 17:06:06,598 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2019-11-28 17:06:06,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 17:06:06,599 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:06:06,599 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:06:06,600 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:06:06,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:06:06,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1567835227, now seen corresponding path program 1 times [2019-11-28 17:06:06,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:06:06,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283956072] [2019-11-28 17:06:06,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:06:06,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:06:06,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:06:06,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283956072] [2019-11-28 17:06:06,703 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:06:06,703 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 17:06:06,703 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202439] [2019-11-28 17:06:06,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 17:06:06,704 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:06:06,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 17:06:06,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 17:06:06,704 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand 4 states. [2019-11-28 17:06:06,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:06:06,805 INFO L93 Difference]: Finished difference Result 97 states and 102 transitions. [2019-11-28 17:06:06,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 17:06:06,808 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-11-28 17:06:06,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:06:06,809 INFO L225 Difference]: With dead ends: 97 [2019-11-28 17:06:06,810 INFO L226 Difference]: Without dead ends: 95 [2019-11-28 17:06:06,810 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:06:06,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-11-28 17:06:06,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 72. [2019-11-28 17:06:06,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-28 17:06:06,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 75 transitions. [2019-11-28 17:06:06,820 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 75 transitions. Word has length 18 [2019-11-28 17:06:06,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:06:06,821 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 75 transitions. [2019-11-28 17:06:06,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 17:06:06,821 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2019-11-28 17:06:06,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 17:06:06,822 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:06:06,822 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:06:06,823 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:06:06,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:06:06,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1358247672, now seen corresponding path program 1 times [2019-11-28 17:06:06,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:06:06,824 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758161610] [2019-11-28 17:06:06,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:06:06,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:06:06,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:06:06,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758161610] [2019-11-28 17:06:06,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:06:06,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 17:06:06,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405200997] [2019-11-28 17:06:06,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:06:06,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:06:06,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:06:06,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:06:06,878 INFO L87 Difference]: Start difference. First operand 72 states and 75 transitions. Second operand 5 states. [2019-11-28 17:06:06,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:06:06,975 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2019-11-28 17:06:06,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 17:06:06,975 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-11-28 17:06:06,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:06:06,976 INFO L225 Difference]: With dead ends: 72 [2019-11-28 17:06:06,977 INFO L226 Difference]: Without dead ends: 70 [2019-11-28 17:06:06,978 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 17:06:06,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-11-28 17:06:06,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-11-28 17:06:06,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-11-28 17:06:06,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2019-11-28 17:06:06,997 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 19 [2019-11-28 17:06:06,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:06:06,998 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2019-11-28 17:06:06,998 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:06:06,999 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2019-11-28 17:06:06,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 17:06:07,000 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:06:07,000 INFO L410 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] [2019-11-28 17:06:07,000 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:06:07,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:06:07,001 INFO L82 PathProgramCache]: Analyzing trace with hash -665385716, now seen corresponding path program 1 times [2019-11-28 17:06:07,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:06:07,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663903164] [2019-11-28 17:06:07,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:06:07,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:06:07,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:06:07,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663903164] [2019-11-28 17:06:07,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:06:07,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 17:06:07,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638477077] [2019-11-28 17:06:07,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:06:07,103 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:06:07,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:06:07,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:06:07,103 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand 5 states. [2019-11-28 17:06:07,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:06:07,274 INFO L93 Difference]: Finished difference Result 137 states and 143 transitions. [2019-11-28 17:06:07,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 17:06:07,275 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-28 17:06:07,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:06:07,276 INFO L225 Difference]: With dead ends: 137 [2019-11-28 17:06:07,277 INFO L226 Difference]: Without dead ends: 135 [2019-11-28 17:06:07,277 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-28 17:06:07,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-11-28 17:06:07,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 73. [2019-11-28 17:06:07,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-11-28 17:06:07,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2019-11-28 17:06:07,287 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 22 [2019-11-28 17:06:07,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:06:07,288 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2019-11-28 17:06:07,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:06:07,288 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2019-11-28 17:06:07,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 17:06:07,289 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:06:07,289 INFO L410 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] [2019-11-28 17:06:07,290 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:06:07,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:06:07,290 INFO L82 PathProgramCache]: Analyzing trace with hash -661217951, now seen corresponding path program 1 times [2019-11-28 17:06:07,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:06:07,291 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543249129] [2019-11-28 17:06:07,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:06:07,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:06:07,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:06:07,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543249129] [2019-11-28 17:06:07,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:06:07,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 17:06:07,388 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731294923] [2019-11-28 17:06:07,388 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:06:07,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:06:07,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:06:07,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:06:07,389 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand 5 states. [2019-11-28 17:06:07,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:06:07,519 INFO L93 Difference]: Finished difference Result 104 states and 110 transitions. [2019-11-28 17:06:07,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 17:06:07,519 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-28 17:06:07,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:06:07,520 INFO L225 Difference]: With dead ends: 104 [2019-11-28 17:06:07,521 INFO L226 Difference]: Without dead ends: 102 [2019-11-28 17:06:07,521 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-28 17:06:07,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-11-28 17:06:07,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 75. [2019-11-28 17:06:07,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-28 17:06:07,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2019-11-28 17:06:07,529 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 22 [2019-11-28 17:06:07,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:06:07,529 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2019-11-28 17:06:07,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:06:07,530 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2019-11-28 17:06:07,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 17:06:07,531 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:06:07,531 INFO L410 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] [2019-11-28 17:06:07,531 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:06:07,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:06:07,532 INFO L82 PathProgramCache]: Analyzing trace with hash 847883539, now seen corresponding path program 1 times [2019-11-28 17:06:07,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:06:07,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902140339] [2019-11-28 17:06:07,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:06:07,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:06:07,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:06:07,586 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902140339] [2019-11-28 17:06:07,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:06:07,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 17:06:07,587 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444831593] [2019-11-28 17:06:07,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:06:07,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:06:07,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:06:07,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:06:07,593 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand 5 states. [2019-11-28 17:06:07,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:06:07,724 INFO L93 Difference]: Finished difference Result 117 states and 123 transitions. [2019-11-28 17:06:07,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 17:06:07,726 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-11-28 17:06:07,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:06:07,727 INFO L225 Difference]: With dead ends: 117 [2019-11-28 17:06:07,727 INFO L226 Difference]: Without dead ends: 115 [2019-11-28 17:06:07,727 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 17:06:07,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-11-28 17:06:07,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 73. [2019-11-28 17:06:07,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-11-28 17:06:07,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2019-11-28 17:06:07,745 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 23 [2019-11-28 17:06:07,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:06:07,745 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2019-11-28 17:06:07,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:06:07,746 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2019-11-28 17:06:07,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 17:06:07,746 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:06:07,747 INFO L410 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] [2019-11-28 17:06:07,747 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:06:07,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:06:07,747 INFO L82 PathProgramCache]: Analyzing trace with hash 977084131, now seen corresponding path program 1 times [2019-11-28 17:06:07,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:06:07,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320000159] [2019-11-28 17:06:07,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:06:07,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:06:07,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:06:07,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320000159] [2019-11-28 17:06:07,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:06:07,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 17:06:07,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729216255] [2019-11-28 17:06:07,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:06:07,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:06:07,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:06:07,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:06:07,829 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand 5 states. [2019-11-28 17:06:07,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:06:07,938 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2019-11-28 17:06:07,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 17:06:07,939 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-11-28 17:06:07,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:06:07,940 INFO L225 Difference]: With dead ends: 73 [2019-11-28 17:06:07,940 INFO L226 Difference]: Without dead ends: 71 [2019-11-28 17:06:07,941 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 17:06:07,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-28 17:06:07,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-11-28 17:06:07,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-28 17:06:07,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 76 transitions. [2019-11-28 17:06:07,956 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 76 transitions. Word has length 23 [2019-11-28 17:06:07,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:06:07,957 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 76 transitions. [2019-11-28 17:06:07,957 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:06:07,957 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2019-11-28 17:06:07,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 17:06:07,958 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:06:07,959 INFO L410 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] [2019-11-28 17:06:07,959 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:06:07,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:06:07,962 INFO L82 PathProgramCache]: Analyzing trace with hash -1619855478, now seen corresponding path program 1 times [2019-11-28 17:06:07,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:06:07,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219636343] [2019-11-28 17:06:07,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:06:07,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:06:08,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:06:08,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219636343] [2019-11-28 17:06:08,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:06:08,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:06:08,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652276155] [2019-11-28 17:06:08,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:06:08,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:06:08,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:06:08,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:06:08,019 INFO L87 Difference]: Start difference. First operand 71 states and 76 transitions. Second operand 3 states. [2019-11-28 17:06:08,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:06:08,060 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2019-11-28 17:06:08,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:06:08,061 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-28 17:06:08,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:06:08,062 INFO L225 Difference]: With dead ends: 111 [2019-11-28 17:06:08,062 INFO L226 Difference]: Without dead ends: 71 [2019-11-28 17:06:08,063 INFO L630 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 [2019-11-28 17:06:08,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-28 17:06:08,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-11-28 17:06:08,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-28 17:06:08,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2019-11-28 17:06:08,070 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 25 [2019-11-28 17:06:08,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:06:08,070 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2019-11-28 17:06:08,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:06:08,071 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2019-11-28 17:06:08,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 17:06:08,072 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:06:08,072 INFO L410 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] [2019-11-28 17:06:08,072 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:06:08,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:06:08,073 INFO L82 PathProgramCache]: Analyzing trace with hash 595608307, now seen corresponding path program 1 times [2019-11-28 17:06:08,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:06:08,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133439396] [2019-11-28 17:06:08,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:06:08,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:06:08,154 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 17:06:08,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133439396] [2019-11-28 17:06:08,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1485443930] [2019-11-28 17:06:08,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:06:08,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:06:08,210 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-28 17:06:08,218 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:06:08,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:06:08,311 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 17:06:08,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:06:08,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 7 [2019-11-28 17:06:08,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141803624] [2019-11-28 17:06:08,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 17:06:08,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:06:08,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 17:06:08,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-28 17:06:08,313 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand 7 states. [2019-11-28 17:06:08,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:06:08,448 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2019-11-28 17:06:08,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 17:06:08,448 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-11-28 17:06:08,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:06:08,449 INFO L225 Difference]: With dead ends: 111 [2019-11-28 17:06:08,450 INFO L226 Difference]: Without dead ends: 109 [2019-11-28 17:06:08,452 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-28 17:06:08,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-11-28 17:06:08,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 68. [2019-11-28 17:06:08,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-28 17:06:08,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2019-11-28 17:06:08,460 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 26 [2019-11-28 17:06:08,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:06:08,462 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2019-11-28 17:06:08,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 17:06:08,462 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2019-11-28 17:06:08,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 17:06:08,464 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:06:08,464 INFO L410 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] [2019-11-28 17:06:08,668 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:06:08,669 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:06:08,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:06:08,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1780382557, now seen corresponding path program 1 times [2019-11-28 17:06:08,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:06:08,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374152695] [2019-11-28 17:06:08,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:06:08,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:06:08,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:06:08,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374152695] [2019-11-28 17:06:08,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:06:08,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 17:06:08,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138387268] [2019-11-28 17:06:08,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:06:08,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:06:08,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:06:08,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:06:08,746 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand 5 states. [2019-11-28 17:06:08,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:06:08,810 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2019-11-28 17:06:08,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 17:06:08,811 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-11-28 17:06:08,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:06:08,812 INFO L225 Difference]: With dead ends: 69 [2019-11-28 17:06:08,812 INFO L226 Difference]: Without dead ends: 67 [2019-11-28 17:06:08,812 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-28 17:06:08,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-11-28 17:06:08,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2019-11-28 17:06:08,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-28 17:06:08,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2019-11-28 17:06:08,817 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 26 [2019-11-28 17:06:08,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:06:08,818 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2019-11-28 17:06:08,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:06:08,818 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2019-11-28 17:06:08,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 17:06:08,819 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:06:08,819 INFO L410 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] [2019-11-28 17:06:08,819 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:06:08,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:06:08,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1280139623, now seen corresponding path program 1 times [2019-11-28 17:06:08,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:06:08,820 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781116052] [2019-11-28 17:06:08,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:06:08,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:06:08,865 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 17:06:08,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781116052] [2019-11-28 17:06:08,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [138878967] [2019-11-28 17:06:08,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:06:08,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:06:08,930 INFO L264 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-28 17:06:08,934 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:06:08,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:06:08,980 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 17:06:08,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:06:08,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 7 [2019-11-28 17:06:08,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484300933] [2019-11-28 17:06:08,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 17:06:08,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:06:08,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 17:06:08,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-28 17:06:08,982 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand 7 states. [2019-11-28 17:06:09,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:06:09,073 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2019-11-28 17:06:09,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 17:06:09,073 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2019-11-28 17:06:09,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:06:09,074 INFO L225 Difference]: With dead ends: 67 [2019-11-28 17:06:09,074 INFO L226 Difference]: Without dead ends: 65 [2019-11-28 17:06:09,075 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-28 17:06:09,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-11-28 17:06:09,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 60. [2019-11-28 17:06:09,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-28 17:06:09,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2019-11-28 17:06:09,079 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 27 [2019-11-28 17:06:09,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:06:09,079 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2019-11-28 17:06:09,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 17:06:09,080 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2019-11-28 17:06:09,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 17:06:09,080 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:06:09,081 INFO L410 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] [2019-11-28 17:06:09,283 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:06:09,284 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:06:09,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:06:09,285 INFO L82 PathProgramCache]: Analyzing trace with hash -642711428, now seen corresponding path program 1 times [2019-11-28 17:06:09,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:06:09,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168625402] [2019-11-28 17:06:09,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:06:09,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:06:09,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:06:09,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168625402] [2019-11-28 17:06:09,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:06:09,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 17:06:09,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841334082] [2019-11-28 17:06:09,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:06:09,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:06:09,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:06:09,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:06:09,340 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 5 states. [2019-11-28 17:06:09,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:06:09,399 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2019-11-28 17:06:09,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 17:06:09,400 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-11-28 17:06:09,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:06:09,400 INFO L225 Difference]: With dead ends: 60 [2019-11-28 17:06:09,401 INFO L226 Difference]: Without dead ends: 58 [2019-11-28 17:06:09,401 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 17:06:09,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-11-28 17:06:09,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-11-28 17:06:09,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-28 17:06:09,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2019-11-28 17:06:09,406 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 27 [2019-11-28 17:06:09,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:06:09,409 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2019-11-28 17:06:09,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:06:09,410 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2019-11-28 17:06:09,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-28 17:06:09,412 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:06:09,412 INFO L410 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] [2019-11-28 17:06:09,413 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:06:09,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:06:09,413 INFO L82 PathProgramCache]: Analyzing trace with hash -47880409, now seen corresponding path program 1 times [2019-11-28 17:06:09,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:06:09,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287801557] [2019-11-28 17:06:09,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:06:09,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:06:09,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:06:09,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287801557] [2019-11-28 17:06:09,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:06:09,472 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 17:06:09,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394904156] [2019-11-28 17:06:09,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:06:09,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:06:09,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:06:09,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:06:09,473 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 5 states. [2019-11-28 17:06:09,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:06:09,527 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2019-11-28 17:06:09,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 17:06:09,527 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-11-28 17:06:09,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:06:09,528 INFO L225 Difference]: With dead ends: 59 [2019-11-28 17:06:09,528 INFO L226 Difference]: Without dead ends: 57 [2019-11-28 17:06:09,528 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-28 17:06:09,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-28 17:06:09,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2019-11-28 17:06:09,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-11-28 17:06:09,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2019-11-28 17:06:09,532 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 30 [2019-11-28 17:06:09,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:06:09,532 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2019-11-28 17:06:09,532 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:06:09,532 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2019-11-28 17:06:09,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 17:06:09,533 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:06:09,533 INFO L410 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] [2019-11-28 17:06:09,535 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:06:09,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:06:09,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1484288504, now seen corresponding path program 1 times [2019-11-28 17:06:09,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:06:09,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720749811] [2019-11-28 17:06:09,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:06:09,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:06:09,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:06:09,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720749811] [2019-11-28 17:06:09,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:06:09,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 17:06:09,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403381554] [2019-11-28 17:06:09,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 17:06:09,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:06:09,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 17:06:09,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 17:06:09,612 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 6 states. [2019-11-28 17:06:09,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:06:09,689 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2019-11-28 17:06:09,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 17:06:09,689 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2019-11-28 17:06:09,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:06:09,690 INFO L225 Difference]: With dead ends: 67 [2019-11-28 17:06:09,690 INFO L226 Difference]: Without dead ends: 65 [2019-11-28 17:06:09,691 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-11-28 17:06:09,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-11-28 17:06:09,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 54. [2019-11-28 17:06:09,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-28 17:06:09,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2019-11-28 17:06:09,696 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 31 [2019-11-28 17:06:09,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:06:09,697 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2019-11-28 17:06:09,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 17:06:09,697 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2019-11-28 17:06:09,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-28 17:06:09,698 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:06:09,698 INFO L410 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] [2019-11-28 17:06:09,698 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:06:09,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:06:09,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1746453711, now seen corresponding path program 1 times [2019-11-28 17:06:09,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:06:09,699 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157534760] [2019-11-28 17:06:09,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:06:09,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:06:09,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:06:09,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157534760] [2019-11-28 17:06:09,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:06:09,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 17:06:09,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453691387] [2019-11-28 17:06:09,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:06:09,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:06:09,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:06:09,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:06:09,752 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand 5 states. [2019-11-28 17:06:09,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:06:09,869 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2019-11-28 17:06:09,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 17:06:09,870 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-11-28 17:06:09,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:06:09,871 INFO L225 Difference]: With dead ends: 87 [2019-11-28 17:06:09,871 INFO L226 Difference]: Without dead ends: 85 [2019-11-28 17:06:09,871 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 17:06:09,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-11-28 17:06:09,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 57. [2019-11-28 17:06:09,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-11-28 17:06:09,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2019-11-28 17:06:09,877 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 34 [2019-11-28 17:06:09,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:06:09,878 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2019-11-28 17:06:09,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:06:09,878 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2019-11-28 17:06:09,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-28 17:06:09,880 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:06:09,880 INFO L410 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] [2019-11-28 17:06:09,880 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:06:09,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:06:09,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1694514003, now seen corresponding path program 1 times [2019-11-28 17:06:09,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:06:09,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683101908] [2019-11-28 17:06:09,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:06:09,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:06:09,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:06:09,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683101908] [2019-11-28 17:06:09,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:06:09,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 17:06:09,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650224090] [2019-11-28 17:06:09,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:06:09,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:06:09,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:06:09,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:06:09,940 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand 5 states. [2019-11-28 17:06:10,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:06:10,021 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2019-11-28 17:06:10,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 17:06:10,022 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2019-11-28 17:06:10,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:06:10,022 INFO L225 Difference]: With dead ends: 57 [2019-11-28 17:06:10,022 INFO L226 Difference]: Without dead ends: 55 [2019-11-28 17:06:10,023 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 17:06:10,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-28 17:06:10,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-11-28 17:06:10,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-11-28 17:06:10,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2019-11-28 17:06:10,030 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 35 [2019-11-28 17:06:10,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:06:10,031 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2019-11-28 17:06:10,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:06:10,031 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2019-11-28 17:06:10,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-28 17:06:10,035 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:06:10,035 INFO L410 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] [2019-11-28 17:06:10,035 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:06:10,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:06:10,036 INFO L82 PathProgramCache]: Analyzing trace with hash 635482230, now seen corresponding path program 1 times [2019-11-28 17:06:10,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:06:10,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616166404] [2019-11-28 17:06:10,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:06:10,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:06:10,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:06:10,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616166404] [2019-11-28 17:06:10,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:06:10,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 17:06:10,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548865466] [2019-11-28 17:06:10,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:06:10,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:06:10,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:06:10,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:06:10,084 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand 5 states. [2019-11-28 17:06:10,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:06:10,106 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2019-11-28 17:06:10,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 17:06:10,107 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-11-28 17:06:10,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:06:10,107 INFO L225 Difference]: With dead ends: 66 [2019-11-28 17:06:10,107 INFO L226 Difference]: Without dead ends: 64 [2019-11-28 17:06:10,108 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:06:10,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-28 17:06:10,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2019-11-28 17:06:10,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-28 17:06:10,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2019-11-28 17:06:10,114 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 37 [2019-11-28 17:06:10,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:06:10,114 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2019-11-28 17:06:10,114 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:06:10,114 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2019-11-28 17:06:10,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-28 17:06:10,115 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:06:10,115 INFO L410 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] [2019-11-28 17:06:10,116 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:06:10,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:06:10,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1774883137, now seen corresponding path program 1 times [2019-11-28 17:06:10,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:06:10,117 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380485520] [2019-11-28 17:06:10,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:06:10,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:06:10,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:06:10,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380485520] [2019-11-28 17:06:10,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:06:10,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 17:06:10,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225164618] [2019-11-28 17:06:10,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:06:10,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:06:10,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:06:10,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:06:10,181 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand 5 states. [2019-11-28 17:06:10,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:06:10,214 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2019-11-28 17:06:10,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 17:06:10,215 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2019-11-28 17:06:10,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:06:10,215 INFO L225 Difference]: With dead ends: 64 [2019-11-28 17:06:10,215 INFO L226 Difference]: Without dead ends: 62 [2019-11-28 17:06:10,216 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 17:06:10,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-11-28 17:06:10,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2019-11-28 17:06:10,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-28 17:06:10,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2019-11-28 17:06:10,224 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 38 [2019-11-28 17:06:10,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:06:10,225 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2019-11-28 17:06:10,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:06:10,225 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2019-11-28 17:06:10,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-28 17:06:10,226 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:06:10,226 INFO L410 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] [2019-11-28 17:06:10,227 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:06:10,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:06:10,227 INFO L82 PathProgramCache]: Analyzing trace with hash 813201821, now seen corresponding path program 1 times [2019-11-28 17:06:10,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:06:10,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897640173] [2019-11-28 17:06:10,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:06:10,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:06:10,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:06:10,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897640173] [2019-11-28 17:06:10,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:06:10,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 17:06:10,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273105797] [2019-11-28 17:06:10,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:06:10,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:06:10,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:06:10,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:06:10,287 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 5 states. [2019-11-28 17:06:10,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:06:10,445 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2019-11-28 17:06:10,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 17:06:10,446 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-11-28 17:06:10,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:06:10,447 INFO L225 Difference]: With dead ends: 86 [2019-11-28 17:06:10,448 INFO L226 Difference]: Without dead ends: 84 [2019-11-28 17:06:10,448 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 17:06:10,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-11-28 17:06:10,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 65. [2019-11-28 17:06:10,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-28 17:06:10,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2019-11-28 17:06:10,455 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 39 [2019-11-28 17:06:10,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:06:10,455 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2019-11-28 17:06:10,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:06:10,455 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2019-11-28 17:06:10,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-28 17:06:10,456 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:06:10,456 INFO L410 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] [2019-11-28 17:06:10,456 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:06:10,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:06:10,457 INFO L82 PathProgramCache]: Analyzing trace with hash -560543098, now seen corresponding path program 1 times [2019-11-28 17:06:10,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:06:10,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754069892] [2019-11-28 17:06:10,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:06:10,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:06:10,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:06:10,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754069892] [2019-11-28 17:06:10,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:06:10,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 17:06:10,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642268195] [2019-11-28 17:06:10,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:06:10,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:06:10,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:06:10,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:06:10,510 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand 5 states. [2019-11-28 17:06:10,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:06:10,596 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2019-11-28 17:06:10,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 17:06:10,597 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-11-28 17:06:10,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:06:10,597 INFO L225 Difference]: With dead ends: 71 [2019-11-28 17:06:10,597 INFO L226 Difference]: Without dead ends: 69 [2019-11-28 17:06:10,598 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 17:06:10,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-11-28 17:06:10,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 63. [2019-11-28 17:06:10,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-28 17:06:10,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2019-11-28 17:06:10,603 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 40 [2019-11-28 17:06:10,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:06:10,603 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2019-11-28 17:06:10,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:06:10,604 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2019-11-28 17:06:10,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-28 17:06:10,604 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:06:10,604 INFO L410 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] [2019-11-28 17:06:10,605 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:06:10,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:06:10,606 INFO L82 PathProgramCache]: Analyzing trace with hash 375780089, now seen corresponding path program 1 times [2019-11-28 17:06:10,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:06:10,606 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750557775] [2019-11-28 17:06:10,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:06:10,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:06:10,692 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:06:10,693 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750557775] [2019-11-28 17:06:10,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850224383] [2019-11-28 17:06:10,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:06:10,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:06:10,753 INFO L264 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-28 17:06:10,756 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:06:10,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:06:10,806 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:06:10,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:06:10,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2019-11-28 17:06:10,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637020149] [2019-11-28 17:06:10,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 17:06:10,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:06:10,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 17:06:10,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-28 17:06:10,808 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand 8 states. [2019-11-28 17:06:10,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:06:10,942 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2019-11-28 17:06:10,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 17:06:10,943 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2019-11-28 17:06:10,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:06:10,944 INFO L225 Difference]: With dead ends: 64 [2019-11-28 17:06:10,944 INFO L226 Difference]: Without dead ends: 62 [2019-11-28 17:06:10,945 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 37 SyntacticMatches, 7 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-11-28 17:06:10,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-11-28 17:06:10,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2019-11-28 17:06:10,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-28 17:06:10,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2019-11-28 17:06:10,949 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 40 [2019-11-28 17:06:10,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:06:10,950 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2019-11-28 17:06:10,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 17:06:10,950 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2019-11-28 17:06:10,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-28 17:06:10,950 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:06:10,951 INFO L410 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] [2019-11-28 17:06:11,154 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:06:11,159 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:06:11,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:06:11,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1394778411, now seen corresponding path program 1 times [2019-11-28 17:06:11,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:06:11,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520374537] [2019-11-28 17:06:11,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:06:11,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:06:11,215 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 17:06:11,215 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520374537] [2019-11-28 17:06:11,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:06:11,215 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 17:06:11,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668455802] [2019-11-28 17:06:11,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:06:11,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:06:11,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:06:11,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:06:11,216 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand 5 states. [2019-11-28 17:06:11,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:06:11,341 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2019-11-28 17:06:11,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 17:06:11,342 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-11-28 17:06:11,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:06:11,342 INFO L225 Difference]: With dead ends: 73 [2019-11-28 17:06:11,343 INFO L226 Difference]: Without dead ends: 71 [2019-11-28 17:06:11,343 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-28 17:06:11,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-28 17:06:11,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 51. [2019-11-28 17:06:11,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-11-28 17:06:11,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2019-11-28 17:06:11,348 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 45 [2019-11-28 17:06:11,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:06:11,349 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2019-11-28 17:06:11,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:06:11,349 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2019-11-28 17:06:11,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-28 17:06:11,350 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:06:11,350 INFO L410 BasicCegarLoop]: trace histogram [2, 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] [2019-11-28 17:06:11,351 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:06:11,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:06:11,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1932282916, now seen corresponding path program 1 times [2019-11-28 17:06:11,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:06:11,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769318861] [2019-11-28 17:06:11,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:06:11,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:06:11,423 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:06:11,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769318861] [2019-11-28 17:06:11,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1941088319] [2019-11-28 17:06:11,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:06:11,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:06:11,498 INFO L264 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 17:06:11,515 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:06:11,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:06:11,568 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 17:06:11,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 17:06:11,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2019-11-28 17:06:11,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866207095] [2019-11-28 17:06:11,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 17:06:11,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:06:11,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 17:06:11,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 17:06:11,574 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand 4 states. [2019-11-28 17:06:11,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:06:11,618 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2019-11-28 17:06:11,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 17:06:11,618 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-11-28 17:06:11,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:06:11,619 INFO L225 Difference]: With dead ends: 56 [2019-11-28 17:06:11,619 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 17:06:11,620 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-28 17:06:11,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 17:06:11,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 17:06:11,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 17:06:11,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 17:06:11,622 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 47 [2019-11-28 17:06:11,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:06:11,623 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 17:06:11,623 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 17:06:11,623 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 17:06:11,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 17:06:11,827 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:06:11,829 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 17:06:12,221 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 29 [2019-11-28 17:06:12,657 WARN L192 SmtUtils]: Spent 433.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 62 [2019-11-28 17:06:12,877 WARN L192 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 36 [2019-11-28 17:06:13,281 WARN L192 SmtUtils]: Spent 401.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 68 [2019-11-28 17:06:13,289 INFO L246 CegarLoopResult]: For program point L250(line 250) no Hoare annotation was computed. [2019-11-28 17:06:13,289 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 92) no Hoare annotation was computed. [2019-11-28 17:06:13,289 INFO L246 CegarLoopResult]: For program point L184(line 184) no Hoare annotation was computed. [2019-11-28 17:06:13,289 INFO L246 CegarLoopResult]: For program point L118(lines 118 398) no Hoare annotation was computed. [2019-11-28 17:06:13,289 INFO L246 CegarLoopResult]: For program point L267(line 267) no Hoare annotation was computed. [2019-11-28 17:06:13,289 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 267) no Hoare annotation was computed. [2019-11-28 17:06:13,289 INFO L246 CegarLoopResult]: For program point L36(lines 36 430) no Hoare annotation was computed. [2019-11-28 17:06:13,289 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 17:06:13,290 INFO L246 CegarLoopResult]: For program point L152(line 152) no Hoare annotation was computed. [2019-11-28 17:06:13,290 INFO L246 CegarLoopResult]: For program point L367(lines 367 390) no Hoare annotation was computed. [2019-11-28 17:06:13,290 INFO L246 CegarLoopResult]: For program point L301(lines 301 311) no Hoare annotation was computed. [2019-11-28 17:06:13,290 INFO L246 CegarLoopResult]: For program point L219(lines 219 339) no Hoare annotation was computed. [2019-11-28 17:06:13,290 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 250) no Hoare annotation was computed. [2019-11-28 17:06:13,290 INFO L246 CegarLoopResult]: For program point L120(line 120) no Hoare annotation was computed. [2019-11-28 17:06:13,290 INFO L246 CegarLoopResult]: For program point L54(lines 54 427) no Hoare annotation was computed. [2019-11-28 17:06:13,290 INFO L246 CegarLoopResult]: For program point L236(lines 236 326) no Hoare annotation was computed. [2019-11-28 17:06:13,290 INFO L246 CegarLoopResult]: For program point L170(lines 170 352) no Hoare annotation was computed. [2019-11-28 17:06:13,290 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 172) no Hoare annotation was computed. [2019-11-28 17:06:13,291 INFO L246 CegarLoopResult]: For program point L369(line 369) no Hoare annotation was computed. [2019-11-28 17:06:13,291 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION(line 381) no Hoare annotation was computed. [2019-11-28 17:06:13,291 INFO L246 CegarLoopResult]: For program point L303(line 303) no Hoare annotation was computed. [2019-11-28 17:06:13,291 INFO L246 CegarLoopResult]: For program point L138(lines 138 357) no Hoare annotation was computed. [2019-11-28 17:06:13,291 INFO L246 CegarLoopResult]: For program point L221(line 221) no Hoare annotation was computed. [2019-11-28 17:06:13,291 INFO L246 CegarLoopResult]: For program point L56(lines 56 422) no Hoare annotation was computed. [2019-11-28 17:06:13,291 INFO L246 CegarLoopResult]: For program point L238(line 238) no Hoare annotation was computed. [2019-11-28 17:06:13,291 INFO L246 CegarLoopResult]: For program point L172(line 172) no Hoare annotation was computed. [2019-11-28 17:06:13,291 INFO L246 CegarLoopResult]: For program point L106(lines 106 400) no Hoare annotation was computed. [2019-11-28 17:06:13,292 INFO L242 CegarLoopResult]: At program point L387(lines 124 398) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~main__cp~0 1) ULTIMATE.start_main_~main__urilen~0) (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~0) (let ((.cse0 (<= 1 ULTIMATE.start_main_~main__cp~0)) (.cse1 (< 0 ULTIMATE.start_main_~main__scheme~0)) (.cse2 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~1))) (.cse3 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~3))) (or (and (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~2) .cse0 .cse1 .cse2 .cse3) (and (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~2)) .cse0 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~17)) .cse1 .cse2 .cse3 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~16))))) [2019-11-28 17:06:13,292 INFO L246 CegarLoopResult]: For program point L189(lines 189 349) no Hoare annotation was computed. [2019-11-28 17:06:13,292 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 209) no Hoare annotation was computed. [2019-11-28 17:06:13,292 INFO L246 CegarLoopResult]: For program point L90(lines 90 407) no Hoare annotation was computed. [2019-11-28 17:06:13,292 INFO L246 CegarLoopResult]: For program point L24(lines 24 432) no Hoare annotation was computed. [2019-11-28 17:06:13,292 INFO L246 CegarLoopResult]: For program point L140(line 140) no Hoare annotation was computed. [2019-11-28 17:06:13,293 INFO L242 CegarLoopResult]: At program point L322(lines 257 323) the Hoare annotation is: (let ((.cse0 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~6))) (.cse1 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~5))) (.cse2 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~10)) (.cse3 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~7))) (.cse4 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~4)) (.cse5 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~8))) (.cse6 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~2))) (.cse7 (<= 1 ULTIMATE.start_main_~main__cp~0)) (.cse8 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~11))) (.cse9 (< 0 ULTIMATE.start_main_~main__scheme~0)) (.cse10 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~1))) (.cse11 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~3)) (.cse13 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~0)) (.cse12 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~9)) (.cse14 (< (+ ULTIMATE.start_main_~main__cp~0 1) ULTIMATE.start_main_~main__urilen~0))) (or (and .cse0 .cse1 .cse2 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~12) (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~13)) (<= 1 ULTIMATE.start_main_~main__c~0) .cse3 .cse4 .cse5 .cse6 .cse7 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~14)) (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~15)) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 (<= (+ ULTIMATE.start_main_~main__c~0 2) ULTIMATE.start_main_~main__tokenlen~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse12 .cse14 (= ULTIMATE.start_main_~main__c~0 0)))) [2019-11-28 17:06:13,293 INFO L246 CegarLoopResult]: For program point L289(lines 289 313) no Hoare annotation was computed. [2019-11-28 17:06:13,293 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 17:06:13,293 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 184) no Hoare annotation was computed. [2019-11-28 17:06:13,293 INFO L246 CegarLoopResult]: For program point L157(lines 157 354) no Hoare annotation was computed. [2019-11-28 17:06:13,293 INFO L246 CegarLoopResult]: For program point L58(lines 58 417) no Hoare annotation was computed. [2019-11-28 17:06:13,293 INFO L242 CegarLoopResult]: At program point L405(lines 99 406) the Hoare annotation is: (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~0)) [2019-11-28 17:06:13,293 INFO L246 CegarLoopResult]: For program point L207(lines 207 341) no Hoare annotation was computed. [2019-11-28 17:06:13,293 INFO L246 CegarLoopResult]: For program point L108(line 108) no Hoare annotation was computed. [2019-11-28 17:06:13,294 INFO L246 CegarLoopResult]: For program point L42(lines 42 429) no Hoare annotation was computed. [2019-11-28 17:06:13,294 INFO L246 CegarLoopResult]: For program point L257(lines 257 323) no Hoare annotation was computed. [2019-11-28 17:06:13,294 INFO L246 CegarLoopResult]: For program point L92(line 92) no Hoare annotation was computed. [2019-11-28 17:06:13,294 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 108) no Hoare annotation was computed. [2019-11-28 17:06:13,294 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 279) no Hoare annotation was computed. [2019-11-28 17:06:13,294 INFO L246 CegarLoopResult]: For program point L291(line 291) no Hoare annotation was computed. [2019-11-28 17:06:13,294 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 221) no Hoare annotation was computed. [2019-11-28 17:06:13,294 INFO L246 CegarLoopResult]: For program point L60(lines 60 412) no Hoare annotation was computed. [2019-11-28 17:06:13,294 INFO L246 CegarLoopResult]: For program point L209(line 209) no Hoare annotation was computed. [2019-11-28 17:06:13,295 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 140) no Hoare annotation was computed. [2019-11-28 17:06:13,295 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 17:06:13,295 INFO L246 CegarLoopResult]: For program point L78(lines 78 409) no Hoare annotation was computed. [2019-11-28 17:06:13,295 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 303) no Hoare annotation was computed. [2019-11-28 17:06:13,295 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 120) no Hoare annotation was computed. [2019-11-28 17:06:13,295 INFO L242 CegarLoopResult]: At program point L310(lines 225 339) the Hoare annotation is: (let ((.cse2 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~10)) (.cse8 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~11))) (.cse0 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~6))) (.cse1 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~5))) (.cse3 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~7))) (.cse4 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~4)) (.cse5 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~8))) (.cse6 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~2))) (.cse7 (<= 1 ULTIMATE.start_main_~main__cp~0)) (.cse9 (< 0 ULTIMATE.start_main_~main__scheme~0)) (.cse10 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~1))) (.cse11 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~3)) (.cse12 (<= (+ ULTIMATE.start_main_~main__cp~0 1) ULTIMATE.start_main_~main__urilen~0)) (.cse13 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~9)) (.cse14 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~0)) (.cse15 (= ULTIMATE.start_main_~main__c~0 0))) (or (and .cse0 .cse1 .cse2 (<= (+ ULTIMATE.start_main_~main__c~0 2) ULTIMATE.start_main_~main__tokenlen~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~12) (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~13)) (<= 1 ULTIMATE.start_main_~main__c~0) .cse3 .cse4 .cse5 .cse6 .cse7 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~14)) (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~15)) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 (<= (+ ULTIMATE.start_main_~main__cp~0 2) ULTIMATE.start_main_~main__urilen~0) .cse9 .cse10 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~8) .cse11 .cse12 .cse13 .cse14 .cse15))) [2019-11-28 17:06:13,295 INFO L246 CegarLoopResult]: For program point L277(lines 277 315) no Hoare annotation was computed. [2019-11-28 17:06:13,295 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 291) no Hoare annotation was computed. [2019-11-28 17:06:13,296 INFO L249 CegarLoopResult]: At program point L426(lines 8 434) the Hoare annotation is: true [2019-11-28 17:06:13,296 INFO L246 CegarLoopResult]: For program point L30(lines 30 431) no Hoare annotation was computed. [2019-11-28 17:06:13,296 INFO L246 CegarLoopResult]: For program point L80(line 80) no Hoare annotation was computed. [2019-11-28 17:06:13,296 INFO L246 CegarLoopResult]: For program point L229(lines 229 333) no Hoare annotation was computed. [2019-11-28 17:06:13,296 INFO L246 CegarLoopResult]: For program point L130(lines 130 392) no Hoare annotation was computed. [2019-11-28 17:06:13,296 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 152) no Hoare annotation was computed. [2019-11-28 17:06:13,296 INFO L246 CegarLoopResult]: For program point L279(line 279) no Hoare annotation was computed. [2019-11-28 17:06:13,296 INFO L246 CegarLoopResult]: For program point L48(lines 48 428) no Hoare annotation was computed. [2019-11-28 17:06:13,296 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION(line 369) no Hoare annotation was computed. [2019-11-28 17:06:13,297 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-28 17:06:13,297 INFO L246 CegarLoopResult]: For program point L379(lines 379 388) no Hoare annotation was computed. [2019-11-28 17:06:13,297 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 80) no Hoare annotation was computed. [2019-11-28 17:06:13,297 INFO L242 CegarLoopResult]: At program point L396(lines 126 397) the Hoare annotation is: (let ((.cse0 (< ULTIMATE.start_main_~main__cp~0 ULTIMATE.start_main_~main__urilen~0)) (.cse1 (let ((.cse3 (<= 1 ULTIMATE.start_main_~main__cp~0)) (.cse4 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~0))) (.cse5 (< 0 ULTIMATE.start_main_~main__scheme~0)) (.cse6 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~3))) (.cse7 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~1)))) (or (and (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~2) .cse3 .cse4 .cse5 .cse6 .cse7) (and (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~16)) (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~2)) .cse3 .cse4 .cse5 .cse6 .cse7)))) (.cse2 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~3))) (or (and (= (+ ULTIMATE.start_main_~main__cp~0 1) ULTIMATE.start_main_~main__urilen~0) .cse0 .cse1 .cse2) (and .cse0 .cse1 .cse2 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~0)))) [2019-11-28 17:06:13,297 INFO L246 CegarLoopResult]: For program point L99(lines 99 406) no Hoare annotation was computed. [2019-11-28 17:06:13,297 INFO L246 CegarLoopResult]: For program point L66(lines 66 411) no Hoare annotation was computed. [2019-11-28 17:06:13,297 INFO L246 CegarLoopResult]: For program point L248(lines 248 324) no Hoare annotation was computed. [2019-11-28 17:06:13,297 INFO L246 CegarLoopResult]: For program point L182(lines 182 350) no Hoare annotation was computed. [2019-11-28 17:06:13,297 INFO L246 CegarLoopResult]: For program point L265(lines 265 317) no Hoare annotation was computed. [2019-11-28 17:06:13,298 INFO L246 CegarLoopResult]: For program point L199(lines 199 348) no Hoare annotation was computed. [2019-11-28 17:06:13,298 INFO L246 CegarLoopResult]: For program point L381(line 381) no Hoare annotation was computed. [2019-11-28 17:06:13,298 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 238) no Hoare annotation was computed. [2019-11-28 17:06:13,298 INFO L246 CegarLoopResult]: For program point L150(lines 150 355) no Hoare annotation was computed. [2019-11-28 17:06:13,298 INFO L246 CegarLoopResult]: For program point L18(lines 18 433) no Hoare annotation was computed. [2019-11-28 17:06:13,327 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 05:06:13 BoogieIcfgContainer [2019-11-28 17:06:13,327 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 17:06:13,327 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 17:06:13,327 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 17:06:13,328 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 17:06:13,328 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:06:06" (3/4) ... [2019-11-28 17:06:13,332 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 17:06:13,346 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-28 17:06:13,347 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 17:06:13,432 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 17:06:13,432 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 17:06:13,433 INFO L168 Benchmark]: Toolchain (without parser) took 8361.20 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 262.7 MB). Free memory was 961.7 MB in the beginning and 1.0 GB in the end (delta: -50.1 MB). Peak memory consumption was 212.6 MB. Max. memory is 11.5 GB. [2019-11-28 17:06:13,434 INFO L168 Benchmark]: CDTParser took 0.76 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 17:06:13,434 INFO L168 Benchmark]: CACSL2BoogieTranslator took 400.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -172.2 MB). Peak memory consumption was 27.2 MB. Max. memory is 11.5 GB. [2019-11-28 17:06:13,434 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.48 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 17:06:13,435 INFO L168 Benchmark]: Boogie Preprocessor took 25.80 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: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 11.5 GB. [2019-11-28 17:06:13,435 INFO L168 Benchmark]: RCFGBuilder took 469.38 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: 31.1 MB). Peak memory consumption was 31.1 MB. Max. memory is 11.5 GB. [2019-11-28 17:06:13,436 INFO L168 Benchmark]: TraceAbstraction took 7311.89 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 119.0 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 79.7 MB). Peak memory consumption was 344.6 MB. Max. memory is 11.5 GB. [2019-11-28 17:06:13,436 INFO L168 Benchmark]: Witness Printer took 104.82 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2019-11-28 17:06:13,438 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.76 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 400.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -172.2 MB). Peak memory consumption was 27.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 44.48 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.80 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: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 469.38 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: 31.1 MB). Peak memory consumption was 31.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7311.89 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 119.0 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 79.7 MB). Peak memory consumption was 344.6 MB. Max. memory is 11.5 GB. * Witness Printer took 104.82 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 92]: 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: 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: 303]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - 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: 80]: 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: 267]: 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: 152]: 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: 238]: 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 - PositiveResult [Line: 279]: 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: 221]: 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: (main__cp + 1 <= main__urilen && 1 == __VERIFIER_assert__cond) && (((((1 == __VERIFIER_assert__cond && 1 <= main__cp) && 0 < main__scheme) && !(0 == __VERIFIER_assert__cond)) && 1 == __VERIFIER_assert__cond) || ((((((!(0 == __VERIFIER_assert__cond) && 1 <= main__cp) && !(0 == __VERIFIER_assert__cond)) && 0 < main__scheme) && !(0 == __VERIFIER_assert__cond)) && 1 == __VERIFIER_assert__cond) && 1 == __VERIFIER_assert__cond)) - InvariantResult [Line: 257]: Loop Invariant Derived loop invariant: (((((((((((((((((((!(0 == __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && 1 == __VERIFIER_assert__cond) && 1 == __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && 1 <= main__c) && !(0 == __VERIFIER_assert__cond)) && 1 == __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && 1 <= main__cp) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && 0 < main__scheme) && !(0 == __VERIFIER_assert__cond)) && 1 == __VERIFIER_assert__cond) && 1 == __VERIFIER_assert__cond) && 1 == __VERIFIER_assert__cond) && main__cp + 1 < main__urilen) || ((((((((((((((((!(0 == __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && 1 == __VERIFIER_assert__cond) && main__c + 2 <= main__tokenlen) && !(0 == __VERIFIER_assert__cond)) && 1 == __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && 1 <= main__cp) && !(0 == __VERIFIER_assert__cond)) && 0 < main__scheme) && !(0 == __VERIFIER_assert__cond)) && 1 == __VERIFIER_assert__cond) && 1 == __VERIFIER_assert__cond) && 1 == __VERIFIER_assert__cond) && main__cp + 1 < main__urilen) && main__c == 0) - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: (((main__cp + 1 == main__urilen && main__cp < main__urilen) && ((((((1 == __VERIFIER_assert__cond && 1 <= main__cp) && !(0 == __VERIFIER_assert__cond)) && 0 < main__scheme) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) || ((((((!(0 == __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && 1 <= main__cp) && !(0 == __VERIFIER_assert__cond)) && 0 < main__scheme) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)))) && 1 == __VERIFIER_assert__cond) || (((main__cp < main__urilen && ((((((1 == __VERIFIER_assert__cond && 1 <= main__cp) && !(0 == __VERIFIER_assert__cond)) && 0 < main__scheme) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) || ((((((!(0 == __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && 1 <= main__cp) && !(0 == __VERIFIER_assert__cond)) && 0 < main__scheme) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)))) && 1 == __VERIFIER_assert__cond) && 1 == __VERIFIER_assert__cond) - InvariantResult [Line: 225]: Loop Invariant Derived loop invariant: (((((((((((((((((!(0 == __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && 1 == __VERIFIER_assert__cond) && main__c + 2 <= main__tokenlen) && !(0 == __VERIFIER_assert__cond)) && 1 == __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && 1 <= main__cp) && !(0 == __VERIFIER_assert__cond)) && 0 < main__scheme) && !(0 == __VERIFIER_assert__cond)) && 1 == __VERIFIER_assert__cond) && main__cp + 1 <= main__urilen) && 1 == __VERIFIER_assert__cond) && 1 == __VERIFIER_assert__cond) && main__c == 0) || (((((((((((((((((((!(0 == __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && 1 == __VERIFIER_assert__cond) && 1 == __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && 1 <= main__c) && !(0 == __VERIFIER_assert__cond)) && 1 == __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && 1 <= main__cp) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && 0 < main__scheme) && !(0 == __VERIFIER_assert__cond)) && 1 == __VERIFIER_assert__cond) && main__cp + 1 <= main__urilen) && 1 == __VERIFIER_assert__cond) && 1 == __VERIFIER_assert__cond)) || (((((((((((((((!(0 == __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && 1 == __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && 1 <= main__cp) && main__cp + 2 <= main__urilen) && 0 < main__scheme) && !(0 == __VERIFIER_assert__cond)) && 1 == __VERIFIER_assert__cond) && 1 == __VERIFIER_assert__cond) && main__cp + 1 <= main__urilen) && 1 == __VERIFIER_assert__cond) && 1 == __VERIFIER_assert__cond) && main__c == 0) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: !(0 == __VERIFIER_assert__cond) - InvariantResult [Line: 8]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 82 locations, 18 error locations. Result: SAFE, OverallTime: 5.7s, OverallIterations: 24, TraceHistogramMax: 2, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.4s, HoareTripleCheckerStatistics: 1307 SDtfs, 2367 SDslu, 1508 SDs, 0 SdLazy, 1173 SolverSat, 131 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 319 GetRequests, 179 SyntacticMatches, 15 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.2s 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 DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 24 MinimizatonAttempts, 291 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 16 NumberOfFragments, 513 HoareAnnotationTreeSize, 6 FomulaSimplifications, 56097 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 6 FomulaSimplificationsInter, 4363 FormulaSimplificationTreeSizeReductionInter, 1.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 845 NumberOfCodeBlocks, 845 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 817 ConstructedInterpolants, 0 QuantifiedInterpolants, 57314 SizeOfPredicates, 25 NumberOfNonLiveVariables, 483 ConjunctsInSsa, 55 ConjunctsInUnsatCore, 28 InterpolantComputations, 21 PerfectInterpolantSequences, 16/33 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...