./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 54858612 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ef15c4790969d8e640b2241771e44174daa41407 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-5485861 [2020-10-25 22:21:52,574 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-25 22:21:52,577 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-25 22:21:52,614 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-25 22:21:52,614 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-25 22:21:52,616 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-25 22:21:52,618 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-25 22:21:52,621 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-25 22:21:52,624 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-25 22:21:52,625 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-25 22:21:52,627 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-25 22:21:52,629 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-25 22:21:52,629 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-25 22:21:52,631 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-25 22:21:52,633 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-25 22:21:52,635 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-25 22:21:52,636 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-25 22:21:52,638 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-25 22:21:52,640 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-25 22:21:52,643 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-25 22:21:52,645 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-25 22:21:52,650 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-25 22:21:52,652 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-25 22:21:52,653 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-25 22:21:52,657 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-25 22:21:52,658 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-25 22:21:52,658 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-25 22:21:52,659 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-25 22:21:52,660 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-25 22:21:52,662 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-25 22:21:52,662 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-25 22:21:52,663 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-25 22:21:52,664 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-25 22:21:52,666 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-25 22:21:52,667 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-25 22:21:52,668 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-25 22:21:52,669 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-25 22:21:52,669 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-25 22:21:52,670 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-25 22:21:52,671 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-25 22:21:52,673 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-25 22:21:52,675 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-25 22:21:52,703 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-25 22:21:52,704 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-25 22:21:52,706 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-25 22:21:52,706 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-25 22:21:52,706 INFO L138 SettingsManager]: * Use SBE=true [2020-10-25 22:21:52,707 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-25 22:21:52,707 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-25 22:21:52,707 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-25 22:21:52,708 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-25 22:21:52,708 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-25 22:21:52,708 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-25 22:21:52,709 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-25 22:21:52,709 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-25 22:21:52,709 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-25 22:21:52,710 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-25 22:21:52,710 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-25 22:21:52,710 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-25 22:21:52,710 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-25 22:21:52,711 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-25 22:21:52,711 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-25 22:21:52,711 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-25 22:21:52,712 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-25 22:21:52,712 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-25 22:21:52,712 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-25 22:21:52,712 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-25 22:21:52,713 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-25 22:21:52,713 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-25 22:21:52,713 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-25 22:21:52,714 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-25 22:21:52,714 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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(reach_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 -> ef15c4790969d8e640b2241771e44174daa41407 [2020-10-25 22:21:53,181 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-25 22:21:53,209 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-25 22:21:53,213 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-25 22:21:53,215 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-25 22:21:53,216 INFO L275 PluginConnector]: CDTParser initialized [2020-10-25 22:21:53,217 INFO L432 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 [2020-10-25 22:21:53,297 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60e77af7b/37a167fdec04496cac52931bbd286e9d/FLAG56c00108c [2020-10-25 22:21:53,906 INFO L306 CDTParser]: Found 1 translation units. [2020-10-25 22:21:53,907 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c [2020-10-25 22:21:53,927 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60e77af7b/37a167fdec04496cac52931bbd286e9d/FLAG56c00108c [2020-10-25 22:21:54,269 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60e77af7b/37a167fdec04496cac52931bbd286e9d [2020-10-25 22:21:54,273 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-25 22:21:54,279 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-25 22:21:54,281 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-25 22:21:54,281 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-25 22:21:54,297 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-25 22:21:54,300 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 10:21:54" (1/1) ... [2020-10-25 22:21:54,309 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33ca736e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:21:54, skipping insertion in model container [2020-10-25 22:21:54,309 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 10:21:54" (1/1) ... [2020-10-25 22:21:54,319 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-25 22:21:54,385 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-25 22:21:54,596 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-25 22:21:54,609 INFO L203 MainTranslator]: Completed pre-run [2020-10-25 22:21:54,651 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-25 22:21:54,667 INFO L208 MainTranslator]: Completed translation [2020-10-25 22:21:54,668 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:21:54 WrapperNode [2020-10-25 22:21:54,668 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-25 22:21:54,669 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-25 22:21:54,670 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-25 22:21:54,670 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-25 22:21:54,680 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:21:54" (1/1) ... [2020-10-25 22:21:54,690 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:21:54" (1/1) ... [2020-10-25 22:21:54,723 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-25 22:21:54,725 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-25 22:21:54,725 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-25 22:21:54,725 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-25 22:21:54,735 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:21:54" (1/1) ... [2020-10-25 22:21:54,736 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:21:54" (1/1) ... [2020-10-25 22:21:54,739 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:21:54" (1/1) ... [2020-10-25 22:21:54,740 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:21:54" (1/1) ... [2020-10-25 22:21:54,759 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:21:54" (1/1) ... [2020-10-25 22:21:54,767 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:21:54" (1/1) ... [2020-10-25 22:21:54,773 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:21:54" (1/1) ... [2020-10-25 22:21:54,781 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-25 22:21:54,785 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-25 22:21:54,785 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-25 22:21:54,786 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-25 22:21:54,787 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:21:54" (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 [2020-10-25 22:21:54,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-25 22:21:54,883 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-25 22:21:54,883 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-25 22:21:54,884 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-25 22:21:55,346 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-25 22:21:55,346 INFO L298 CfgBuilder]: Removed 38 assume(true) statements. [2020-10-25 22:21:55,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 10:21:55 BoogieIcfgContainer [2020-10-25 22:21:55,350 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-25 22:21:55,352 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-25 22:21:55,352 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-25 22:21:55,357 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-25 22:21:55,357 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 10:21:54" (1/3) ... [2020-10-25 22:21:55,359 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d20a873 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 10:21:55, skipping insertion in model container [2020-10-25 22:21:55,359 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:21:54" (2/3) ... [2020-10-25 22:21:55,360 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d20a873 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 10:21:55, skipping insertion in model container [2020-10-25 22:21:55,360 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 10:21:55" (3/3) ... [2020-10-25 22:21:55,376 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.v+nlh-reducer.c [2020-10-25 22:21:55,390 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-25 22:21:55,397 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2020-10-25 22:21:55,415 INFO L253 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2020-10-25 22:21:55,487 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-25 22:21:55,489 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-25 22:21:55,489 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-25 22:21:55,490 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-25 22:21:55,490 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-25 22:21:55,490 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-25 22:21:55,490 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-25 22:21:55,490 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-25 22:21:55,527 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states. [2020-10-25 22:21:55,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-10-25 22:21:55,534 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:21:55,534 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:21:55,535 INFO L429 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]=== [2020-10-25 22:21:55,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:21:55,543 INFO L82 PathProgramCache]: Analyzing trace with hash 124710446, now seen corresponding path program 1 times [2020-10-25 22:21:55,554 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:21:55,555 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172929111] [2020-10-25 22:21:55,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:21:55,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:21:55,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:21:55,810 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172929111] [2020-10-25 22:21:55,811 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:21:55,811 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 22:21:55,812 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139961453] [2020-10-25 22:21:55,820 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 22:21:55,821 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:21:55,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 22:21:55,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 22:21:55,841 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 4 states. [2020-10-25 22:21:56,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:21:56,029 INFO L93 Difference]: Finished difference Result 142 states and 183 transitions. [2020-10-25 22:21:56,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-25 22:21:56,031 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-10-25 22:21:56,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:21:56,044 INFO L225 Difference]: With dead ends: 142 [2020-10-25 22:21:56,044 INFO L226 Difference]: Without dead ends: 109 [2020-10-25 22:21:56,049 INFO L677 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 [2020-10-25 22:21:56,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2020-10-25 22:21:56,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 65. [2020-10-25 22:21:56,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-10-25 22:21:56,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2020-10-25 22:21:56,102 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 8 [2020-10-25 22:21:56,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:21:56,102 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2020-10-25 22:21:56,102 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 22:21:56,103 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2020-10-25 22:21:56,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-10-25 22:21:56,103 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:21:56,103 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:21:56,104 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-25 22:21:56,104 INFO L429 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]=== [2020-10-25 22:21:56,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:21:56,106 INFO L82 PathProgramCache]: Analyzing trace with hash 120336139, now seen corresponding path program 1 times [2020-10-25 22:21:56,106 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:21:56,107 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141894169] [2020-10-25 22:21:56,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:21:56,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:21:56,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:21:56,256 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141894169] [2020-10-25 22:21:56,256 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:21:56,256 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 22:21:56,257 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220028515] [2020-10-25 22:21:56,260 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 22:21:56,260 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:21:56,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 22:21:56,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 22:21:56,267 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 4 states. [2020-10-25 22:21:56,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:21:56,384 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2020-10-25 22:21:56,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 22:21:56,386 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-10-25 22:21:56,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:21:56,388 INFO L225 Difference]: With dead ends: 65 [2020-10-25 22:21:56,388 INFO L226 Difference]: Without dead ends: 63 [2020-10-25 22:21:56,390 INFO L677 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 [2020-10-25 22:21:56,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-10-25 22:21:56,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2020-10-25 22:21:56,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-10-25 22:21:56,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2020-10-25 22:21:56,413 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 8 [2020-10-25 22:21:56,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:21:56,414 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2020-10-25 22:21:56,414 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 22:21:56,415 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2020-10-25 22:21:56,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-25 22:21:56,417 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:21:56,417 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:21:56,419 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-25 22:21:56,419 INFO L429 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]=== [2020-10-25 22:21:56,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:21:56,422 INFO L82 PathProgramCache]: Analyzing trace with hash -564540945, now seen corresponding path program 1 times [2020-10-25 22:21:56,423 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:21:56,423 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215089124] [2020-10-25 22:21:56,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:21:56,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:21:56,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:21:56,521 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215089124] [2020-10-25 22:21:56,521 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:21:56,521 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 22:21:56,521 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074639050] [2020-10-25 22:21:56,522 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 22:21:56,523 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:21:56,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 22:21:56,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 22:21:56,524 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 4 states. [2020-10-25 22:21:56,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:21:56,617 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2020-10-25 22:21:56,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-25 22:21:56,618 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-10-25 22:21:56,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:21:56,619 INFO L225 Difference]: With dead ends: 69 [2020-10-25 22:21:56,620 INFO L226 Difference]: Without dead ends: 67 [2020-10-25 22:21:56,621 INFO L677 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 [2020-10-25 22:21:56,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-10-25 22:21:56,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2020-10-25 22:21:56,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-10-25 22:21:56,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2020-10-25 22:21:56,631 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 9 [2020-10-25 22:21:56,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:21:56,632 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2020-10-25 22:21:56,632 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 22:21:56,632 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2020-10-25 22:21:56,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-25 22:21:56,633 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:21:56,633 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:21:56,633 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-25 22:21:56,634 INFO L429 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]=== [2020-10-25 22:21:56,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:21:56,635 INFO L82 PathProgramCache]: Analyzing trace with hash 108108288, now seen corresponding path program 1 times [2020-10-25 22:21:56,636 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:21:56,636 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489945209] [2020-10-25 22:21:56,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:21:56,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:21:56,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:21:56,689 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489945209] [2020-10-25 22:21:56,689 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:21:56,690 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-25 22:21:56,690 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011179406] [2020-10-25 22:21:56,690 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-25 22:21:56,691 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:21:56,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-25 22:21:56,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-25 22:21:56,693 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 5 states. [2020-10-25 22:21:56,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:21:56,817 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2020-10-25 22:21:56,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-25 22:21:56,818 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-10-25 22:21:56,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:21:56,819 INFO L225 Difference]: With dead ends: 67 [2020-10-25 22:21:56,819 INFO L226 Difference]: Without dead ends: 65 [2020-10-25 22:21:56,820 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-25 22:21:56,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-10-25 22:21:56,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2020-10-25 22:21:56,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-10-25 22:21:56,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2020-10-25 22:21:56,829 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 11 [2020-10-25 22:21:56,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:21:56,829 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2020-10-25 22:21:56,829 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-25 22:21:56,830 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2020-10-25 22:21:56,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-25 22:21:56,831 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:21:56,831 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:21:56,831 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-25 22:21:56,832 INFO L429 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]=== [2020-10-25 22:21:56,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:21:56,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1357780173, now seen corresponding path program 1 times [2020-10-25 22:21:56,833 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:21:56,833 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981549622] [2020-10-25 22:21:56,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:21:56,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:21:56,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:21:56,886 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981549622] [2020-10-25 22:21:56,887 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:21:56,887 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-25 22:21:56,887 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137258206] [2020-10-25 22:21:56,888 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-25 22:21:56,888 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:21:56,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-25 22:21:56,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-25 22:21:56,889 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 5 states. [2020-10-25 22:21:57,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:21:57,003 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2020-10-25 22:21:57,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-25 22:21:57,004 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-10-25 22:21:57,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:21:57,005 INFO L225 Difference]: With dead ends: 65 [2020-10-25 22:21:57,005 INFO L226 Difference]: Without dead ends: 63 [2020-10-25 22:21:57,006 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-25 22:21:57,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-10-25 22:21:57,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2020-10-25 22:21:57,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-10-25 22:21:57,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2020-10-25 22:21:57,014 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 11 [2020-10-25 22:21:57,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:21:57,014 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2020-10-25 22:21:57,015 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-25 22:21:57,015 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2020-10-25 22:21:57,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-25 22:21:57,016 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:21:57,016 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:21:57,016 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-25 22:21:57,017 INFO L429 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]=== [2020-10-25 22:21:57,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:21:57,018 INFO L82 PathProgramCache]: Analyzing trace with hash -942992459, now seen corresponding path program 1 times [2020-10-25 22:21:57,018 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:21:57,018 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709514718] [2020-10-25 22:21:57,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:21:57,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:21:57,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:21:57,080 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709514718] [2020-10-25 22:21:57,080 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:21:57,081 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-25 22:21:57,081 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168029226] [2020-10-25 22:21:57,081 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-25 22:21:57,082 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:21:57,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-25 22:21:57,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-25 22:21:57,084 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand 5 states. [2020-10-25 22:21:57,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:21:57,258 INFO L93 Difference]: Finished difference Result 108 states and 115 transitions. [2020-10-25 22:21:57,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-25 22:21:57,259 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-25 22:21:57,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:21:57,260 INFO L225 Difference]: With dead ends: 108 [2020-10-25 22:21:57,260 INFO L226 Difference]: Without dead ends: 106 [2020-10-25 22:21:57,261 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-25 22:21:57,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2020-10-25 22:21:57,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 60. [2020-10-25 22:21:57,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-10-25 22:21:57,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2020-10-25 22:21:57,269 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 12 [2020-10-25 22:21:57,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:21:57,269 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2020-10-25 22:21:57,270 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-25 22:21:57,270 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2020-10-25 22:21:57,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-25 22:21:57,271 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:21:57,271 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:21:57,271 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-25 22:21:57,272 INFO L429 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]=== [2020-10-25 22:21:57,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:21:57,273 INFO L82 PathProgramCache]: Analyzing trace with hash -943604167, now seen corresponding path program 1 times [2020-10-25 22:21:57,273 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:21:57,274 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587541120] [2020-10-25 22:21:57,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:21:57,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:21:57,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:21:57,316 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587541120] [2020-10-25 22:21:57,316 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:21:57,317 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 22:21:57,317 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408907714] [2020-10-25 22:21:57,318 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 22:21:57,318 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:21:57,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 22:21:57,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 22:21:57,319 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 4 states. [2020-10-25 22:21:57,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:21:57,401 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2020-10-25 22:21:57,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 22:21:57,402 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-10-25 22:21:57,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:21:57,403 INFO L225 Difference]: With dead ends: 61 [2020-10-25 22:21:57,403 INFO L226 Difference]: Without dead ends: 57 [2020-10-25 22:21:57,403 INFO L677 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 [2020-10-25 22:21:57,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-10-25 22:21:57,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2020-10-25 22:21:57,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-10-25 22:21:57,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2020-10-25 22:21:57,410 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 12 [2020-10-25 22:21:57,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:21:57,411 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2020-10-25 22:21:57,411 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 22:21:57,411 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2020-10-25 22:21:57,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-25 22:21:57,412 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:21:57,412 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:21:57,412 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-25 22:21:57,413 INFO L429 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]=== [2020-10-25 22:21:57,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:21:57,414 INFO L82 PathProgramCache]: Analyzing trace with hash 858493661, now seen corresponding path program 1 times [2020-10-25 22:21:57,414 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:21:57,414 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85748218] [2020-10-25 22:21:57,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:21:57,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:21:57,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:21:57,452 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85748218] [2020-10-25 22:21:57,452 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:21:57,452 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 22:21:57,452 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432697416] [2020-10-25 22:21:57,453 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 22:21:57,453 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:21:57,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 22:21:57,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 22:21:57,454 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 4 states. [2020-10-25 22:21:57,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:21:57,515 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2020-10-25 22:21:57,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 22:21:57,516 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-10-25 22:21:57,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:21:57,517 INFO L225 Difference]: With dead ends: 57 [2020-10-25 22:21:57,517 INFO L226 Difference]: Without dead ends: 53 [2020-10-25 22:21:57,518 INFO L677 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 [2020-10-25 22:21:57,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-10-25 22:21:57,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2020-10-25 22:21:57,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-10-25 22:21:57,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2020-10-25 22:21:57,524 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 12 [2020-10-25 22:21:57,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:21:57,524 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2020-10-25 22:21:57,524 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 22:21:57,525 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2020-10-25 22:21:57,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-25 22:21:57,525 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:21:57,526 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:21:57,526 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-25 22:21:57,526 INFO L429 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]=== [2020-10-25 22:21:57,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:21:57,527 INFO L82 PathProgramCache]: Analyzing trace with hash 832011069, now seen corresponding path program 1 times [2020-10-25 22:21:57,527 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:21:57,528 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43211651] [2020-10-25 22:21:57,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:21:57,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:21:57,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:21:57,666 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43211651] [2020-10-25 22:21:57,666 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:21:57,666 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-25 22:21:57,666 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730302714] [2020-10-25 22:21:57,667 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-25 22:21:57,667 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:21:57,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-25 22:21:57,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-25 22:21:57,668 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 6 states. [2020-10-25 22:21:57,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:21:57,816 INFO L93 Difference]: Finished difference Result 118 states and 127 transitions. [2020-10-25 22:21:57,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-25 22:21:57,817 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-10-25 22:21:57,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:21:57,818 INFO L225 Difference]: With dead ends: 118 [2020-10-25 22:21:57,818 INFO L226 Difference]: Without dead ends: 116 [2020-10-25 22:21:57,819 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-25 22:21:57,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2020-10-25 22:21:57,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 57. [2020-10-25 22:21:57,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-10-25 22:21:57,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2020-10-25 22:21:57,825 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 13 [2020-10-25 22:21:57,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:21:57,826 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2020-10-25 22:21:57,826 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-25 22:21:57,826 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2020-10-25 22:21:57,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-25 22:21:57,827 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:21:57,827 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:21:57,828 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-25 22:21:57,828 INFO L429 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]=== [2020-10-25 22:21:57,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:21:57,829 INFO L82 PathProgramCache]: Analyzing trace with hash 866403148, now seen corresponding path program 1 times [2020-10-25 22:21:57,829 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:21:57,830 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464627924] [2020-10-25 22:21:57,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:21:57,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:21:57,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:21:57,871 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464627924] [2020-10-25 22:21:57,871 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:21:57,871 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-25 22:21:57,871 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497234368] [2020-10-25 22:21:57,872 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-25 22:21:57,872 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:21:57,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-25 22:21:57,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-25 22:21:57,873 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand 5 states. [2020-10-25 22:21:57,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:21:57,968 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2020-10-25 22:21:57,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-25 22:21:57,969 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-25 22:21:57,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:21:57,969 INFO L225 Difference]: With dead ends: 57 [2020-10-25 22:21:57,970 INFO L226 Difference]: Without dead ends: 55 [2020-10-25 22:21:57,970 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-25 22:21:57,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-10-25 22:21:57,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2020-10-25 22:21:57,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-10-25 22:21:57,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2020-10-25 22:21:57,975 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 13 [2020-10-25 22:21:57,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:21:57,975 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2020-10-25 22:21:57,975 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-25 22:21:57,975 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2020-10-25 22:21:57,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-25 22:21:57,976 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:21:57,976 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:21:57,977 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-25 22:21:57,977 INFO L429 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]=== [2020-10-25 22:21:57,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:21:57,977 INFO L82 PathProgramCache]: Analyzing trace with hash 864309836, now seen corresponding path program 1 times [2020-10-25 22:21:57,978 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:21:57,978 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400325611] [2020-10-25 22:21:57,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:21:57,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:21:58,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:21:58,017 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400325611] [2020-10-25 22:21:58,018 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:21:58,018 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-25 22:21:58,018 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198401090] [2020-10-25 22:21:58,018 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-25 22:21:58,019 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:21:58,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-25 22:21:58,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-25 22:21:58,020 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand 5 states. [2020-10-25 22:21:58,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:21:58,119 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2020-10-25 22:21:58,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-25 22:21:58,120 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-25 22:21:58,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:21:58,121 INFO L225 Difference]: With dead ends: 70 [2020-10-25 22:21:58,121 INFO L226 Difference]: Without dead ends: 68 [2020-10-25 22:21:58,121 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-25 22:21:58,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-10-25 22:21:58,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 53. [2020-10-25 22:21:58,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-10-25 22:21:58,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2020-10-25 22:21:58,126 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 13 [2020-10-25 22:21:58,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:21:58,126 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2020-10-25 22:21:58,126 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-25 22:21:58,126 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2020-10-25 22:21:58,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-25 22:21:58,127 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:21:58,127 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:21:58,127 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-25 22:21:58,127 INFO L429 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]=== [2020-10-25 22:21:58,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:21:58,128 INFO L82 PathProgramCache]: Analyzing trace with hash 14757244, now seen corresponding path program 1 times [2020-10-25 22:21:58,128 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:21:58,129 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285329764] [2020-10-25 22:21:58,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:21:58,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:21:58,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:21:58,273 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285329764] [2020-10-25 22:21:58,273 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:21:58,274 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-25 22:21:58,274 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552025347] [2020-10-25 22:21:58,274 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-25 22:21:58,275 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:21:58,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-25 22:21:58,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-25 22:21:58,276 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand 6 states. [2020-10-25 22:21:58,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:21:58,386 INFO L93 Difference]: Finished difference Result 78 states and 85 transitions. [2020-10-25 22:21:58,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-25 22:21:58,386 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-10-25 22:21:58,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:21:58,388 INFO L225 Difference]: With dead ends: 78 [2020-10-25 22:21:58,389 INFO L226 Difference]: Without dead ends: 76 [2020-10-25 22:21:58,389 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-25 22:21:58,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-10-25 22:21:58,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 53. [2020-10-25 22:21:58,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-10-25 22:21:58,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2020-10-25 22:21:58,395 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 14 [2020-10-25 22:21:58,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:21:58,395 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2020-10-25 22:21:58,395 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-25 22:21:58,395 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2020-10-25 22:21:58,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-25 22:21:58,396 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:21:58,396 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:21:58,396 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-25 22:21:58,396 INFO L429 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]=== [2020-10-25 22:21:58,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:21:58,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1088699972, now seen corresponding path program 1 times [2020-10-25 22:21:58,397 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:21:58,397 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565116196] [2020-10-25 22:21:58,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:21:58,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:21:58,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:21:58,508 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565116196] [2020-10-25 22:21:58,508 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:21:58,508 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-25 22:21:58,508 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846529863] [2020-10-25 22:21:58,509 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-25 22:21:58,509 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:21:58,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-25 22:21:58,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-25 22:21:58,510 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand 6 states. [2020-10-25 22:21:58,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:21:58,620 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2020-10-25 22:21:58,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-25 22:21:58,621 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-10-25 22:21:58,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:21:58,622 INFO L225 Difference]: With dead ends: 76 [2020-10-25 22:21:58,622 INFO L226 Difference]: Without dead ends: 72 [2020-10-25 22:21:58,622 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-25 22:21:58,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-10-25 22:21:58,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 59. [2020-10-25 22:21:58,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-10-25 22:21:58,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2020-10-25 22:21:58,627 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 14 [2020-10-25 22:21:58,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:21:58,627 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2020-10-25 22:21:58,627 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-25 22:21:58,627 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2020-10-25 22:21:58,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-25 22:21:58,628 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:21:58,628 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:21:58,629 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-25 22:21:58,629 INFO L429 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]=== [2020-10-25 22:21:58,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:21:58,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1089262030, now seen corresponding path program 1 times [2020-10-25 22:21:58,630 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:21:58,630 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23795272] [2020-10-25 22:21:58,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:21:58,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:21:58,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:21:58,664 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23795272] [2020-10-25 22:21:58,664 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:21:58,664 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-25 22:21:58,665 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710715776] [2020-10-25 22:21:58,665 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-25 22:21:58,665 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:21:58,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-25 22:21:58,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-25 22:21:58,666 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand 5 states. [2020-10-25 22:21:58,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:21:58,784 INFO L93 Difference]: Finished difference Result 79 states and 87 transitions. [2020-10-25 22:21:58,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-25 22:21:58,784 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-10-25 22:21:58,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:21:58,785 INFO L225 Difference]: With dead ends: 79 [2020-10-25 22:21:58,785 INFO L226 Difference]: Without dead ends: 77 [2020-10-25 22:21:58,786 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-25 22:21:58,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-10-25 22:21:58,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 57. [2020-10-25 22:21:58,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-10-25 22:21:58,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2020-10-25 22:21:58,790 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 14 [2020-10-25 22:21:58,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:21:58,791 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2020-10-25 22:21:58,791 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-25 22:21:58,791 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2020-10-25 22:21:58,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-25 22:21:58,792 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:21:58,792 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:21:58,792 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-25 22:21:58,792 INFO L429 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]=== [2020-10-25 22:21:58,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:21:58,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1023807232, now seen corresponding path program 1 times [2020-10-25 22:21:58,793 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:21:58,793 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82575639] [2020-10-25 22:21:58,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:21:58,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:21:58,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:21:58,920 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82575639] [2020-10-25 22:21:58,920 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:21:58,920 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-25 22:21:58,920 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768426569] [2020-10-25 22:21:58,921 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-25 22:21:58,921 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:21:58,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-25 22:21:58,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-25 22:21:58,922 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. Second operand 6 states. [2020-10-25 22:21:59,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:21:59,047 INFO L93 Difference]: Finished difference Result 82 states and 91 transitions. [2020-10-25 22:21:59,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-25 22:21:59,047 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-10-25 22:21:59,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:21:59,048 INFO L225 Difference]: With dead ends: 82 [2020-10-25 22:21:59,048 INFO L226 Difference]: Without dead ends: 80 [2020-10-25 22:21:59,049 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-25 22:21:59,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2020-10-25 22:21:59,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 60. [2020-10-25 22:21:59,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-10-25 22:21:59,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2020-10-25 22:21:59,053 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 14 [2020-10-25 22:21:59,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:21:59,054 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2020-10-25 22:21:59,054 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-25 22:21:59,054 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2020-10-25 22:21:59,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-25 22:21:59,055 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:21:59,055 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:21:59,055 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-25 22:21:59,055 INFO L429 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]=== [2020-10-25 22:21:59,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:21:59,056 INFO L82 PathProgramCache]: Analyzing trace with hash -592609303, now seen corresponding path program 1 times [2020-10-25 22:21:59,056 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:21:59,056 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137497544] [2020-10-25 22:21:59,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:21:59,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:21:59,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:21:59,178 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137497544] [2020-10-25 22:21:59,179 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:21:59,179 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-25 22:21:59,179 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918837393] [2020-10-25 22:21:59,179 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-25 22:21:59,180 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:21:59,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-25 22:21:59,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-25 22:21:59,180 INFO L87 Difference]: Start difference. First operand 60 states and 67 transitions. Second operand 6 states. [2020-10-25 22:21:59,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:21:59,329 INFO L93 Difference]: Finished difference Result 87 states and 96 transitions. [2020-10-25 22:21:59,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-25 22:21:59,330 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-10-25 22:21:59,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:21:59,330 INFO L225 Difference]: With dead ends: 87 [2020-10-25 22:21:59,331 INFO L226 Difference]: Without dead ends: 85 [2020-10-25 22:21:59,331 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-25 22:21:59,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2020-10-25 22:21:59,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 63. [2020-10-25 22:21:59,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-10-25 22:21:59,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2020-10-25 22:21:59,336 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 15 [2020-10-25 22:21:59,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:21:59,337 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2020-10-25 22:21:59,337 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-25 22:21:59,337 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2020-10-25 22:21:59,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-25 22:21:59,337 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:21:59,338 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:21:59,338 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-25 22:21:59,338 INFO L429 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]=== [2020-10-25 22:21:59,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:21:59,339 INFO L82 PathProgramCache]: Analyzing trace with hash 331428451, now seen corresponding path program 1 times [2020-10-25 22:21:59,339 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:21:59,339 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829530083] [2020-10-25 22:21:59,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:21:59,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:21:59,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:21:59,368 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829530083] [2020-10-25 22:21:59,368 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:21:59,369 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 22:21:59,369 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594457353] [2020-10-25 22:21:59,369 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 22:21:59,369 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:21:59,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 22:21:59,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 22:21:59,370 INFO L87 Difference]: Start difference. First operand 63 states and 70 transitions. Second operand 4 states. [2020-10-25 22:21:59,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:21:59,408 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2020-10-25 22:21:59,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 22:21:59,409 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-10-25 22:21:59,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:21:59,410 INFO L225 Difference]: With dead ends: 63 [2020-10-25 22:21:59,410 INFO L226 Difference]: Without dead ends: 61 [2020-10-25 22:21:59,410 INFO L677 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 [2020-10-25 22:21:59,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-10-25 22:21:59,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2020-10-25 22:21:59,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-10-25 22:21:59,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2020-10-25 22:21:59,415 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 16 [2020-10-25 22:21:59,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:21:59,415 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2020-10-25 22:21:59,415 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 22:21:59,415 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2020-10-25 22:21:59,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-25 22:21:59,416 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:21:59,416 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:21:59,416 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-25 22:21:59,417 INFO L429 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]=== [2020-10-25 22:21:59,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:21:59,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1684353502, now seen corresponding path program 1 times [2020-10-25 22:21:59,417 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:21:59,418 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441436359] [2020-10-25 22:21:59,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:21:59,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:21:59,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:21:59,447 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441436359] [2020-10-25 22:21:59,447 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:21:59,447 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 22:21:59,447 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262477254] [2020-10-25 22:21:59,448 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 22:21:59,448 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:21:59,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 22:21:59,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 22:21:59,449 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand 4 states. [2020-10-25 22:21:59,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:21:59,505 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2020-10-25 22:21:59,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 22:21:59,506 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2020-10-25 22:21:59,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:21:59,506 INFO L225 Difference]: With dead ends: 61 [2020-10-25 22:21:59,506 INFO L226 Difference]: Without dead ends: 57 [2020-10-25 22:21:59,507 INFO L677 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 [2020-10-25 22:21:59,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-10-25 22:21:59,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2020-10-25 22:21:59,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-10-25 22:21:59,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2020-10-25 22:21:59,511 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 17 [2020-10-25 22:21:59,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:21:59,512 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2020-10-25 22:21:59,512 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 22:21:59,512 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2020-10-25 22:21:59,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-25 22:21:59,512 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:21:59,513 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:21:59,513 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-25 22:21:59,513 INFO L429 AbstractCegarLoop]: === Iteration 19 === [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]=== [2020-10-25 22:21:59,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:21:59,514 INFO L82 PathProgramCache]: Analyzing trace with hash -2089868866, now seen corresponding path program 1 times [2020-10-25 22:21:59,514 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:21:59,514 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613509333] [2020-10-25 22:21:59,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:21:59,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:21:59,582 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:21:59,583 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613509333] [2020-10-25 22:21:59,583 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [739771983] [2020-10-25 22:21:59,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 22:21:59,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:21:59,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-25 22:21:59,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 22:21:59,935 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-25 22:21:59,943 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-25 22:21:59,965 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:21:59,966 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 22:21:59,966 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2020-10-25 22:21:59,966 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250713594] [2020-10-25 22:21:59,966 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-25 22:21:59,967 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:21:59,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-25 22:21:59,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2020-10-25 22:21:59,968 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand 13 states. [2020-10-25 22:22:00,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:22:00,368 INFO L93 Difference]: Finished difference Result 104 states and 117 transitions. [2020-10-25 22:22:00,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-25 22:22:00,369 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2020-10-25 22:22:00,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:22:00,370 INFO L225 Difference]: With dead ends: 104 [2020-10-25 22:22:00,370 INFO L226 Difference]: Without dead ends: 102 [2020-10-25 22:22:00,370 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2020-10-25 22:22:00,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2020-10-25 22:22:00,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 53. [2020-10-25 22:22:00,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-10-25 22:22:00,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2020-10-25 22:22:00,376 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 18 [2020-10-25 22:22:00,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:22:00,376 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2020-10-25 22:22:00,377 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-25 22:22:00,377 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2020-10-25 22:22:00,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-25 22:22:00,377 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:22:00,377 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:22:00,578 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 22:22:00,578 INFO L429 AbstractCegarLoop]: === Iteration 20 === [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]=== [2020-10-25 22:22:00,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:22:00,579 INFO L82 PathProgramCache]: Analyzing trace with hash 694227744, now seen corresponding path program 1 times [2020-10-25 22:22:00,579 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:22:00,579 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491608575] [2020-10-25 22:22:00,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:22:00,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:22:00,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:22:00,673 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491608575] [2020-10-25 22:22:00,674 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:22:00,674 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-25 22:22:00,674 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866923330] [2020-10-25 22:22:00,675 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-25 22:22:00,675 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:22:00,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-25 22:22:00,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-25 22:22:00,676 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand 6 states. [2020-10-25 22:22:00,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:22:00,806 INFO L93 Difference]: Finished difference Result 68 states and 77 transitions. [2020-10-25 22:22:00,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-25 22:22:00,807 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-10-25 22:22:00,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:22:00,808 INFO L225 Difference]: With dead ends: 68 [2020-10-25 22:22:00,808 INFO L226 Difference]: Without dead ends: 66 [2020-10-25 22:22:00,808 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-10-25 22:22:00,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-10-25 22:22:00,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 48. [2020-10-25 22:22:00,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-10-25 22:22:00,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2020-10-25 22:22:00,817 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 18 [2020-10-25 22:22:00,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:22:00,818 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2020-10-25 22:22:00,818 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-25 22:22:00,818 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2020-10-25 22:22:00,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-25 22:22:00,819 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:22:00,819 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:22:00,819 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-25 22:22:00,820 INFO L429 AbstractCegarLoop]: === Iteration 21 === [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]=== [2020-10-25 22:22:00,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:22:00,820 INFO L82 PathProgramCache]: Analyzing trace with hash 2065566423, now seen corresponding path program 1 times [2020-10-25 22:22:00,821 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:22:00,822 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513683548] [2020-10-25 22:22:00,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:22:00,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:22:00,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:22:00,911 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513683548] [2020-10-25 22:22:00,911 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:22:00,911 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-25 22:22:00,912 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849040350] [2020-10-25 22:22:00,912 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-25 22:22:00,912 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:22:00,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-25 22:22:00,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-25 22:22:00,913 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand 6 states. [2020-10-25 22:22:01,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:22:01,003 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2020-10-25 22:22:01,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-25 22:22:01,004 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-10-25 22:22:01,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:22:01,005 INFO L225 Difference]: With dead ends: 48 [2020-10-25 22:22:01,005 INFO L226 Difference]: Without dead ends: 44 [2020-10-25 22:22:01,006 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-25 22:22:01,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-10-25 22:22:01,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2020-10-25 22:22:01,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-10-25 22:22:01,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2020-10-25 22:22:01,016 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 19 [2020-10-25 22:22:01,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:22:01,017 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 50 transitions. [2020-10-25 22:22:01,017 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-25 22:22:01,017 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2020-10-25 22:22:01,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-25 22:22:01,017 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:22:01,017 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:22:01,017 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-25 22:22:01,018 INFO L429 AbstractCegarLoop]: === Iteration 22 === [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]=== [2020-10-25 22:22:01,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:22:01,018 INFO L82 PathProgramCache]: Analyzing trace with hash 2000673683, now seen corresponding path program 1 times [2020-10-25 22:22:01,018 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:22:01,018 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279425810] [2020-10-25 22:22:01,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:22:01,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:22:01,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:22:01,102 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279425810] [2020-10-25 22:22:01,102 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:22:01,103 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-25 22:22:01,103 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871145195] [2020-10-25 22:22:01,103 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-25 22:22:01,103 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:22:01,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-25 22:22:01,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-25 22:22:01,104 INFO L87 Difference]: Start difference. First operand 43 states and 50 transitions. Second operand 6 states. [2020-10-25 22:22:01,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:22:01,225 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2020-10-25 22:22:01,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-25 22:22:01,225 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-10-25 22:22:01,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:22:01,226 INFO L225 Difference]: With dead ends: 51 [2020-10-25 22:22:01,226 INFO L226 Difference]: Without dead ends: 20 [2020-10-25 22:22:01,227 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-10-25 22:22:01,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-10-25 22:22:01,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-10-25 22:22:01,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-10-25 22:22:01,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2020-10-25 22:22:01,230 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 19 [2020-10-25 22:22:01,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:22:01,230 INFO L481 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2020-10-25 22:22:01,230 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-25 22:22:01,230 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2020-10-25 22:22:01,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-25 22:22:01,231 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:22:01,231 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:22:01,231 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-25 22:22:01,232 INFO L429 AbstractCegarLoop]: === Iteration 23 === [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]=== [2020-10-25 22:22:01,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:22:01,232 INFO L82 PathProgramCache]: Analyzing trace with hash -369207525, now seen corresponding path program 1 times [2020-10-25 22:22:01,233 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:22:01,233 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392097825] [2020-10-25 22:22:01,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:22:01,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:22:01,297 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:22:01,297 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392097825] [2020-10-25 22:22:01,297 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1332596757] [2020-10-25 22:22:01,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 22:22:01,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:22:01,365 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-25 22:22:01,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 22:22:01,541 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-25 22:22:01,548 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-25 22:22:01,582 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:22:01,583 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 22:22:01,583 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2020-10-25 22:22:01,584 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282401119] [2020-10-25 22:22:01,584 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-25 22:22:01,584 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:22:01,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-25 22:22:01,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2020-10-25 22:22:01,588 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 13 states. [2020-10-25 22:22:01,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:22:01,874 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2020-10-25 22:22:01,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-25 22:22:01,874 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 19 [2020-10-25 22:22:01,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:22:01,875 INFO L225 Difference]: With dead ends: 31 [2020-10-25 22:22:01,875 INFO L226 Difference]: Without dead ends: 0 [2020-10-25 22:22:01,876 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2020-10-25 22:22:01,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-25 22:22:01,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-25 22:22:01,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-25 22:22:01,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-25 22:22:01,876 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2020-10-25 22:22:01,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:22:01,876 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-25 22:22:01,877 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-25 22:22:01,877 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-25 22:22:01,877 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-25 22:22:02,082 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2020-10-25 22:22:02,086 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-10-25 22:22:02,511 WARN L193 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 15 [2020-10-25 22:22:02,783 WARN L193 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 28 [2020-10-25 22:22:03,091 WARN L193 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 25 [2020-10-25 22:22:03,230 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 15 [2020-10-25 22:22:03,232 INFO L274 CegarLoopResult]: For program point L349(lines 349 358) no Hoare annotation was computed. [2020-10-25 22:22:03,233 INFO L270 CegarLoopResult]: At program point L250(lines 102 252) the Hoare annotation is: (and (< ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0) (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~0 0)) (<= 1 ULTIMATE.start_main_~main__t~0) (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~1 0))) [2020-10-25 22:22:03,233 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-10-25 22:22:03,233 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-10-25 22:22:03,233 INFO L274 CegarLoopResult]: For program point L102(lines 102 252) no Hoare annotation was computed. [2020-10-25 22:22:03,233 INFO L274 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-10-25 22:22:03,233 INFO L274 CegarLoopResult]: For program point L20(lines 20 374) no Hoare annotation was computed. [2020-10-25 22:22:03,233 INFO L274 CegarLoopResult]: For program point L235(lines 235 243) no Hoare annotation was computed. [2020-10-25 22:22:03,233 INFO L274 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-10-25 22:22:03,234 INFO L274 CegarLoopResult]: For program point L4-1(line 4) no Hoare annotation was computed. [2020-10-25 22:22:03,234 INFO L274 CegarLoopResult]: For program point L4-2(line 4) no Hoare annotation was computed. [2020-10-25 22:22:03,234 INFO L274 CegarLoopResult]: For program point L4-3(line 4) no Hoare annotation was computed. [2020-10-25 22:22:03,234 INFO L274 CegarLoopResult]: For program point L4-4(line 4) no Hoare annotation was computed. [2020-10-25 22:22:03,234 INFO L274 CegarLoopResult]: For program point L4-5(line 4) no Hoare annotation was computed. [2020-10-25 22:22:03,235 INFO L274 CegarLoopResult]: For program point L4-6(line 4) no Hoare annotation was computed. [2020-10-25 22:22:03,235 INFO L274 CegarLoopResult]: For program point L4-7(line 4) no Hoare annotation was computed. [2020-10-25 22:22:03,235 INFO L274 CegarLoopResult]: For program point L4-8(line 4) no Hoare annotation was computed. [2020-10-25 22:22:03,235 INFO L274 CegarLoopResult]: For program point L4-9(line 4) no Hoare annotation was computed. [2020-10-25 22:22:03,235 INFO L274 CegarLoopResult]: For program point L4-10(line 4) no Hoare annotation was computed. [2020-10-25 22:22:03,235 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-10-25 22:22:03,235 INFO L274 CegarLoopResult]: For program point L4-11(line 4) no Hoare annotation was computed. [2020-10-25 22:22:03,236 INFO L274 CegarLoopResult]: For program point L153(lines 153 161) no Hoare annotation was computed. [2020-10-25 22:22:03,236 INFO L274 CegarLoopResult]: For program point L4-12(line 4) no Hoare annotation was computed. [2020-10-25 22:22:03,236 INFO L274 CegarLoopResult]: For program point L4-13(line 4) no Hoare annotation was computed. [2020-10-25 22:22:03,236 INFO L274 CegarLoopResult]: For program point L54(lines 54 254) no Hoare annotation was computed. [2020-10-25 22:22:03,236 INFO L274 CegarLoopResult]: For program point L4-14(line 4) no Hoare annotation was computed. [2020-10-25 22:22:03,236 INFO L274 CegarLoopResult]: For program point L4-15(line 4) no Hoare annotation was computed. [2020-10-25 22:22:03,236 INFO L274 CegarLoopResult]: For program point L4-16(line 4) no Hoare annotation was computed. [2020-10-25 22:22:03,236 INFO L274 CegarLoopResult]: For program point L4-17(line 4) no Hoare annotation was computed. [2020-10-25 22:22:03,236 INFO L274 CegarLoopResult]: For program point L4-18(line 4) no Hoare annotation was computed. [2020-10-25 22:22:03,236 INFO L274 CegarLoopResult]: For program point L4-19(line 4) no Hoare annotation was computed. [2020-10-25 22:22:03,237 INFO L274 CegarLoopResult]: For program point L4-20(line 4) no Hoare annotation was computed. [2020-10-25 22:22:03,237 INFO L274 CegarLoopResult]: For program point L4-21(line 4) no Hoare annotation was computed. [2020-10-25 22:22:03,237 INFO L274 CegarLoopResult]: For program point L4-22(line 4) no Hoare annotation was computed. [2020-10-25 22:22:03,237 INFO L274 CegarLoopResult]: For program point L4-23(line 4) no Hoare annotation was computed. [2020-10-25 22:22:03,237 INFO L274 CegarLoopResult]: For program point L4-24(line 4) no Hoare annotation was computed. [2020-10-25 22:22:03,237 INFO L274 CegarLoopResult]: For program point L4-25(line 4) no Hoare annotation was computed. [2020-10-25 22:22:03,237 INFO L274 CegarLoopResult]: For program point L4-26(line 4) no Hoare annotation was computed. [2020-10-25 22:22:03,237 INFO L274 CegarLoopResult]: For program point L4-27(line 4) no Hoare annotation was computed. [2020-10-25 22:22:03,237 INFO L274 CegarLoopResult]: For program point L4-28(line 4) no Hoare annotation was computed. [2020-10-25 22:22:03,237 INFO L274 CegarLoopResult]: For program point L71(lines 71 95) no Hoare annotation was computed. [2020-10-25 22:22:03,237 INFO L274 CegarLoopResult]: For program point L4-29(line 4) no Hoare annotation was computed. [2020-10-25 22:22:03,238 INFO L274 CegarLoopResult]: For program point L4-30(line 4) no Hoare annotation was computed. [2020-10-25 22:22:03,238 INFO L274 CegarLoopResult]: For program point L4-31(line 4) no Hoare annotation was computed. [2020-10-25 22:22:03,238 INFO L274 CegarLoopResult]: For program point L4-32(line 4) no Hoare annotation was computed. [2020-10-25 22:22:03,238 INFO L274 CegarLoopResult]: For program point L4-33(line 4) no Hoare annotation was computed. [2020-10-25 22:22:03,239 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-10-25 22:22:03,239 INFO L274 CegarLoopResult]: For program point L187(lines 187 197) no Hoare annotation was computed. [2020-10-25 22:22:03,239 INFO L274 CegarLoopResult]: For program point L337(lines 337 360) no Hoare annotation was computed. [2020-10-25 22:22:03,239 INFO L274 CegarLoopResult]: For program point L106(lines 106 210) no Hoare annotation was computed. [2020-10-25 22:22:03,239 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-10-25 22:22:03,239 INFO L274 CegarLoopResult]: For program point L24(lines 24 369) no Hoare annotation was computed. [2020-10-25 22:22:03,239 INFO L274 CegarLoopResult]: For program point L289(lines 289 363) no Hoare annotation was computed. [2020-10-25 22:22:03,239 INFO L274 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-10-25 22:22:03,239 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-10-25 22:22:03,239 INFO L274 CegarLoopResult]: For program point L223(lines 223 245) no Hoare annotation was computed. [2020-10-25 22:22:03,240 INFO L274 CegarLoopResult]: For program point L141(lines 141 163) no Hoare annotation was computed. [2020-10-25 22:22:03,240 INFO L274 CegarLoopResult]: For program point L42(lines 42 256) no Hoare annotation was computed. [2020-10-25 22:22:03,240 INFO L274 CegarLoopResult]: For program point L125(lines 125 202) no Hoare annotation was computed. [2020-10-25 22:22:03,240 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-10-25 22:22:03,240 INFO L277 CegarLoopResult]: At program point L373(lines 15 375) the Hoare annotation is: true [2020-10-25 22:22:03,240 INFO L274 CegarLoopResult]: For program point L175(lines 175 199) no Hoare annotation was computed. [2020-10-25 22:22:03,240 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-10-25 22:22:03,242 INFO L270 CegarLoopResult]: At program point L357(lines 283 364) the Hoare annotation is: (let ((.cse1 (= ULTIMATE.start_main_~main__t~0 0))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~13 0)))) (or (and .cse3 .cse1) (and .cse3 (<= 1 ULTIMATE.start_main_~main__t~0)))))) (or (and .cse2 .cse1) (and .cse2 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~16 0))))))) (or (and .cse0 (< 0 ULTIMATE.start_main_~main__tagbuf_len~0) .cse1) (and (< ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0) .cse0 (<= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~17))))) [2020-10-25 22:22:03,242 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-10-25 22:22:03,243 INFO L274 CegarLoopResult]: For program point L308(lines 308 316) no Hoare annotation was computed. [2020-10-25 22:22:03,243 INFO L274 CegarLoopResult]: For program point L325(lines 325 362) no Hoare annotation was computed. [2020-10-25 22:22:03,243 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-10-25 22:22:03,243 INFO L274 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-10-25 22:22:03,243 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-10-25 22:22:03,243 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-10-25 22:22:03,243 INFO L274 CegarLoopResult]: For program point L277(lines 277 364) no Hoare annotation was computed. [2020-10-25 22:22:03,243 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-10-25 22:22:03,244 INFO L274 CegarLoopResult]: For program point L113(lines 113 204) no Hoare annotation was computed. [2020-10-25 22:22:03,244 INFO L270 CegarLoopResult]: At program point L328(lines 32 368) the Hoare annotation is: (let ((.cse1 (< 0 ULTIMATE.start_main_~main__tagbuf_len~0)) (.cse2 (<= ULTIMATE.start_main_~main__t~0 1))) (let ((.cse0 (let ((.cse3 (or (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~13 0)) (and (<= 0 ULTIMATE.start_main_~main__tagbuf_len~0) (= ULTIMATE.start_main_~main__t~0 0)))) (.cse4 (<= 0 ULTIMATE.start_main_~main__t~0))) (or (and .cse3 .cse4 .cse1 .cse2) (and .cse3 .cse4 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~17 0))))))) (or (and (< ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0) .cse0 (<= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~17)) (and (not (= ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0)) .cse1 .cse0 .cse2)))) [2020-10-25 22:22:03,244 INFO L270 CegarLoopResult]: At program point L196(lines 60 254) the Hoare annotation is: (and (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~0 0)) (<= 1 ULTIMATE.start_main_~main__t~0) (<= ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0) (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~1 0))) [2020-10-25 22:22:03,244 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-10-25 22:22:03,244 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-10-25 22:22:03,245 INFO L274 CegarLoopResult]: For program point L296(lines 296 318) no Hoare annotation was computed. [2020-10-25 22:22:03,245 INFO L274 CegarLoopResult]: For program point L32(lines 32 368) no Hoare annotation was computed. [2020-10-25 22:22:03,245 INFO L274 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-10-25 22:22:03,245 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-10-25 22:22:03,245 INFO L274 CegarLoopResult]: For program point L83(lines 83 93) no Hoare annotation was computed. [2020-10-25 22:22:03,245 INFO L277 CegarLoopResult]: At program point L315(lines 32 368) the Hoare annotation is: true [2020-10-25 22:22:03,247 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-10-25 22:22:03,248 INFO L274 CegarLoopResult]: For program point L216(lines 216 251) no Hoare annotation was computed. [2020-10-25 22:22:03,248 INFO L274 CegarLoopResult]: For program point L266(lines 266 366) no Hoare annotation was computed. [2020-10-25 22:22:03,248 INFO L274 CegarLoopResult]: For program point L134(lines 134 201) no Hoare annotation was computed. [2020-10-25 22:22:03,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.10 10:22:03 BoogieIcfgContainer [2020-10-25 22:22:03,271 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-25 22:22:03,272 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-25 22:22:03,272 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-25 22:22:03,272 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-25 22:22:03,273 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 10:21:55" (3/4) ... [2020-10-25 22:22:03,277 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-10-25 22:22:03,294 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2020-10-25 22:22:03,294 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2020-10-25 22:22:03,295 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-10-25 22:22:03,295 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-10-25 22:22:03,397 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-25 22:22:03,397 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-25 22:22:03,399 INFO L168 Benchmark]: Toolchain (without parser) took 9124.10 ms. Allocated memory was 41.9 MB in the beginning and 134.2 MB in the end (delta: 92.3 MB). Free memory was 18.7 MB in the beginning and 69.5 MB in the end (delta: -50.8 MB). Peak memory consumption was 43.0 MB. Max. memory is 16.1 GB. [2020-10-25 22:22:03,400 INFO L168 Benchmark]: CDTParser took 0.38 ms. Allocated memory is still 41.9 MB. Free memory is still 21.7 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-10-25 22:22:03,401 INFO L168 Benchmark]: CACSL2BoogieTranslator took 387.75 ms. Allocated memory was 41.9 MB in the beginning and 50.3 MB in the end (delta: 8.4 MB). Free memory was 18.1 MB in the beginning and 23.8 MB in the end (delta: -5.7 MB). Peak memory consumption was 3.3 MB. Max. memory is 16.1 GB. [2020-10-25 22:22:03,401 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.43 ms. Allocated memory is still 50.3 MB. Free memory was 23.8 MB in the beginning and 21.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-25 22:22:03,402 INFO L168 Benchmark]: Boogie Preprocessor took 59.66 ms. Allocated memory is still 50.3 MB. Free memory was 21.7 MB in the beginning and 34.0 MB in the end (delta: -12.3 MB). Peak memory consumption was 5.2 MB. Max. memory is 16.1 GB. [2020-10-25 22:22:03,402 INFO L168 Benchmark]: RCFGBuilder took 564.78 ms. Allocated memory is still 50.3 MB. Free memory was 33.9 MB in the beginning and 19.6 MB in the end (delta: 14.3 MB). Peak memory consumption was 13.8 MB. Max. memory is 16.1 GB. [2020-10-25 22:22:03,403 INFO L168 Benchmark]: TraceAbstraction took 7919.92 ms. Allocated memory was 50.3 MB in the beginning and 134.2 MB in the end (delta: 83.9 MB). Free memory was 19.1 MB in the beginning and 75.8 MB in the end (delta: -56.7 MB). Peak memory consumption was 58.8 MB. Max. memory is 16.1 GB. [2020-10-25 22:22:03,403 INFO L168 Benchmark]: Witness Printer took 125.45 ms. Allocated memory is still 134.2 MB. Free memory was 75.8 MB in the beginning and 69.5 MB in the end (delta: 6.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2020-10-25 22:22:03,406 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.38 ms. Allocated memory is still 41.9 MB. Free memory is still 21.7 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 387.75 ms. Allocated memory was 41.9 MB in the beginning and 50.3 MB in the end (delta: 8.4 MB). Free memory was 18.1 MB in the beginning and 23.8 MB in the end (delta: -5.7 MB). Peak memory consumption was 3.3 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 54.43 ms. Allocated memory is still 50.3 MB. Free memory was 23.8 MB in the beginning and 21.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 59.66 ms. Allocated memory is still 50.3 MB. Free memory was 21.7 MB in the beginning and 34.0 MB in the end (delta: -12.3 MB). Peak memory consumption was 5.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 564.78 ms. Allocated memory is still 50.3 MB. Free memory was 33.9 MB in the beginning and 19.6 MB in the end (delta: 14.3 MB). Peak memory consumption was 13.8 MB. Max. memory is 16.1 GB. * TraceAbstraction took 7919.92 ms. Allocated memory was 50.3 MB in the beginning and 134.2 MB in the end (delta: 83.9 MB). Free memory was 19.1 MB in the beginning and 75.8 MB in the end (delta: -56.7 MB). Peak memory consumption was 58.8 MB. Max. memory is 16.1 GB. * Witness Printer took 125.45 ms. Allocated memory is still 134.2 MB. Free memory was 75.8 MB in the beginning and 69.5 MB in the end (delta: 6.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 17 specifications checked. All of them hold - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: ((main__t < main__tagbuf_len && !(__VERIFIER_assert__cond == 0)) && 1 <= main__t) && !(__VERIFIER_assert__cond == 0) - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: ((main__t < main__tagbuf_len && (((((!(__VERIFIER_assert__cond == 0) || (0 <= main__tagbuf_len && main__t == 0)) && 0 <= main__t) && 0 < main__tagbuf_len) && main__t <= 1) || (((!(__VERIFIER_assert__cond == 0) || (0 <= main__tagbuf_len && main__t == 0)) && 0 <= main__t) && !(__VERIFIER_assert__cond == 0)))) && 1 <= __VERIFIER_assert__cond) || (((!(main__t == main__tagbuf_len) && 0 < main__tagbuf_len) && (((((!(__VERIFIER_assert__cond == 0) || (0 <= main__tagbuf_len && main__t == 0)) && 0 <= main__t) && 0 < main__tagbuf_len) && main__t <= 1) || (((!(__VERIFIER_assert__cond == 0) || (0 <= main__tagbuf_len && main__t == 0)) && 0 <= main__t) && !(__VERIFIER_assert__cond == 0)))) && main__t <= 1) - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 283]: Loop Invariant Derived loop invariant: ((((((!(__VERIFIER_assert__cond == 0) && main__t == 0) || (!(__VERIFIER_assert__cond == 0) && 1 <= main__t)) && main__t == 0) || (((!(__VERIFIER_assert__cond == 0) && main__t == 0) || (!(__VERIFIER_assert__cond == 0) && 1 <= main__t)) && !(__VERIFIER_assert__cond == 0))) && 0 < main__tagbuf_len) && main__t == 0) || ((main__t < main__tagbuf_len && ((((!(__VERIFIER_assert__cond == 0) && main__t == 0) || (!(__VERIFIER_assert__cond == 0) && 1 <= main__t)) && main__t == 0) || (((!(__VERIFIER_assert__cond == 0) && main__t == 0) || (!(__VERIFIER_assert__cond == 0) && 1 <= main__t)) && !(__VERIFIER_assert__cond == 0)))) && 1 <= __VERIFIER_assert__cond) - InvariantResult [Line: 60]: Loop Invariant Derived loop invariant: ((!(__VERIFIER_assert__cond == 0) && 1 <= main__t) && main__t <= main__tagbuf_len) && !(__VERIFIER_assert__cond == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 88 locations, 17 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 6.6s, OverallIterations: 23, TraceHistogramMax: 2, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 952 SDtfs, 1552 SDslu, 1428 SDs, 0 SdLazy, 1700 SolverSat, 174 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 195 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=88occurred 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, 23 MinimizatonAttempts, 335 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 19 NumberOfFragments, 240 HoareAnnotationTreeSize, 6 FomulaSimplifications, 618521 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 6 FomulaSimplificationsInter, 114567 FormulaSimplificationTreeSizeReductionInter, 0.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 356 NumberOfCodeBlocks, 356 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 331 ConstructedInterpolants, 0 QuantifiedInterpolants, 18922 SizeOfPredicates, 8 NumberOfNonLiveVariables, 237 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 25 InterpolantComputations, 21 PerfectInterpolantSequences, 4/16 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...