./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30f4e4ab 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-get-tag.i.v+nlh-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 edfcf451b435e6b30ae37c75ee1e2f5c8348550f ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 00:02:00,556 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 00:02:00,560 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 00:02:00,577 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 00:02:00,577 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 00:02:00,580 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 00:02:00,582 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 00:02:00,591 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 00:02:00,594 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 00:02:00,597 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 00:02:00,599 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 00:02:00,601 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 00:02:00,602 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 00:02:00,605 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 00:02:00,606 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 00:02:00,608 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 00:02:00,610 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 00:02:00,612 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 00:02:00,614 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 00:02:00,618 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 00:02:00,623 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 00:02:00,627 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 00:02:00,628 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 00:02:00,630 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 00:02:00,634 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 00:02:00,634 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 00:02:00,634 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 00:02:00,636 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 00:02:00,638 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 00:02:00,639 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 00:02:00,639 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 00:02:00,640 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 00:02:00,641 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 00:02:00,642 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 00:02:00,643 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 00:02:00,643 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 00:02:00,644 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 00:02:00,645 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 00:02:00,645 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 00:02:00,646 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 00:02:00,647 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 00:02:00,648 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 00:02:00,682 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 00:02:00,684 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 00:02:00,685 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 00:02:00,686 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 00:02:00,686 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 00:02:00,686 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 00:02:00,686 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 00:02:00,687 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 00:02:00,687 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 00:02:00,687 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 00:02:00,687 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 00:02:00,688 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 00:02:00,688 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 00:02:00,688 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 00:02:00,689 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 00:02:00,689 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 00:02:00,689 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 00:02:00,689 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 00:02:00,690 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 00:02:00,690 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 00:02:00,690 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 00:02:00,690 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 00:02:00,691 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 00:02:00,691 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 00:02:00,691 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 00:02:00,692 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 00:02:00,692 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 00:02:00,692 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 00:02:00,692 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 -> edfcf451b435e6b30ae37c75ee1e2f5c8348550f [2019-11-28 00:02:00,995 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 00:02:01,014 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 00:02:01,018 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 00:02:01,020 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 00:02:01,021 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 00:02:01,023 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c [2019-11-28 00:02:01,096 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a86e5bf92/9c4fa4458e86428994bc48fdaee2f051/FLAG7a81b1fcb [2019-11-28 00:02:01,578 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 00:02:01,579 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c [2019-11-28 00:02:01,590 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a86e5bf92/9c4fa4458e86428994bc48fdaee2f051/FLAG7a81b1fcb [2019-11-28 00:02:01,950 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a86e5bf92/9c4fa4458e86428994bc48fdaee2f051 [2019-11-28 00:02:01,954 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 00:02:01,956 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 00:02:01,957 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 00:02:01,958 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 00:02:01,961 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 00:02:01,962 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:02:01" (1/1) ... [2019-11-28 00:02:01,965 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ce6540c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:02:01, skipping insertion in model container [2019-11-28 00:02:01,966 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:02:01" (1/1) ... [2019-11-28 00:02:01,974 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 00:02:02,018 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 00:02:02,285 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:02:02,292 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 00:02:02,339 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:02:02,413 INFO L208 MainTranslator]: Completed translation [2019-11-28 00:02:02,413 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:02:02 WrapperNode [2019-11-28 00:02:02,413 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 00:02:02,414 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 00:02:02,414 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 00:02:02,415 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 00:02:02,423 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:02:02" (1/1) ... [2019-11-28 00:02:02,430 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:02:02" (1/1) ... [2019-11-28 00:02:02,458 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 00:02:02,459 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 00:02:02,459 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 00:02:02,459 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 00:02:02,468 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:02:02" (1/1) ... [2019-11-28 00:02:02,468 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:02:02" (1/1) ... [2019-11-28 00:02:02,471 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:02:02" (1/1) ... [2019-11-28 00:02:02,471 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:02:02" (1/1) ... [2019-11-28 00:02:02,476 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:02:02" (1/1) ... [2019-11-28 00:02:02,480 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:02:02" (1/1) ... [2019-11-28 00:02:02,482 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:02:02" (1/1) ... [2019-11-28 00:02:02,485 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 00:02:02,486 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 00:02:02,486 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 00:02:02,487 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 00:02:02,488 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:02:02" (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 00:02:02,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 00:02:02,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 00:02:02,959 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 00:02:02,959 INFO L297 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-28 00:02:02,961 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:02:02 BoogieIcfgContainer [2019-11-28 00:02:02,961 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 00:02:02,962 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 00:02:02,962 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 00:02:02,965 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 00:02:02,965 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 12:02:01" (1/3) ... [2019-11-28 00:02:02,966 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fd3f9b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:02:02, skipping insertion in model container [2019-11-28 00:02:02,967 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:02:02" (2/3) ... [2019-11-28 00:02:02,967 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fd3f9b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:02:02, skipping insertion in model container [2019-11-28 00:02:02,967 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:02:02" (3/3) ... [2019-11-28 00:02:02,969 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.v+nlh-reducer.c [2019-11-28 00:02:02,979 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 00:02:02,986 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2019-11-28 00:02:02,999 INFO L249 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2019-11-28 00:02:03,025 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 00:02:03,026 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 00:02:03,026 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 00:02:03,026 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 00:02:03,027 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 00:02:03,027 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 00:02:03,027 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 00:02:03,027 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 00:02:03,049 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states. [2019-11-28 00:02:03,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-28 00:02:03,056 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:02:03,057 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:02:03,058 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.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 00:02:03,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:02:03,064 INFO L82 PathProgramCache]: Analyzing trace with hash 123971630, now seen corresponding path program 1 times [2019-11-28 00:02:03,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:02:03,075 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323187304] [2019-11-28 00:02:03,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:02:03,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:02:03,336 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 00:02:03,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323187304] [2019-11-28 00:02:03,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:02:03,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:02:03,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212816843] [2019-11-28 00:02:03,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 00:02:03,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:02:03,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 00:02:03,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 00:02:03,364 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 4 states. [2019-11-28 00:02:03,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:02:03,517 INFO L93 Difference]: Finished difference Result 130 states and 170 transitions. [2019-11-28 00:02:03,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 00:02:03,519 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-11-28 00:02:03,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:02:03,530 INFO L225 Difference]: With dead ends: 130 [2019-11-28 00:02:03,531 INFO L226 Difference]: Without dead ends: 109 [2019-11-28 00:02:03,534 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 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 00:02:03,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-11-28 00:02:03,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 65. [2019-11-28 00:02:03,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-28 00:02:03,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2019-11-28 00:02:03,579 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 8 [2019-11-28 00:02:03,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:02:03,580 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2019-11-28 00:02:03,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 00:02:03,580 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2019-11-28 00:02:03,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-28 00:02:03,581 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:02:03,581 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:02:03,582 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.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 00:02:03,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:02:03,583 INFO L82 PathProgramCache]: Analyzing trace with hash 120336139, now seen corresponding path program 1 times [2019-11-28 00:02:03,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:02:03,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099731538] [2019-11-28 00:02:03,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:02:03,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:02:03,622 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 00:02:03,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099731538] [2019-11-28 00:02:03,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:02:03,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:02:03,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235486900] [2019-11-28 00:02:03,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 00:02:03,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:02:03,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 00:02:03,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 00:02:03,628 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 4 states. [2019-11-28 00:02:03,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:02:03,717 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2019-11-28 00:02:03,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 00:02:03,718 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-11-28 00:02:03,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:02:03,719 INFO L225 Difference]: With dead ends: 65 [2019-11-28 00:02:03,719 INFO L226 Difference]: Without dead ends: 63 [2019-11-28 00:02:03,721 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 00:02:03,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-28 00:02:03,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-11-28 00:02:03,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-28 00:02:03,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2019-11-28 00:02:03,730 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 8 [2019-11-28 00:02:03,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:02:03,731 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2019-11-28 00:02:03,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 00:02:03,731 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2019-11-28 00:02:03,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-28 00:02:03,732 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:02:03,732 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:02:03,733 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.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 00:02:03,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:02:03,734 INFO L82 PathProgramCache]: Analyzing trace with hash -564542931, now seen corresponding path program 1 times [2019-11-28 00:02:03,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:02:03,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681185931] [2019-11-28 00:02:03,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:02:03,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:02:03,795 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 00:02:03,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681185931] [2019-11-28 00:02:03,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:02:03,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:02:03,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092149478] [2019-11-28 00:02:03,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 00:02:03,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:02:03,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 00:02:03,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 00:02:03,798 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 4 states. [2019-11-28 00:02:03,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:02:03,908 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2019-11-28 00:02:03,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 00:02:03,908 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-11-28 00:02:03,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:02:03,909 INFO L225 Difference]: With dead ends: 69 [2019-11-28 00:02:03,910 INFO L226 Difference]: Without dead ends: 67 [2019-11-28 00:02:03,910 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 00:02:03,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-11-28 00:02:03,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2019-11-28 00:02:03,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-28 00:02:03,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2019-11-28 00:02:03,919 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 9 [2019-11-28 00:02:03,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:02:03,919 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2019-11-28 00:02:03,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 00:02:03,920 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2019-11-28 00:02:03,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 00:02:03,921 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:02:03,921 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:02:03,921 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.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 00:02:03,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:02:03,922 INFO L82 PathProgramCache]: Analyzing trace with hash -429055130, now seen corresponding path program 1 times [2019-11-28 00:02:03,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:02:03,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681302073] [2019-11-28 00:02:03,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:02:03,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:02:04,000 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 00:02:04,000 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681302073] [2019-11-28 00:02:04,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:02:04,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:02:04,001 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714883467] [2019-11-28 00:02:04,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:02:04,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:02:04,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:02:04,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:02:04,003 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 5 states. [2019-11-28 00:02:04,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:02:04,085 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2019-11-28 00:02:04,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 00:02:04,086 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-11-28 00:02:04,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:02:04,087 INFO L225 Difference]: With dead ends: 66 [2019-11-28 00:02:04,087 INFO L226 Difference]: Without dead ends: 64 [2019-11-28 00:02:04,088 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-28 00:02:04,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-28 00:02:04,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-11-28 00:02:04,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-28 00:02:04,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2019-11-28 00:02:04,095 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 11 [2019-11-28 00:02:04,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:02:04,096 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2019-11-28 00:02:04,096 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:02:04,096 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2019-11-28 00:02:04,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 00:02:04,097 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:02:04,097 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:02:04,097 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.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 00:02:04,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:02:04,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1359750351, now seen corresponding path program 1 times [2019-11-28 00:02:04,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:02:04,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574769909] [2019-11-28 00:02:04,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:02:04,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:02:04,148 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 00:02:04,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574769909] [2019-11-28 00:02:04,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:02:04,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:02:04,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682139422] [2019-11-28 00:02:04,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:02:04,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:02:04,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:02:04,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:02:04,151 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 5 states. [2019-11-28 00:02:04,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:02:04,265 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2019-11-28 00:02:04,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 00:02:04,266 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-11-28 00:02:04,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:02:04,267 INFO L225 Difference]: With dead ends: 65 [2019-11-28 00:02:04,267 INFO L226 Difference]: Without dead ends: 63 [2019-11-28 00:02:04,268 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-28 00:02:04,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-28 00:02:04,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2019-11-28 00:02:04,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-28 00:02:04,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2019-11-28 00:02:04,275 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 11 [2019-11-28 00:02:04,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:02:04,275 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2019-11-28 00:02:04,276 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:02:04,276 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2019-11-28 00:02:04,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-28 00:02:04,278 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:02:04,278 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:02:04,279 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.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 00:02:04,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:02:04,279 INFO L82 PathProgramCache]: Analyzing trace with hash -415802953, now seen corresponding path program 1 times [2019-11-28 00:02:04,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:02:04,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046034579] [2019-11-28 00:02:04,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:02:04,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:02:04,351 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 00:02:04,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046034579] [2019-11-28 00:02:04,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:02:04,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:02:04,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422974782] [2019-11-28 00:02:04,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 00:02:04,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:02:04,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 00:02:04,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 00:02:04,358 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand 4 states. [2019-11-28 00:02:04,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:02:04,424 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2019-11-28 00:02:04,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 00:02:04,425 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-28 00:02:04,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:02:04,426 INFO L225 Difference]: With dead ends: 63 [2019-11-28 00:02:04,426 INFO L226 Difference]: Without dead ends: 59 [2019-11-28 00:02:04,427 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 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 00:02:04,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-28 00:02:04,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2019-11-28 00:02:04,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-28 00:02:04,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2019-11-28 00:02:04,434 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 12 [2019-11-28 00:02:04,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:02:04,436 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2019-11-28 00:02:04,436 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 00:02:04,436 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2019-11-28 00:02:04,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-28 00:02:04,437 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:02:04,437 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:02:04,438 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.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 00:02:04,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:02:04,440 INFO L82 PathProgramCache]: Analyzing trace with hash -415312395, now seen corresponding path program 1 times [2019-11-28 00:02:04,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:02:04,441 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543032053] [2019-11-28 00:02:04,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:02:04,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:02:04,536 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 00:02:04,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543032053] [2019-11-28 00:02:04,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:02:04,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:02:04,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669218826] [2019-11-28 00:02:04,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:02:04,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:02:04,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:02:04,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:02:04,539 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand 5 states. [2019-11-28 00:02:04,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:02:04,679 INFO L93 Difference]: Finished difference Result 100 states and 107 transitions. [2019-11-28 00:02:04,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 00:02:04,681 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-11-28 00:02:04,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:02:04,682 INFO L225 Difference]: With dead ends: 100 [2019-11-28 00:02:04,683 INFO L226 Difference]: Without dead ends: 98 [2019-11-28 00:02:04,683 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-28 00:02:04,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-11-28 00:02:04,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 56. [2019-11-28 00:02:04,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-11-28 00:02:04,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2019-11-28 00:02:04,699 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 12 [2019-11-28 00:02:04,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:02:04,700 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2019-11-28 00:02:04,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:02:04,701 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2019-11-28 00:02:04,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-28 00:02:04,702 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:02:04,703 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:02:04,703 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.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 00:02:04,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:02:04,705 INFO L82 PathProgramCache]: Analyzing trace with hash 797416153, now seen corresponding path program 1 times [2019-11-28 00:02:04,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:02:04,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118259883] [2019-11-28 00:02:04,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:02:04,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:02:04,774 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 00:02:04,775 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118259883] [2019-11-28 00:02:04,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:02:04,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:02:04,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400843180] [2019-11-28 00:02:04,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 00:02:04,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:02:04,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 00:02:04,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 00:02:04,779 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 4 states. [2019-11-28 00:02:04,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:02:04,845 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2019-11-28 00:02:04,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 00:02:04,846 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-28 00:02:04,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:02:04,846 INFO L225 Difference]: With dead ends: 57 [2019-11-28 00:02:04,847 INFO L226 Difference]: Without dead ends: 53 [2019-11-28 00:02:04,847 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 00:02:04,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-28 00:02:04,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2019-11-28 00:02:04,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-28 00:02:04,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2019-11-28 00:02:04,859 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 12 [2019-11-28 00:02:04,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:02:04,859 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2019-11-28 00:02:04,860 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 00:02:04,860 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2019-11-28 00:02:04,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-28 00:02:04,863 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:02:04,863 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:02:04,863 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.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 00:02:04,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:02:04,864 INFO L82 PathProgramCache]: Analyzing trace with hash 10221853, now seen corresponding path program 1 times [2019-11-28 00:02:04,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:02:04,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568549044] [2019-11-28 00:02:04,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:02:04,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:02:04,964 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 00:02:04,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568549044] [2019-11-28 00:02:04,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:02:04,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:02:04,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771203087] [2019-11-28 00:02:04,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:02:04,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:02:04,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:02:04,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:02:04,969 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 5 states. [2019-11-28 00:02:05,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:02:05,095 INFO L93 Difference]: Finished difference Result 91 states and 98 transitions. [2019-11-28 00:02:05,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 00:02:05,096 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-11-28 00:02:05,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:02:05,097 INFO L225 Difference]: With dead ends: 91 [2019-11-28 00:02:05,097 INFO L226 Difference]: Without dead ends: 89 [2019-11-28 00:02:05,097 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 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 00:02:05,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-11-28 00:02:05,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 50. [2019-11-28 00:02:05,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-28 00:02:05,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2019-11-28 00:02:05,117 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 13 [2019-11-28 00:02:05,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:02:05,118 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2019-11-28 00:02:05,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:02:05,118 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2019-11-28 00:02:05,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-28 00:02:05,120 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:02:05,120 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:02:05,120 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.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 00:02:05,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:02:05,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1032848570, now seen corresponding path program 1 times [2019-11-28 00:02:05,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:02:05,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571161212] [2019-11-28 00:02:05,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:02:05,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:02:05,183 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 00:02:05,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571161212] [2019-11-28 00:02:05,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:02:05,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:02:05,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199868184] [2019-11-28 00:02:05,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:02:05,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:02:05,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:02:05,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:02:05,187 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 5 states. [2019-11-28 00:02:05,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:02:05,274 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2019-11-28 00:02:05,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 00:02:05,278 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-11-28 00:02:05,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:02:05,279 INFO L225 Difference]: With dead ends: 68 [2019-11-28 00:02:05,280 INFO L226 Difference]: Without dead ends: 66 [2019-11-28 00:02:05,280 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-28 00:02:05,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-11-28 00:02:05,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 48. [2019-11-28 00:02:05,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-28 00:02:05,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2019-11-28 00:02:05,293 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 13 [2019-11-28 00:02:05,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:02:05,296 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2019-11-28 00:02:05,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:02:05,297 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2019-11-28 00:02:05,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-28 00:02:05,300 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:02:05,300 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:02:05,301 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.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 00:02:05,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:02:05,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1031124666, now seen corresponding path program 1 times [2019-11-28 00:02:05,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:02:05,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427432008] [2019-11-28 00:02:05,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:02:05,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:02:05,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 00:02:05,387 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427432008] [2019-11-28 00:02:05,387 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:02:05,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 00:02:05,388 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023124991] [2019-11-28 00:02:05,388 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 00:02:05,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:02:05,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 00:02:05,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-28 00:02:05,389 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 6 states. [2019-11-28 00:02:05,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:02:05,462 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2019-11-28 00:02:05,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 00:02:05,462 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-11-28 00:02:05,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:02:05,463 INFO L225 Difference]: With dead ends: 49 [2019-11-28 00:02:05,463 INFO L226 Difference]: Without dead ends: 47 [2019-11-28 00:02:05,464 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-28 00:02:05,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-28 00:02:05,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2019-11-28 00:02:05,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-28 00:02:05,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2019-11-28 00:02:05,468 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 13 [2019-11-28 00:02:05,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:02:05,468 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2019-11-28 00:02:05,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 00:02:05,469 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2019-11-28 00:02:05,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 00:02:05,469 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:02:05,470 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:02:05,470 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.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 00:02:05,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:02:05,470 INFO L82 PathProgramCache]: Analyzing trace with hash 310078394, now seen corresponding path program 1 times [2019-11-28 00:02:05,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:02:05,471 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572554703] [2019-11-28 00:02:05,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:02:05,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:02:05,560 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 00:02:05,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572554703] [2019-11-28 00:02:05,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:02:05,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:02:05,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145876555] [2019-11-28 00:02:05,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:02:05,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:02:05,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:02:05,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:02:05,563 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 5 states. [2019-11-28 00:02:05,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:02:05,642 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2019-11-28 00:02:05,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 00:02:05,643 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-11-28 00:02:05,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:02:05,643 INFO L225 Difference]: With dead ends: 46 [2019-11-28 00:02:05,644 INFO L226 Difference]: Without dead ends: 44 [2019-11-28 00:02:05,644 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 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 00:02:05,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-11-28 00:02:05,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2019-11-28 00:02:05,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-28 00:02:05,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2019-11-28 00:02:05,647 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 14 [2019-11-28 00:02:05,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:02:05,647 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2019-11-28 00:02:05,648 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:02:05,648 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2019-11-28 00:02:05,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 00:02:05,648 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:02:05,648 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:02:05,649 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.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 00:02:05,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:02:05,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1953530500, now seen corresponding path program 1 times [2019-11-28 00:02:05,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:02:05,649 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092551097] [2019-11-28 00:02:05,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:02:05,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:02:05,713 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 00:02:05,713 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092551097] [2019-11-28 00:02:05,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:02:05,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:02:05,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617874127] [2019-11-28 00:02:05,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:02:05,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:02:05,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:02:05,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:02:05,718 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 5 states. [2019-11-28 00:02:05,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:02:05,805 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2019-11-28 00:02:05,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 00:02:05,805 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-11-28 00:02:05,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:02:05,806 INFO L225 Difference]: With dead ends: 57 [2019-11-28 00:02:05,806 INFO L226 Difference]: Without dead ends: 55 [2019-11-28 00:02:05,808 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 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 00:02:05,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-28 00:02:05,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 39. [2019-11-28 00:02:05,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-28 00:02:05,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-11-28 00:02:05,812 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 14 [2019-11-28 00:02:05,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:02:05,813 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-11-28 00:02:05,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:02:05,813 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-11-28 00:02:05,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 00:02:05,815 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:02:05,816 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:02:05,816 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.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 00:02:05,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:02:05,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1951983355, now seen corresponding path program 1 times [2019-11-28 00:02:05,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:02:05,820 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273081382] [2019-11-28 00:02:05,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:02:05,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:02:05,896 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 00:02:05,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273081382] [2019-11-28 00:02:05,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:02:05,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 00:02:05,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585750944] [2019-11-28 00:02:05,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 00:02:05,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:02:05,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 00:02:05,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-28 00:02:05,899 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 6 states. [2019-11-28 00:02:05,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:02:05,994 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2019-11-28 00:02:05,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 00:02:05,995 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-11-28 00:02:05,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:02:05,996 INFO L225 Difference]: With dead ends: 61 [2019-11-28 00:02:05,996 INFO L226 Difference]: Without dead ends: 59 [2019-11-28 00:02:05,997 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-28 00:02:05,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-28 00:02:06,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 37. [2019-11-28 00:02:06,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-28 00:02:06,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2019-11-28 00:02:06,001 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 14 [2019-11-28 00:02:06,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:02:06,002 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-11-28 00:02:06,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 00:02:06,002 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2019-11-28 00:02:06,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 00:02:06,004 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:02:06,004 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:02:06,005 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.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 00:02:06,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:02:06,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1900089420, now seen corresponding path program 1 times [2019-11-28 00:02:06,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:02:06,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035167418] [2019-11-28 00:02:06,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:02:06,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:02:06,103 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 00:02:06,104 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035167418] [2019-11-28 00:02:06,104 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:02:06,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 00:02:06,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784757795] [2019-11-28 00:02:06,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 00:02:06,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:02:06,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 00:02:06,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-28 00:02:06,106 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 6 states. [2019-11-28 00:02:06,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:02:06,197 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2019-11-28 00:02:06,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 00:02:06,198 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-11-28 00:02:06,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:02:06,198 INFO L225 Difference]: With dead ends: 37 [2019-11-28 00:02:06,199 INFO L226 Difference]: Without dead ends: 33 [2019-11-28 00:02:06,199 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-28 00:02:06,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-11-28 00:02:06,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-11-28 00:02:06,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-28 00:02:06,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-11-28 00:02:06,203 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 14 [2019-11-28 00:02:06,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:02:06,203 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-11-28 00:02:06,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 00:02:06,203 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-11-28 00:02:06,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 00:02:06,204 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:02:06,204 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:02:06,204 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.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 00:02:06,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:02:06,205 INFO L82 PathProgramCache]: Analyzing trace with hash -381937728, now seen corresponding path program 1 times [2019-11-28 00:02:06,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:02:06,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986194028] [2019-11-28 00:02:06,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:02:06,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:02:06,287 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 00:02:06,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986194028] [2019-11-28 00:02:06,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:02:06,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 00:02:06,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856545611] [2019-11-28 00:02:06,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 00:02:06,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:02:06,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 00:02:06,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-28 00:02:06,288 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 6 states. [2019-11-28 00:02:06,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:02:06,363 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2019-11-28 00:02:06,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 00:02:06,363 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-11-28 00:02:06,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:02:06,364 INFO L225 Difference]: With dead ends: 48 [2019-11-28 00:02:06,364 INFO L226 Difference]: Without dead ends: 46 [2019-11-28 00:02:06,364 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-28 00:02:06,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-11-28 00:02:06,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 31. [2019-11-28 00:02:06,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-28 00:02:06,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2019-11-28 00:02:06,367 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 15 [2019-11-28 00:02:06,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:02:06,368 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-11-28 00:02:06,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 00:02:06,368 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2019-11-28 00:02:06,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 00:02:06,368 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:02:06,369 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:02:06,369 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.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 00:02:06,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:02:06,369 INFO L82 PathProgramCache]: Analyzing trace with hash -441974753, now seen corresponding path program 1 times [2019-11-28 00:02:06,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:02:06,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042191179] [2019-11-28 00:02:06,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:02:06,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:02:06,407 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 00:02:06,407 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042191179] [2019-11-28 00:02:06,407 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:02:06,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 00:02:06,408 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928397754] [2019-11-28 00:02:06,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 00:02:06,408 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:02:06,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 00:02:06,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-28 00:02:06,409 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 6 states. [2019-11-28 00:02:06,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:02:06,511 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2019-11-28 00:02:06,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 00:02:06,512 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-11-28 00:02:06,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:02:06,514 INFO L225 Difference]: With dead ends: 52 [2019-11-28 00:02:06,515 INFO L226 Difference]: Without dead ends: 50 [2019-11-28 00:02:06,515 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 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 00:02:06,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-11-28 00:02:06,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 29. [2019-11-28 00:02:06,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-28 00:02:06,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2019-11-28 00:02:06,519 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 16 [2019-11-28 00:02:06,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:02:06,520 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-11-28 00:02:06,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 00:02:06,520 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2019-11-28 00:02:06,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 00:02:06,520 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:02:06,520 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:02:06,521 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.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 00:02:06,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:02:06,521 INFO L82 PathProgramCache]: Analyzing trace with hash -816311340, now seen corresponding path program 1 times [2019-11-28 00:02:06,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:02:06,521 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100573619] [2019-11-28 00:02:06,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:02:06,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:02:06,547 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 00:02:06,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100573619] [2019-11-28 00:02:06,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:02:06,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:02:06,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764002831] [2019-11-28 00:02:06,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 00:02:06,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:02:06,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 00:02:06,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 00:02:06,549 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 4 states. [2019-11-28 00:02:06,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:02:06,603 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2019-11-28 00:02:06,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 00:02:06,603 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-11-28 00:02:06,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:02:06,604 INFO L225 Difference]: With dead ends: 33 [2019-11-28 00:02:06,604 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 00:02:06,604 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 00:02:06,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 00:02:06,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 00:02:06,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 00:02:06,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 00:02:06,605 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2019-11-28 00:02:06,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:02:06,606 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 00:02:06,606 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 00:02:06,606 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 00:02:06,606 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 00:02:06,609 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 00:02:06,918 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 184) no Hoare annotation was computed. [2019-11-28 00:02:06,918 INFO L246 CegarLoopResult]: For program point L27(lines 27 363) no Hoare annotation was computed. [2019-11-28 00:02:06,918 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 51) no Hoare annotation was computed. [2019-11-28 00:02:06,918 INFO L246 CegarLoopResult]: For program point L184(line 184) no Hoare annotation was computed. [2019-11-28 00:02:06,918 INFO L246 CegarLoopResult]: For program point L19(lines 19 364) no Hoare annotation was computed. [2019-11-28 00:02:06,918 INFO L246 CegarLoopResult]: For program point L110(line 110) no Hoare annotation was computed. [2019-11-28 00:02:06,918 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 274) no Hoare annotation was computed. [2019-11-28 00:02:06,919 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 110) no Hoare annotation was computed. [2019-11-28 00:02:06,919 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 00:02:06,919 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 00:02:06,919 INFO L246 CegarLoopResult]: For program point L284(lines 284 358) no Hoare annotation was computed. [2019-11-28 00:02:06,919 INFO L246 CegarLoopResult]: For program point L218(lines 218 240) no Hoare annotation was computed. [2019-11-28 00:02:06,919 INFO L246 CegarLoopResult]: For program point L78(lines 78 88) no Hoare annotation was computed. [2019-11-28 00:02:06,919 INFO L246 CegarLoopResult]: For program point L334(line 334) no Hoare annotation was computed. [2019-11-28 00:02:06,919 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 334) no Hoare annotation was computed. [2019-11-28 00:02:06,919 INFO L246 CegarLoopResult]: For program point L136(lines 136 158) no Hoare annotation was computed. [2019-11-28 00:02:06,920 INFO L246 CegarLoopResult]: For program point L37(lines 37 251) no Hoare annotation was computed. [2019-11-28 00:02:06,920 INFO L246 CegarLoopResult]: For program point L293(line 293) no Hoare annotation was computed. [2019-11-28 00:02:06,920 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 232) no Hoare annotation was computed. [2019-11-28 00:02:06,920 INFO L246 CegarLoopResult]: For program point L120(lines 120 197) no Hoare annotation was computed. [2019-11-28 00:02:06,920 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 80) no Hoare annotation was computed. [2019-11-28 00:02:06,920 INFO L249 CegarLoopResult]: At program point L310(lines 27 363) the Hoare annotation is: true [2019-11-28 00:02:06,920 INFO L246 CegarLoopResult]: For program point L211(lines 211 246) no Hoare annotation was computed. [2019-11-28 00:02:06,920 INFO L249 CegarLoopResult]: At program point L368(lines 10 370) the Hoare annotation is: true [2019-11-28 00:02:06,921 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 305) no Hoare annotation was computed. [2019-11-28 00:02:06,922 INFO L246 CegarLoopResult]: For program point L170(lines 170 194) no Hoare annotation was computed. [2019-11-28 00:02:06,922 INFO L246 CegarLoopResult]: For program point L261(lines 261 361) no Hoare annotation was computed. [2019-11-28 00:02:06,922 INFO L246 CegarLoopResult]: For program point L129(lines 129 196) no Hoare annotation was computed. [2019-11-28 00:02:06,922 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 138) no Hoare annotation was computed. [2019-11-28 00:02:06,923 INFO L242 CegarLoopResult]: At program point L352(lines 278 359) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~main__t~0 1) ULTIMATE.start_main_~main__tagbuf_len~0) (<= 0 ULTIMATE.start_main_~main__t~0) (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~13))) [2019-11-28 00:02:06,923 INFO L246 CegarLoopResult]: For program point L220(line 220) no Hoare annotation was computed. [2019-11-28 00:02:06,923 INFO L246 CegarLoopResult]: For program point L344(lines 344 353) no Hoare annotation was computed. [2019-11-28 00:02:06,923 INFO L242 CegarLoopResult]: At program point L245(lines 97 247) the Hoare annotation is: (and (<= 1 ULTIMATE.start_main_~main__t~0) (<= (+ ULTIMATE.start_main_~main__t~0 1) ULTIMATE.start_main_~main__tagbuf_len~0) (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~0)) (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~1))) [2019-11-28 00:02:06,924 INFO L246 CegarLoopResult]: For program point L80(line 80) no Hoare annotation was computed. [2019-11-28 00:02:06,924 INFO L246 CegarLoopResult]: For program point L303(lines 303 311) no Hoare annotation was computed. [2019-11-28 00:02:06,924 INFO L246 CegarLoopResult]: For program point L138(line 138) no Hoare annotation was computed. [2019-11-28 00:02:06,924 INFO L246 CegarLoopResult]: For program point L39(line 39) no Hoare annotation was computed. [2019-11-28 00:02:06,924 INFO L246 CegarLoopResult]: For program point L97(lines 97 247) no Hoare annotation was computed. [2019-11-28 00:02:06,924 INFO L246 CegarLoopResult]: For program point L320(lines 320 357) no Hoare annotation was computed. [2019-11-28 00:02:06,925 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 122) no Hoare annotation was computed. [2019-11-28 00:02:06,925 INFO L246 CegarLoopResult]: For program point L122(line 122) no Hoare annotation was computed. [2019-11-28 00:02:06,925 INFO L246 CegarLoopResult]: For program point L15(lines 15 369) no Hoare annotation was computed. [2019-11-28 00:02:06,925 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION(line 346) no Hoare annotation was computed. [2019-11-28 00:02:06,925 INFO L246 CegarLoopResult]: For program point L172(line 172) no Hoare annotation was computed. [2019-11-28 00:02:06,926 INFO L246 CegarLoopResult]: For program point L230(lines 230 238) no Hoare annotation was computed. [2019-11-28 00:02:06,926 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-28 00:02:06,926 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 172) no Hoare annotation was computed. [2019-11-28 00:02:06,926 INFO L246 CegarLoopResult]: For program point L346(line 346) no Hoare annotation was computed. [2019-11-28 00:02:06,926 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 39) no Hoare annotation was computed. [2019-11-28 00:02:06,926 INFO L246 CegarLoopResult]: For program point L148(lines 148 156) no Hoare annotation was computed. [2019-11-28 00:02:06,927 INFO L246 CegarLoopResult]: For program point L49(lines 49 249) no Hoare annotation was computed. [2019-11-28 00:02:06,927 INFO L246 CegarLoopResult]: For program point L305(line 305) no Hoare annotation was computed. [2019-11-28 00:02:06,927 INFO L246 CegarLoopResult]: For program point L272(lines 272 359) no Hoare annotation was computed. [2019-11-28 00:02:06,927 INFO L246 CegarLoopResult]: For program point L66(lines 66 90) no Hoare annotation was computed. [2019-11-28 00:02:06,927 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 00:02:06,928 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 150) no Hoare annotation was computed. [2019-11-28 00:02:06,928 INFO L246 CegarLoopResult]: For program point L182(lines 182 192) no Hoare annotation was computed. [2019-11-28 00:02:06,928 INFO L246 CegarLoopResult]: For program point L108(lines 108 199) no Hoare annotation was computed. [2019-11-28 00:02:06,928 INFO L246 CegarLoopResult]: For program point L232(line 232) no Hoare annotation was computed. [2019-11-28 00:02:06,928 INFO L242 CegarLoopResult]: At program point L323(lines 27 363) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~main__t~0 1) ULTIMATE.start_main_~main__tagbuf_len~0) (<= 0 ULTIMATE.start_main_~main__t~0)) [2019-11-28 00:02:06,929 INFO L242 CegarLoopResult]: At program point L191(lines 55 249) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0) (<= 1 ULTIMATE.start_main_~main__t~0) (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~0)) (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~1))) [2019-11-28 00:02:06,929 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 220) no Hoare annotation was computed. [2019-11-28 00:02:06,929 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 68) no Hoare annotation was computed. [2019-11-28 00:02:06,929 INFO L246 CegarLoopResult]: For program point L150(line 150) no Hoare annotation was computed. [2019-11-28 00:02:06,929 INFO L246 CegarLoopResult]: For program point L51(line 51) no Hoare annotation was computed. [2019-11-28 00:02:06,929 INFO L246 CegarLoopResult]: For program point L274(line 274) no Hoare annotation was computed. [2019-11-28 00:02:06,930 INFO L246 CegarLoopResult]: For program point L332(lines 332 355) no Hoare annotation was computed. [2019-11-28 00:02:06,930 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 293) no Hoare annotation was computed. [2019-11-28 00:02:06,930 INFO L246 CegarLoopResult]: For program point L101(lines 101 205) no Hoare annotation was computed. [2019-11-28 00:02:06,930 INFO L246 CegarLoopResult]: For program point L68(line 68) no Hoare annotation was computed. [2019-11-28 00:02:06,930 INFO L246 CegarLoopResult]: For program point L291(lines 291 313) no Hoare annotation was computed. [2019-11-28 00:02:06,951 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 12:02:06 BoogieIcfgContainer [2019-11-28 00:02:06,952 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 00:02:06,952 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 00:02:06,952 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 00:02:06,953 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 00:02:06,953 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:02:02" (3/4) ... [2019-11-28 00:02:06,957 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 00:02:06,972 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-28 00:02:06,973 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 00:02:07,051 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 00:02:07,052 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 00:02:07,054 INFO L168 Benchmark]: Toolchain (without parser) took 5097.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 210.2 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -118.0 MB). Peak memory consumption was 92.2 MB. Max. memory is 11.5 GB. [2019-11-28 00:02:07,054 INFO L168 Benchmark]: CDTParser took 0.39 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 00:02:07,055 INFO L168 Benchmark]: CACSL2BoogieTranslator took 456.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -184.9 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2019-11-28 00:02:07,055 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.33 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 00:02:07,056 INFO L168 Benchmark]: Boogie Preprocessor took 26.83 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 00:02:07,056 INFO L168 Benchmark]: RCFGBuilder took 475.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. [2019-11-28 00:02:07,057 INFO L168 Benchmark]: TraceAbstraction took 3989.78 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 64.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.5 MB). Peak memory consumption was 84.4 MB. Max. memory is 11.5 GB. [2019-11-28 00:02:07,057 INFO L168 Benchmark]: Witness Printer took 99.58 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: 7.6 MB). Peak memory consumption was 7.6 MB. Max. memory is 11.5 GB. [2019-11-28 00:02:07,060 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.39 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 456.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -184.9 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 44.33 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 26.83 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 475.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3989.78 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 64.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.5 MB). Peak memory consumption was 84.4 MB. Max. memory is 11.5 GB. * Witness Printer took 99.58 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: 7.6 MB). Peak memory consumption was 7.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 51]: 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: 150]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 346]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 334]: 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: 39]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 68]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 274]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 110]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 122]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 138]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 220]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 305]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 293]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 232]: 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 - AllSpecificationsHoldResult: All specifications hold 17 specifications checked. All of them hold - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: ((main__t <= main__tagbuf_len && 1 <= main__t) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond) - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: ((1 <= main__t && main__t + 1 <= main__tagbuf_len) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond) - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: main__t + 1 <= main__tagbuf_len && 0 <= main__t - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 278]: Loop Invariant Derived loop invariant: (main__t + 1 <= main__tagbuf_len && 0 <= main__t) && !(0 == __VERIFIER_assert__cond) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 71 locations, 17 error locations. Result: SAFE, OverallTime: 3.5s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, HoareTripleCheckerStatistics: 726 SDtfs, 1259 SDslu, 649 SDs, 0 SdLazy, 990 SolverSat, 125 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 136 GetRequests, 53 SyntacticMatches, 8 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71occurred 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.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 225 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 15 NumberOfFragments, 56 HoareAnnotationTreeSize, 6 FomulaSimplifications, 80270 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 6 FomulaSimplificationsInter, 1102 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 226 NumberOfCodeBlocks, 226 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 208 ConstructedInterpolants, 0 QuantifiedInterpolants, 7089 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 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...