./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem10_label07.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem10_label07.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f00fa7f90af487ebbfd04394bf815b5a9b100931 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-27 23:00:43,736 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 23:00:43,738 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 23:00:43,750 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 23:00:43,751 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 23:00:43,752 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 23:00:43,754 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 23:00:43,757 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 23:00:43,770 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 23:00:43,771 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 23:00:43,772 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 23:00:43,773 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 23:00:43,774 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 23:00:43,775 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 23:00:43,776 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 23:00:43,777 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 23:00:43,778 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 23:00:43,779 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 23:00:43,781 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 23:00:43,783 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 23:00:43,784 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 23:00:43,786 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 23:00:43,787 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 23:00:43,788 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 23:00:43,790 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 23:00:43,791 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 23:00:43,791 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 23:00:43,792 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 23:00:43,793 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 23:00:43,794 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 23:00:43,794 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 23:00:43,795 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 23:00:43,796 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 23:00:43,797 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 23:00:43,798 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 23:00:43,798 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 23:00:43,799 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 23:00:43,799 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 23:00:43,799 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 23:00:43,801 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 23:00:43,801 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 23:00:43,802 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-27 23:00:43,818 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 23:00:43,818 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 23:00:43,819 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 23:00:43,820 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 23:00:43,820 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 23:00:43,820 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 23:00:43,821 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 23:00:43,821 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 23:00:43,822 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 23:00:43,822 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 23:00:43,823 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-27 23:00:43,823 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 23:00:43,824 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-27 23:00:43,824 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 23:00:43,825 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-27 23:00:43,825 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 23:00:43,825 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-27 23:00:43,825 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 23:00:43,826 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 23:00:43,826 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 23:00:43,827 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 23:00:43,827 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 23:00:43,827 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 23:00:43,828 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 23:00:43,828 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-27 23:00:43,828 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-27 23:00:43,828 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-27 23:00:43,829 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-27 23:00:43,829 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f00fa7f90af487ebbfd04394bf815b5a9b100931 [2019-11-27 23:00:44,142 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 23:00:44,155 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 23:00:44,158 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 23:00:44,160 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 23:00:44,161 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 23:00:44,161 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem10_label07.c [2019-11-27 23:00:44,240 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69127070e/ecd09e8d1cbf43d082cbdc0e03310115/FLAG33a436bbd [2019-11-27 23:00:44,808 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 23:00:44,809 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label07.c [2019-11-27 23:00:44,827 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69127070e/ecd09e8d1cbf43d082cbdc0e03310115/FLAG33a436bbd [2019-11-27 23:00:45,093 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69127070e/ecd09e8d1cbf43d082cbdc0e03310115 [2019-11-27 23:00:45,097 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 23:00:45,098 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-27 23:00:45,099 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 23:00:45,100 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 23:00:45,104 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 23:00:45,105 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:00:45" (1/1) ... [2019-11-27 23:00:45,108 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7da42a7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:00:45, skipping insertion in model container [2019-11-27 23:00:45,108 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:00:45" (1/1) ... [2019-11-27 23:00:45,117 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 23:00:45,174 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 23:00:45,694 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 23:00:45,700 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 23:00:45,821 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 23:00:45,843 INFO L208 MainTranslator]: Completed translation [2019-11-27 23:00:45,844 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:00:45 WrapperNode [2019-11-27 23:00:45,844 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 23:00:45,845 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-27 23:00:45,845 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-27 23:00:45,846 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-27 23:00:45,867 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:00:45" (1/1) ... [2019-11-27 23:00:45,912 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:00:45" (1/1) ... [2019-11-27 23:00:46,023 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-27 23:00:46,025 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 23:00:46,025 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 23:00:46,025 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 23:00:46,037 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:00:45" (1/1) ... [2019-11-27 23:00:46,037 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:00:45" (1/1) ... [2019-11-27 23:00:46,056 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:00:45" (1/1) ... [2019-11-27 23:00:46,057 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:00:45" (1/1) ... [2019-11-27 23:00:46,085 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:00:45" (1/1) ... [2019-11-27 23:00:46,108 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:00:45" (1/1) ... [2019-11-27 23:00:46,132 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:00:45" (1/1) ... [2019-11-27 23:00:46,162 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 23:00:46,163 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 23:00:46,163 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 23:00:46,163 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 23:00:46,165 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:00:45" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 23:00:46,244 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 23:00:46,244 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 23:00:47,685 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 23:00:47,686 INFO L297 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-27 23:00:47,688 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:00:47 BoogieIcfgContainer [2019-11-27 23:00:47,689 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 23:00:47,691 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 23:00:47,691 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 23:00:47,695 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 23:00:47,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 11:00:45" (1/3) ... [2019-11-27 23:00:47,698 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4514594c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:00:47, skipping insertion in model container [2019-11-27 23:00:47,699 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:00:45" (2/3) ... [2019-11-27 23:00:47,701 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4514594c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:00:47, skipping insertion in model container [2019-11-27 23:00:47,701 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:00:47" (3/3) ... [2019-11-27 23:00:47,704 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem10_label07.c [2019-11-27 23:00:47,715 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 23:00:47,725 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-27 23:00:47,739 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-27 23:00:47,785 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 23:00:47,785 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-27 23:00:47,786 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 23:00:47,786 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 23:00:47,786 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 23:00:47,787 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 23:00:47,787 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 23:00:47,788 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 23:00:47,829 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states. [2019-11-27 23:00:47,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-27 23:00:47,844 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:00:47,846 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:00:47,847 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:00:47,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:00:47,854 INFO L82 PathProgramCache]: Analyzing trace with hash -2068820151, now seen corresponding path program 1 times [2019-11-27 23:00:47,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:00:47,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282667910] [2019-11-27 23:00:47,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:00:48,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:00:48,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:00:48,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282667910] [2019-11-27 23:00:48,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:00:48,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 23:00:48,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321030751] [2019-11-27 23:00:48,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 23:00:48,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:00:48,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 23:00:48,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 23:00:48,203 INFO L87 Difference]: Start difference. First operand 206 states. Second operand 4 states. [2019-11-27 23:00:49,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:00:49,839 INFO L93 Difference]: Finished difference Result 709 states and 1261 transitions. [2019-11-27 23:00:49,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 23:00:49,841 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-11-27 23:00:49,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:00:49,860 INFO L225 Difference]: With dead ends: 709 [2019-11-27 23:00:49,860 INFO L226 Difference]: Without dead ends: 421 [2019-11-27 23:00:49,865 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 23:00:49,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2019-11-27 23:00:49,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 282. [2019-11-27 23:00:49,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-11-27 23:00:49,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 432 transitions. [2019-11-27 23:00:49,930 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 432 transitions. Word has length 45 [2019-11-27 23:00:49,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:00:49,931 INFO L462 AbstractCegarLoop]: Abstraction has 282 states and 432 transitions. [2019-11-27 23:00:49,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 23:00:49,931 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 432 transitions. [2019-11-27 23:00:49,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-27 23:00:49,935 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:00:49,938 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:00:49,938 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:00:49,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:00:49,939 INFO L82 PathProgramCache]: Analyzing trace with hash 5391356, now seen corresponding path program 1 times [2019-11-27 23:00:49,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:00:49,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322587967] [2019-11-27 23:00:49,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:00:49,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:00:50,451 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 37 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:00:50,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322587967] [2019-11-27 23:00:50,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [404212021] [2019-11-27 23:00:50,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:00:50,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:00:50,541 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-27 23:00:50,557 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:00:50,620 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-11-27 23:00:50,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-27 23:00:50,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2019-11-27 23:00:50,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734977785] [2019-11-27 23:00:50,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 23:00:50,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:00:50,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 23:00:50,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-27 23:00:50,627 INFO L87 Difference]: Start difference. First operand 282 states and 432 transitions. Second operand 3 states. [2019-11-27 23:00:51,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:00:51,236 INFO L93 Difference]: Finished difference Result 562 states and 862 transitions. [2019-11-27 23:00:51,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 23:00:51,237 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2019-11-27 23:00:51,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:00:51,241 INFO L225 Difference]: With dead ends: 562 [2019-11-27 23:00:51,242 INFO L226 Difference]: Without dead ends: 560 [2019-11-27 23:00:51,243 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-27 23:00:51,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2019-11-27 23:00:51,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 282. [2019-11-27 23:00:51,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-11-27 23:00:51,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 432 transitions. [2019-11-27 23:00:51,265 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 432 transitions. Word has length 111 [2019-11-27 23:00:51,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:00:51,266 INFO L462 AbstractCegarLoop]: Abstraction has 282 states and 432 transitions. [2019-11-27 23:00:51,267 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 23:00:51,267 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 432 transitions. [2019-11-27 23:00:51,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-11-27 23:00:51,274 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:00:51,274 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:00:51,487 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:00:51,487 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:00:51,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:00:51,488 INFO L82 PathProgramCache]: Analyzing trace with hash 305911779, now seen corresponding path program 1 times [2019-11-27 23:00:51,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:00:51,488 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692173814] [2019-11-27 23:00:51,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:00:51,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:00:51,655 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:00:51,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692173814] [2019-11-27 23:00:51,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:00:51,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 23:00:51,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605429775] [2019-11-27 23:00:51,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 23:00:51,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:00:51,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 23:00:51,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 23:00:51,664 INFO L87 Difference]: Start difference. First operand 282 states and 432 transitions. Second operand 4 states. [2019-11-27 23:00:52,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:00:52,754 INFO L93 Difference]: Finished difference Result 840 states and 1290 transitions. [2019-11-27 23:00:52,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 23:00:52,758 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2019-11-27 23:00:52,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:00:52,762 INFO L225 Difference]: With dead ends: 840 [2019-11-27 23:00:52,762 INFO L226 Difference]: Without dead ends: 560 [2019-11-27 23:00:52,764 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 23:00:52,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2019-11-27 23:00:52,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 421. [2019-11-27 23:00:52,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-11-27 23:00:52,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 596 transitions. [2019-11-27 23:00:52,787 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 596 transitions. Word has length 166 [2019-11-27 23:00:52,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:00:52,787 INFO L462 AbstractCegarLoop]: Abstraction has 421 states and 596 transitions. [2019-11-27 23:00:52,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 23:00:52,788 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 596 transitions. [2019-11-27 23:00:52,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-11-27 23:00:52,792 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:00:52,792 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:00:52,792 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:00:52,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:00:52,793 INFO L82 PathProgramCache]: Analyzing trace with hash 231637281, now seen corresponding path program 1 times [2019-11-27 23:00:52,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:00:52,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344800378] [2019-11-27 23:00:52,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:00:52,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:00:53,264 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:00:53,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344800378] [2019-11-27 23:00:53,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:00:53,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-27 23:00:53,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024145406] [2019-11-27 23:00:53,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-27 23:00:53,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:00:53,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-27 23:00:53,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-27 23:00:53,269 INFO L87 Difference]: Start difference. First operand 421 states and 596 transitions. Second operand 7 states. [2019-11-27 23:00:54,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:00:54,637 INFO L93 Difference]: Finished difference Result 990 states and 1390 transitions. [2019-11-27 23:00:54,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 23:00:54,638 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 177 [2019-11-27 23:00:54,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:00:54,641 INFO L225 Difference]: With dead ends: 990 [2019-11-27 23:00:54,641 INFO L226 Difference]: Without dead ends: 571 [2019-11-27 23:00:54,642 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-11-27 23:00:54,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2019-11-27 23:00:54,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 560. [2019-11-27 23:00:54,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 560 states. [2019-11-27 23:00:54,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 740 transitions. [2019-11-27 23:00:54,668 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 740 transitions. Word has length 177 [2019-11-27 23:00:54,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:00:54,668 INFO L462 AbstractCegarLoop]: Abstraction has 560 states and 740 transitions. [2019-11-27 23:00:54,668 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-27 23:00:54,669 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 740 transitions. [2019-11-27 23:00:54,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-11-27 23:00:54,683 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:00:54,683 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:00:54,684 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:00:54,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:00:54,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1594537044, now seen corresponding path program 1 times [2019-11-27 23:00:54,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:00:54,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786697285] [2019-11-27 23:00:54,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:00:54,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:00:54,922 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:00:54,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786697285] [2019-11-27 23:00:54,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:00:54,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-27 23:00:54,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474756312] [2019-11-27 23:00:54,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 23:00:54,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:00:54,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 23:00:54,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 23:00:54,926 INFO L87 Difference]: Start difference. First operand 560 states and 740 transitions. Second operand 4 states. [2019-11-27 23:00:56,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:00:56,061 INFO L93 Difference]: Finished difference Result 1535 states and 2116 transitions. [2019-11-27 23:00:56,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 23:00:56,061 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 243 [2019-11-27 23:00:56,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:00:56,069 INFO L225 Difference]: With dead ends: 1535 [2019-11-27 23:00:56,070 INFO L226 Difference]: Without dead ends: 1116 [2019-11-27 23:00:56,071 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 23:00:56,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2019-11-27 23:00:56,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 1116. [2019-11-27 23:00:56,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1116 states. [2019-11-27 23:00:56,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 1397 transitions. [2019-11-27 23:00:56,109 INFO L78 Accepts]: Start accepts. Automaton has 1116 states and 1397 transitions. Word has length 243 [2019-11-27 23:00:56,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:00:56,110 INFO L462 AbstractCegarLoop]: Abstraction has 1116 states and 1397 transitions. [2019-11-27 23:00:56,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 23:00:56,111 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 1397 transitions. [2019-11-27 23:00:56,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-11-27 23:00:56,116 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:00:56,116 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:00:56,116 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:00:56,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:00:56,117 INFO L82 PathProgramCache]: Analyzing trace with hash 2124387304, now seen corresponding path program 1 times [2019-11-27 23:00:56,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:00:56,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800333578] [2019-11-27 23:00:56,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:00:56,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:00:56,337 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:00:56,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800333578] [2019-11-27 23:00:56,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:00:56,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-27 23:00:56,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985476702] [2019-11-27 23:00:56,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 23:00:56,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:00:56,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 23:00:56,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-27 23:00:56,342 INFO L87 Difference]: Start difference. First operand 1116 states and 1397 transitions. Second operand 5 states. [2019-11-27 23:00:57,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:00:57,694 INFO L93 Difference]: Finished difference Result 3064 states and 3862 transitions. [2019-11-27 23:00:57,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 23:00:57,695 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 252 [2019-11-27 23:00:57,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:00:57,700 INFO L225 Difference]: With dead ends: 3064 [2019-11-27 23:00:57,701 INFO L226 Difference]: Without dead ends: 977 [2019-11-27 23:00:57,704 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-27 23:00:57,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2019-11-27 23:00:57,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 977. [2019-11-27 23:00:57,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 977 states. [2019-11-27 23:00:57,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1091 transitions. [2019-11-27 23:00:57,728 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1091 transitions. Word has length 252 [2019-11-27 23:00:57,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:00:57,728 INFO L462 AbstractCegarLoop]: Abstraction has 977 states and 1091 transitions. [2019-11-27 23:00:57,728 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 23:00:57,729 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1091 transitions. [2019-11-27 23:00:57,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2019-11-27 23:00:57,735 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:00:57,736 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:00:57,736 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:00:57,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:00:57,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1058413162, now seen corresponding path program 1 times [2019-11-27 23:00:57,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:00:57,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049679848] [2019-11-27 23:00:57,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:00:57,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:00:58,326 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 328 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:00:58,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049679848] [2019-11-27 23:00:58,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [826023465] [2019-11-27 23:00:58,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:00:58,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:00:58,434 INFO L255 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-27 23:00:58,451 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:00:58,571 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 306 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-11-27 23:00:58,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-27 23:00:58,572 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-11-27 23:00:58,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408044223] [2019-11-27 23:00:58,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 23:00:58,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:00:58,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 23:00:58,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-27 23:00:58,574 INFO L87 Difference]: Start difference. First operand 977 states and 1091 transitions. Second operand 3 states. [2019-11-27 23:00:59,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:00:59,133 INFO L93 Difference]: Finished difference Result 2369 states and 2695 transitions. [2019-11-27 23:00:59,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 23:00:59,134 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 345 [2019-11-27 23:00:59,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:00:59,141 INFO L225 Difference]: With dead ends: 2369 [2019-11-27 23:00:59,142 INFO L226 Difference]: Without dead ends: 1533 [2019-11-27 23:00:59,144 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 344 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-27 23:00:59,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1533 states. [2019-11-27 23:00:59,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1533 to 1533. [2019-11-27 23:00:59,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1533 states. [2019-11-27 23:00:59,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1533 states to 1533 states and 1696 transitions. [2019-11-27 23:00:59,179 INFO L78 Accepts]: Start accepts. Automaton has 1533 states and 1696 transitions. Word has length 345 [2019-11-27 23:00:59,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:00:59,180 INFO L462 AbstractCegarLoop]: Abstraction has 1533 states and 1696 transitions. [2019-11-27 23:00:59,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 23:00:59,180 INFO L276 IsEmpty]: Start isEmpty. Operand 1533 states and 1696 transitions. [2019-11-27 23:00:59,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2019-11-27 23:00:59,189 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:00:59,190 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:00:59,395 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:00:59,396 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:00:59,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:00:59,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1761855630, now seen corresponding path program 1 times [2019-11-27 23:00:59,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:00:59,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462940420] [2019-11-27 23:00:59,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:00:59,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:01:00,120 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 107 proven. 278 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-27 23:01:00,121 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462940420] [2019-11-27 23:01:00,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1170746146] [2019-11-27 23:01:00,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:01:00,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:01:00,282 INFO L255 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-27 23:01:00,289 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:01:00,398 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2019-11-27 23:01:00,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-27 23:01:00,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2019-11-27 23:01:00,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103522215] [2019-11-27 23:01:00,401 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 23:01:00,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:01:00,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 23:01:00,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-27 23:01:00,402 INFO L87 Difference]: Start difference. First operand 1533 states and 1696 transitions. Second operand 3 states. [2019-11-27 23:01:00,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:01:00,918 INFO L93 Difference]: Finished difference Result 3342 states and 3713 transitions. [2019-11-27 23:01:00,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 23:01:00,925 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 358 [2019-11-27 23:01:00,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:01:00,934 INFO L225 Difference]: With dead ends: 3342 [2019-11-27 23:01:00,934 INFO L226 Difference]: Without dead ends: 1811 [2019-11-27 23:01:00,937 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 358 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-27 23:01:00,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1811 states. [2019-11-27 23:01:00,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1811 to 1811. [2019-11-27 23:01:00,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1811 states. [2019-11-27 23:01:00,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1811 states to 1811 states and 1991 transitions. [2019-11-27 23:01:00,975 INFO L78 Accepts]: Start accepts. Automaton has 1811 states and 1991 transitions. Word has length 358 [2019-11-27 23:01:00,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:01:00,976 INFO L462 AbstractCegarLoop]: Abstraction has 1811 states and 1991 transitions. [2019-11-27 23:01:00,976 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 23:01:00,976 INFO L276 IsEmpty]: Start isEmpty. Operand 1811 states and 1991 transitions. [2019-11-27 23:01:00,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2019-11-27 23:01:00,981 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:01:00,982 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:01:01,186 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:01:01,187 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:01:01,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:01:01,187 INFO L82 PathProgramCache]: Analyzing trace with hash -641347779, now seen corresponding path program 1 times [2019-11-27 23:01:01,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:01:01,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110504822] [2019-11-27 23:01:01,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:01:01,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:01:01,550 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2019-11-27 23:01:01,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110504822] [2019-11-27 23:01:01,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:01:01,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-27 23:01:01,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408826880] [2019-11-27 23:01:01,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 23:01:01,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:01:01,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 23:01:01,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 23:01:01,553 INFO L87 Difference]: Start difference. First operand 1811 states and 1991 transitions. Second operand 4 states. [2019-11-27 23:01:02,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:01:02,532 INFO L93 Difference]: Finished difference Result 3757 states and 4162 transitions. [2019-11-27 23:01:02,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 23:01:02,532 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 359 [2019-11-27 23:01:02,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:01:02,534 INFO L225 Difference]: With dead ends: 3757 [2019-11-27 23:01:02,534 INFO L226 Difference]: Without dead ends: 0 [2019-11-27 23:01:02,539 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 23:01:02,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-27 23:01:02,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-27 23:01:02,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-27 23:01:02,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-27 23:01:02,540 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 359 [2019-11-27 23:01:02,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:01:02,541 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-27 23:01:02,541 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 23:01:02,541 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-27 23:01:02,541 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-27 23:01:02,544 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-27 23:01:02,788 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 28 [2019-11-27 23:01:02,959 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 28 [2019-11-27 23:01:02,963 INFO L246 CegarLoopResult]: For program point L465(lines 465 572) no Hoare annotation was computed. [2019-11-27 23:01:02,964 INFO L246 CegarLoopResult]: For program point L201-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:02,964 INFO L246 CegarLoopResult]: For program point L168-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:02,964 INFO L246 CegarLoopResult]: For program point L135-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:02,964 INFO L246 CegarLoopResult]: For program point L102-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:02,964 INFO L246 CegarLoopResult]: For program point L69-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:02,965 INFO L246 CegarLoopResult]: For program point L36-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:02,965 INFO L246 CegarLoopResult]: For program point L499(lines 499 572) no Hoare annotation was computed. [2019-11-27 23:01:02,965 INFO L246 CegarLoopResult]: For program point L301(lines 301 572) no Hoare annotation was computed. [2019-11-27 23:01:02,965 INFO L246 CegarLoopResult]: For program point L202(line 202) no Hoare annotation was computed. [2019-11-27 23:01:02,965 INFO L246 CegarLoopResult]: For program point L169(line 169) no Hoare annotation was computed. [2019-11-27 23:01:02,965 INFO L246 CegarLoopResult]: For program point L136(line 136) no Hoare annotation was computed. [2019-11-27 23:01:02,973 INFO L246 CegarLoopResult]: For program point L103(line 103) no Hoare annotation was computed. [2019-11-27 23:01:02,973 INFO L246 CegarLoopResult]: For program point L70(line 70) no Hoare annotation was computed. [2019-11-27 23:01:02,974 INFO L246 CegarLoopResult]: For program point L37(line 37) no Hoare annotation was computed. [2019-11-27 23:01:02,974 INFO L246 CegarLoopResult]: For program point L335(lines 335 572) no Hoare annotation was computed. [2019-11-27 23:01:02,974 INFO L246 CegarLoopResult]: For program point L236(lines 236 572) no Hoare annotation was computed. [2019-11-27 23:01:02,974 INFO L246 CegarLoopResult]: For program point L534(lines 534 572) no Hoare annotation was computed. [2019-11-27 23:01:02,975 INFO L246 CegarLoopResult]: For program point L171-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:02,976 INFO L246 CegarLoopResult]: For program point L138-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:02,976 INFO L246 CegarLoopResult]: For program point L105-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:02,976 INFO L246 CegarLoopResult]: For program point L72-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:02,976 INFO L246 CegarLoopResult]: For program point L39-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:02,977 INFO L246 CegarLoopResult]: For program point L436(lines 436 572) no Hoare annotation was computed. [2019-11-27 23:01:02,978 INFO L246 CegarLoopResult]: For program point L403(lines 403 572) no Hoare annotation was computed. [2019-11-27 23:01:02,978 INFO L246 CegarLoopResult]: For program point L370(lines 370 572) no Hoare annotation was computed. [2019-11-27 23:01:02,978 INFO L246 CegarLoopResult]: For program point L271(lines 271 572) no Hoare annotation was computed. [2019-11-27 23:01:02,979 INFO L246 CegarLoopResult]: For program point L172(line 172) no Hoare annotation was computed. [2019-11-27 23:01:02,980 INFO L246 CegarLoopResult]: For program point L139(line 139) no Hoare annotation was computed. [2019-11-27 23:01:02,980 INFO L246 CegarLoopResult]: For program point L106(line 106) no Hoare annotation was computed. [2019-11-27 23:01:02,980 INFO L246 CegarLoopResult]: For program point L73(line 73) no Hoare annotation was computed. [2019-11-27 23:01:02,981 INFO L246 CegarLoopResult]: For program point L40(line 40) no Hoare annotation was computed. [2019-11-27 23:01:02,982 INFO L246 CegarLoopResult]: For program point L569(lines 569 572) no Hoare annotation was computed. [2019-11-27 23:01:02,983 INFO L246 CegarLoopResult]: For program point L239(lines 239 572) no Hoare annotation was computed. [2019-11-27 23:01:02,983 INFO L246 CegarLoopResult]: For program point L504(lines 504 572) no Hoare annotation was computed. [2019-11-27 23:01:02,983 INFO L246 CegarLoopResult]: For program point L471(lines 471 572) no Hoare annotation was computed. [2019-11-27 23:01:02,983 INFO L246 CegarLoopResult]: For program point L306(lines 306 572) no Hoare annotation was computed. [2019-11-27 23:01:02,984 INFO L246 CegarLoopResult]: For program point L174-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:02,984 INFO L246 CegarLoopResult]: For program point L141-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:02,985 INFO L246 CegarLoopResult]: For program point L108-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:02,985 INFO L246 CegarLoopResult]: For program point L75-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:02,986 INFO L246 CegarLoopResult]: For program point L42-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:02,986 INFO L246 CegarLoopResult]: For program point L340(lines 340 572) no Hoare annotation was computed. [2019-11-27 23:01:02,986 INFO L246 CegarLoopResult]: For program point L175(line 175) no Hoare annotation was computed. [2019-11-27 23:01:02,986 INFO L246 CegarLoopResult]: For program point L142(line 142) no Hoare annotation was computed. [2019-11-27 23:01:02,987 INFO L246 CegarLoopResult]: For program point L109(line 109) no Hoare annotation was computed. [2019-11-27 23:01:02,987 INFO L246 CegarLoopResult]: For program point L76(line 76) no Hoare annotation was computed. [2019-11-27 23:01:02,987 INFO L246 CegarLoopResult]: For program point L43(line 43) no Hoare annotation was computed. [2019-11-27 23:01:02,988 INFO L242 CegarLoopResult]: At program point L573(lines 20 574) the Hoare annotation is: (let ((.cse0 (or (< 0 (+ ~a1~0 13)) (<= 9 ~a19~0)))) (or (= ~a10~0 0) (and .cse0 (not (= ~a19~0 10))) (and .cse0 (not (= ~a10~0 2))) (and (= ~a19~0 8) (not (= ~a10~0 1))) (<= 4 ~a10~0))) [2019-11-27 23:01:02,989 INFO L246 CegarLoopResult]: For program point L540(lines 540 572) no Hoare annotation was computed. [2019-11-27 23:01:02,989 INFO L246 CegarLoopResult]: For program point L408(lines 408 572) no Hoare annotation was computed. [2019-11-27 23:01:02,990 INFO L246 CegarLoopResult]: For program point L375(lines 375 572) no Hoare annotation was computed. [2019-11-27 23:01:02,990 INFO L246 CegarLoopResult]: For program point L210(lines 210 572) no Hoare annotation was computed. [2019-11-27 23:01:02,990 INFO L246 CegarLoopResult]: For program point L177-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:02,990 INFO L246 CegarLoopResult]: For program point L144-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:02,991 INFO L246 CegarLoopResult]: For program point L111-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:02,991 INFO L246 CegarLoopResult]: For program point L78-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:02,991 INFO L246 CegarLoopResult]: For program point L45-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:02,991 INFO L246 CegarLoopResult]: For program point L442(lines 442 572) no Hoare annotation was computed. [2019-11-27 23:01:02,992 INFO L246 CegarLoopResult]: For program point L277(lines 277 572) no Hoare annotation was computed. [2019-11-27 23:01:02,992 INFO L246 CegarLoopResult]: For program point L244(lines 244 572) no Hoare annotation was computed. [2019-11-27 23:01:02,992 INFO L246 CegarLoopResult]: For program point L178(line 178) no Hoare annotation was computed. [2019-11-27 23:01:02,992 INFO L246 CegarLoopResult]: For program point L145(line 145) no Hoare annotation was computed. [2019-11-27 23:01:02,992 INFO L246 CegarLoopResult]: For program point L112(line 112) no Hoare annotation was computed. [2019-11-27 23:01:02,993 INFO L246 CegarLoopResult]: For program point L79(line 79) no Hoare annotation was computed. [2019-11-27 23:01:02,993 INFO L246 CegarLoopResult]: For program point L46(line 46) no Hoare annotation was computed. [2019-11-27 23:01:02,993 INFO L246 CegarLoopResult]: For program point L509(lines 509 572) no Hoare annotation was computed. [2019-11-27 23:01:02,993 INFO L246 CegarLoopResult]: For program point L476(lines 476 572) no Hoare annotation was computed. [2019-11-27 23:01:02,994 INFO L249 CegarLoopResult]: At program point L576(lines 576 592) the Hoare annotation is: true [2019-11-27 23:01:02,994 INFO L246 CegarLoopResult]: For program point L378(lines 378 572) no Hoare annotation was computed. [2019-11-27 23:01:02,994 INFO L246 CegarLoopResult]: For program point L345(lines 345 572) no Hoare annotation was computed. [2019-11-27 23:01:02,994 INFO L246 CegarLoopResult]: For program point L312(lines 312 572) no Hoare annotation was computed. [2019-11-27 23:01:02,995 INFO L246 CegarLoopResult]: For program point L180-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:02,995 INFO L246 CegarLoopResult]: For program point L147-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:02,995 INFO L246 CegarLoopResult]: For program point L114-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:02,995 INFO L246 CegarLoopResult]: For program point L81-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:02,995 INFO L246 CegarLoopResult]: For program point L48-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:02,996 INFO L246 CegarLoopResult]: For program point L181(line 181) no Hoare annotation was computed. [2019-11-27 23:01:02,996 INFO L246 CegarLoopResult]: For program point L148(line 148) no Hoare annotation was computed. [2019-11-27 23:01:02,996 INFO L246 CegarLoopResult]: For program point L115(line 115) no Hoare annotation was computed. [2019-11-27 23:01:02,996 INFO L246 CegarLoopResult]: For program point L82(line 82) no Hoare annotation was computed. [2019-11-27 23:01:02,997 INFO L246 CegarLoopResult]: For program point L49(line 49) no Hoare annotation was computed. [2019-11-27 23:01:02,997 INFO L246 CegarLoopResult]: For program point L545(lines 545 572) no Hoare annotation was computed. [2019-11-27 23:01:02,997 INFO L246 CegarLoopResult]: For program point L215(lines 215 572) no Hoare annotation was computed. [2019-11-27 23:01:02,997 INFO L246 CegarLoopResult]: For program point L414(lines 414 572) no Hoare annotation was computed. [2019-11-27 23:01:02,998 INFO L246 CegarLoopResult]: For program point L249(lines 249 572) no Hoare annotation was computed. [2019-11-27 23:01:02,998 INFO L246 CegarLoopResult]: For program point L183-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:02,998 INFO L246 CegarLoopResult]: For program point L150-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:02,998 INFO L246 CegarLoopResult]: For program point L117-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:02,998 INFO L246 CegarLoopResult]: For program point L84-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:02,999 INFO L246 CegarLoopResult]: For program point L51-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:02,999 INFO L246 CegarLoopResult]: For program point L514(lines 514 572) no Hoare annotation was computed. [2019-11-27 23:01:02,999 INFO L246 CegarLoopResult]: For program point L481(lines 481 572) no Hoare annotation was computed. [2019-11-27 23:01:02,999 INFO L246 CegarLoopResult]: For program point L448(lines 448 572) no Hoare annotation was computed. [2019-11-27 23:01:03,000 INFO L246 CegarLoopResult]: For program point L283(lines 283 572) no Hoare annotation was computed. [2019-11-27 23:01:03,000 INFO L246 CegarLoopResult]: For program point L184(line 184) no Hoare annotation was computed. [2019-11-27 23:01:03,000 INFO L246 CegarLoopResult]: For program point L151(line 151) no Hoare annotation was computed. [2019-11-27 23:01:03,000 INFO L246 CegarLoopResult]: For program point L118(line 118) no Hoare annotation was computed. [2019-11-27 23:01:03,000 INFO L246 CegarLoopResult]: For program point L85(line 85) no Hoare annotation was computed. [2019-11-27 23:01:03,001 INFO L246 CegarLoopResult]: For program point L52(line 52) no Hoare annotation was computed. [2019-11-27 23:01:03,001 INFO L246 CegarLoopResult]: For program point L548(lines 548 572) no Hoare annotation was computed. [2019-11-27 23:01:03,001 INFO L246 CegarLoopResult]: For program point L383(lines 383 572) no Hoare annotation was computed. [2019-11-27 23:01:03,001 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-27 23:01:03,002 INFO L246 CegarLoopResult]: For program point L317(lines 317 572) no Hoare annotation was computed. [2019-11-27 23:01:03,003 INFO L242 CegarLoopResult]: At program point L582-2(lines 582 591) the Hoare annotation is: (let ((.cse0 (or (< 0 (+ ~a1~0 13)) (<= 9 ~a19~0)))) (or (= ~a10~0 0) (and .cse0 (not (= ~a19~0 10))) (and .cse0 (not (= ~a10~0 2))) (and (= ~a19~0 8) (not (= ~a10~0 1))) (<= 4 ~a10~0))) [2019-11-27 23:01:03,003 INFO L246 CegarLoopResult]: For program point L351(lines 351 572) no Hoare annotation was computed. [2019-11-27 23:01:03,003 INFO L246 CegarLoopResult]: For program point L186-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:03,004 INFO L246 CegarLoopResult]: For program point L153-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:03,004 INFO L246 CegarLoopResult]: For program point L120-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:03,004 INFO L246 CegarLoopResult]: For program point L87-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:03,004 INFO L246 CegarLoopResult]: For program point L21(lines 21 23) no Hoare annotation was computed. [2019-11-27 23:01:03,005 INFO L246 CegarLoopResult]: For program point L54-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:03,005 INFO L246 CegarLoopResult]: For program point L21-2(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:03,005 INFO L246 CegarLoopResult]: For program point L517(lines 517 572) no Hoare annotation was computed. [2019-11-27 23:01:03,005 INFO L246 CegarLoopResult]: For program point L286(lines 286 572) no Hoare annotation was computed. [2019-11-27 23:01:03,006 INFO L246 CegarLoopResult]: For program point L220(lines 220 572) no Hoare annotation was computed. [2019-11-27 23:01:03,006 INFO L246 CegarLoopResult]: For program point L187(line 187) no Hoare annotation was computed. [2019-11-27 23:01:03,006 INFO L246 CegarLoopResult]: For program point L154(line 154) no Hoare annotation was computed. [2019-11-27 23:01:03,006 INFO L246 CegarLoopResult]: For program point L121(line 121) no Hoare annotation was computed. [2019-11-27 23:01:03,007 INFO L246 CegarLoopResult]: For program point L88(line 88) no Hoare annotation was computed. [2019-11-27 23:01:03,007 INFO L246 CegarLoopResult]: For program point L55(line 55) no Hoare annotation was computed. [2019-11-27 23:01:03,007 INFO L246 CegarLoopResult]: For program point L22(line 22) no Hoare annotation was computed. [2019-11-27 23:01:03,007 INFO L246 CegarLoopResult]: For program point L419(lines 419 572) no Hoare annotation was computed. [2019-11-27 23:01:03,008 INFO L246 CegarLoopResult]: For program point L320(lines 320 572) no Hoare annotation was computed. [2019-11-27 23:01:03,008 INFO L246 CegarLoopResult]: For program point L254(lines 254 572) no Hoare annotation was computed. [2019-11-27 23:01:03,008 INFO L246 CegarLoopResult]: For program point L354(lines 354 572) no Hoare annotation was computed. [2019-11-27 23:01:03,008 INFO L246 CegarLoopResult]: For program point L189-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:03,009 INFO L246 CegarLoopResult]: For program point L156-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:03,009 INFO L246 CegarLoopResult]: For program point L123-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:03,009 INFO L246 CegarLoopResult]: For program point L90-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:03,009 INFO L246 CegarLoopResult]: For program point L57-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:03,010 INFO L246 CegarLoopResult]: For program point L24-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:03,010 INFO L246 CegarLoopResult]: For program point L487(lines 487 572) no Hoare annotation was computed. [2019-11-27 23:01:03,010 INFO L246 CegarLoopResult]: For program point L454(lines 454 572) no Hoare annotation was computed. [2019-11-27 23:01:03,010 INFO L246 CegarLoopResult]: For program point L388(lines 388 572) no Hoare annotation was computed. [2019-11-27 23:01:03,011 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-27 23:01:03,011 INFO L246 CegarLoopResult]: For program point L190(line 190) no Hoare annotation was computed. [2019-11-27 23:01:03,014 INFO L246 CegarLoopResult]: For program point L157(line 157) no Hoare annotation was computed. [2019-11-27 23:01:03,014 INFO L246 CegarLoopResult]: For program point L124(line 124) no Hoare annotation was computed. [2019-11-27 23:01:03,014 INFO L246 CegarLoopResult]: For program point L91(line 91) no Hoare annotation was computed. [2019-11-27 23:01:03,014 INFO L246 CegarLoopResult]: For program point L58(line 58) no Hoare annotation was computed. [2019-11-27 23:01:03,015 INFO L246 CegarLoopResult]: For program point L25(line 25) no Hoare annotation was computed. [2019-11-27 23:01:03,015 INFO L246 CegarLoopResult]: For program point L587(line 587) no Hoare annotation was computed. [2019-11-27 23:01:03,015 INFO L246 CegarLoopResult]: For program point L554(lines 554 572) no Hoare annotation was computed. [2019-11-27 23:01:03,015 INFO L246 CegarLoopResult]: For program point L323(lines 323 572) no Hoare annotation was computed. [2019-11-27 23:01:03,016 INFO L246 CegarLoopResult]: For program point L357(lines 357 572) no Hoare annotation was computed. [2019-11-27 23:01:03,016 INFO L246 CegarLoopResult]: For program point L291(lines 291 572) no Hoare annotation was computed. [2019-11-27 23:01:03,016 INFO L246 CegarLoopResult]: For program point L225(lines 225 572) no Hoare annotation was computed. [2019-11-27 23:01:03,016 INFO L246 CegarLoopResult]: For program point L192-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:03,016 INFO L246 CegarLoopResult]: For program point L159-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:03,016 INFO L246 CegarLoopResult]: For program point L126-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:03,017 INFO L246 CegarLoopResult]: For program point L93-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:03,017 INFO L246 CegarLoopResult]: For program point L60-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:03,017 INFO L246 CegarLoopResult]: For program point L27-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:03,017 INFO L246 CegarLoopResult]: For program point L523(lines 523 572) no Hoare annotation was computed. [2019-11-27 23:01:03,017 INFO L246 CegarLoopResult]: For program point L193(line 193) no Hoare annotation was computed. [2019-11-27 23:01:03,017 INFO L246 CegarLoopResult]: For program point L160(line 160) no Hoare annotation was computed. [2019-11-27 23:01:03,018 INFO L246 CegarLoopResult]: For program point L127(line 127) no Hoare annotation was computed. [2019-11-27 23:01:03,018 INFO L246 CegarLoopResult]: For program point L94(line 94) no Hoare annotation was computed. [2019-11-27 23:01:03,018 INFO L246 CegarLoopResult]: For program point L61(line 61) no Hoare annotation was computed. [2019-11-27 23:01:03,018 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-27 23:01:03,018 INFO L246 CegarLoopResult]: For program point L28(line 28) no Hoare annotation was computed. [2019-11-27 23:01:03,018 INFO L246 CegarLoopResult]: For program point L557(lines 557 572) no Hoare annotation was computed. [2019-11-27 23:01:03,019 INFO L246 CegarLoopResult]: For program point L425(lines 425 572) no Hoare annotation was computed. [2019-11-27 23:01:03,019 INFO L246 CegarLoopResult]: For program point L326(lines 326 572) no Hoare annotation was computed. [2019-11-27 23:01:03,019 INFO L246 CegarLoopResult]: For program point L260(lines 260 572) no Hoare annotation was computed. [2019-11-27 23:01:03,019 INFO L246 CegarLoopResult]: For program point L393(lines 393 572) no Hoare annotation was computed. [2019-11-27 23:01:03,019 INFO L246 CegarLoopResult]: For program point L360(lines 360 572) no Hoare annotation was computed. [2019-11-27 23:01:03,019 INFO L246 CegarLoopResult]: For program point L195-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:03,020 INFO L246 CegarLoopResult]: For program point L162-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:03,020 INFO L246 CegarLoopResult]: For program point L129-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:03,020 INFO L246 CegarLoopResult]: For program point L96-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:03,020 INFO L246 CegarLoopResult]: For program point L63-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:03,020 INFO L246 CegarLoopResult]: For program point L30-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:03,020 INFO L246 CegarLoopResult]: For program point L526(lines 526 572) no Hoare annotation was computed. [2019-11-27 23:01:03,020 INFO L246 CegarLoopResult]: For program point L493(lines 493 572) no Hoare annotation was computed. [2019-11-27 23:01:03,021 INFO L246 CegarLoopResult]: For program point L460(lines 460 572) no Hoare annotation was computed. [2019-11-27 23:01:03,021 INFO L246 CegarLoopResult]: For program point L196(line 196) no Hoare annotation was computed. [2019-11-27 23:01:03,021 INFO L246 CegarLoopResult]: For program point L163(line 163) no Hoare annotation was computed. [2019-11-27 23:01:03,021 INFO L246 CegarLoopResult]: For program point L130(line 130) no Hoare annotation was computed. [2019-11-27 23:01:03,021 INFO L246 CegarLoopResult]: For program point L97(line 97) no Hoare annotation was computed. [2019-11-27 23:01:03,021 INFO L246 CegarLoopResult]: For program point L64(line 64) no Hoare annotation was computed. [2019-11-27 23:01:03,022 INFO L246 CegarLoopResult]: For program point L31(line 31) no Hoare annotation was computed. [2019-11-27 23:01:03,022 INFO L246 CegarLoopResult]: For program point L329(lines 329 572) no Hoare annotation was computed. [2019-11-27 23:01:03,022 INFO L246 CegarLoopResult]: For program point L296(lines 296 572) no Hoare annotation was computed. [2019-11-27 23:01:03,022 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-27 23:01:03,022 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 139) no Hoare annotation was computed. [2019-11-27 23:01:03,022 INFO L246 CegarLoopResult]: For program point L231(lines 231 572) no Hoare annotation was computed. [2019-11-27 23:01:03,023 INFO L246 CegarLoopResult]: For program point L198-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:03,023 INFO L246 CegarLoopResult]: For program point L165-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:03,023 INFO L246 CegarLoopResult]: For program point L132-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:03,023 INFO L246 CegarLoopResult]: For program point L99-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:03,023 INFO L246 CegarLoopResult]: For program point L66-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:03,023 INFO L246 CegarLoopResult]: For program point L33-1(lines 20 574) no Hoare annotation was computed. [2019-11-27 23:01:03,024 INFO L246 CegarLoopResult]: For program point L529(lines 529 572) no Hoare annotation was computed. [2019-11-27 23:01:03,024 INFO L246 CegarLoopResult]: For program point L430(lines 430 572) no Hoare annotation was computed. [2019-11-27 23:01:03,024 INFO L246 CegarLoopResult]: For program point L265(lines 265 572) no Hoare annotation was computed. [2019-11-27 23:01:03,024 INFO L246 CegarLoopResult]: For program point L199(line 199) no Hoare annotation was computed. [2019-11-27 23:01:03,025 INFO L246 CegarLoopResult]: For program point L166(line 166) no Hoare annotation was computed. [2019-11-27 23:01:03,025 INFO L246 CegarLoopResult]: For program point L133(line 133) no Hoare annotation was computed. [2019-11-27 23:01:03,025 INFO L246 CegarLoopResult]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-27 23:01:03,025 INFO L246 CegarLoopResult]: For program point L67(line 67) no Hoare annotation was computed. [2019-11-27 23:01:03,026 INFO L246 CegarLoopResult]: For program point L34(line 34) no Hoare annotation was computed. [2019-11-27 23:01:03,026 INFO L246 CegarLoopResult]: For program point L563(lines 563 572) no Hoare annotation was computed. [2019-11-27 23:01:03,026 INFO L246 CegarLoopResult]: For program point L398(lines 398 572) no Hoare annotation was computed. [2019-11-27 23:01:03,026 INFO L246 CegarLoopResult]: For program point L365(lines 365 572) no Hoare annotation was computed. [2019-11-27 23:01:03,073 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 11:01:03 BoogieIcfgContainer [2019-11-27 23:01:03,073 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-27 23:01:03,074 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-27 23:01:03,074 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-27 23:01:03,074 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-27 23:01:03,075 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:00:47" (3/4) ... [2019-11-27 23:01:03,080 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-27 23:01:03,123 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-27 23:01:03,125 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-27 23:01:03,341 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-27 23:01:03,341 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-27 23:01:03,343 INFO L168 Benchmark]: Toolchain (without parser) took 18245.22 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 587.2 MB). Free memory was 960.4 MB in the beginning and 1.2 GB in the end (delta: -209.4 MB). Peak memory consumption was 377.8 MB. Max. memory is 11.5 GB. [2019-11-27 23:01:03,344 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 23:01:03,344 INFO L168 Benchmark]: CACSL2BoogieTranslator took 745.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -163.4 MB). Peak memory consumption was 21.1 MB. Max. memory is 11.5 GB. [2019-11-27 23:01:03,345 INFO L168 Benchmark]: Boogie Procedure Inliner took 179.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-27 23:01:03,345 INFO L168 Benchmark]: Boogie Preprocessor took 137.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-27 23:01:03,345 INFO L168 Benchmark]: RCFGBuilder took 1526.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 993.3 MB in the end (delta: 111.8 MB). Peak memory consumption was 111.8 MB. Max. memory is 11.5 GB. [2019-11-27 23:01:03,346 INFO L168 Benchmark]: TraceAbstraction took 15382.49 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 443.0 MB). Free memory was 993.3 MB in the beginning and 1.2 GB in the end (delta: -191.4 MB). Peak memory consumption was 251.7 MB. Max. memory is 11.5 GB. [2019-11-27 23:01:03,346 INFO L168 Benchmark]: Witness Printer took 267.74 ms. Allocated memory is still 1.6 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 14.9 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. [2019-11-27 23:01:03,349 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 745.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -163.4 MB). Peak memory consumption was 21.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 179.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 137.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1526.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 993.3 MB in the end (delta: 111.8 MB). Peak memory consumption was 111.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 15382.49 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 443.0 MB). Free memory was 993.3 MB in the beginning and 1.2 GB in the end (delta: -191.4 MB). Peak memory consumption was 251.7 MB. Max. memory is 11.5 GB. * Witness Printer took 267.74 ms. Allocated memory is still 1.6 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 14.9 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 139]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 582]: Loop Invariant Derived loop invariant: (((a10 == 0 || ((0 < a1 + 13 || 9 <= a19) && !(a19 == 10))) || ((0 < a1 + 13 || 9 <= a19) && !(a10 == 2))) || (a19 == 8 && !(a10 == 1))) || 4 <= a10 - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: (((a10 == 0 || ((0 < a1 + 13 || 9 <= a19) && !(a19 == 10))) || ((0 < a1 + 13 || 9 <= a19) && !(a10 == 2))) || (a19 == 8 && !(a10 == 1))) || 4 <= a10 - InvariantResult [Line: 576]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 206 locations, 1 error locations. Result: SAFE, OverallTime: 14.7s, OverallIterations: 9, TraceHistogramMax: 4, AutomataDifference: 9.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, HoareTripleCheckerStatistics: 815 SDtfs, 1724 SDslu, 101 SDs, 0 SdLazy, 6024 SolverSat, 932 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 861 GetRequests, 822 SyntacticMatches, 5 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1811occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 567 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 54 NumberOfFragments, 87 HoareAnnotationTreeSize, 3 FomulaSimplifications, 2308 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 2706 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 2870 NumberOfCodeBlocks, 2870 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2858 ConstructedInterpolants, 0 QuantifiedInterpolants, 3167948 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1111 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 12 InterpolantComputations, 9 PerfectInterpolantSequences, 2092/2420 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...