./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/loops/s3_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/loops/s3_false-unreach-call.i -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 cdf0cf9bd7de1f69825d4535f203da45c4edbbfc ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/loops/s3_false-unreach-call.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 cdf0cf9bd7de1f69825d4535f203da45c4edbbfc .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 17:02:02,704 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 17:02:02,706 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 17:02:02,719 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 17:02:02,719 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 17:02:02,723 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 17:02:02,724 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 17:02:02,726 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 17:02:02,729 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 17:02:02,730 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 17:02:02,731 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 17:02:02,732 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 17:02:02,733 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 17:02:02,735 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 17:02:02,743 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 17:02:02,743 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 17:02:02,744 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 17:02:02,749 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 17:02:02,754 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 17:02:02,756 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 17:02:02,761 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 17:02:02,762 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 17:02:02,767 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 17:02:02,767 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 17:02:02,767 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 17:02:02,768 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 17:02:02,771 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 17:02:02,772 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 17:02:02,773 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 17:02:02,776 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 17:02:02,776 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 17:02:02,778 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 17:02:02,778 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 17:02:02,778 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 17:02:02,779 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 17:02:02,782 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 17:02:02,782 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-14 17:02:02,799 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 17:02:02,799 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 17:02:02,800 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 17:02:02,800 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 17:02:02,801 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 17:02:02,801 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 17:02:02,801 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 17:02:02,801 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 17:02:02,801 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 17:02:02,802 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 17:02:02,802 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-14 17:02:02,802 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 17:02:02,802 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-14 17:02:02,802 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 17:02:02,802 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 17:02:02,803 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-14 17:02:02,803 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 17:02:02,803 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 17:02:02,803 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 17:02:02,803 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 17:02:02,804 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 17:02:02,804 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 17:02:02,804 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 17:02:02,804 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-14 17:02:02,804 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 17:02:02,805 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 17:02:02,805 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-14 17:02:02,805 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cdf0cf9bd7de1f69825d4535f203da45c4edbbfc [2019-01-14 17:02:02,846 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 17:02:02,860 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 17:02:02,864 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 17:02:02,865 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 17:02:02,866 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 17:02:02,867 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/loops/s3_false-unreach-call.i [2019-01-14 17:02:02,930 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8e9522ee/489cfde145584a429d186cffec4222fd/FLAG7f15b4ffa [2019-01-14 17:02:03,513 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 17:02:03,514 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/loops/s3_false-unreach-call.i [2019-01-14 17:02:03,538 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8e9522ee/489cfde145584a429d186cffec4222fd/FLAG7f15b4ffa [2019-01-14 17:02:03,718 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8e9522ee/489cfde145584a429d186cffec4222fd [2019-01-14 17:02:03,721 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 17:02:03,722 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 17:02:03,724 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 17:02:03,724 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 17:02:03,727 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 17:02:03,728 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 05:02:03" (1/1) ... [2019-01-14 17:02:03,731 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bbae27e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:02:03, skipping insertion in model container [2019-01-14 17:02:03,731 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 05:02:03" (1/1) ... [2019-01-14 17:02:03,739 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 17:02:03,825 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 17:02:04,298 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 17:02:04,314 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 17:02:04,546 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 17:02:04,579 INFO L195 MainTranslator]: Completed translation [2019-01-14 17:02:04,579 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:02:04 WrapperNode [2019-01-14 17:02:04,580 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 17:02:04,582 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 17:02:04,582 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 17:02:04,582 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 17:02:04,591 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:02:04" (1/1) ... [2019-01-14 17:02:04,628 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:02:04" (1/1) ... [2019-01-14 17:02:04,677 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 17:02:04,677 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 17:02:04,677 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 17:02:04,678 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 17:02:04,690 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:02:04" (1/1) ... [2019-01-14 17:02:04,690 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:02:04" (1/1) ... [2019-01-14 17:02:04,713 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:02:04" (1/1) ... [2019-01-14 17:02:04,713 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:02:04" (1/1) ... [2019-01-14 17:02:04,789 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:02:04" (1/1) ... [2019-01-14 17:02:04,806 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:02:04" (1/1) ... [2019-01-14 17:02:04,813 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:02:04" (1/1) ... [2019-01-14 17:02:04,827 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 17:02:04,828 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 17:02:04,828 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 17:02:04,828 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 17:02:04,829 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:02:04" (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-01-14 17:02:04,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-01-14 17:02:04,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-14 17:02:04,927 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 17:02:04,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 17:02:04,927 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 17:02:04,928 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-14 17:02:04,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-14 17:02:04,929 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-14 17:02:04,929 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 17:02:04,929 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 17:02:05,337 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-14 17:02:07,002 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-01-14 17:02:07,002 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-01-14 17:02:07,004 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 17:02:07,004 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-14 17:02:07,006 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 05:02:07 BoogieIcfgContainer [2019-01-14 17:02:07,010 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 17:02:07,011 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 17:02:07,011 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 17:02:07,019 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 17:02:07,019 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 05:02:03" (1/3) ... [2019-01-14 17:02:07,020 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72575727 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 05:02:07, skipping insertion in model container [2019-01-14 17:02:07,020 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:02:04" (2/3) ... [2019-01-14 17:02:07,021 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72575727 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 05:02:07, skipping insertion in model container [2019-01-14 17:02:07,021 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 05:02:07" (3/3) ... [2019-01-14 17:02:07,024 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_false-unreach-call.i [2019-01-14 17:02:07,032 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 17:02:07,040 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-14 17:02:07,056 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-14 17:02:07,082 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 17:02:07,082 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 17:02:07,083 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-14 17:02:07,083 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 17:02:07,083 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 17:02:07,083 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 17:02:07,083 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 17:02:07,084 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 17:02:07,084 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 17:02:07,102 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states. [2019-01-14 17:02:07,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-14 17:02:07,110 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:02:07,111 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 17:02:07,113 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:02:07,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:02:07,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1457703967, now seen corresponding path program 1 times [2019-01-14 17:02:07,121 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:02:07,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:02:07,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:02:07,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:02:07,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:02:07,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:02:07,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 17:02:07,508 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 17:02:07,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 17:02:07,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 17:02:07,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 17:02:07,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 17:02:07,531 INFO L87 Difference]: Start difference. First operand 131 states. Second operand 3 states. [2019-01-14 17:02:07,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:02:07,881 INFO L93 Difference]: Finished difference Result 375 states and 626 transitions. [2019-01-14 17:02:07,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 17:02:07,883 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-01-14 17:02:07,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:02:07,897 INFO L225 Difference]: With dead ends: 375 [2019-01-14 17:02:07,897 INFO L226 Difference]: Without dead ends: 217 [2019-01-14 17:02:07,901 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 17:02:07,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-01-14 17:02:07,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2019-01-14 17:02:07,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-01-14 17:02:07,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 321 transitions. [2019-01-14 17:02:07,968 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 321 transitions. Word has length 24 [2019-01-14 17:02:07,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:02:07,968 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 321 transitions. [2019-01-14 17:02:07,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 17:02:07,969 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 321 transitions. [2019-01-14 17:02:07,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-14 17:02:07,971 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:02:07,972 INFO L402 BasicCegarLoop]: trace histogram [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] [2019-01-14 17:02:07,972 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:02:07,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:02:07,972 INFO L82 PathProgramCache]: Analyzing trace with hash 546953675, now seen corresponding path program 1 times [2019-01-14 17:02:07,973 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:02:07,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:02:07,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:02:07,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:02:07,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:02:08,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:02:08,283 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 17:02:08,283 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 17:02:08,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 17:02:08,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 17:02:08,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 17:02:08,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 17:02:08,286 INFO L87 Difference]: Start difference. First operand 217 states and 321 transitions. Second operand 4 states. [2019-01-14 17:02:09,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:02:09,501 INFO L93 Difference]: Finished difference Result 359 states and 534 transitions. [2019-01-14 17:02:09,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 17:02:09,502 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-01-14 17:02:09,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:02:09,504 INFO L225 Difference]: With dead ends: 359 [2019-01-14 17:02:09,505 INFO L226 Difference]: Without dead ends: 252 [2019-01-14 17:02:09,506 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 17:02:09,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2019-01-14 17:02:09,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 235. [2019-01-14 17:02:09,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-01-14 17:02:09,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 351 transitions. [2019-01-14 17:02:09,525 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 351 transitions. Word has length 39 [2019-01-14 17:02:09,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:02:09,526 INFO L480 AbstractCegarLoop]: Abstraction has 235 states and 351 transitions. [2019-01-14 17:02:09,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 17:02:09,526 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 351 transitions. [2019-01-14 17:02:09,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-14 17:02:09,529 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:02:09,529 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-01-14 17:02:09,530 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:02:09,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:02:09,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1468155038, now seen corresponding path program 1 times [2019-01-14 17:02:09,530 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:02:09,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:02:09,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:02:09,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:02:09,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:02:09,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:02:09,743 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 17:02:09,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 17:02:09,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 17:02:09,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 17:02:09,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 17:02:09,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 17:02:09,747 INFO L87 Difference]: Start difference. First operand 235 states and 351 transitions. Second operand 4 states. [2019-01-14 17:02:10,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:02:10,239 INFO L93 Difference]: Finished difference Result 376 states and 562 transitions. [2019-01-14 17:02:10,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 17:02:10,242 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-01-14 17:02:10,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:02:10,244 INFO L225 Difference]: With dead ends: 376 [2019-01-14 17:02:10,245 INFO L226 Difference]: Without dead ends: 251 [2019-01-14 17:02:10,246 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 17:02:10,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-01-14 17:02:10,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 235. [2019-01-14 17:02:10,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-01-14 17:02:10,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 350 transitions. [2019-01-14 17:02:10,262 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 350 transitions. Word has length 54 [2019-01-14 17:02:10,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:02:10,263 INFO L480 AbstractCegarLoop]: Abstraction has 235 states and 350 transitions. [2019-01-14 17:02:10,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 17:02:10,263 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 350 transitions. [2019-01-14 17:02:10,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-14 17:02:10,266 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:02:10,266 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2019-01-14 17:02:10,267 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:02:10,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:02:10,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1486810496, now seen corresponding path program 1 times [2019-01-14 17:02:10,267 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:02:10,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:02:10,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:02:10,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:02:10,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:02:10,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:02:10,493 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 17:02:10,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 17:02:10,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 17:02:10,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 17:02:10,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 17:02:10,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 17:02:10,495 INFO L87 Difference]: Start difference. First operand 235 states and 350 transitions. Second operand 4 states. [2019-01-14 17:02:11,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:02:11,014 INFO L93 Difference]: Finished difference Result 376 states and 560 transitions. [2019-01-14 17:02:11,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 17:02:11,015 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-01-14 17:02:11,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:02:11,017 INFO L225 Difference]: With dead ends: 376 [2019-01-14 17:02:11,017 INFO L226 Difference]: Without dead ends: 251 [2019-01-14 17:02:11,018 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 17:02:11,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-01-14 17:02:11,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 235. [2019-01-14 17:02:11,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-01-14 17:02:11,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 349 transitions. [2019-01-14 17:02:11,032 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 349 transitions. Word has length 54 [2019-01-14 17:02:11,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:02:11,033 INFO L480 AbstractCegarLoop]: Abstraction has 235 states and 349 transitions. [2019-01-14 17:02:11,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 17:02:11,033 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 349 transitions. [2019-01-14 17:02:11,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-14 17:02:11,036 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:02:11,036 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-01-14 17:02:11,036 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:02:11,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:02:11,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1014296481, now seen corresponding path program 1 times [2019-01-14 17:02:11,037 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:02:11,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:02:11,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:02:11,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:02:11,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:02:11,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:02:11,187 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 17:02:11,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 17:02:11,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 17:02:11,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 17:02:11,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 17:02:11,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 17:02:11,189 INFO L87 Difference]: Start difference. First operand 235 states and 349 transitions. Second operand 4 states. [2019-01-14 17:02:11,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:02:11,680 INFO L93 Difference]: Finished difference Result 376 states and 558 transitions. [2019-01-14 17:02:11,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 17:02:11,681 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-01-14 17:02:11,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:02:11,682 INFO L225 Difference]: With dead ends: 376 [2019-01-14 17:02:11,683 INFO L226 Difference]: Without dead ends: 251 [2019-01-14 17:02:11,683 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 17:02:11,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-01-14 17:02:11,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 235. [2019-01-14 17:02:11,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-01-14 17:02:11,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 348 transitions. [2019-01-14 17:02:11,693 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 348 transitions. Word has length 55 [2019-01-14 17:02:11,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:02:11,694 INFO L480 AbstractCegarLoop]: Abstraction has 235 states and 348 transitions. [2019-01-14 17:02:11,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 17:02:11,694 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 348 transitions. [2019-01-14 17:02:11,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-14 17:02:11,696 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:02:11,696 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2019-01-14 17:02:11,696 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:02:11,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:02:11,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1792231515, now seen corresponding path program 1 times [2019-01-14 17:02:11,697 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:02:11,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:02:11,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:02:11,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:02:11,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:02:11,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:02:12,000 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 17:02:12,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 17:02:12,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 17:02:12,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 17:02:12,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 17:02:12,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 17:02:12,001 INFO L87 Difference]: Start difference. First operand 235 states and 348 transitions. Second operand 4 states. [2019-01-14 17:02:12,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:02:12,659 INFO L93 Difference]: Finished difference Result 376 states and 556 transitions. [2019-01-14 17:02:12,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 17:02:12,660 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-01-14 17:02:12,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:02:12,662 INFO L225 Difference]: With dead ends: 376 [2019-01-14 17:02:12,662 INFO L226 Difference]: Without dead ends: 251 [2019-01-14 17:02:12,662 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 17:02:12,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-01-14 17:02:12,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 235. [2019-01-14 17:02:12,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-01-14 17:02:12,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 347 transitions. [2019-01-14 17:02:12,670 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 347 transitions. Word has length 56 [2019-01-14 17:02:12,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:02:12,670 INFO L480 AbstractCegarLoop]: Abstraction has 235 states and 347 transitions. [2019-01-14 17:02:12,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 17:02:12,671 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 347 transitions. [2019-01-14 17:02:12,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-14 17:02:12,673 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:02:12,673 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-01-14 17:02:12,673 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:02:12,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:02:12,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1615585892, now seen corresponding path program 1 times [2019-01-14 17:02:12,674 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:02:12,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:02:12,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:02:12,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:02:12,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:02:12,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:02:12,803 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 17:02:12,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 17:02:12,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 17:02:12,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 17:02:12,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 17:02:12,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 17:02:12,805 INFO L87 Difference]: Start difference. First operand 235 states and 347 transitions. Second operand 4 states. [2019-01-14 17:02:13,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:02:13,070 INFO L93 Difference]: Finished difference Result 367 states and 543 transitions. [2019-01-14 17:02:13,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 17:02:13,071 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-01-14 17:02:13,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:02:13,072 INFO L225 Difference]: With dead ends: 367 [2019-01-14 17:02:13,072 INFO L226 Difference]: Without dead ends: 242 [2019-01-14 17:02:13,073 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 17:02:13,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-01-14 17:02:13,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 235. [2019-01-14 17:02:13,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-01-14 17:02:13,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 346 transitions. [2019-01-14 17:02:13,079 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 346 transitions. Word has length 57 [2019-01-14 17:02:13,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:02:13,079 INFO L480 AbstractCegarLoop]: Abstraction has 235 states and 346 transitions. [2019-01-14 17:02:13,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 17:02:13,079 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 346 transitions. [2019-01-14 17:02:13,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-14 17:02:13,081 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:02:13,081 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2019-01-14 17:02:13,081 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:02:13,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:02:13,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1711683715, now seen corresponding path program 1 times [2019-01-14 17:02:13,082 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:02:13,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:02:13,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:02:13,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:02:13,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:02:13,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:02:13,184 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-01-14 17:02:13,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 17:02:13,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 17:02:13,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 17:02:13,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 17:02:13,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 17:02:13,186 INFO L87 Difference]: Start difference. First operand 235 states and 346 transitions. Second operand 3 states. [2019-01-14 17:02:13,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:02:13,509 INFO L93 Difference]: Finished difference Result 483 states and 715 transitions. [2019-01-14 17:02:13,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 17:02:13,509 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-01-14 17:02:13,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:02:13,512 INFO L225 Difference]: With dead ends: 483 [2019-01-14 17:02:13,512 INFO L226 Difference]: Without dead ends: 358 [2019-01-14 17:02:13,513 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 17:02:13,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-01-14 17:02:13,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 358. [2019-01-14 17:02:13,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2019-01-14 17:02:13,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 527 transitions. [2019-01-14 17:02:13,533 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 527 transitions. Word has length 57 [2019-01-14 17:02:13,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:02:13,533 INFO L480 AbstractCegarLoop]: Abstraction has 358 states and 527 transitions. [2019-01-14 17:02:13,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 17:02:13,535 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 527 transitions. [2019-01-14 17:02:13,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-01-14 17:02:13,538 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:02:13,538 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2019-01-14 17:02:13,539 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:02:13,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:02:13,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1922596163, now seen corresponding path program 1 times [2019-01-14 17:02:13,539 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:02:13,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:02:13,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:02:13,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:02:13,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:02:13,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:02:13,910 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-01-14 17:02:13,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 17:02:13,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 17:02:13,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 17:02:13,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 17:02:13,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 17:02:13,912 INFO L87 Difference]: Start difference. First operand 358 states and 527 transitions. Second operand 4 states. [2019-01-14 17:02:15,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:02:15,277 INFO L93 Difference]: Finished difference Result 989 states and 1463 transitions. [2019-01-14 17:02:15,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 17:02:15,280 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-01-14 17:02:15,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:02:15,284 INFO L225 Difference]: With dead ends: 989 [2019-01-14 17:02:15,284 INFO L226 Difference]: Without dead ends: 638 [2019-01-14 17:02:15,285 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 17:02:15,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2019-01-14 17:02:15,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 421. [2019-01-14 17:02:15,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-01-14 17:02:15,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 632 transitions. [2019-01-14 17:02:15,305 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 632 transitions. Word has length 77 [2019-01-14 17:02:15,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:02:15,305 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 632 transitions. [2019-01-14 17:02:15,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 17:02:15,306 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 632 transitions. [2019-01-14 17:02:15,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-01-14 17:02:15,308 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:02:15,308 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2019-01-14 17:02:15,308 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:02:15,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:02:15,309 INFO L82 PathProgramCache]: Analyzing trace with hash -126791679, now seen corresponding path program 1 times [2019-01-14 17:02:15,309 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:02:15,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:02:15,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:02:15,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:02:15,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:02:15,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:02:15,646 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-01-14 17:02:15,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 17:02:15,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 17:02:15,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 17:02:15,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 17:02:15,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 17:02:15,649 INFO L87 Difference]: Start difference. First operand 421 states and 632 transitions. Second operand 4 states. [2019-01-14 17:02:16,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:02:16,193 INFO L93 Difference]: Finished difference Result 975 states and 1463 transitions. [2019-01-14 17:02:16,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 17:02:16,195 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-01-14 17:02:16,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:02:16,198 INFO L225 Difference]: With dead ends: 975 [2019-01-14 17:02:16,198 INFO L226 Difference]: Without dead ends: 561 [2019-01-14 17:02:16,199 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 17:02:16,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2019-01-14 17:02:16,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 487. [2019-01-14 17:02:16,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2019-01-14 17:02:16,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 746 transitions. [2019-01-14 17:02:16,215 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 746 transitions. Word has length 77 [2019-01-14 17:02:16,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:02:16,216 INFO L480 AbstractCegarLoop]: Abstraction has 487 states and 746 transitions. [2019-01-14 17:02:16,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 17:02:16,216 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 746 transitions. [2019-01-14 17:02:16,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-14 17:02:16,217 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:02:16,218 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2019-01-14 17:02:16,218 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:02:16,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:02:16,218 INFO L82 PathProgramCache]: Analyzing trace with hash 416305772, now seen corresponding path program 1 times [2019-01-14 17:02:16,218 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:02:16,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:02:16,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:02:16,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:02:16,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:02:16,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:02:16,548 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-01-14 17:02:16,550 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 17:02:16,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 17:02:16,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 17:02:16,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 17:02:16,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 17:02:16,552 INFO L87 Difference]: Start difference. First operand 487 states and 746 transitions. Second operand 4 states. [2019-01-14 17:02:17,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:02:17,558 INFO L93 Difference]: Finished difference Result 1038 states and 1571 transitions. [2019-01-14 17:02:17,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 17:02:17,562 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-01-14 17:02:17,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:02:17,566 INFO L225 Difference]: With dead ends: 1038 [2019-01-14 17:02:17,567 INFO L226 Difference]: Without dead ends: 558 [2019-01-14 17:02:17,569 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 17:02:17,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2019-01-14 17:02:17,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 487. [2019-01-14 17:02:17,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2019-01-14 17:02:17,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 743 transitions. [2019-01-14 17:02:17,589 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 743 transitions. Word has length 92 [2019-01-14 17:02:17,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:02:17,590 INFO L480 AbstractCegarLoop]: Abstraction has 487 states and 743 transitions. [2019-01-14 17:02:17,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 17:02:17,590 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 743 transitions. [2019-01-14 17:02:17,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-14 17:02:17,591 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:02:17,591 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2019-01-14 17:02:17,593 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:02:17,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:02:17,594 INFO L82 PathProgramCache]: Analyzing trace with hash 397650314, now seen corresponding path program 1 times [2019-01-14 17:02:17,594 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:02:17,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:02:17,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:02:17,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:02:17,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:02:17,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:02:17,710 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-01-14 17:02:17,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 17:02:17,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 17:02:17,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 17:02:17,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 17:02:17,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 17:02:17,711 INFO L87 Difference]: Start difference. First operand 487 states and 743 transitions. Second operand 4 states. [2019-01-14 17:02:18,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:02:18,266 INFO L93 Difference]: Finished difference Result 1038 states and 1565 transitions. [2019-01-14 17:02:18,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 17:02:18,267 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-01-14 17:02:18,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:02:18,270 INFO L225 Difference]: With dead ends: 1038 [2019-01-14 17:02:18,270 INFO L226 Difference]: Without dead ends: 558 [2019-01-14 17:02:18,271 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 17:02:18,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2019-01-14 17:02:18,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 487. [2019-01-14 17:02:18,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2019-01-14 17:02:18,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 740 transitions. [2019-01-14 17:02:18,291 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 740 transitions. Word has length 92 [2019-01-14 17:02:18,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:02:18,291 INFO L480 AbstractCegarLoop]: Abstraction has 487 states and 740 transitions. [2019-01-14 17:02:18,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 17:02:18,292 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 740 transitions. [2019-01-14 17:02:18,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-14 17:02:18,293 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:02:18,293 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2019-01-14 17:02:18,294 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:02:18,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:02:18,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1569413781, now seen corresponding path program 1 times [2019-01-14 17:02:18,294 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:02:18,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:02:18,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:02:18,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:02:18,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:02:18,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:02:18,647 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-01-14 17:02:18,648 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 17:02:18,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 17:02:18,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 17:02:18,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 17:02:18,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 17:02:18,650 INFO L87 Difference]: Start difference. First operand 487 states and 740 transitions. Second operand 4 states. [2019-01-14 17:02:19,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:02:19,065 INFO L93 Difference]: Finished difference Result 1038 states and 1559 transitions. [2019-01-14 17:02:19,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 17:02:19,066 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-01-14 17:02:19,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:02:19,070 INFO L225 Difference]: With dead ends: 1038 [2019-01-14 17:02:19,070 INFO L226 Difference]: Without dead ends: 558 [2019-01-14 17:02:19,072 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 17:02:19,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2019-01-14 17:02:19,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 487. [2019-01-14 17:02:19,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2019-01-14 17:02:19,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 737 transitions. [2019-01-14 17:02:19,089 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 737 transitions. Word has length 93 [2019-01-14 17:02:19,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:02:19,090 INFO L480 AbstractCegarLoop]: Abstraction has 487 states and 737 transitions. [2019-01-14 17:02:19,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 17:02:19,090 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 737 transitions. [2019-01-14 17:02:19,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-14 17:02:19,091 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:02:19,093 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 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] [2019-01-14 17:02:19,093 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:02:19,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:02:19,094 INFO L82 PathProgramCache]: Analyzing trace with hash 993375279, now seen corresponding path program 1 times [2019-01-14 17:02:19,094 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:02:19,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:02:19,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:02:19,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:02:19,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:02:19,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:02:19,381 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-01-14 17:02:19,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 17:02:19,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 17:02:19,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 17:02:19,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 17:02:19,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 17:02:19,383 INFO L87 Difference]: Start difference. First operand 487 states and 737 transitions. Second operand 4 states. [2019-01-14 17:02:19,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:02:19,919 INFO L93 Difference]: Finished difference Result 1038 states and 1553 transitions. [2019-01-14 17:02:19,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 17:02:19,922 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-01-14 17:02:19,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:02:19,924 INFO L225 Difference]: With dead ends: 1038 [2019-01-14 17:02:19,924 INFO L226 Difference]: Without dead ends: 558 [2019-01-14 17:02:19,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 17:02:19,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2019-01-14 17:02:19,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 487. [2019-01-14 17:02:19,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2019-01-14 17:02:19,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 734 transitions. [2019-01-14 17:02:19,941 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 734 transitions. Word has length 94 [2019-01-14 17:02:19,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:02:19,942 INFO L480 AbstractCegarLoop]: Abstraction has 487 states and 734 transitions. [2019-01-14 17:02:19,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 17:02:19,942 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 734 transitions. [2019-01-14 17:02:19,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-14 17:02:19,943 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:02:19,944 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 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] [2019-01-14 17:02:19,944 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:02:19,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:02:19,944 INFO L82 PathProgramCache]: Analyzing trace with hash 2070050586, now seen corresponding path program 1 times [2019-01-14 17:02:19,944 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:02:19,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:02:19,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:02:19,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:02:19,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:02:19,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:02:20,142 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-01-14 17:02:20,143 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 17:02:20,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 17:02:20,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 17:02:20,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 17:02:20,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 17:02:20,144 INFO L87 Difference]: Start difference. First operand 487 states and 734 transitions. Second operand 4 states. [2019-01-14 17:02:20,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:02:20,518 INFO L93 Difference]: Finished difference Result 1011 states and 1514 transitions. [2019-01-14 17:02:20,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 17:02:20,520 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-01-14 17:02:20,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:02:20,523 INFO L225 Difference]: With dead ends: 1011 [2019-01-14 17:02:20,523 INFO L226 Difference]: Without dead ends: 531 [2019-01-14 17:02:20,525 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 17:02:20,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2019-01-14 17:02:20,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 487. [2019-01-14 17:02:20,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2019-01-14 17:02:20,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 731 transitions. [2019-01-14 17:02:20,542 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 731 transitions. Word has length 95 [2019-01-14 17:02:20,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:02:20,543 INFO L480 AbstractCegarLoop]: Abstraction has 487 states and 731 transitions. [2019-01-14 17:02:20,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 17:02:20,543 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 731 transitions. [2019-01-14 17:02:20,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-14 17:02:20,545 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:02:20,546 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 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] [2019-01-14 17:02:20,546 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:02:20,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:02:20,547 INFO L82 PathProgramCache]: Analyzing trace with hash -2066779273, now seen corresponding path program 1 times [2019-01-14 17:02:20,547 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:02:20,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:02:20,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:02:20,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:02:20,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:02:20,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:02:20,681 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-01-14 17:02:20,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 17:02:20,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 17:02:20,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 17:02:20,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 17:02:20,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 17:02:20,682 INFO L87 Difference]: Start difference. First operand 487 states and 731 transitions. Second operand 4 states. [2019-01-14 17:02:21,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:02:21,095 INFO L93 Difference]: Finished difference Result 1011 states and 1508 transitions. [2019-01-14 17:02:21,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 17:02:21,095 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-01-14 17:02:21,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:02:21,098 INFO L225 Difference]: With dead ends: 1011 [2019-01-14 17:02:21,098 INFO L226 Difference]: Without dead ends: 531 [2019-01-14 17:02:21,099 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 17:02:21,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2019-01-14 17:02:21,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 487. [2019-01-14 17:02:21,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2019-01-14 17:02:21,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 728 transitions. [2019-01-14 17:02:21,114 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 728 transitions. Word has length 95 [2019-01-14 17:02:21,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:02:21,115 INFO L480 AbstractCegarLoop]: Abstraction has 487 states and 728 transitions. [2019-01-14 17:02:21,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 17:02:21,115 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 728 transitions. [2019-01-14 17:02:21,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-14 17:02:21,116 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:02:21,116 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 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] [2019-01-14 17:02:21,117 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:02:21,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:02:21,117 INFO L82 PathProgramCache]: Analyzing trace with hash 952822956, now seen corresponding path program 1 times [2019-01-14 17:02:21,117 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:02:21,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:02:21,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:02:21,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:02:21,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:02:21,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:02:21,348 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-01-14 17:02:21,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 17:02:21,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 17:02:21,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 17:02:21,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 17:02:21,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 17:02:21,349 INFO L87 Difference]: Start difference. First operand 487 states and 728 transitions. Second operand 4 states. [2019-01-14 17:02:21,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:02:21,631 INFO L93 Difference]: Finished difference Result 999 states and 1485 transitions. [2019-01-14 17:02:21,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 17:02:21,632 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-01-14 17:02:21,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:02:21,634 INFO L225 Difference]: With dead ends: 999 [2019-01-14 17:02:21,634 INFO L226 Difference]: Without dead ends: 519 [2019-01-14 17:02:21,635 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 17:02:21,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2019-01-14 17:02:21,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 487. [2019-01-14 17:02:21,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2019-01-14 17:02:21,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 725 transitions. [2019-01-14 17:02:21,651 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 725 transitions. Word has length 96 [2019-01-14 17:02:21,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:02:21,651 INFO L480 AbstractCegarLoop]: Abstraction has 487 states and 725 transitions. [2019-01-14 17:02:21,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 17:02:21,651 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 725 transitions. [2019-01-14 17:02:21,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-14 17:02:21,653 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:02:21,653 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 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] [2019-01-14 17:02:21,653 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:02:21,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:02:21,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1844388260, now seen corresponding path program 1 times [2019-01-14 17:02:21,653 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:02:21,653 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:02:21,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:02:21,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:02:21,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:02:21,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:02:21,760 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-01-14 17:02:21,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 17:02:21,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 17:02:21,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 17:02:21,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 17:02:21,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 17:02:21,762 INFO L87 Difference]: Start difference. First operand 487 states and 725 transitions. Second operand 3 states. [2019-01-14 17:02:21,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:02:21,911 INFO L93 Difference]: Finished difference Result 986 states and 1470 transitions. [2019-01-14 17:02:21,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 17:02:21,911 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-01-14 17:02:21,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:02:21,914 INFO L225 Difference]: With dead ends: 986 [2019-01-14 17:02:21,914 INFO L226 Difference]: Without dead ends: 652 [2019-01-14 17:02:21,915 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 17:02:21,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2019-01-14 17:02:21,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 650. [2019-01-14 17:02:21,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 650 states. [2019-01-14 17:02:21,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 965 transitions. [2019-01-14 17:02:21,932 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 965 transitions. Word has length 98 [2019-01-14 17:02:21,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:02:21,933 INFO L480 AbstractCegarLoop]: Abstraction has 650 states and 965 transitions. [2019-01-14 17:02:21,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 17:02:21,933 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 965 transitions. [2019-01-14 17:02:21,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-14 17:02:21,935 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:02:21,935 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 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] [2019-01-14 17:02:21,935 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:02:21,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:02:21,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1703839650, now seen corresponding path program 1 times [2019-01-14 17:02:21,935 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:02:21,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:02:21,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:02:21,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:02:21,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:02:21,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:02:22,033 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-01-14 17:02:22,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 17:02:22,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 17:02:22,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 17:02:22,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 17:02:22,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 17:02:22,035 INFO L87 Difference]: Start difference. First operand 650 states and 965 transitions. Second operand 3 states. [2019-01-14 17:02:22,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:02:22,259 INFO L93 Difference]: Finished difference Result 1145 states and 1701 transitions. [2019-01-14 17:02:22,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 17:02:22,259 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-01-14 17:02:22,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:02:22,262 INFO L225 Difference]: With dead ends: 1145 [2019-01-14 17:02:22,262 INFO L226 Difference]: Without dead ends: 648 [2019-01-14 17:02:22,263 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 17:02:22,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2019-01-14 17:02:22,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 648. [2019-01-14 17:02:22,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2019-01-14 17:02:22,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 957 transitions. [2019-01-14 17:02:22,283 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 957 transitions. Word has length 98 [2019-01-14 17:02:22,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:02:22,283 INFO L480 AbstractCegarLoop]: Abstraction has 648 states and 957 transitions. [2019-01-14 17:02:22,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 17:02:22,284 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 957 transitions. [2019-01-14 17:02:22,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-14 17:02:22,286 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:02:22,286 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 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] [2019-01-14 17:02:22,286 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:02:22,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:02:22,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1223162519, now seen corresponding path program 1 times [2019-01-14 17:02:22,287 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:02:22,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:02:22,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:02:22,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:02:22,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:02:22,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:02:22,416 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-01-14 17:02:22,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 17:02:22,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 17:02:22,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 17:02:22,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 17:02:22,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 17:02:22,418 INFO L87 Difference]: Start difference. First operand 648 states and 957 transitions. Second operand 4 states. [2019-01-14 17:02:22,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:02:22,809 INFO L93 Difference]: Finished difference Result 1446 states and 2132 transitions. [2019-01-14 17:02:22,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 17:02:22,811 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-01-14 17:02:22,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:02:22,815 INFO L225 Difference]: With dead ends: 1446 [2019-01-14 17:02:22,816 INFO L226 Difference]: Without dead ends: 805 [2019-01-14 17:02:22,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 17:02:22,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2019-01-14 17:02:22,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 720. [2019-01-14 17:02:22,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 720 states. [2019-01-14 17:02:22,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1083 transitions. [2019-01-14 17:02:22,861 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1083 transitions. Word has length 100 [2019-01-14 17:02:22,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:02:22,862 INFO L480 AbstractCegarLoop]: Abstraction has 720 states and 1083 transitions. [2019-01-14 17:02:22,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 17:02:22,862 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1083 transitions. [2019-01-14 17:02:22,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-01-14 17:02:22,865 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:02:22,865 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 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] [2019-01-14 17:02:22,866 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:02:22,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:02:22,866 INFO L82 PathProgramCache]: Analyzing trace with hash -517718612, now seen corresponding path program 1 times [2019-01-14 17:02:22,866 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:02:22,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:02:22,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:02:22,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:02:22,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:02:22,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:02:23,060 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-01-14 17:02:23,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 17:02:23,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 17:02:23,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 17:02:23,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 17:02:23,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 17:02:23,061 INFO L87 Difference]: Start difference. First operand 720 states and 1083 transitions. Second operand 4 states. [2019-01-14 17:02:23,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:02:23,474 INFO L93 Difference]: Finished difference Result 1515 states and 2252 transitions. [2019-01-14 17:02:23,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 17:02:23,476 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2019-01-14 17:02:23,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:02:23,481 INFO L225 Difference]: With dead ends: 1515 [2019-01-14 17:02:23,481 INFO L226 Difference]: Without dead ends: 802 [2019-01-14 17:02:23,483 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 17:02:23,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2019-01-14 17:02:23,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 720. [2019-01-14 17:02:23,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 720 states. [2019-01-14 17:02:23,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1080 transitions. [2019-01-14 17:02:23,503 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1080 transitions. Word has length 115 [2019-01-14 17:02:23,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:02:23,504 INFO L480 AbstractCegarLoop]: Abstraction has 720 states and 1080 transitions. [2019-01-14 17:02:23,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 17:02:23,504 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1080 transitions. [2019-01-14 17:02:23,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-01-14 17:02:23,507 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:02:23,508 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 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] [2019-01-14 17:02:23,508 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:02:23,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:02:23,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1265744566, now seen corresponding path program 1 times [2019-01-14 17:02:23,508 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:02:23,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:02:23,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:02:23,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:02:23,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:02:23,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:02:23,670 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-01-14 17:02:23,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 17:02:23,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 17:02:23,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 17:02:23,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 17:02:23,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 17:02:23,671 INFO L87 Difference]: Start difference. First operand 720 states and 1080 transitions. Second operand 4 states. [2019-01-14 17:02:23,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:02:23,998 INFO L93 Difference]: Finished difference Result 1515 states and 2246 transitions. [2019-01-14 17:02:24,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 17:02:24,002 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2019-01-14 17:02:24,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:02:24,007 INFO L225 Difference]: With dead ends: 1515 [2019-01-14 17:02:24,007 INFO L226 Difference]: Without dead ends: 802 [2019-01-14 17:02:24,009 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 17:02:24,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2019-01-14 17:02:24,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 720. [2019-01-14 17:02:24,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 720 states. [2019-01-14 17:02:24,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1077 transitions. [2019-01-14 17:02:24,034 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1077 transitions. Word has length 115 [2019-01-14 17:02:24,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:02:24,034 INFO L480 AbstractCegarLoop]: Abstraction has 720 states and 1077 transitions. [2019-01-14 17:02:24,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 17:02:24,035 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1077 transitions. [2019-01-14 17:02:24,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-01-14 17:02:24,038 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:02:24,038 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 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] [2019-01-14 17:02:24,039 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:02:24,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:02:24,039 INFO L82 PathProgramCache]: Analyzing trace with hash -849536469, now seen corresponding path program 1 times [2019-01-14 17:02:24,039 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:02:24,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:02:24,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:02:24,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:02:24,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:02:24,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:02:24,357 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-01-14 17:02:24,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 17:02:24,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 17:02:24,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 17:02:24,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 17:02:24,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 17:02:24,358 INFO L87 Difference]: Start difference. First operand 720 states and 1077 transitions. Second operand 4 states. [2019-01-14 17:02:24,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:02:24,834 INFO L93 Difference]: Finished difference Result 1515 states and 2240 transitions. [2019-01-14 17:02:24,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 17:02:24,835 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-01-14 17:02:24,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:02:24,839 INFO L225 Difference]: With dead ends: 1515 [2019-01-14 17:02:24,839 INFO L226 Difference]: Without dead ends: 802 [2019-01-14 17:02:24,840 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 17:02:24,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2019-01-14 17:02:24,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 720. [2019-01-14 17:02:24,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 720 states. [2019-01-14 17:02:24,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1074 transitions. [2019-01-14 17:02:24,862 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1074 transitions. Word has length 116 [2019-01-14 17:02:24,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:02:24,863 INFO L480 AbstractCegarLoop]: Abstraction has 720 states and 1074 transitions. [2019-01-14 17:02:24,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 17:02:24,863 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1074 transitions. [2019-01-14 17:02:24,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-01-14 17:02:24,867 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:02:24,867 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 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] [2019-01-14 17:02:24,867 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:02:24,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:02:24,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1134529903, now seen corresponding path program 1 times [2019-01-14 17:02:24,868 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:02:24,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:02:24,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:02:24,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:02:24,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:02:24,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:02:25,093 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-01-14 17:02:25,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 17:02:25,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 17:02:25,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 17:02:25,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 17:02:25,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 17:02:25,094 INFO L87 Difference]: Start difference. First operand 720 states and 1074 transitions. Second operand 4 states. [2019-01-14 17:02:25,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:02:25,397 INFO L93 Difference]: Finished difference Result 1515 states and 2234 transitions. [2019-01-14 17:02:25,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 17:02:25,398 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2019-01-14 17:02:25,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:02:25,402 INFO L225 Difference]: With dead ends: 1515 [2019-01-14 17:02:25,403 INFO L226 Difference]: Without dead ends: 802 [2019-01-14 17:02:25,404 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 17:02:25,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2019-01-14 17:02:25,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 720. [2019-01-14 17:02:25,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 720 states. [2019-01-14 17:02:25,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1071 transitions. [2019-01-14 17:02:25,423 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1071 transitions. Word has length 117 [2019-01-14 17:02:25,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:02:25,425 INFO L480 AbstractCegarLoop]: Abstraction has 720 states and 1071 transitions. [2019-01-14 17:02:25,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 17:02:25,425 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1071 transitions. [2019-01-14 17:02:25,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-01-14 17:02:25,428 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:02:25,428 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 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] [2019-01-14 17:02:25,429 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:02:25,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:02:25,429 INFO L82 PathProgramCache]: Analyzing trace with hash 182595248, now seen corresponding path program 1 times [2019-01-14 17:02:25,429 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:02:25,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:02:25,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:02:25,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:02:25,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:02:25,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:02:25,751 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-01-14 17:02:25,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 17:02:25,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 17:02:25,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 17:02:25,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 17:02:25,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 17:02:25,753 INFO L87 Difference]: Start difference. First operand 720 states and 1071 transitions. Second operand 4 states. [2019-01-14 17:02:26,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:02:26,184 INFO L93 Difference]: Finished difference Result 1488 states and 2195 transitions. [2019-01-14 17:02:26,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 17:02:26,185 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2019-01-14 17:02:26,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:02:26,188 INFO L225 Difference]: With dead ends: 1488 [2019-01-14 17:02:26,188 INFO L226 Difference]: Without dead ends: 775 [2019-01-14 17:02:26,189 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 17:02:26,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2019-01-14 17:02:26,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 720. [2019-01-14 17:02:26,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 720 states. [2019-01-14 17:02:26,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1068 transitions. [2019-01-14 17:02:26,207 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1068 transitions. Word has length 118 [2019-01-14 17:02:26,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:02:26,208 INFO L480 AbstractCegarLoop]: Abstraction has 720 states and 1068 transitions. [2019-01-14 17:02:26,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 17:02:26,209 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1068 transitions. [2019-01-14 17:02:26,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-01-14 17:02:26,212 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:02:26,212 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 3, 3, 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] [2019-01-14 17:02:26,212 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:02:26,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:02:26,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1828816845, now seen corresponding path program 1 times [2019-01-14 17:02:26,213 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:02:26,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:02:26,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:02:26,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:02:26,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:02:26,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:02:26,870 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 133 proven. 1 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-01-14 17:02:26,870 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 17:02:26,870 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 17:02:26,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:02:27,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:02:27,079 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 17:02:27,171 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2019-01-14 17:02:27,187 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-14 17:02:27,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:02:27,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:02:27,259 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2019-01-14 17:02:27,260 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 17:02:27,387 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:02:27,450 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:02:27,526 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:02:27,527 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-01-14 17:02:27,708 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2019-01-14 17:02:27,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:02:27,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:02:27,758 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2019-01-14 17:02:27,759 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 17:02:27,860 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:02:27,882 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:02:27,882 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-01-14 17:02:28,038 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-01-14 17:02:28,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 17:02:28,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-01-14 17:02:28,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 17:02:28,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 17:02:28,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-14 17:02:28,069 INFO L87 Difference]: Start difference. First operand 720 states and 1068 transitions. Second operand 7 states. [2019-01-14 17:02:30,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:02:30,720 INFO L93 Difference]: Finished difference Result 2140 states and 3126 transitions. [2019-01-14 17:02:30,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-14 17:02:30,721 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 118 [2019-01-14 17:02:30,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:02:30,731 INFO L225 Difference]: With dead ends: 2140 [2019-01-14 17:02:30,731 INFO L226 Difference]: Without dead ends: 1427 [2019-01-14 17:02:30,733 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 118 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-01-14 17:02:30,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2019-01-14 17:02:30,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 1257. [2019-01-14 17:02:30,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1257 states. [2019-01-14 17:02:30,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1257 states to 1257 states and 1864 transitions. [2019-01-14 17:02:30,785 INFO L78 Accepts]: Start accepts. Automaton has 1257 states and 1864 transitions. Word has length 118 [2019-01-14 17:02:30,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:02:30,786 INFO L480 AbstractCegarLoop]: Abstraction has 1257 states and 1864 transitions. [2019-01-14 17:02:30,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 17:02:30,786 INFO L276 IsEmpty]: Start isEmpty. Operand 1257 states and 1864 transitions. [2019-01-14 17:02:30,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-01-14 17:02:30,790 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:02:30,791 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 3, 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] [2019-01-14 17:02:30,791 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:02:30,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:02:30,791 INFO L82 PathProgramCache]: Analyzing trace with hash 467198890, now seen corresponding path program 1 times [2019-01-14 17:02:30,791 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:02:30,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:02:30,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:02:30,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:02:30,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:02:30,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:02:31,120 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-01-14 17:02:31,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 17:02:31,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 17:02:31,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 17:02:31,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 17:02:31,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 17:02:31,122 INFO L87 Difference]: Start difference. First operand 1257 states and 1864 transitions. Second operand 4 states. [2019-01-14 17:02:31,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:02:31,844 INFO L93 Difference]: Finished difference Result 2608 states and 3853 transitions. [2019-01-14 17:02:31,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 17:02:31,847 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 119 [2019-01-14 17:02:31,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:02:31,855 INFO L225 Difference]: With dead ends: 2608 [2019-01-14 17:02:31,855 INFO L226 Difference]: Without dead ends: 1358 [2019-01-14 17:02:31,857 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 17:02:31,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2019-01-14 17:02:31,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 1271. [2019-01-14 17:02:31,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1271 states. [2019-01-14 17:02:31,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1271 states to 1271 states and 1894 transitions. [2019-01-14 17:02:31,903 INFO L78 Accepts]: Start accepts. Automaton has 1271 states and 1894 transitions. Word has length 119 [2019-01-14 17:02:31,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:02:31,904 INFO L480 AbstractCegarLoop]: Abstraction has 1271 states and 1894 transitions. [2019-01-14 17:02:31,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 17:02:31,904 INFO L276 IsEmpty]: Start isEmpty. Operand 1271 states and 1894 transitions. [2019-01-14 17:02:31,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-01-14 17:02:31,909 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:02:31,909 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 3, 3, 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] [2019-01-14 17:02:31,909 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:02:31,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:02:31,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1731483519, now seen corresponding path program 1 times [2019-01-14 17:02:31,911 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:02:31,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:02:31,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:02:31,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:02:31,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:02:31,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:02:32,284 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-01-14 17:02:32,284 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 17:02:32,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 17:02:32,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 17:02:32,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 17:02:32,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 17:02:32,288 INFO L87 Difference]: Start difference. First operand 1271 states and 1894 transitions. Second operand 4 states. [2019-01-14 17:02:34,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:02:34,185 INFO L93 Difference]: Finished difference Result 2801 states and 4155 transitions. [2019-01-14 17:02:34,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 17:02:34,186 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2019-01-14 17:02:34,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:02:34,193 INFO L225 Difference]: With dead ends: 2801 [2019-01-14 17:02:34,193 INFO L226 Difference]: Without dead ends: 1537 [2019-01-14 17:02:34,194 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 17:02:34,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1537 states. [2019-01-14 17:02:34,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1537 to 1275. [2019-01-14 17:02:34,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1275 states. [2019-01-14 17:02:34,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1275 states to 1275 states and 1898 transitions. [2019-01-14 17:02:34,240 INFO L78 Accepts]: Start accepts. Automaton has 1275 states and 1898 transitions. Word has length 120 [2019-01-14 17:02:34,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:02:34,240 INFO L480 AbstractCegarLoop]: Abstraction has 1275 states and 1898 transitions. [2019-01-14 17:02:34,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 17:02:34,240 INFO L276 IsEmpty]: Start isEmpty. Operand 1275 states and 1898 transitions. [2019-01-14 17:02:34,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-01-14 17:02:34,245 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:02:34,245 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 17:02:34,245 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:02:34,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:02:34,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1820752595, now seen corresponding path program 1 times [2019-01-14 17:02:34,246 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:02:34,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:02:34,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:02:34,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:02:34,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:02:34,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:02:34,478 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 15 [2019-01-14 17:02:34,508 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2019-01-14 17:02:34,508 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 17:02:34,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 17:02:34,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 17:02:34,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 17:02:34,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 17:02:34,509 INFO L87 Difference]: Start difference. First operand 1275 states and 1898 transitions. Second operand 4 states. [2019-01-14 17:02:34,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:02:34,782 INFO L93 Difference]: Finished difference Result 2547 states and 3790 transitions. [2019-01-14 17:02:34,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 17:02:34,783 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2019-01-14 17:02:34,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:02:34,788 INFO L225 Difference]: With dead ends: 2547 [2019-01-14 17:02:34,788 INFO L226 Difference]: Without dead ends: 1279 [2019-01-14 17:02:34,789 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 17:02:34,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1279 states. [2019-01-14 17:02:34,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1279 to 1278. [2019-01-14 17:02:34,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1278 states. [2019-01-14 17:02:34,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1278 states to 1278 states and 1901 transitions. [2019-01-14 17:02:34,834 INFO L78 Accepts]: Start accepts. Automaton has 1278 states and 1901 transitions. Word has length 122 [2019-01-14 17:02:34,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:02:34,835 INFO L480 AbstractCegarLoop]: Abstraction has 1278 states and 1901 transitions. [2019-01-14 17:02:34,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 17:02:34,835 INFO L276 IsEmpty]: Start isEmpty. Operand 1278 states and 1901 transitions. [2019-01-14 17:02:34,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-01-14 17:02:34,838 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:02:34,839 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 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] [2019-01-14 17:02:34,839 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:02:34,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:02:34,839 INFO L82 PathProgramCache]: Analyzing trace with hash -272550210, now seen corresponding path program 1 times [2019-01-14 17:02:34,839 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:02:34,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:02:34,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:02:34,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:02:34,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:02:35,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 17:02:35,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 17:02:35,506 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-14 17:02:35,721 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 05:02:35 BoogieIcfgContainer [2019-01-14 17:02:35,723 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 17:02:35,724 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 17:02:35,724 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 17:02:35,724 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 17:02:35,725 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 05:02:07" (3/4) ... [2019-01-14 17:02:35,733 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 17:02:35,733 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 17:02:35,734 INFO L168 Benchmark]: Toolchain (without parser) took 32012.81 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 382.7 MB). Free memory was 947.3 MB in the beginning and 1.2 GB in the end (delta: -282.7 MB). Peak memory consumption was 100.0 MB. Max. memory is 11.5 GB. [2019-01-14 17:02:35,737 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 17:02:35,738 INFO L168 Benchmark]: CACSL2BoogieTranslator took 857.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.4 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -189.8 MB). Peak memory consumption was 39.9 MB. Max. memory is 11.5 GB. [2019-01-14 17:02:35,739 INFO L168 Benchmark]: Boogie Procedure Inliner took 95.46 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-14 17:02:35,741 INFO L168 Benchmark]: Boogie Preprocessor took 149.93 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-14 17:02:35,741 INFO L168 Benchmark]: RCFGBuilder took 2182.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 85.7 MB). Peak memory consumption was 85.7 MB. Max. memory is 11.5 GB. [2019-01-14 17:02:35,742 INFO L168 Benchmark]: TraceAbstraction took 28712.08 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 223.3 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -192.0 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. [2019-01-14 17:02:35,745 INFO L168 Benchmark]: Witness Printer took 9.74 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 17:02:35,751 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 857.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.4 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -189.8 MB). Peak memory consumption was 39.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 95.46 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 149.93 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2182.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 85.7 MB). Peak memory consumption was 85.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 28712.08 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 223.3 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -192.0 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. * Witness Printer took 9.74 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1645]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 1330. Possible FailurePath: [L1039] static int init = 1; [L1040] static SSL_METHOD SSLv3_client_data ; VAL [init=1, SSLv3_client_data={-2:0}] [L1062] SSL *s ; [L1066] s = malloc (sizeof (SSL)) [L1067] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1068] s->ctx = malloc(sizeof(SSL_CTX)) [L1069] s->state = 12292 [L1070] s->version = __VERIFIER_nondet_int() [L1077] BUF_MEM *buf = __VERIFIER_nondet_pointer(); [L1078] unsigned long tmp ; [L1079] unsigned long l ; [L1080] long num1 ; [L1081] void (*cb)() ; [L1082] int ret ; [L1083] int new_state ; [L1084] int state ; [L1085] int skip ; [L1086] int *tmp___0 ; [L1087] int tmp___1 = __VERIFIER_nondet_int(); [L1088] int tmp___2 = __VERIFIER_nondet_int(); [L1089] int tmp___3 ; [L1090] int tmp___4 ; [L1091] int tmp___5 ; [L1092] int tmp___6 ; [L1093] int tmp___7 ; [L1094] int tmp___8 ; [L1095] long tmp___9 ; [L1097] int blastFlag ; [L1100] blastFlag = 0 [L1101] s->state = 12292 [L1102] s->hit = __VERIFIER_nondet_int() [L1104] tmp = __VERIFIER_nondet_int() [L1105] cb = (void (*)())((void *)0) [L1106] ret = -1 [L1107] skip = 0 [L1108] tmp___0 = (int*)malloc(sizeof(int)) [L1109] *tmp___0 = 0 [L1110] EXPR s->info_callback VAL [init=1, SSLv3_client_data={-2:0}] [L1110] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1111] EXPR s->info_callback [L1111] cb = s->info_callback [L1119] EXPR s->in_handshake [L1119] s->in_handshake += 1 [L1120] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_client_data={-2:0}] [L1130] COND TRUE 1 VAL [init=1, SSLv3_client_data={-2:0}] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [init=1, SSLv3_client_data={-2:0}] [L1133] COND TRUE s->state == 12292 [L1236] s->new_session = 1 [L1237] s->state = 4096 [L1238] EXPR s->ctx [L1238] EXPR (s->ctx)->stats.sess_connect_renegotiate [L1238] (s->ctx)->stats.sess_connect_renegotiate += 1 [L1243] s->server = 0 VAL [init=1, SSLv3_client_data={-2:0}] [L1244] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [init=1, SSLv3_client_data={-2:0}] [L1249] EXPR s->version VAL [init=1, SSLv3_client_data={-2:0}] [L1249] COND FALSE !((s->version & 65280) != 768) [L1255] s->type = 4096 [L1256] EXPR s->init_buf VAL [init=1, SSLv3_client_data={-2:0}] [L1256] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1268] tmp___4 = __VERIFIER_nondet_int() [L1269] COND FALSE !(! tmp___4) [L1275] tmp___5 = __VERIFIER_nondet_int() [L1276] COND FALSE !(! tmp___5) [L1282] s->state = 4368 [L1283] EXPR s->ctx [L1283] EXPR (s->ctx)->stats.sess_connect [L1283] (s->ctx)->stats.sess_connect += 1 [L1284] s->init_num = 0 VAL [init=1, SSLv3_client_data={-2:0}] [L1604] EXPR s->s3 [L1604] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={-2:0}] [L1604] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1633] skip = 0 VAL [init=1, SSLv3_client_data={-2:0}] [L1130] COND TRUE 1 VAL [init=1, SSLv3_client_data={-2:0}] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [init=1, SSLv3_client_data={-2:0}] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [init=1, SSLv3_client_data={-2:0}] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [init=1, SSLv3_client_data={-2:0}] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [init=1, SSLv3_client_data={-2:0}] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [init=1, SSLv3_client_data={-2:0}] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [init=1, SSLv3_client_data={-2:0}] [L1148] COND TRUE s->state == 4368 [L1288] s->shutdown = 0 [L1289] ret = __VERIFIER_nondet_int() [L1290] COND TRUE blastFlag == 0 [L1291] blastFlag = 1 VAL [init=1, SSLv3_client_data={-2:0}] [L1295] COND FALSE !(ret <= 0) [L1300] s->state = 4384 [L1301] s->init_num = 0 [L1302] EXPR s->bbio [L1302] EXPR s->wbio VAL [init=1, SSLv3_client_data={-2:0}] [L1302] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1604] EXPR s->s3 [L1604] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={-2:0}] [L1604] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1633] skip = 0 VAL [init=1, SSLv3_client_data={-2:0}] [L1130] COND TRUE 1 VAL [init=1, SSLv3_client_data={-2:0}] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [init=1, SSLv3_client_data={-2:0}] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [init=1, SSLv3_client_data={-2:0}] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [init=1, SSLv3_client_data={-2:0}] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [init=1, SSLv3_client_data={-2:0}] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [init=1, SSLv3_client_data={-2:0}] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [init=1, SSLv3_client_data={-2:0}] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [init=1, SSLv3_client_data={-2:0}] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [init=1, SSLv3_client_data={-2:0}] [L1154] COND TRUE s->state == 4384 [L1310] ret = __VERIFIER_nondet_int() [L1311] COND TRUE blastFlag == 1 [L1312] blastFlag = 2 VAL [init=1, SSLv3_client_data={-2:0}] [L1316] COND FALSE !(ret <= 0) [L1321] s->hit VAL [init=1, SSLv3_client_data={-2:0}] [L1321] COND FALSE !(s->hit) [L1324] s->state = 4400 VAL [init=1, SSLv3_client_data={-2:0}] [L1326] s->init_num = 0 VAL [init=1, SSLv3_client_data={-2:0}] [L1604] EXPR s->s3 [L1604] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={-2:0}] [L1604] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1633] skip = 0 VAL [init=1, SSLv3_client_data={-2:0}] [L1130] COND TRUE 1 VAL [init=1, SSLv3_client_data={-2:0}] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [init=1, SSLv3_client_data={-2:0}] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [init=1, SSLv3_client_data={-2:0}] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [init=1, SSLv3_client_data={-2:0}] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [init=1, SSLv3_client_data={-2:0}] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [init=1, SSLv3_client_data={-2:0}] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [init=1, SSLv3_client_data={-2:0}] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [init=1, SSLv3_client_data={-2:0}] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [init=1, SSLv3_client_data={-2:0}] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR s->state VAL [init=1, SSLv3_client_data={-2:0}] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR s->state VAL [init=1, SSLv3_client_data={-2:0}] [L1160] COND TRUE s->state == 4400 [L1330] EXPR s->s3 [L1330] EXPR (s->s3)->tmp.new_cipher [L1330] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [init=1, SSLv3_client_data={-2:0}] [L1330] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1333] ret = __VERIFIER_nondet_int() [L1334] COND TRUE blastFlag == 2 [L1335] blastFlag = 3 VAL [init=1, SSLv3_client_data={-2:0}] [L1339] COND FALSE !(ret <= 0) VAL [init=1, SSLv3_client_data={-2:0}] [L1345] s->state = 4416 [L1346] s->init_num = 0 VAL [init=1, SSLv3_client_data={-2:0}] [L1604] EXPR s->s3 [L1604] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={-2:0}] [L1604] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1633] skip = 0 VAL [init=1, SSLv3_client_data={-2:0}] [L1130] COND TRUE 1 VAL [init=1, SSLv3_client_data={-2:0}] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [init=1, SSLv3_client_data={-2:0}] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [init=1, SSLv3_client_data={-2:0}] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [init=1, SSLv3_client_data={-2:0}] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [init=1, SSLv3_client_data={-2:0}] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [init=1, SSLv3_client_data={-2:0}] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [init=1, SSLv3_client_data={-2:0}] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [init=1, SSLv3_client_data={-2:0}] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [init=1, SSLv3_client_data={-2:0}] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR s->state VAL [init=1, SSLv3_client_data={-2:0}] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR s->state VAL [init=1, SSLv3_client_data={-2:0}] [L1160] COND FALSE !(s->state == 4400) [L1163] EXPR s->state VAL [init=1, SSLv3_client_data={-2:0}] [L1163] COND FALSE !(s->state == 4401) [L1166] EXPR s->state VAL [init=1, SSLv3_client_data={-2:0}] [L1166] COND TRUE s->state == 4416 [L1350] ret = __VERIFIER_nondet_int() [L1351] COND TRUE blastFlag == 3 [L1352] blastFlag = 4 VAL [init=1, SSLv3_client_data={-2:0}] [L1356] COND FALSE !(ret <= 0) [L1361] s->state = 4432 [L1362] s->init_num = 0 [L1363] tmp___6 = __VERIFIER_nondet_int() [L1364] COND FALSE !(! tmp___6) VAL [init=1, SSLv3_client_data={-2:0}] [L1604] EXPR s->s3 [L1604] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={-2:0}] [L1604] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1633] skip = 0 VAL [init=1, SSLv3_client_data={-2:0}] [L1130] COND TRUE 1 VAL [init=1, SSLv3_client_data={-2:0}] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [init=1, SSLv3_client_data={-2:0}] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [init=1, SSLv3_client_data={-2:0}] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [init=1, SSLv3_client_data={-2:0}] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [init=1, SSLv3_client_data={-2:0}] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [init=1, SSLv3_client_data={-2:0}] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [init=1, SSLv3_client_data={-2:0}] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [init=1, SSLv3_client_data={-2:0}] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [init=1, SSLv3_client_data={-2:0}] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR s->state VAL [init=1, SSLv3_client_data={-2:0}] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR s->state VAL [init=1, SSLv3_client_data={-2:0}] [L1160] COND FALSE !(s->state == 4400) [L1163] EXPR s->state VAL [init=1, SSLv3_client_data={-2:0}] [L1163] COND FALSE !(s->state == 4401) [L1166] EXPR s->state VAL [init=1, SSLv3_client_data={-2:0}] [L1166] COND FALSE !(s->state == 4416) [L1169] EXPR s->state VAL [init=1, SSLv3_client_data={-2:0}] [L1169] COND FALSE !(s->state == 4417) [L1172] EXPR s->state VAL [init=1, SSLv3_client_data={-2:0}] [L1172] COND TRUE s->state == 4432 [L1373] ret = __VERIFIER_nondet_int() [L1374] COND FALSE !(blastFlag == 5) VAL [init=1, SSLv3_client_data={-2:0}] [L1379] COND FALSE !(ret <= 0) [L1384] s->state = 4448 [L1385] s->init_num = 0 VAL [init=1, SSLv3_client_data={-2:0}] [L1604] EXPR s->s3 [L1604] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={-2:0}] [L1604] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1633] skip = 0 VAL [init=1, SSLv3_client_data={-2:0}] [L1130] COND TRUE 1 VAL [init=1, SSLv3_client_data={-2:0}] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [init=1, SSLv3_client_data={-2:0}] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [init=1, SSLv3_client_data={-2:0}] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [init=1, SSLv3_client_data={-2:0}] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [init=1, SSLv3_client_data={-2:0}] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [init=1, SSLv3_client_data={-2:0}] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [init=1, SSLv3_client_data={-2:0}] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [init=1, SSLv3_client_data={-2:0}] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [init=1, SSLv3_client_data={-2:0}] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR s->state VAL [init=1, SSLv3_client_data={-2:0}] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR s->state VAL [init=1, SSLv3_client_data={-2:0}] [L1160] COND FALSE !(s->state == 4400) [L1163] EXPR s->state VAL [init=1, SSLv3_client_data={-2:0}] [L1163] COND FALSE !(s->state == 4401) [L1166] EXPR s->state VAL [init=1, SSLv3_client_data={-2:0}] [L1166] COND FALSE !(s->state == 4416) [L1169] EXPR s->state VAL [init=1, SSLv3_client_data={-2:0}] [L1169] COND FALSE !(s->state == 4417) [L1172] EXPR s->state VAL [init=1, SSLv3_client_data={-2:0}] [L1172] COND FALSE !(s->state == 4432) [L1175] EXPR s->state VAL [init=1, SSLv3_client_data={-2:0}] [L1175] COND FALSE !(s->state == 4433) [L1178] EXPR s->state VAL [init=1, SSLv3_client_data={-2:0}] [L1178] COND TRUE s->state == 4448 [L1389] ret = __VERIFIER_nondet_int() [L1390] COND TRUE blastFlag == 4 VAL [init=1, SSLv3_client_data={-2:0}] [L1645] __VERIFIER_error() VAL [init=1, SSLv3_client_data={-2:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 131 locations, 1 error locations. UNSAFE Result, 28.6s OverallTime, 30 OverallIterations, 7 TraceHistogramMax, 18.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6220 SDtfs, 1789 SDslu, 8667 SDs, 0 SdLazy, 4493 SolverSat, 173 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 291 GetRequests, 174 SyntacticMatches, 30 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 5.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1278occurred in iteration=29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 29 MinimizatonAttempts, 1773 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 7.0s InterpolantComputationTime, 2818 NumberOfCodeBlocks, 2818 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 2651 ConstructedInterpolants, 0 QuantifiedInterpolants, 593426 SizeOfPredicates, 3 NumberOfNonLiveVariables, 563 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 30 InterpolantComputations, 29 PerfectInterpolantSequences, 3036/3037 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-0ed9222-m [2019-01-14 17:02:38,049 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 17:02:38,051 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 17:02:38,062 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 17:02:38,062 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 17:02:38,063 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 17:02:38,065 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 17:02:38,066 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 17:02:38,068 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 17:02:38,069 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 17:02:38,070 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 17:02:38,070 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 17:02:38,071 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 17:02:38,072 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 17:02:38,073 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 17:02:38,073 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 17:02:38,074 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 17:02:38,076 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 17:02:38,078 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 17:02:38,080 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 17:02:38,081 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 17:02:38,082 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 17:02:38,084 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 17:02:38,085 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 17:02:38,085 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 17:02:38,086 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 17:02:38,087 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 17:02:38,088 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 17:02:38,088 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 17:02:38,090 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 17:02:38,090 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 17:02:38,090 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 17:02:38,091 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 17:02:38,091 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 17:02:38,092 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 17:02:38,092 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 17:02:38,093 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-01-14 17:02:38,108 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 17:02:38,108 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 17:02:38,109 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 17:02:38,110 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 17:02:38,110 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 17:02:38,110 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 17:02:38,110 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 17:02:38,110 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 17:02:38,110 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 17:02:38,111 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-14 17:02:38,111 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 17:02:38,111 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-14 17:02:38,111 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2019-01-14 17:02:38,111 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-01-14 17:02:38,111 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 17:02:38,112 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 17:02:38,112 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-14 17:02:38,112 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 17:02:38,112 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 17:02:38,112 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 17:02:38,112 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 17:02:38,113 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 17:02:38,113 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 17:02:38,113 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 17:02:38,113 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-14 17:02:38,113 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2019-01-14 17:02:38,114 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 17:02:38,114 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-01-14 17:02:38,114 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2019-01-14 17:02:38,114 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cdf0cf9bd7de1f69825d4535f203da45c4edbbfc [2019-01-14 17:02:38,170 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 17:02:38,183 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 17:02:38,186 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 17:02:38,188 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 17:02:38,188 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 17:02:38,189 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/loops/s3_false-unreach-call.i [2019-01-14 17:02:38,251 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ac7ebad8/2ea8f2f883ac4266a53de95c0f411412/FLAGa2c1e2907 [2019-01-14 17:02:38,823 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 17:02:38,824 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/loops/s3_false-unreach-call.i [2019-01-14 17:02:38,850 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ac7ebad8/2ea8f2f883ac4266a53de95c0f411412/FLAGa2c1e2907 [2019-01-14 17:02:39,030 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ac7ebad8/2ea8f2f883ac4266a53de95c0f411412 [2019-01-14 17:02:39,034 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 17:02:39,036 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 17:02:39,037 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 17:02:39,038 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 17:02:39,042 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 17:02:39,043 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 05:02:39" (1/1) ... [2019-01-14 17:02:39,046 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@872c042 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:02:39, skipping insertion in model container [2019-01-14 17:02:39,046 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 05:02:39" (1/1) ... [2019-01-14 17:02:39,054 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 17:02:39,133 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 17:02:39,642 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 17:02:39,667 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 17:02:39,891 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 17:02:39,915 INFO L195 MainTranslator]: Completed translation [2019-01-14 17:02:39,915 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:02:39 WrapperNode [2019-01-14 17:02:39,915 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 17:02:39,916 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 17:02:39,916 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 17:02:39,917 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 17:02:39,926 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:02:39" (1/1) ... [2019-01-14 17:02:39,968 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:02:39" (1/1) ... [2019-01-14 17:02:40,049 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 17:02:40,053 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 17:02:40,053 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 17:02:40,053 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 17:02:40,070 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:02:39" (1/1) ... [2019-01-14 17:02:40,071 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:02:39" (1/1) ... [2019-01-14 17:02:40,091 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:02:39" (1/1) ... [2019-01-14 17:02:40,096 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:02:39" (1/1) ... [2019-01-14 17:02:40,180 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:02:39" (1/1) ... [2019-01-14 17:02:40,199 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:02:39" (1/1) ... [2019-01-14 17:02:40,205 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:02:39" (1/1) ... [2019-01-14 17:02:40,222 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 17:02:40,223 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 17:02:40,223 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 17:02:40,223 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 17:02:40,226 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:02:39" (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-01-14 17:02:40,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-01-14 17:02:40,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2019-01-14 17:02:40,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-14 17:02:40,312 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 17:02:40,313 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-01-14 17:02:40,315 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-14 17:02:40,315 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-14 17:02:40,315 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 17:02:40,315 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 17:02:40,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-01-14 17:02:40,589 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-14 17:02:45,003 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-01-14 17:02:45,003 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-01-14 17:02:45,005 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 17:02:45,005 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-14 17:02:45,006 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 05:02:45 BoogieIcfgContainer [2019-01-14 17:02:45,007 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 17:02:45,008 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 17:02:45,009 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 17:02:45,012 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 17:02:45,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 05:02:39" (1/3) ... [2019-01-14 17:02:45,013 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e5a8614 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 05:02:45, skipping insertion in model container [2019-01-14 17:02:45,013 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:02:39" (2/3) ... [2019-01-14 17:02:45,014 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e5a8614 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 05:02:45, skipping insertion in model container [2019-01-14 17:02:45,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 05:02:45" (3/3) ... [2019-01-14 17:02:45,017 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_false-unreach-call.i [2019-01-14 17:02:45,025 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 17:02:45,032 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-14 17:02:45,047 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-14 17:02:45,079 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 17:02:45,080 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 17:02:45,080 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-14 17:02:45,081 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 17:02:45,082 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 17:02:45,082 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 17:02:45,082 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 17:02:45,082 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 17:02:45,083 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 17:02:45,102 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states. [2019-01-14 17:02:45,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-14 17:02:45,110 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:02:45,111 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 17:02:45,114 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:02:45,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:02:45,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1457703967, now seen corresponding path program 1 times [2019-01-14 17:02:45,124 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 17:02:45,124 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-14 17:02:45,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:02:45,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:02:45,289 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 17:02:45,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 17:02:45,367 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 17:02:45,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 17:02:45,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 17:02:45,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 17:02:45,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 17:02:45,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 17:02:45,394 INFO L87 Difference]: Start difference. First operand 131 states. Second operand 3 states. [2019-01-14 17:02:45,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:02:45,766 INFO L93 Difference]: Finished difference Result 375 states and 626 transitions. [2019-01-14 17:02:45,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 17:02:45,768 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-01-14 17:02:45,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:02:45,781 INFO L225 Difference]: With dead ends: 375 [2019-01-14 17:02:45,781 INFO L226 Difference]: Without dead ends: 217 [2019-01-14 17:02:45,785 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 17:02:45,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-01-14 17:02:45,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2019-01-14 17:02:45,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-01-14 17:02:45,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 321 transitions. [2019-01-14 17:02:45,844 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 321 transitions. Word has length 24 [2019-01-14 17:02:45,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:02:45,845 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 321 transitions. [2019-01-14 17:02:45,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 17:02:45,845 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 321 transitions. [2019-01-14 17:02:45,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-14 17:02:45,848 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:02:45,848 INFO L402 BasicCegarLoop]: trace histogram [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] [2019-01-14 17:02:45,849 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:02:45,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:02:45,850 INFO L82 PathProgramCache]: Analyzing trace with hash 546953675, now seen corresponding path program 1 times [2019-01-14 17:02:45,851 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 17:02:45,851 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-14 17:02:45,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:02:46,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:02:46,032 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 17:02:46,099 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 17:02:46,099 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 17:02:46,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 17:02:46,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 17:02:46,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 17:02:46,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 17:02:46,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 17:02:46,110 INFO L87 Difference]: Start difference. First operand 217 states and 321 transitions. Second operand 3 states. [2019-01-14 17:02:48,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:02:48,345 INFO L93 Difference]: Finished difference Result 426 states and 636 transitions. [2019-01-14 17:02:48,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 17:02:48,346 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-01-14 17:02:48,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:02:48,350 INFO L225 Difference]: With dead ends: 426 [2019-01-14 17:02:48,350 INFO L226 Difference]: Without dead ends: 319 [2019-01-14 17:02:48,352 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 17:02:48,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2019-01-14 17:02:48,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 319. [2019-01-14 17:02:48,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2019-01-14 17:02:48,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 470 transitions. [2019-01-14 17:02:48,389 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 470 transitions. Word has length 39 [2019-01-14 17:02:48,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:02:48,390 INFO L480 AbstractCegarLoop]: Abstraction has 319 states and 470 transitions. [2019-01-14 17:02:48,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 17:02:48,390 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 470 transitions. [2019-01-14 17:02:48,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-14 17:02:48,395 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:02:48,395 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2019-01-14 17:02:48,396 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:02:48,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:02:48,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1711683715, now seen corresponding path program 1 times [2019-01-14 17:02:48,398 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 17:02:48,398 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-14 17:02:48,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:02:48,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:02:48,582 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 17:02:48,646 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-01-14 17:02:48,647 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 17:02:48,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 17:02:48,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 17:02:48,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 17:02:48,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 17:02:48,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 17:02:48,651 INFO L87 Difference]: Start difference. First operand 319 states and 470 transitions. Second operand 3 states. [2019-01-14 17:02:50,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:02:50,756 INFO L93 Difference]: Finished difference Result 632 states and 937 transitions. [2019-01-14 17:02:50,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 17:02:50,758 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-01-14 17:02:50,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:02:50,763 INFO L225 Difference]: With dead ends: 632 [2019-01-14 17:02:50,764 INFO L226 Difference]: Without dead ends: 423 [2019-01-14 17:02:50,769 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 17:02:50,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2019-01-14 17:02:50,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 423. [2019-01-14 17:02:50,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2019-01-14 17:02:50,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 622 transitions. [2019-01-14 17:02:50,811 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 622 transitions. Word has length 57 [2019-01-14 17:02:50,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:02:50,811 INFO L480 AbstractCegarLoop]: Abstraction has 423 states and 622 transitions. [2019-01-14 17:02:50,811 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 17:02:50,812 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 622 transitions. [2019-01-14 17:02:50,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-01-14 17:02:50,815 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:02:50,815 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2019-01-14 17:02:50,816 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:02:50,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:02:50,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1922596163, now seen corresponding path program 1 times [2019-01-14 17:02:50,818 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 17:02:50,818 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-14 17:02:50,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:02:51,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:02:51,036 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 17:02:51,109 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-01-14 17:02:51,110 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 17:02:51,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 17:02:51,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 17:02:51,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 17:02:51,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 17:02:51,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 17:02:51,117 INFO L87 Difference]: Start difference. First operand 423 states and 622 transitions. Second operand 3 states. [2019-01-14 17:02:53,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:02:53,409 INFO L93 Difference]: Finished difference Result 839 states and 1240 transitions. [2019-01-14 17:02:53,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 17:02:53,410 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-01-14 17:02:53,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:02:53,417 INFO L225 Difference]: With dead ends: 839 [2019-01-14 17:02:53,417 INFO L226 Difference]: Without dead ends: 526 [2019-01-14 17:02:53,418 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 17:02:53,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2019-01-14 17:02:53,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 526. [2019-01-14 17:02:53,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 526 states. [2019-01-14 17:02:53,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 773 transitions. [2019-01-14 17:02:53,440 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 773 transitions. Word has length 77 [2019-01-14 17:02:53,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:02:53,441 INFO L480 AbstractCegarLoop]: Abstraction has 526 states and 773 transitions. [2019-01-14 17:02:53,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 17:02:53,442 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 773 transitions. [2019-01-14 17:02:53,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-14 17:02:53,445 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:02:53,445 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 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] [2019-01-14 17:02:53,446 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:02:53,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:02:53,446 INFO L82 PathProgramCache]: Analyzing trace with hash -158208422, now seen corresponding path program 1 times [2019-01-14 17:02:53,447 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 17:02:53,448 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-14 17:02:53,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:02:53,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:02:53,671 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 17:02:53,756 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-01-14 17:02:53,757 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 17:02:53,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 17:02:53,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 17:02:53,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 17:02:53,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 17:02:53,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 17:02:53,767 INFO L87 Difference]: Start difference. First operand 526 states and 773 transitions. Second operand 3 states. [2019-01-14 17:02:56,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:02:56,001 INFO L93 Difference]: Finished difference Result 939 states and 1381 transitions. [2019-01-14 17:02:56,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 17:02:56,002 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-01-14 17:02:56,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:02:56,006 INFO L225 Difference]: With dead ends: 939 [2019-01-14 17:02:56,006 INFO L226 Difference]: Without dead ends: 523 [2019-01-14 17:02:56,008 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 17:02:56,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2019-01-14 17:02:56,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 523. [2019-01-14 17:02:56,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 523 states. [2019-01-14 17:02:56,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 763 transitions. [2019-01-14 17:02:56,056 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 763 transitions. Word has length 98 [2019-01-14 17:02:56,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:02:56,056 INFO L480 AbstractCegarLoop]: Abstraction has 523 states and 763 transitions. [2019-01-14 17:02:56,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 17:02:56,057 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 763 transitions. [2019-01-14 17:02:56,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-14 17:02:56,059 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:02:56,060 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 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] [2019-01-14 17:02:56,060 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:02:56,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:02:56,064 INFO L82 PathProgramCache]: Analyzing trace with hash -1855651051, now seen corresponding path program 1 times [2019-01-14 17:02:56,064 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 17:02:56,064 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-14 17:02:56,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:02:56,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:02:56,644 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 17:02:56,968 WARN L181 SmtUtils]: Spent 287.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-01-14 17:02:57,058 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 39 [2019-01-14 17:02:57,069 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 26 [2019-01-14 17:02:57,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:02:57,080 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-01-14 17:02:57,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:02:57,172 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2019-01-14 17:02:57,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:02:57,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:02:57,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:02:57,347 INFO L303 Elim1Store]: Index analysis took 172 ms [2019-01-14 17:02:57,349 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2019-01-14 17:02:57,351 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 17:02:57,503 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:02:57,587 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:02:57,626 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:02:57,686 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 38 [2019-01-14 17:02:57,694 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 17:02:57,694 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-14 17:02:57,712 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:02:57,734 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:02:57,752 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 54 [2019-01-14 17:02:57,764 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 48 [2019-01-14 17:02:57,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:02:57,790 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 53 [2019-01-14 17:02:57,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:02:57,820 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 43 [2019-01-14 17:02:57,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:02:57,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:02:57,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:02:57,877 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 57 [2019-01-14 17:02:57,878 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-14 17:02:57,937 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:02:57,976 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:02:58,008 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:02:58,090 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2019-01-14 17:02:58,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:02:58,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:02:58,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:02:58,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:02:58,271 INFO L303 Elim1Store]: Index analysis took 178 ms [2019-01-14 17:02:58,272 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 59 [2019-01-14 17:02:58,273 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-01-14 17:02:58,316 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:02:58,330 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:02:58,376 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-14 17:02:58,376 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 4 variables, input treesize:61, output treesize:41 [2019-01-14 17:02:58,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:02:58,562 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 62 [2019-01-14 17:02:58,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:02:58,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:02:58,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:02:58,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:02:58,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:02:58,616 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 73 [2019-01-14 17:02:58,618 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 17:02:58,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:02:58,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:02:58,799 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 44 [2019-01-14 17:02:58,800 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 17:02:58,865 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:02:58,876 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 17:02:58,876 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:43, output treesize:22 [2019-01-14 17:02:58,916 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 24 [2019-01-14 17:02:58,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:02:58,925 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2019-01-14 17:02:58,925 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 17:02:58,934 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:02:58,936 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:02:58,937 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:22, output treesize:3 [2019-01-14 17:02:58,963 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-01-14 17:02:58,963 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 17:02:58,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 17:02:58,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 17:02:58,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 17:02:58,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 17:02:58,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 17:02:58,973 INFO L87 Difference]: Start difference. First operand 523 states and 763 transitions. Second operand 4 states. [2019-01-14 17:03:05,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:03:05,139 INFO L93 Difference]: Finished difference Result 1022 states and 1490 transitions. [2019-01-14 17:03:05,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 17:03:05,141 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-01-14 17:03:05,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:03:05,146 INFO L225 Difference]: With dead ends: 1022 [2019-01-14 17:03:05,147 INFO L226 Difference]: Without dead ends: 607 [2019-01-14 17:03:05,148 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 17:03:05,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2019-01-14 17:03:05,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 531. [2019-01-14 17:03:05,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 531 states. [2019-01-14 17:03:05,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 776 transitions. [2019-01-14 17:03:05,171 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 776 transitions. Word has length 100 [2019-01-14 17:03:05,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:03:05,172 INFO L480 AbstractCegarLoop]: Abstraction has 531 states and 776 transitions. [2019-01-14 17:03:05,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 17:03:05,172 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 776 transitions. [2019-01-14 17:03:05,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-01-14 17:03:05,175 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:03:05,175 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 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] [2019-01-14 17:03:05,175 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:03:05,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:03:05,177 INFO L82 PathProgramCache]: Analyzing trace with hash 116871402, now seen corresponding path program 1 times [2019-01-14 17:03:05,178 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 17:03:05,178 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-14 17:03:05,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:03:05,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:03:05,917 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 17:03:06,152 WARN L181 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-01-14 17:03:06,210 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 39 [2019-01-14 17:03:06,220 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 26 [2019-01-14 17:03:06,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:03:06,246 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-01-14 17:03:06,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:03:06,273 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2019-01-14 17:03:06,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:03:06,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:03:06,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:03:06,303 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2019-01-14 17:03:06,304 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 17:03:06,336 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:03:06,358 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:03:06,376 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:03:06,425 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 38 [2019-01-14 17:03:06,434 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 17:03:06,434 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-14 17:03:06,455 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:03:06,478 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:03:06,494 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 54 [2019-01-14 17:03:06,504 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 48 [2019-01-14 17:03:06,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:03:06,528 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 53 [2019-01-14 17:03:06,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:03:06,577 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 43 [2019-01-14 17:03:06,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:03:06,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:03:06,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:03:06,629 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 57 [2019-01-14 17:03:06,630 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-14 17:03:06,669 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:03:06,704 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:03:06,735 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:03:06,790 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2019-01-14 17:03:06,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:03:06,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:03:06,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:03:07,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:03:07,005 INFO L303 Elim1Store]: Index analysis took 213 ms [2019-01-14 17:03:07,006 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 59 [2019-01-14 17:03:07,007 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-01-14 17:03:07,046 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:03:07,084 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:03:07,144 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-14 17:03:07,145 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 4 variables, input treesize:61, output treesize:41 [2019-01-14 17:03:07,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:03:07,281 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 62 [2019-01-14 17:03:07,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:03:07,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:03:07,367 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 48 [2019-01-14 17:03:07,367 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 17:03:07,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:03:07,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:03:07,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:03:07,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:03:07,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:03:07,480 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 73 [2019-01-14 17:03:07,481 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 17:03:07,500 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:03:07,511 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 17:03:07,511 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:43, output treesize:22 [2019-01-14 17:03:07,545 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 24 [2019-01-14 17:03:07,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:03:07,591 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2019-01-14 17:03:07,591 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 17:03:07,640 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:03:07,643 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:03:07,643 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:22, output treesize:3 [2019-01-14 17:03:07,661 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-01-14 17:03:07,662 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 17:03:07,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 17:03:07,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 17:03:07,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 17:03:07,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 17:03:07,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 17:03:07,666 INFO L87 Difference]: Start difference. First operand 531 states and 776 transitions. Second operand 4 states. [2019-01-14 17:03:12,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:03:12,786 INFO L93 Difference]: Finished difference Result 1019 states and 1486 transitions. [2019-01-14 17:03:12,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 17:03:12,788 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-01-14 17:03:12,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:03:12,792 INFO L225 Difference]: With dead ends: 1019 [2019-01-14 17:03:12,792 INFO L226 Difference]: Without dead ends: 604 [2019-01-14 17:03:12,794 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 17:03:12,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2019-01-14 17:03:12,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 532. [2019-01-14 17:03:12,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 532 states. [2019-01-14 17:03:12,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 777 transitions. [2019-01-14 17:03:12,818 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 777 transitions. Word has length 101 [2019-01-14 17:03:12,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:03:12,819 INFO L480 AbstractCegarLoop]: Abstraction has 532 states and 777 transitions. [2019-01-14 17:03:12,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 17:03:12,819 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 777 transitions. [2019-01-14 17:03:12,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-01-14 17:03:12,822 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:03:12,822 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 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] [2019-01-14 17:03:12,823 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:03:12,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:03:12,823 INFO L82 PathProgramCache]: Analyzing trace with hash 517833024, now seen corresponding path program 1 times [2019-01-14 17:03:12,824 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 17:03:12,824 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-14 17:03:12,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:03:14,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:03:14,673 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 17:03:14,724 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2019-01-14 17:03:14,742 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-14 17:03:14,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:03:14,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:03:14,751 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2019-01-14 17:03:14,752 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 17:03:14,764 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:03:14,773 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:03:14,789 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:03:14,789 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-01-14 17:03:14,862 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2019-01-14 17:03:14,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:03:14,900 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2019-01-14 17:03:14,903 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 17:03:14,952 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:03:14,954 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:03:14,955 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-01-14 17:03:15,010 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-01-14 17:03:15,010 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 17:03:15,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 17:03:15,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 17:03:15,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 17:03:15,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 17:03:15,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-14 17:03:15,018 INFO L87 Difference]: Start difference. First operand 532 states and 777 transitions. Second operand 5 states. [2019-01-14 17:03:25,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:03:25,950 INFO L93 Difference]: Finished difference Result 1414 states and 2068 transitions. [2019-01-14 17:03:25,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 17:03:25,954 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 115 [2019-01-14 17:03:25,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:03:25,959 INFO L225 Difference]: With dead ends: 1414 [2019-01-14 17:03:25,959 INFO L226 Difference]: Without dead ends: 898 [2019-01-14 17:03:25,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-14 17:03:25,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 898 states. [2019-01-14 17:03:25,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 898 to 636. [2019-01-14 17:03:25,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 636 states. [2019-01-14 17:03:25,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 961 transitions. [2019-01-14 17:03:25,988 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 961 transitions. Word has length 115 [2019-01-14 17:03:25,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:03:25,988 INFO L480 AbstractCegarLoop]: Abstraction has 636 states and 961 transitions. [2019-01-14 17:03:25,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 17:03:25,988 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 961 transitions. [2019-01-14 17:03:25,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-01-14 17:03:25,992 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:03:25,992 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 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] [2019-01-14 17:03:25,992 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:03:25,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:03:25,992 INFO L82 PathProgramCache]: Analyzing trace with hash -1131522579, now seen corresponding path program 1 times [2019-01-14 17:03:25,994 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 17:03:25,994 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-14 17:03:26,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:03:27,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:03:27,780 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 17:03:27,830 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2019-01-14 17:03:27,844 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-14 17:03:27,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:03:27,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:03:27,891 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2019-01-14 17:03:27,892 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 17:03:27,959 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:03:27,965 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:03:27,976 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:03:27,976 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-01-14 17:03:27,997 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2019-01-14 17:03:28,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:03:28,022 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2019-01-14 17:03:28,022 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 17:03:28,026 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:03:28,027 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:03:28,027 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-01-14 17:03:28,051 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-01-14 17:03:28,051 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 17:03:28,058 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 17:03:28,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 17:03:28,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 17:03:28,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 17:03:28,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-14 17:03:28,059 INFO L87 Difference]: Start difference. First operand 636 states and 961 transitions. Second operand 5 states. [2019-01-14 17:03:38,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:03:38,196 INFO L93 Difference]: Finished difference Result 1502 states and 2230 transitions. [2019-01-14 17:03:38,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 17:03:38,198 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 116 [2019-01-14 17:03:38,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:03:38,203 INFO L225 Difference]: With dead ends: 1502 [2019-01-14 17:03:38,204 INFO L226 Difference]: Without dead ends: 882 [2019-01-14 17:03:38,205 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-14 17:03:38,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2019-01-14 17:03:38,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 640. [2019-01-14 17:03:38,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2019-01-14 17:03:38,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 965 transitions. [2019-01-14 17:03:38,235 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 965 transitions. Word has length 116 [2019-01-14 17:03:38,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:03:38,235 INFO L480 AbstractCegarLoop]: Abstraction has 640 states and 965 transitions. [2019-01-14 17:03:38,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 17:03:38,235 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 965 transitions. [2019-01-14 17:03:38,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-01-14 17:03:38,238 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:03:38,239 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 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] [2019-01-14 17:03:38,239 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:03:38,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:03:38,239 INFO L82 PathProgramCache]: Analyzing trace with hash 100495331, now seen corresponding path program 2 times [2019-01-14 17:03:38,240 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 17:03:38,240 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-14 17:03:38,267 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2019-01-14 17:03:39,079 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 17:03:39,079 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 17:03:39,091 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 17:03:39,102 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-14 17:03:39,106 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-14 17:03:39,107 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 17:03:39,127 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:03:39,135 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:03:39,135 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2019-01-14 17:03:39,154 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2019-01-14 17:03:39,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:03:39,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:03:39,161 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2019-01-14 17:03:39,162 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 17:03:39,171 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:03:39,183 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:03:39,184 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-01-14 17:03:39,203 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2019-01-14 17:03:39,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:03:39,244 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2019-01-14 17:03:39,244 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 17:03:39,248 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:03:39,249 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:03:39,249 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-01-14 17:03:39,272 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-01-14 17:03:39,272 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 17:03:39,277 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 17:03:39,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 17:03:39,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 17:03:39,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 17:03:39,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-14 17:03:39,278 INFO L87 Difference]: Start difference. First operand 640 states and 965 transitions. Second operand 6 states. [2019-01-14 17:03:50,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:03:50,281 INFO L93 Difference]: Finished difference Result 1638 states and 2453 transitions. [2019-01-14 17:03:50,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 17:03:50,284 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 130 [2019-01-14 17:03:50,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:03:50,290 INFO L225 Difference]: With dead ends: 1638 [2019-01-14 17:03:50,290 INFO L226 Difference]: Without dead ends: 1014 [2019-01-14 17:03:50,292 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-14 17:03:50,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1014 states. [2019-01-14 17:03:50,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1014 to 724. [2019-01-14 17:03:50,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 724 states. [2019-01-14 17:03:50,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 1105 transitions. [2019-01-14 17:03:50,327 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 1105 transitions. Word has length 130 [2019-01-14 17:03:50,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:03:50,328 INFO L480 AbstractCegarLoop]: Abstraction has 724 states and 1105 transitions. [2019-01-14 17:03:50,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 17:03:50,328 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 1105 transitions. [2019-01-14 17:03:50,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-01-14 17:03:50,331 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:03:50,332 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 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] [2019-01-14 17:03:50,332 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:03:50,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:03:50,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1667253281, now seen corresponding path program 1 times [2019-01-14 17:03:50,333 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-14 17:03:50,333 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-14 17:03:50,361 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 17:03:52,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:03:52,201 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 17:03:52,597 WARN L181 SmtUtils]: Spent 380.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-01-14 17:03:52,603 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 124 [2019-01-14 17:03:52,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 97 [2019-01-14 17:03:52,624 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 17:03:52,654 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:03:52,664 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 152 [2019-01-14 17:03:52,674 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 132 [2019-01-14 17:03:52,676 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 17:03:52,729 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 17:03:52,738 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 160 treesize of output 152 [2019-01-14 17:03:52,749 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 125 [2019-01-14 17:03:52,750 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 17:03:52,829 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 17:03:54,174 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 132 treesize of output 121 [2019-01-14 17:03:54,185 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 111 [2019-01-14 17:03:54,186 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 17:03:55,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:03:55,941 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 106 [2019-01-14 17:03:55,942 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-14 17:03:57,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:03:57,780 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 75 [2019-01-14 17:03:57,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:03:57,799 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2019-01-14 17:03:57,800 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-14 17:03:57,827 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2019-01-14 17:03:57,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:03:57,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:03:57,838 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2019-01-14 17:03:57,838 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-01-14 17:03:57,851 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:03:57,865 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:03:58,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:03:58,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:03:58,655 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 110 treesize of output 108 [2019-01-14 17:03:58,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:03:58,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:03:58,696 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 102 [2019-01-14 17:03:58,697 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-01-14 17:03:59,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:03:59,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:03:59,556 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 75 [2019-01-14 17:03:59,558 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-01-14 17:04:00,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:04:00,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:04:00,207 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 68 [2019-01-14 17:04:00,238 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 17:04:00,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:04:00,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:04:00,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:04:00,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:04:00,429 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 52 treesize of output 116 [2019-01-14 17:04:00,431 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 2 xjuncts. [2019-01-14 17:04:00,513 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 17:04:00,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:04:00,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:04:00,782 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 69 [2019-01-14 17:04:00,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:04:00,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:04:00,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:04:01,178 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 127 [2019-01-14 17:04:01,183 INFO L267 ElimStorePlain]: Start of recursive call 21: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 8 xjuncts. [2019-01-14 17:04:01,383 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 17:04:01,539 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 41 [2019-01-14 17:04:01,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:04:01,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:04:01,561 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 55 [2019-01-14 17:04:01,562 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2019-01-14 17:04:01,580 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:04:01,694 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 5 xjuncts. [2019-01-14 17:04:02,052 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-14 17:04:02,059 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 77 [2019-01-14 17:04:02,066 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-14 17:04:02,066 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2019-01-14 17:04:02,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:04:02,103 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 54 [2019-01-14 17:04:02,112 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 15 [2019-01-14 17:04:02,112 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2019-01-14 17:04:02,138 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2019-01-14 17:04:02,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:04:02,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:04:02,150 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 55 [2019-01-14 17:04:02,150 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2019-01-14 17:04:02,167 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:04:02,176 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:04:02,190 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:04:02,244 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 106 [2019-01-14 17:04:02,253 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-14 17:04:02,254 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2019-01-14 17:04:02,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:04:02,343 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 69 [2019-01-14 17:04:02,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:04:02,354 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2019-01-14 17:04:02,354 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2019-01-14 17:04:02,377 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2019-01-14 17:04:02,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:04:02,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:04:02,385 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2019-01-14 17:04:02,385 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2019-01-14 17:04:02,395 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:04:02,403 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:04:02,414 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:04:02,531 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2019-01-14 17:04:02,536 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2019-01-14 17:04:02,537 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 17:04:02,559 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 17:04:02,563 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2019-01-14 17:04:02,566 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 19 [2019-01-14 17:04:02,567 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2019-01-14 17:04:02,575 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:04:02,578 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2019-01-14 17:04:02,581 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2019-01-14 17:04:02,582 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2019-01-14 17:04:02,592 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:04:02,595 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2019-01-14 17:04:02,598 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-01-14 17:04:02,599 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 17:04:02,608 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 17:04:02,702 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2019-01-14 17:04:02,702 INFO L202 ElimStorePlain]: Needed 43 recursive calls to eliminate 3 variables, input treesize:173, output treesize:114 [2019-01-14 17:04:03,008 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2019-01-14 17:04:03,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:04:03,012 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2019-01-14 17:04:03,012 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 17:04:03,015 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:04:03,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:04:03,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 17:04:03,040 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2019-01-14 17:04:03,056 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 10 treesize of output 15 [2019-01-14 17:04:03,056 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 17:04:03,093 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 4 [2019-01-14 17:04:03,093 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 17:04:03,101 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 17:04:03,112 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 17:04:03,112 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:53, output treesize:8 [2019-01-14 17:04:03,158 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-01-14 17:04:03,159 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-14 17:04:03,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 17:04:03,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 17:04:03,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 17:04:03,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 17:04:03,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-01-14 17:04:03,172 INFO L87 Difference]: Start difference. First operand 724 states and 1105 transitions. Second operand 7 states. [2019-01-14 17:04:18,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:04:18,648 INFO L93 Difference]: Finished difference Result 1192 states and 1791 transitions. [2019-01-14 17:04:18,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 17:04:18,652 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 130 [2019-01-14 17:04:18,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:04:18,653 INFO L225 Difference]: With dead ends: 1192 [2019-01-14 17:04:18,653 INFO L226 Difference]: Without dead ends: 0 [2019-01-14 17:04:18,656 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-14 17:04:18,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-14 17:04:18,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-14 17:04:18,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-14 17:04:18,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 17:04:18,657 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 130 [2019-01-14 17:04:18,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:04:18,657 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 17:04:18,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 17:04:18,657 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-14 17:04:18,657 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-14 17:04:18,664 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-14 17:04:18,837 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 46 [2019-01-14 17:04:19,168 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 17:04:19,433 WARN L181 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 23 [2019-01-14 17:04:19,577 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 23 [2019-01-14 17:04:19,763 WARN L181 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 23 [2019-01-14 17:04:19,955 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 23 [2019-01-14 17:04:20,091 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 23 [2019-01-14 17:04:20,533 WARN L181 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 23 [2019-01-14 17:04:20,674 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 23 [2019-01-14 17:04:20,802 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 23 [2019-01-14 17:04:21,191 INFO L448 ceAbstractionStarter]: For program point L1423(lines 1423 1427) no Hoare annotation was computed. [2019-01-14 17:04:21,192 INFO L448 ceAbstractionStarter]: For program point L1390(lines 1390 1394) no Hoare annotation was computed. [2019-01-14 17:04:21,192 INFO L448 ceAbstractionStarter]: For program point L1258(lines 1258 1263) no Hoare annotation was computed. [2019-01-14 17:04:21,192 INFO L448 ceAbstractionStarter]: For program point L1490(lines 1490 1501) no Hoare annotation was computed. [2019-01-14 17:04:21,192 INFO L448 ceAbstractionStarter]: For program point L1490-1(lines 1490 1501) no Hoare annotation was computed. [2019-01-14 17:04:21,192 INFO L444 ceAbstractionStarter]: At program point L1391(lines 1099 1646) the Hoare annotation is: (and (= (_ bv0 32) ULTIMATE.start_ssl3_connect_~s.offset) (= (bvadd ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv4294967292 32)) (_ bv0 32))) [2019-01-14 17:04:21,192 INFO L448 ceAbstractionStarter]: For program point L1226(lines 1226 1572) no Hoare annotation was computed. [2019-01-14 17:04:21,192 INFO L448 ceAbstractionStarter]: For program point L1193(lines 1193 1583) no Hoare annotation was computed. [2019-01-14 17:04:21,193 INFO L448 ceAbstractionStarter]: For program point L1160(lines 1160 1594) no Hoare annotation was computed. [2019-01-14 17:04:21,193 INFO L444 ceAbstractionStarter]: At program point L1227(lines 1226 1572) the Hoare annotation is: (let ((.cse0 (= (_ bv0 32) ULTIMATE.start_ssl3_connect_~s.offset))) (or (and (= (bvadd ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv4294967294 32)) (_ bv0 32)) .cse0) (and .cse0 (= (bvadd ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv4294967292 32)) (_ bv0 32))) (and (= (bvadd ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv4294967293 32)) (_ bv0 32)) .cse0) (and (= ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv0 32)) .cse0) (and (= (bvadd ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv4294967295 32)) (_ bv0 32)) .cse0))) [2019-01-14 17:04:21,193 INFO L444 ceAbstractionStarter]: At program point L1194(lines 1184 1586) the Hoare annotation is: (let ((.cse0 (= (_ bv0 32) ULTIMATE.start_ssl3_connect_~s.offset))) (or (and (= (bvadd ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv4294967294 32)) (_ bv0 32)) .cse0) (and .cse0 (= (bvadd ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv4294967292 32)) (_ bv0 32))) (and (= (bvadd ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv4294967293 32)) (_ bv0 32)) .cse0) (and (= ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv0 32)) .cse0) (and (= (bvadd ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv4294967295 32)) (_ bv0 32)) .cse0))) [2019-01-14 17:04:21,193 INFO L448 ceAbstractionStarter]: For program point L1558(lines 1558 1562) no Hoare annotation was computed. [2019-01-14 17:04:21,193 INFO L448 ceAbstractionStarter]: For program point L1525(lines 1525 1530) no Hoare annotation was computed. [2019-01-14 17:04:21,193 INFO L448 ceAbstractionStarter]: For program point L1492(lines 1492 1498) no Hoare annotation was computed. [2019-01-14 17:04:21,193 INFO L448 ceAbstractionStarter]: For program point L1460(lines 1460 1464) no Hoare annotation was computed. [2019-01-14 17:04:21,193 INFO L448 ceAbstractionStarter]: For program point L1460-2(lines 1460 1464) no Hoare annotation was computed. [2019-01-14 17:04:21,193 INFO L448 ceAbstractionStarter]: For program point L1229(lines 1229 1571) no Hoare annotation was computed. [2019-01-14 17:04:21,194 INFO L448 ceAbstractionStarter]: For program point L1196(lines 1196 1582) no Hoare annotation was computed. [2019-01-14 17:04:21,194 INFO L448 ceAbstractionStarter]: For program point L1163(lines 1163 1593) no Hoare annotation was computed. [2019-01-14 17:04:21,194 INFO L448 ceAbstractionStarter]: For program point L1130-1(lines 1099 1646) no Hoare annotation was computed. [2019-01-14 17:04:21,194 INFO L448 ceAbstractionStarter]: For program point L1395(lines 1395 1399) no Hoare annotation was computed. [2019-01-14 17:04:21,194 INFO L451 ceAbstractionStarter]: At program point L1230(lines 1229 1571) the Hoare annotation is: true [2019-01-14 17:04:21,194 INFO L444 ceAbstractionStarter]: At program point L1164(lines 1160 1594) the Hoare annotation is: (let ((.cse0 (= (_ bv0 32) ULTIMATE.start_ssl3_connect_~s.offset))) (or (and (= (bvadd ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv4294967294 32)) (_ bv0 32)) .cse0) (and .cse0 (= (bvadd ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv4294967292 32)) (_ bv0 32))) (and (= (bvadd ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv4294967293 32)) (_ bv0 32)) .cse0) (and (= ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv0 32)) .cse0) (and (= (bvadd ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv4294967295 32)) (_ bv0 32)) .cse0))) [2019-01-14 17:04:21,194 INFO L448 ceAbstractionStarter]: For program point L1131(line 1131) no Hoare annotation was computed. [2019-01-14 17:04:21,194 INFO L448 ceAbstractionStarter]: For program point L1429(lines 1429 1434) no Hoare annotation was computed. [2019-01-14 17:04:21,194 INFO L448 ceAbstractionStarter]: For program point L1429-2(lines 1429 1434) no Hoare annotation was computed. [2019-01-14 17:04:21,194 INFO L448 ceAbstractionStarter]: For program point L1330(lines 1330 1344) no Hoare annotation was computed. [2019-01-14 17:04:21,195 INFO L448 ceAbstractionStarter]: For program point L1330-2(lines 1330 1344) no Hoare annotation was computed. [2019-01-14 17:04:21,195 INFO L448 ceAbstractionStarter]: For program point L1364(lines 1364 1369) no Hoare annotation was computed. [2019-01-14 17:04:21,195 INFO L448 ceAbstractionStarter]: For program point L1199(lines 1199 1581) no Hoare annotation was computed. [2019-01-14 17:04:21,195 INFO L448 ceAbstractionStarter]: For program point L1166(lines 1166 1592) no Hoare annotation was computed. [2019-01-14 17:04:21,195 INFO L448 ceAbstractionStarter]: For program point L1133(lines 1133 1603) no Hoare annotation was computed. [2019-01-14 17:04:21,195 INFO L451 ceAbstractionStarter]: At program point L1233(lines 1232 1570) the Hoare annotation is: true [2019-01-14 17:04:21,195 INFO L444 ceAbstractionStarter]: At program point L1200(lines 1196 1582) the Hoare annotation is: (let ((.cse0 (= (_ bv0 32) ULTIMATE.start_ssl3_connect_~s.offset))) (or (and (= (bvadd ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv4294967294 32)) (_ bv0 32)) .cse0) (and .cse0 (= (bvadd ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv4294967292 32)) (_ bv0 32))) (and (= (bvadd ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv4294967293 32)) (_ bv0 32)) .cse0) (and (= ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv0 32)) .cse0) (and (= (bvadd ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv4294967295 32)) (_ bv0 32)) .cse0))) [2019-01-14 17:04:21,195 INFO L444 ceAbstractionStarter]: At program point L1134(lines 1133 1603) the Hoare annotation is: (let ((.cse0 (= (_ bv0 32) ULTIMATE.start_ssl3_connect_~s.offset))) (or (and (= (bvadd ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv4294967294 32)) (_ bv0 32)) .cse0) (and .cse0 (= (bvadd ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv4294967292 32)) (_ bv0 32))) (and (= (bvadd ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv4294967293 32)) (_ bv0 32)) .cse0) (and (= ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv0 32)) .cse0) (and (= (bvadd ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv4294967295 32)) (_ bv0 32)) .cse0))) [2019-01-14 17:04:21,195 INFO L448 ceAbstractionStarter]: For program point L1466(lines 1466 1471) no Hoare annotation was computed. [2019-01-14 17:04:21,196 INFO L448 ceAbstractionStarter]: For program point L1400(lines 1400 1404) no Hoare annotation was computed. [2019-01-14 17:04:21,196 INFO L448 ceAbstractionStarter]: For program point L1334(lines 1334 1338) no Hoare annotation was computed. [2019-01-14 17:04:21,196 INFO L448 ceAbstractionStarter]: For program point L1400-2(lines 1400 1404) no Hoare annotation was computed. [2019-01-14 17:04:21,196 INFO L448 ceAbstractionStarter]: For program point L1334-2(lines 1332 1344) no Hoare annotation was computed. [2019-01-14 17:04:21,196 INFO L448 ceAbstractionStarter]: For program point L1202(lines 1202 1580) no Hoare annotation was computed. [2019-01-14 17:04:21,196 INFO L448 ceAbstractionStarter]: For program point L1169(lines 1169 1591) no Hoare annotation was computed. [2019-01-14 17:04:21,196 INFO L448 ceAbstractionStarter]: For program point L1136(lines 1136 1602) no Hoare annotation was computed. [2019-01-14 17:04:21,196 INFO L448 ceAbstractionStarter]: For program point L1302(lines 1302 1306) no Hoare annotation was computed. [2019-01-14 17:04:21,196 INFO L448 ceAbstractionStarter]: For program point L1269(lines 1269 1274) no Hoare annotation was computed. [2019-01-14 17:04:21,196 INFO L444 ceAbstractionStarter]: At program point L1170(lines 1166 1592) the Hoare annotation is: (let ((.cse0 (= (_ bv0 32) ULTIMATE.start_ssl3_connect_~s.offset))) (or (and (= (bvadd ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv4294967294 32)) (_ bv0 32)) .cse0) (and .cse0 (= (bvadd ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv4294967292 32)) (_ bv0 32))) (and (= (bvadd ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv4294967293 32)) (_ bv0 32)) .cse0) (and (= ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv0 32)) .cse0) (and (= (bvadd ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv4294967295 32)) (_ bv0 32)) .cse0))) [2019-01-14 17:04:21,197 INFO L444 ceAbstractionStarter]: At program point L1568(lines 1234 1569) the Hoare annotation is: (let ((.cse0 (= (_ bv0 32) ULTIMATE.start_ssl3_connect_~s.offset))) (or (and (= (bvadd ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv4294967294 32)) (_ bv0 32)) .cse0) (and .cse0 (= (bvadd ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv4294967292 32)) (_ bv0 32))) (and (= (bvadd ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv4294967293 32)) (_ bv0 32)) .cse0) (and (= ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv0 32)) .cse0) (and (= (bvadd ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv4294967295 32)) (_ bv0 32)) .cse0))) [2019-01-14 17:04:21,203 INFO L448 ceAbstractionStarter]: For program point L1205(lines 1205 1579) no Hoare annotation was computed. [2019-01-14 17:04:21,203 INFO L448 ceAbstractionStarter]: For program point L1172(lines 1172 1590) no Hoare annotation was computed. [2019-01-14 17:04:21,204 INFO L448 ceAbstractionStarter]: For program point L1139(lines 1139 1601) no Hoare annotation was computed. [2019-01-14 17:04:21,204 INFO L451 ceAbstractionStarter]: At program point L1073(lines 1061 1075) the Hoare annotation is: true [2019-01-14 17:04:21,204 INFO L451 ceAbstractionStarter]: At program point L1635(lines 1129 1636) the Hoare annotation is: true [2019-01-14 17:04:21,204 INFO L444 ceAbstractionStarter]: At program point L1239(lines 1136 1602) the Hoare annotation is: (let ((.cse0 (= (_ bv0 32) ULTIMATE.start_ssl3_connect_~s.offset))) (or (and (= (bvadd ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv4294967294 32)) (_ bv0 32)) .cse0) (and .cse0 (= (bvadd ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv4294967292 32)) (_ bv0 32))) (and (= (bvadd ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv4294967293 32)) (_ bv0 32)) .cse0) (and (= ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv0 32)) .cse0) (and (= (bvadd ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv4294967295 32)) (_ bv0 32)) .cse0))) [2019-01-14 17:04:21,204 INFO L444 ceAbstractionStarter]: At program point L1206(lines 1202 1580) the Hoare annotation is: (let ((.cse0 (= (_ bv0 32) ULTIMATE.start_ssl3_connect_~s.offset))) (or (and (= (bvadd ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv4294967294 32)) (_ bv0 32)) .cse0) (and .cse0 (= (bvadd ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv4294967292 32)) (_ bv0 32))) (and (= (bvadd ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv4294967293 32)) (_ bv0 32)) .cse0) (and (= ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv0 32)) .cse0) (and (= (bvadd ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv4294967295 32)) (_ bv0 32)) .cse0))) [2019-01-14 17:04:21,204 INFO L448 ceAbstractionStarter]: For program point L1604(lines 1604 1632) no Hoare annotation was computed. [2019-01-14 17:04:21,204 INFO L448 ceAbstractionStarter]: For program point L1604-1(lines 1604 1632) no Hoare annotation was computed. [2019-01-14 17:04:21,204 INFO L448 ceAbstractionStarter]: For program point L1538(lines 1538 1542) no Hoare annotation was computed. [2019-01-14 17:04:21,205 INFO L448 ceAbstractionStarter]: For program point L1538-2(lines 1538 1542) no Hoare annotation was computed. [2019-01-14 17:04:21,205 INFO L448 ceAbstractionStarter]: For program point L1208(lines 1208 1578) no Hoare annotation was computed. [2019-01-14 17:04:21,205 INFO L448 ceAbstractionStarter]: For program point L1175(lines 1175 1589) no Hoare annotation was computed. [2019-01-14 17:04:21,205 INFO L448 ceAbstractionStarter]: For program point L1142(lines 1142 1600) no Hoare annotation was computed. [2019-01-14 17:04:21,205 INFO L451 ceAbstractionStarter]: At program point L1076(lines 1076 1647) the Hoare annotation is: true [2019-01-14 17:04:21,205 INFO L448 ceAbstractionStarter]: For program point L1605(lines 1605 1629) no Hoare annotation was computed. [2019-01-14 17:04:21,205 INFO L448 ceAbstractionStarter]: For program point L1473(lines 1473 1478) no Hoare annotation was computed. [2019-01-14 17:04:21,205 INFO L448 ceAbstractionStarter]: For program point L1440(lines 1440 1444) no Hoare annotation was computed. [2019-01-14 17:04:21,205 INFO L448 ceAbstractionStarter]: For program point L1374(lines 1374 1378) no Hoare annotation was computed. [2019-01-14 17:04:21,205 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-14 17:04:21,206 INFO L444 ceAbstractionStarter]: At program point L1176(lines 1172 1590) the Hoare annotation is: (let ((.cse0 (= (_ bv0 32) ULTIMATE.start_ssl3_connect_~s.offset))) (or (and (= (bvadd ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv4294967294 32)) (_ bv0 32)) .cse0) (and .cse0 (= (bvadd ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv4294967292 32)) (_ bv0 32))) (and (= (bvadd ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv4294967293 32)) (_ bv0 32)) .cse0) (and (= ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv0 32)) .cse0) (and (= (bvadd ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv4294967295 32)) (_ bv0 32)) .cse0))) [2019-01-14 17:04:21,206 INFO L448 ceAbstractionStarter]: For program point L1110(lines 1110 1118) no Hoare annotation was computed. [2019-01-14 17:04:21,206 INFO L448 ceAbstractionStarter]: For program point L1639(lines 1639 1643) no Hoare annotation was computed. [2019-01-14 17:04:21,206 INFO L448 ceAbstractionStarter]: For program point L1606(lines 1606 1615) no Hoare annotation was computed. [2019-01-14 17:04:21,206 INFO L448 ceAbstractionStarter]: For program point L1639-2(lines 1639 1643) no Hoare annotation was computed. [2019-01-14 17:04:21,206 INFO L448 ceAbstractionStarter]: For program point L1606-2(lines 1605 1627) no Hoare annotation was computed. [2019-01-14 17:04:21,206 INFO L448 ceAbstractionStarter]: For program point L1507(lines 1507 1511) no Hoare annotation was computed. [2019-01-14 17:04:21,206 INFO L448 ceAbstractionStarter]: For program point L1276(lines 1276 1281) no Hoare annotation was computed. [2019-01-14 17:04:21,206 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1645) no Hoare annotation was computed. [2019-01-14 17:04:21,206 INFO L448 ceAbstractionStarter]: For program point L1244(lines 1244 1248) no Hoare annotation was computed. [2019-01-14 17:04:21,207 INFO L448 ceAbstractionStarter]: For program point L1211(lines 1211 1577) no Hoare annotation was computed. [2019-01-14 17:04:21,207 INFO L448 ceAbstractionStarter]: For program point L1178(lines 1178 1588) no Hoare annotation was computed. [2019-01-14 17:04:21,207 INFO L448 ceAbstractionStarter]: For program point L1244-2(lines 1244 1248) no Hoare annotation was computed. [2019-01-14 17:04:21,207 INFO L448 ceAbstractionStarter]: For program point L1145(lines 1145 1599) no Hoare annotation was computed. [2019-01-14 17:04:21,207 INFO L448 ceAbstractionStarter]: For program point L1608(lines 1608 1612) no Hoare annotation was computed. [2019-01-14 17:04:21,207 INFO L448 ceAbstractionStarter]: For program point L1311(lines 1311 1315) no Hoare annotation was computed. [2019-01-14 17:04:21,207 INFO L448 ceAbstractionStarter]: For program point L1311-2(lines 1234 1567) no Hoare annotation was computed. [2019-01-14 17:04:21,207 INFO L444 ceAbstractionStarter]: At program point L1212(lines 1208 1578) the Hoare annotation is: (let ((.cse0 (= (_ bv0 32) ULTIMATE.start_ssl3_connect_~s.offset))) (or (and (= (bvadd ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv4294967294 32)) (_ bv0 32)) .cse0) (and .cse0 (= (bvadd ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv4294967292 32)) (_ bv0 32))) (and (= (bvadd ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv4294967293 32)) (_ bv0 32)) .cse0) (and (= ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv0 32)) .cse0) (and (= (bvadd ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv4294967295 32)) (_ bv0 32)) .cse0))) [2019-01-14 17:04:21,207 INFO L448 ceAbstractionStarter]: For program point L1113(lines 1113 1117) no Hoare annotation was computed. [2019-01-14 17:04:21,207 INFO L448 ceAbstractionStarter]: For program point L1113-2(lines 1110 1118) no Hoare annotation was computed. [2019-01-14 17:04:21,208 INFO L448 ceAbstractionStarter]: For program point L1543(lines 1543 1547) no Hoare annotation was computed. [2019-01-14 17:04:21,208 INFO L448 ceAbstractionStarter]: For program point L1543-2(lines 1543 1547) no Hoare annotation was computed. [2019-01-14 17:04:21,208 INFO L448 ceAbstractionStarter]: For program point L1412(lines 1412 1416) no Hoare annotation was computed. [2019-01-14 17:04:21,208 INFO L448 ceAbstractionStarter]: For program point L1379(lines 1379 1383) no Hoare annotation was computed. [2019-01-14 17:04:21,208 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-14 17:04:21,208 INFO L448 ceAbstractionStarter]: For program point L1214(lines 1214 1576) no Hoare annotation was computed. [2019-01-14 17:04:21,208 INFO L448 ceAbstractionStarter]: For program point L1181(lines 1181 1587) no Hoare annotation was computed. [2019-01-14 17:04:21,208 INFO L448 ceAbstractionStarter]: For program point L1148(lines 1148 1598) no Hoare annotation was computed. [2019-01-14 17:04:21,208 INFO L448 ceAbstractionStarter]: For program point L1512(lines 1512 1516) no Hoare annotation was computed. [2019-01-14 17:04:21,208 INFO L448 ceAbstractionStarter]: For program point L1512-2(lines 1512 1516) no Hoare annotation was computed. [2019-01-14 17:04:21,208 INFO L444 ceAbstractionStarter]: At program point L1182(lines 1178 1588) the Hoare annotation is: (let ((.cse0 (= (_ bv0 32) ULTIMATE.start_ssl3_connect_~s.offset))) (or (and (= (bvadd ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv4294967294 32)) (_ bv0 32)) .cse0) (and .cse0 (= (bvadd ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv4294967292 32)) (_ bv0 32))) (and (= (bvadd ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv4294967293 32)) (_ bv0 32)) .cse0) (and (= ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv0 32)) .cse0) (and (= (bvadd ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv4294967295 32)) (_ bv0 32)) .cse0))) [2019-01-14 17:04:21,209 INFO L448 ceAbstractionStarter]: For program point L1249(lines 1249 1254) no Hoare annotation was computed. [2019-01-14 17:04:21,209 INFO L448 ceAbstractionStarter]: For program point L1217(lines 1217 1575) no Hoare annotation was computed. [2019-01-14 17:04:21,209 INFO L448 ceAbstractionStarter]: For program point L1184(lines 1184 1586) no Hoare annotation was computed. [2019-01-14 17:04:21,209 INFO L448 ceAbstractionStarter]: For program point L1151(lines 1151 1597) no Hoare annotation was computed. [2019-01-14 17:04:21,209 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-14 17:04:21,209 INFO L444 ceAbstractionStarter]: At program point L1218(lines 1214 1576) the Hoare annotation is: (let ((.cse0 (= (_ bv0 32) ULTIMATE.start_ssl3_connect_~s.offset))) (or (and (= (bvadd ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv4294967294 32)) (_ bv0 32)) .cse0) (and .cse0 (= (bvadd ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv4294967292 32)) (_ bv0 32))) (and (= (bvadd ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv4294967293 32)) (_ bv0 32)) .cse0) (and (= ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv0 32)) .cse0) (and (= (bvadd ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv4294967295 32)) (_ bv0 32)) .cse0))) [2019-01-14 17:04:21,209 INFO L444 ceAbstractionStarter]: At program point L1152(lines 1148 1598) the Hoare annotation is: (let ((.cse0 (= (_ bv0 32) ULTIMATE.start_ssl3_connect_~s.offset))) (or (and (= (bvadd ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv4294967294 32)) (_ bv0 32)) .cse0) (and .cse0 (= (bvadd ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv4294967292 32)) (_ bv0 32))) (and (= (bvadd ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv4294967293 32)) (_ bv0 32)) .cse0) (and (= ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv0 32)) .cse0) (and (= (bvadd ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv4294967295 32)) (_ bv0 32)) .cse0))) [2019-01-14 17:04:21,209 INFO L448 ceAbstractionStarter]: For program point L1483(lines 1483 1487) no Hoare annotation was computed. [2019-01-14 17:04:21,209 INFO L448 ceAbstractionStarter]: For program point L1351(lines 1351 1355) no Hoare annotation was computed. [2019-01-14 17:04:21,209 INFO L448 ceAbstractionStarter]: For program point L1351-2(lines 1234 1567) no Hoare annotation was computed. [2019-01-14 17:04:21,210 INFO L448 ceAbstractionStarter]: For program point L1120(lines 1120 1128) no Hoare annotation was computed. [2019-01-14 17:04:21,210 INFO L448 ceAbstractionStarter]: For program point L1550(lines 1550 1554) no Hoare annotation was computed. [2019-01-14 17:04:21,210 INFO L448 ceAbstractionStarter]: For program point L1550-2(lines 1550 1554) no Hoare annotation was computed. [2019-01-14 17:04:21,210 INFO L448 ceAbstractionStarter]: For program point L1220(lines 1220 1574) no Hoare annotation was computed. [2019-01-14 17:04:21,210 INFO L448 ceAbstractionStarter]: For program point L1187(lines 1187 1585) no Hoare annotation was computed. [2019-01-14 17:04:21,210 INFO L448 ceAbstractionStarter]: For program point L1154(lines 1154 1596) no Hoare annotation was computed. [2019-01-14 17:04:21,210 INFO L448 ceAbstractionStarter]: For program point L1121(lines 1121 1125) no Hoare annotation was computed. [2019-01-14 17:04:21,210 INFO L448 ceAbstractionStarter]: For program point L1617(lines 1617 1623) no Hoare annotation was computed. [2019-01-14 17:04:21,210 INFO L448 ceAbstractionStarter]: For program point L1452(lines 1452 1456) no Hoare annotation was computed. [2019-01-14 17:04:21,210 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-14 17:04:21,210 INFO L448 ceAbstractionStarter]: For program point L1321(lines 1321 1325) no Hoare annotation was computed. [2019-01-14 17:04:21,211 INFO L448 ceAbstractionStarter]: For program point L1321-2(lines 1321 1325) no Hoare annotation was computed. [2019-01-14 17:04:21,211 INFO L448 ceAbstractionStarter]: For program point L1256(lines 1256 1267) no Hoare annotation was computed. [2019-01-14 17:04:21,211 INFO L448 ceAbstractionStarter]: For program point L1223(lines 1223 1573) no Hoare annotation was computed. [2019-01-14 17:04:21,211 INFO L448 ceAbstractionStarter]: For program point L1190(lines 1190 1584) no Hoare annotation was computed. [2019-01-14 17:04:21,211 INFO L448 ceAbstractionStarter]: For program point L1256-2(lines 1256 1267) no Hoare annotation was computed. [2019-01-14 17:04:21,211 INFO L448 ceAbstractionStarter]: For program point L1157(lines 1157 1595) no Hoare annotation was computed. [2019-01-14 17:04:21,211 INFO L448 ceAbstractionStarter]: For program point L1521(lines 1521 1534) no Hoare annotation was computed. [2019-01-14 17:04:21,211 INFO L448 ceAbstractionStarter]: For program point L1521-2(lines 1521 1534) no Hoare annotation was computed. [2019-01-14 17:04:21,211 INFO L448 ceAbstractionStarter]: For program point L1290(lines 1290 1294) no Hoare annotation was computed. [2019-01-14 17:04:21,211 INFO L444 ceAbstractionStarter]: At program point L1224(lines 1220 1574) the Hoare annotation is: (let ((.cse0 (= (_ bv0 32) ULTIMATE.start_ssl3_connect_~s.offset))) (or (and (= (bvadd ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv4294967294 32)) (_ bv0 32)) .cse0) (and .cse0 (= (bvadd ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv4294967292 32)) (_ bv0 32))) (and (= (bvadd ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv4294967293 32)) (_ bv0 32)) .cse0) (and (= ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv0 32)) .cse0) (and (= (bvadd ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv4294967295 32)) (_ bv0 32)) .cse0))) [2019-01-14 17:04:21,212 INFO L448 ceAbstractionStarter]: For program point L1290-2(lines 1234 1567) no Hoare annotation was computed. [2019-01-14 17:04:21,212 INFO L444 ceAbstractionStarter]: At program point L1158(lines 1154 1596) the Hoare annotation is: (let ((.cse0 (= (_ bv0 32) ULTIMATE.start_ssl3_connect_~s.offset))) (or (and (= (bvadd ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv4294967294 32)) (_ bv0 32)) .cse0) (and .cse0 (= (bvadd ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv4294967292 32)) (_ bv0 32))) (and (= (bvadd ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv4294967293 32)) (_ bv0 32)) .cse0) (and (= ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv0 32)) .cse0) (and (= (bvadd ULTIMATE.start_ssl3_connect_~blastFlag~0 (_ bv4294967295 32)) (_ bv0 32)) .cse0))) [2019-01-14 17:04:21,239 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 05:04:21 BoogieIcfgContainer [2019-01-14 17:04:21,239 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 17:04:21,240 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 17:04:21,240 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 17:04:21,240 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 17:04:21,240 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 05:02:45" (3/4) ... [2019-01-14 17:04:21,244 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-14 17:04:21,268 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-01-14 17:04:21,269 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-01-14 17:04:21,271 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-14 17:04:21,391 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 17:04:21,391 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 17:04:21,392 INFO L168 Benchmark]: Toolchain (without parser) took 102356.74 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 276.3 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -178.5 MB). Peak memory consumption was 97.8 MB. Max. memory is 11.5 GB. [2019-01-14 17:04:21,392 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 17:04:21,392 INFO L168 Benchmark]: CACSL2BoogieTranslator took 878.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.9 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -197.4 MB). Peak memory consumption was 41.4 MB. Max. memory is 11.5 GB. [2019-01-14 17:04:21,394 INFO L168 Benchmark]: Boogie Procedure Inliner took 136.31 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-14 17:04:21,394 INFO L168 Benchmark]: Boogie Preprocessor took 169.65 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-14 17:04:21,394 INFO L168 Benchmark]: RCFGBuilder took 4784.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 84.4 MB). Peak memory consumption was 84.4 MB. Max. memory is 11.5 GB. [2019-01-14 17:04:21,396 INFO L168 Benchmark]: TraceAbstraction took 96231.07 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 116.4 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -96.9 MB). Peak memory consumption was 348.1 MB. Max. memory is 11.5 GB. [2019-01-14 17:04:21,396 INFO L168 Benchmark]: Witness Printer took 151.15 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-01-14 17:04:21,399 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 878.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.9 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -197.4 MB). Peak memory consumption was 41.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 136.31 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 169.65 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 4784.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 84.4 MB). Peak memory consumption was 84.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 96231.07 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 116.4 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -96.9 MB). Peak memory consumption was 348.1 MB. Max. memory is 11.5 GB. * Witness Printer took 151.15 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1645]: 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: 1129]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1133]: Loop Invariant Derived loop invariant: ((((~bvadd64(blastFlag, 4294967294bv32) == 0bv32 && 0bv32 == s) || (0bv32 == s && ~bvadd64(blastFlag, 4294967292bv32) == 0bv32)) || (~bvadd64(blastFlag, 4294967293bv32) == 0bv32 && 0bv32 == s)) || (blastFlag == 0bv32 && 0bv32 == s)) || (~bvadd64(blastFlag, 4294967295bv32) == 0bv32 && 0bv32 == s) - InvariantResult [Line: 1229]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1172]: Loop Invariant Derived loop invariant: ((((~bvadd64(blastFlag, 4294967294bv32) == 0bv32 && 0bv32 == s) || (0bv32 == s && ~bvadd64(blastFlag, 4294967292bv32) == 0bv32)) || (~bvadd64(blastFlag, 4294967293bv32) == 0bv32 && 0bv32 == s)) || (blastFlag == 0bv32 && 0bv32 == s)) || (~bvadd64(blastFlag, 4294967295bv32) == 0bv32 && 0bv32 == s) - InvariantResult [Line: 1136]: Loop Invariant Derived loop invariant: ((((~bvadd64(blastFlag, 4294967294bv32) == 0bv32 && 0bv32 == s) || (0bv32 == s && ~bvadd64(blastFlag, 4294967292bv32) == 0bv32)) || (~bvadd64(blastFlag, 4294967293bv32) == 0bv32 && 0bv32 == s)) || (blastFlag == 0bv32 && 0bv32 == s)) || (~bvadd64(blastFlag, 4294967295bv32) == 0bv32 && 0bv32 == s) - InvariantResult [Line: 1214]: Loop Invariant Derived loop invariant: ((((~bvadd64(blastFlag, 4294967294bv32) == 0bv32 && 0bv32 == s) || (0bv32 == s && ~bvadd64(blastFlag, 4294967292bv32) == 0bv32)) || (~bvadd64(blastFlag, 4294967293bv32) == 0bv32 && 0bv32 == s)) || (blastFlag == 0bv32 && 0bv32 == s)) || (~bvadd64(blastFlag, 4294967295bv32) == 0bv32 && 0bv32 == s) - InvariantResult [Line: 1160]: Loop Invariant Derived loop invariant: ((((~bvadd64(blastFlag, 4294967294bv32) == 0bv32 && 0bv32 == s) || (0bv32 == s && ~bvadd64(blastFlag, 4294967292bv32) == 0bv32)) || (~bvadd64(blastFlag, 4294967293bv32) == 0bv32 && 0bv32 == s)) || (blastFlag == 0bv32 && 0bv32 == s)) || (~bvadd64(blastFlag, 4294967295bv32) == 0bv32 && 0bv32 == s) - InvariantResult [Line: 1226]: Loop Invariant Derived loop invariant: ((((~bvadd64(blastFlag, 4294967294bv32) == 0bv32 && 0bv32 == s) || (0bv32 == s && ~bvadd64(blastFlag, 4294967292bv32) == 0bv32)) || (~bvadd64(blastFlag, 4294967293bv32) == 0bv32 && 0bv32 == s)) || (blastFlag == 0bv32 && 0bv32 == s)) || (~bvadd64(blastFlag, 4294967295bv32) == 0bv32 && 0bv32 == s) - InvariantResult [Line: 1202]: Loop Invariant Derived loop invariant: ((((~bvadd64(blastFlag, 4294967294bv32) == 0bv32 && 0bv32 == s) || (0bv32 == s && ~bvadd64(blastFlag, 4294967292bv32) == 0bv32)) || (~bvadd64(blastFlag, 4294967293bv32) == 0bv32 && 0bv32 == s)) || (blastFlag == 0bv32 && 0bv32 == s)) || (~bvadd64(blastFlag, 4294967295bv32) == 0bv32 && 0bv32 == s) - InvariantResult [Line: 1148]: Loop Invariant Derived loop invariant: ((((~bvadd64(blastFlag, 4294967294bv32) == 0bv32 && 0bv32 == s) || (0bv32 == s && ~bvadd64(blastFlag, 4294967292bv32) == 0bv32)) || (~bvadd64(blastFlag, 4294967293bv32) == 0bv32 && 0bv32 == s)) || (blastFlag == 0bv32 && 0bv32 == s)) || (~bvadd64(blastFlag, 4294967295bv32) == 0bv32 && 0bv32 == s) - InvariantResult [Line: 1234]: Loop Invariant Derived loop invariant: ((((~bvadd64(blastFlag, 4294967294bv32) == 0bv32 && 0bv32 == s) || (0bv32 == s && ~bvadd64(blastFlag, 4294967292bv32) == 0bv32)) || (~bvadd64(blastFlag, 4294967293bv32) == 0bv32 && 0bv32 == s)) || (blastFlag == 0bv32 && 0bv32 == s)) || (~bvadd64(blastFlag, 4294967295bv32) == 0bv32 && 0bv32 == s) - InvariantResult [Line: 1184]: Loop Invariant Derived loop invariant: ((((~bvadd64(blastFlag, 4294967294bv32) == 0bv32 && 0bv32 == s) || (0bv32 == s && ~bvadd64(blastFlag, 4294967292bv32) == 0bv32)) || (~bvadd64(blastFlag, 4294967293bv32) == 0bv32 && 0bv32 == s)) || (blastFlag == 0bv32 && 0bv32 == s)) || (~bvadd64(blastFlag, 4294967295bv32) == 0bv32 && 0bv32 == s) - InvariantResult [Line: 1076]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1178]: Loop Invariant Derived loop invariant: ((((~bvadd64(blastFlag, 4294967294bv32) == 0bv32 && 0bv32 == s) || (0bv32 == s && ~bvadd64(blastFlag, 4294967292bv32) == 0bv32)) || (~bvadd64(blastFlag, 4294967293bv32) == 0bv32 && 0bv32 == s)) || (blastFlag == 0bv32 && 0bv32 == s)) || (~bvadd64(blastFlag, 4294967295bv32) == 0bv32 && 0bv32 == s) - InvariantResult [Line: 1220]: Loop Invariant Derived loop invariant: ((((~bvadd64(blastFlag, 4294967294bv32) == 0bv32 && 0bv32 == s) || (0bv32 == s && ~bvadd64(blastFlag, 4294967292bv32) == 0bv32)) || (~bvadd64(blastFlag, 4294967293bv32) == 0bv32 && 0bv32 == s)) || (blastFlag == 0bv32 && 0bv32 == s)) || (~bvadd64(blastFlag, 4294967295bv32) == 0bv32 && 0bv32 == s) - InvariantResult [Line: 1166]: Loop Invariant Derived loop invariant: ((((~bvadd64(blastFlag, 4294967294bv32) == 0bv32 && 0bv32 == s) || (0bv32 == s && ~bvadd64(blastFlag, 4294967292bv32) == 0bv32)) || (~bvadd64(blastFlag, 4294967293bv32) == 0bv32 && 0bv32 == s)) || (blastFlag == 0bv32 && 0bv32 == s)) || (~bvadd64(blastFlag, 4294967295bv32) == 0bv32 && 0bv32 == s) - InvariantResult [Line: 1061]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1232]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1208]: Loop Invariant Derived loop invariant: ((((~bvadd64(blastFlag, 4294967294bv32) == 0bv32 && 0bv32 == s) || (0bv32 == s && ~bvadd64(blastFlag, 4294967292bv32) == 0bv32)) || (~bvadd64(blastFlag, 4294967293bv32) == 0bv32 && 0bv32 == s)) || (blastFlag == 0bv32 && 0bv32 == s)) || (~bvadd64(blastFlag, 4294967295bv32) == 0bv32 && 0bv32 == s) - InvariantResult [Line: 1154]: Loop Invariant Derived loop invariant: ((((~bvadd64(blastFlag, 4294967294bv32) == 0bv32 && 0bv32 == s) || (0bv32 == s && ~bvadd64(blastFlag, 4294967292bv32) == 0bv32)) || (~bvadd64(blastFlag, 4294967293bv32) == 0bv32 && 0bv32 == s)) || (blastFlag == 0bv32 && 0bv32 == s)) || (~bvadd64(blastFlag, 4294967295bv32) == 0bv32 && 0bv32 == s) - InvariantResult [Line: 1196]: Loop Invariant Derived loop invariant: ((((~bvadd64(blastFlag, 4294967294bv32) == 0bv32 && 0bv32 == s) || (0bv32 == s && ~bvadd64(blastFlag, 4294967292bv32) == 0bv32)) || (~bvadd64(blastFlag, 4294967293bv32) == 0bv32 && 0bv32 == s)) || (blastFlag == 0bv32 && 0bv32 == s)) || (~bvadd64(blastFlag, 4294967295bv32) == 0bv32 && 0bv32 == s) - InvariantResult [Line: 1099]: Loop Invariant Derived loop invariant: 0bv32 == s && ~bvadd64(blastFlag, 4294967292bv32) == 0bv32 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 131 locations, 1 error locations. SAFE Result, 96.1s OverallTime, 11 OverallIterations, 7 TraceHistogramMax, 68.1s AutomataDifference, 0.0s DeadEndRemovalTime, 2.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 2319 SDtfs, 1936 SDslu, 2353 SDs, 0 SdLazy, 2251 SolverSat, 88 SolverUnsat, 6 SolverUnknown, 0 SolverNotchecked, 64.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 982 GetRequests, 952 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=724occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 942 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 22 PreInvPairs, 207 NumberOfFragments, 718 HoareAnnotationTreeSize, 22 FomulaSimplifications, 45220 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 22 FomulaSimplificationsInter, 1421 FormulaSimplificationTreeSizeReductionInter, 2.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.7s SsaConstructionTime, 7.4s SatisfiabilityAnalysisTime, 16.3s InterpolantComputationTime, 987 NumberOfCodeBlocks, 987 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 976 ConstructedInterpolants, 41 QuantifiedInterpolants, 525005 SizeOfPredicates, 58 NumberOfNonLiveVariables, 3184 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 1124/1124 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...