./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ssh-simplified/s3_srvr_13.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ssh-simplified/s3_srvr_13.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a4ba7a359047c30b647e3fae146392c1b2eaa08f ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-27 22:35:39,776 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 22:35:39,779 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 22:35:39,797 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 22:35:39,797 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 22:35:39,798 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 22:35:39,800 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 22:35:39,802 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 22:35:39,803 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 22:35:39,804 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 22:35:39,806 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 22:35:39,807 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 22:35:39,807 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 22:35:39,808 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 22:35:39,809 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 22:35:39,810 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 22:35:39,811 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 22:35:39,812 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 22:35:39,814 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 22:35:39,816 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 22:35:39,818 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 22:35:39,819 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 22:35:39,820 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 22:35:39,821 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 22:35:39,826 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 22:35:39,826 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 22:35:39,826 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 22:35:39,827 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 22:35:39,828 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 22:35:39,829 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 22:35:39,832 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 22:35:39,833 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 22:35:39,833 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 22:35:39,834 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 22:35:39,835 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 22:35:39,835 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 22:35:39,836 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 22:35:39,836 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 22:35:39,836 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 22:35:39,837 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 22:35:39,838 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 22:35:39,839 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-27 22:35:39,863 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 22:35:39,864 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 22:35:39,866 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 22:35:39,866 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 22:35:39,867 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 22:35:39,867 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 22:35:39,867 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 22:35:39,867 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 22:35:39,868 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 22:35:39,868 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 22:35:39,868 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-27 22:35:39,868 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 22:35:39,868 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-27 22:35:39,869 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 22:35:39,869 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-27 22:35:39,869 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 22:35:39,869 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-27 22:35:39,870 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 22:35:39,871 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 22:35:39,871 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 22:35:39,872 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 22:35:39,872 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 22:35:39,872 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 22:35:39,872 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 22:35:39,873 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-27 22:35:39,873 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-27 22:35:39,873 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-27 22:35:39,873 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-27 22:35:39,874 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a4ba7a359047c30b647e3fae146392c1b2eaa08f [2019-11-27 22:35:40,179 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 22:35:40,198 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 22:35:40,201 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 22:35:40,203 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 22:35:40,203 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 22:35:40,204 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ssh-simplified/s3_srvr_13.cil.c [2019-11-27 22:35:40,265 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b92dd78d/c80b4a5a86144d8fb092c29e559428da/FLAGa2e4daa4a [2019-11-27 22:35:40,770 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 22:35:40,772 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ssh-simplified/s3_srvr_13.cil.c [2019-11-27 22:35:40,788 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b92dd78d/c80b4a5a86144d8fb092c29e559428da/FLAGa2e4daa4a [2019-11-27 22:35:41,045 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b92dd78d/c80b4a5a86144d8fb092c29e559428da [2019-11-27 22:35:41,049 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 22:35:41,051 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-27 22:35:41,052 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 22:35:41,052 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 22:35:41,056 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 22:35:41,057 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:35:41" (1/1) ... [2019-11-27 22:35:41,060 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@772fdc68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:41, skipping insertion in model container [2019-11-27 22:35:41,060 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:35:41" (1/1) ... [2019-11-27 22:35:41,068 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 22:35:41,111 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 22:35:41,400 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:35:41,404 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 22:35:41,555 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:35:41,574 INFO L208 MainTranslator]: Completed translation [2019-11-27 22:35:41,575 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:41 WrapperNode [2019-11-27 22:35:41,575 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 22:35:41,576 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-27 22:35:41,576 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-27 22:35:41,576 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-27 22:35:41,583 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:41" (1/1) ... [2019-11-27 22:35:41,593 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:41" (1/1) ... [2019-11-27 22:35:41,641 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-27 22:35:41,641 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 22:35:41,641 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 22:35:41,641 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 22:35:41,653 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:41" (1/1) ... [2019-11-27 22:35:41,653 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:41" (1/1) ... [2019-11-27 22:35:41,657 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:41" (1/1) ... [2019-11-27 22:35:41,657 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:41" (1/1) ... [2019-11-27 22:35:41,665 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:41" (1/1) ... [2019-11-27 22:35:41,676 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:41" (1/1) ... [2019-11-27 22:35:41,679 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:41" (1/1) ... [2019-11-27 22:35:41,684 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 22:35:41,684 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 22:35:41,685 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 22:35:41,685 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 22:35:41,686 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:41" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 22:35:41,770 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 22:35:41,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 22:35:42,001 WARN L759 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-27 22:35:42,634 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-11-27 22:35:42,634 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-11-27 22:35:42,638 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 22:35:42,638 INFO L297 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-27 22:35:42,640 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:35:42 BoogieIcfgContainer [2019-11-27 22:35:42,640 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 22:35:42,641 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 22:35:42,641 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 22:35:42,644 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 22:35:42,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 10:35:41" (1/3) ... [2019-11-27 22:35:42,645 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f7bc769 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:35:42, skipping insertion in model container [2019-11-27 22:35:42,646 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:41" (2/3) ... [2019-11-27 22:35:42,646 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f7bc769 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:35:42, skipping insertion in model container [2019-11-27 22:35:42,646 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:35:42" (3/3) ... [2019-11-27 22:35:42,648 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_13.cil.c [2019-11-27 22:35:42,657 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 22:35:42,665 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-27 22:35:42,676 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-27 22:35:42,700 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 22:35:42,700 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-27 22:35:42,700 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 22:35:42,701 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 22:35:42,701 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 22:35:42,701 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 22:35:42,701 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 22:35:42,701 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 22:35:42,720 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states. [2019-11-27 22:35:42,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-27 22:35:42,726 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:42,727 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:42,727 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:42,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:42,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1440243157, now seen corresponding path program 1 times [2019-11-27 22:35:42,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:42,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143183015] [2019-11-27 22:35:42,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:42,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:42,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:35:42,936 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143183015] [2019-11-27 22:35:42,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:42,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:42,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664617406] [2019-11-27 22:35:42,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:42,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:42,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:42,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:42,965 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 3 states. [2019-11-27 22:35:43,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:43,381 INFO L93 Difference]: Finished difference Result 324 states and 556 transitions. [2019-11-27 22:35:43,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:43,383 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-27 22:35:43,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:43,398 INFO L225 Difference]: With dead ends: 324 [2019-11-27 22:35:43,398 INFO L226 Difference]: Without dead ends: 159 [2019-11-27 22:35:43,402 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:43,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-27 22:35:43,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 157. [2019-11-27 22:35:43,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-11-27 22:35:43,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 248 transitions. [2019-11-27 22:35:43,454 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 248 transitions. Word has length 25 [2019-11-27 22:35:43,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:43,455 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 248 transitions. [2019-11-27 22:35:43,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:43,455 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 248 transitions. [2019-11-27 22:35:43,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-27 22:35:43,457 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:43,457 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:43,458 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:43,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:43,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1818183234, now seen corresponding path program 1 times [2019-11-27 22:35:43,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:43,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844642601] [2019-11-27 22:35:43,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:43,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:43,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:35:43,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844642601] [2019-11-27 22:35:43,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:43,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:43,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340998898] [2019-11-27 22:35:43,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:43,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:43,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:43,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:43,543 INFO L87 Difference]: Start difference. First operand 157 states and 248 transitions. Second operand 3 states. [2019-11-27 22:35:43,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:43,723 INFO L93 Difference]: Finished difference Result 329 states and 518 transitions. [2019-11-27 22:35:43,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:43,724 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-27 22:35:43,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:43,729 INFO L225 Difference]: With dead ends: 329 [2019-11-27 22:35:43,729 INFO L226 Difference]: Without dead ends: 179 [2019-11-27 22:35:43,734 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:43,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-11-27 22:35:43,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2019-11-27 22:35:43,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-11-27 22:35:43,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 278 transitions. [2019-11-27 22:35:43,767 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 278 transitions. Word has length 26 [2019-11-27 22:35:43,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:43,767 INFO L462 AbstractCegarLoop]: Abstraction has 179 states and 278 transitions. [2019-11-27 22:35:43,767 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:43,767 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 278 transitions. [2019-11-27 22:35:43,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-27 22:35:43,769 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:43,769 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:43,769 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:43,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:43,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1920661961, now seen corresponding path program 1 times [2019-11-27 22:35:43,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:43,770 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933947136] [2019-11-27 22:35:43,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:43,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:43,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:35:43,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933947136] [2019-11-27 22:35:43,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:43,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:43,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593335989] [2019-11-27 22:35:43,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:43,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:43,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:43,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:43,830 INFO L87 Difference]: Start difference. First operand 179 states and 278 transitions. Second operand 3 states. [2019-11-27 22:35:44,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:44,008 INFO L93 Difference]: Finished difference Result 359 states and 559 transitions. [2019-11-27 22:35:44,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:44,011 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-27 22:35:44,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:44,013 INFO L225 Difference]: With dead ends: 359 [2019-11-27 22:35:44,013 INFO L226 Difference]: Without dead ends: 187 [2019-11-27 22:35:44,017 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:44,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-11-27 22:35:44,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 185. [2019-11-27 22:35:44,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-11-27 22:35:44,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 289 transitions. [2019-11-27 22:35:44,045 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 289 transitions. Word has length 26 [2019-11-27 22:35:44,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:44,046 INFO L462 AbstractCegarLoop]: Abstraction has 185 states and 289 transitions. [2019-11-27 22:35:44,046 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:44,046 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 289 transitions. [2019-11-27 22:35:44,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-27 22:35:44,048 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:44,048 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:44,048 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:44,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:44,048 INFO L82 PathProgramCache]: Analyzing trace with hash -304150793, now seen corresponding path program 1 times [2019-11-27 22:35:44,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:44,050 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835719090] [2019-11-27 22:35:44,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:44,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:44,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:35:44,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835719090] [2019-11-27 22:35:44,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:44,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:44,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961472544] [2019-11-27 22:35:44,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:44,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:44,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:44,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:44,115 INFO L87 Difference]: Start difference. First operand 185 states and 289 transitions. Second operand 3 states. [2019-11-27 22:35:44,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:44,276 INFO L93 Difference]: Finished difference Result 364 states and 569 transitions. [2019-11-27 22:35:44,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:44,277 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-27 22:35:44,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:44,279 INFO L225 Difference]: With dead ends: 364 [2019-11-27 22:35:44,279 INFO L226 Difference]: Without dead ends: 186 [2019-11-27 22:35:44,282 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:44,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-11-27 22:35:44,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2019-11-27 22:35:44,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-11-27 22:35:44,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 290 transitions. [2019-11-27 22:35:44,307 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 290 transitions. Word has length 26 [2019-11-27 22:35:44,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:44,307 INFO L462 AbstractCegarLoop]: Abstraction has 186 states and 290 transitions. [2019-11-27 22:35:44,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:44,308 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 290 transitions. [2019-11-27 22:35:44,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-27 22:35:44,312 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:44,312 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:44,313 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:44,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:44,313 INFO L82 PathProgramCache]: Analyzing trace with hash 2065347919, now seen corresponding path program 1 times [2019-11-27 22:35:44,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:44,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188613048] [2019-11-27 22:35:44,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:44,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:44,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:35:44,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188613048] [2019-11-27 22:35:44,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:44,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:44,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239795680] [2019-11-27 22:35:44,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:44,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:44,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:44,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:44,395 INFO L87 Difference]: Start difference. First operand 186 states and 290 transitions. Second operand 3 states. [2019-11-27 22:35:44,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:44,535 INFO L93 Difference]: Finished difference Result 375 states and 581 transitions. [2019-11-27 22:35:44,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:44,535 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-27 22:35:44,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:44,537 INFO L225 Difference]: With dead ends: 375 [2019-11-27 22:35:44,537 INFO L226 Difference]: Without dead ends: 196 [2019-11-27 22:35:44,538 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:44,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-11-27 22:35:44,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 186. [2019-11-27 22:35:44,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-11-27 22:35:44,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 288 transitions. [2019-11-27 22:35:44,552 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 288 transitions. Word has length 27 [2019-11-27 22:35:44,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:44,553 INFO L462 AbstractCegarLoop]: Abstraction has 186 states and 288 transitions. [2019-11-27 22:35:44,553 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:44,553 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 288 transitions. [2019-11-27 22:35:44,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-27 22:35:44,554 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:44,555 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:44,555 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:44,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:44,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1768037659, now seen corresponding path program 1 times [2019-11-27 22:35:44,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:44,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474635800] [2019-11-27 22:35:44,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:44,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:44,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:35:44,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474635800] [2019-11-27 22:35:44,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:44,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:44,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942920630] [2019-11-27 22:35:44,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:44,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:44,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:44,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:44,601 INFO L87 Difference]: Start difference. First operand 186 states and 288 transitions. Second operand 3 states. [2019-11-27 22:35:44,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:44,731 INFO L93 Difference]: Finished difference Result 375 states and 577 transitions. [2019-11-27 22:35:44,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:44,732 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-27 22:35:44,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:44,733 INFO L225 Difference]: With dead ends: 375 [2019-11-27 22:35:44,733 INFO L226 Difference]: Without dead ends: 196 [2019-11-27 22:35:44,734 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:44,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-11-27 22:35:44,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 186. [2019-11-27 22:35:44,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-11-27 22:35:44,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 286 transitions. [2019-11-27 22:35:44,743 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 286 transitions. Word has length 28 [2019-11-27 22:35:44,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:44,743 INFO L462 AbstractCegarLoop]: Abstraction has 186 states and 286 transitions. [2019-11-27 22:35:44,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:44,744 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 286 transitions. [2019-11-27 22:35:44,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-27 22:35:44,745 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:44,745 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:44,745 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:44,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:44,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1213962132, now seen corresponding path program 1 times [2019-11-27 22:35:44,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:44,747 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496764335] [2019-11-27 22:35:44,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:44,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:44,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:35:44,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496764335] [2019-11-27 22:35:44,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:44,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:44,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004083007] [2019-11-27 22:35:44,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:44,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:44,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:44,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:44,781 INFO L87 Difference]: Start difference. First operand 186 states and 286 transitions. Second operand 3 states. [2019-11-27 22:35:44,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:44,911 INFO L93 Difference]: Finished difference Result 375 states and 573 transitions. [2019-11-27 22:35:44,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:44,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-27 22:35:44,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:44,914 INFO L225 Difference]: With dead ends: 375 [2019-11-27 22:35:44,914 INFO L226 Difference]: Without dead ends: 196 [2019-11-27 22:35:44,915 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:44,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-11-27 22:35:44,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 186. [2019-11-27 22:35:44,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-11-27 22:35:44,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 284 transitions. [2019-11-27 22:35:44,924 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 284 transitions. Word has length 29 [2019-11-27 22:35:44,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:44,925 INFO L462 AbstractCegarLoop]: Abstraction has 186 states and 284 transitions. [2019-11-27 22:35:44,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:44,925 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 284 transitions. [2019-11-27 22:35:44,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-27 22:35:44,926 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:44,926 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:44,927 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:44,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:44,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1639645429, now seen corresponding path program 1 times [2019-11-27 22:35:44,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:44,928 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882066569] [2019-11-27 22:35:44,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:44,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:44,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:35:44,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882066569] [2019-11-27 22:35:44,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:44,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:44,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468482433] [2019-11-27 22:35:44,985 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:35:44,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:44,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:35:44,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:35:44,986 INFO L87 Difference]: Start difference. First operand 186 states and 284 transitions. Second operand 4 states. [2019-11-27 22:35:45,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:45,244 INFO L93 Difference]: Finished difference Result 571 states and 870 transitions. [2019-11-27 22:35:45,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 22:35:45,245 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2019-11-27 22:35:45,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:45,249 INFO L225 Difference]: With dead ends: 571 [2019-11-27 22:35:45,249 INFO L226 Difference]: Without dead ends: 392 [2019-11-27 22:35:45,250 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-27 22:35:45,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2019-11-27 22:35:45,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 356. [2019-11-27 22:35:45,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-11-27 22:35:45,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 542 transitions. [2019-11-27 22:35:45,269 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 542 transitions. Word has length 29 [2019-11-27 22:35:45,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:45,270 INFO L462 AbstractCegarLoop]: Abstraction has 356 states and 542 transitions. [2019-11-27 22:35:45,270 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:35:45,270 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 542 transitions. [2019-11-27 22:35:45,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-27 22:35:45,271 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:45,271 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:45,271 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:45,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:45,272 INFO L82 PathProgramCache]: Analyzing trace with hash -356314719, now seen corresponding path program 1 times [2019-11-27 22:35:45,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:45,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391420712] [2019-11-27 22:35:45,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:45,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:45,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:35:45,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391420712] [2019-11-27 22:35:45,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:45,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:45,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747526890] [2019-11-27 22:35:45,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:45,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:45,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:45,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:45,322 INFO L87 Difference]: Start difference. First operand 356 states and 542 transitions. Second operand 3 states. [2019-11-27 22:35:45,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:45,480 INFO L93 Difference]: Finished difference Result 780 states and 1196 transitions. [2019-11-27 22:35:45,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:45,481 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-11-27 22:35:45,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:45,483 INFO L225 Difference]: With dead ends: 780 [2019-11-27 22:35:45,484 INFO L226 Difference]: Without dead ends: 431 [2019-11-27 22:35:45,485 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:45,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2019-11-27 22:35:45,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 411. [2019-11-27 22:35:45,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-11-27 22:35:45,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 629 transitions. [2019-11-27 22:35:45,503 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 629 transitions. Word has length 32 [2019-11-27 22:35:45,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:45,503 INFO L462 AbstractCegarLoop]: Abstraction has 411 states and 629 transitions. [2019-11-27 22:35:45,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:45,504 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 629 transitions. [2019-11-27 22:35:45,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-27 22:35:45,505 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:45,505 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:45,505 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:45,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:45,506 INFO L82 PathProgramCache]: Analyzing trace with hash 863724629, now seen corresponding path program 1 times [2019-11-27 22:35:45,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:45,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34826707] [2019-11-27 22:35:45,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:45,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:45,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:35:45,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34826707] [2019-11-27 22:35:45,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:45,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:45,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783291422] [2019-11-27 22:35:45,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:45,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:45,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:45,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:45,537 INFO L87 Difference]: Start difference. First operand 411 states and 629 transitions. Second operand 3 states. [2019-11-27 22:35:45,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:45,708 INFO L93 Difference]: Finished difference Result 857 states and 1320 transitions. [2019-11-27 22:35:45,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:45,708 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-11-27 22:35:45,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:45,712 INFO L225 Difference]: With dead ends: 857 [2019-11-27 22:35:45,712 INFO L226 Difference]: Without dead ends: 453 [2019-11-27 22:35:45,713 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:45,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2019-11-27 22:35:45,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 433. [2019-11-27 22:35:45,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2019-11-27 22:35:45,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 669 transitions. [2019-11-27 22:35:45,741 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 669 transitions. Word has length 33 [2019-11-27 22:35:45,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:45,743 INFO L462 AbstractCegarLoop]: Abstraction has 433 states and 669 transitions. [2019-11-27 22:35:45,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:45,743 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 669 transitions. [2019-11-27 22:35:45,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-27 22:35:45,744 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:45,744 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:45,745 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:45,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:45,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1579131601, now seen corresponding path program 1 times [2019-11-27 22:35:45,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:45,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716958021] [2019-11-27 22:35:45,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:45,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:45,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:35:45,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716958021] [2019-11-27 22:35:45,790 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:45,790 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:45,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923505605] [2019-11-27 22:35:45,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:45,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:45,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:45,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:45,791 INFO L87 Difference]: Start difference. First operand 433 states and 669 transitions. Second operand 3 states. [2019-11-27 22:35:45,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:45,958 INFO L93 Difference]: Finished difference Result 924 states and 1432 transitions. [2019-11-27 22:35:45,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:45,958 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-27 22:35:45,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:45,962 INFO L225 Difference]: With dead ends: 924 [2019-11-27 22:35:45,962 INFO L226 Difference]: Without dead ends: 498 [2019-11-27 22:35:45,963 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:45,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2019-11-27 22:35:45,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 488. [2019-11-27 22:35:45,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2019-11-27 22:35:45,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 759 transitions. [2019-11-27 22:35:45,984 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 759 transitions. Word has length 39 [2019-11-27 22:35:45,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:45,985 INFO L462 AbstractCegarLoop]: Abstraction has 488 states and 759 transitions. [2019-11-27 22:35:45,985 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:45,985 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 759 transitions. [2019-11-27 22:35:45,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-27 22:35:45,986 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:45,986 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:45,986 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:45,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:45,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1701430936, now seen corresponding path program 1 times [2019-11-27 22:35:45,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:45,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192654032] [2019-11-27 22:35:45,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:46,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:46,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:35:46,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192654032] [2019-11-27 22:35:46,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:46,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:46,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79482473] [2019-11-27 22:35:46,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:46,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:46,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:46,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:46,024 INFO L87 Difference]: Start difference. First operand 488 states and 759 transitions. Second operand 3 states. [2019-11-27 22:35:46,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:46,182 INFO L93 Difference]: Finished difference Result 991 states and 1544 transitions. [2019-11-27 22:35:46,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:46,183 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-11-27 22:35:46,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:46,186 INFO L225 Difference]: With dead ends: 991 [2019-11-27 22:35:46,186 INFO L226 Difference]: Without dead ends: 510 [2019-11-27 22:35:46,187 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:46,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2019-11-27 22:35:46,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 500. [2019-11-27 22:35:46,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-11-27 22:35:46,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 781 transitions. [2019-11-27 22:35:46,209 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 781 transitions. Word has length 40 [2019-11-27 22:35:46,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:46,209 INFO L462 AbstractCegarLoop]: Abstraction has 500 states and 781 transitions. [2019-11-27 22:35:46,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:46,209 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 781 transitions. [2019-11-27 22:35:46,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-27 22:35:46,211 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:46,212 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:46,212 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:46,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:46,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1491732218, now seen corresponding path program 1 times [2019-11-27 22:35:46,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:46,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374042559] [2019-11-27 22:35:46,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:46,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:46,267 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:35:46,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374042559] [2019-11-27 22:35:46,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:46,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:46,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069142232] [2019-11-27 22:35:46,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:46,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:46,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:46,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:46,270 INFO L87 Difference]: Start difference. First operand 500 states and 781 transitions. Second operand 3 states. [2019-11-27 22:35:46,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:46,433 INFO L93 Difference]: Finished difference Result 1007 states and 1574 transitions. [2019-11-27 22:35:46,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:46,433 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-11-27 22:35:46,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:46,438 INFO L225 Difference]: With dead ends: 1007 [2019-11-27 22:35:46,438 INFO L226 Difference]: Without dead ends: 514 [2019-11-27 22:35:46,439 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:46,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2019-11-27 22:35:46,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 500. [2019-11-27 22:35:46,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-11-27 22:35:46,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 777 transitions. [2019-11-27 22:35:46,461 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 777 transitions. Word has length 60 [2019-11-27 22:35:46,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:46,461 INFO L462 AbstractCegarLoop]: Abstraction has 500 states and 777 transitions. [2019-11-27 22:35:46,461 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:46,462 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 777 transitions. [2019-11-27 22:35:46,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-27 22:35:46,464 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:46,465 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:46,465 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:46,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:46,465 INFO L82 PathProgramCache]: Analyzing trace with hash -892846741, now seen corresponding path program 1 times [2019-11-27 22:35:46,466 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:46,469 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586244650] [2019-11-27 22:35:46,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:46,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:46,512 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-27 22:35:46,512 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586244650] [2019-11-27 22:35:46,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:46,512 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:46,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518502769] [2019-11-27 22:35:46,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:46,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:46,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:46,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:46,513 INFO L87 Difference]: Start difference. First operand 500 states and 777 transitions. Second operand 3 states. [2019-11-27 22:35:46,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:46,648 INFO L93 Difference]: Finished difference Result 1035 states and 1604 transitions. [2019-11-27 22:35:46,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:46,648 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-11-27 22:35:46,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:46,651 INFO L225 Difference]: With dead ends: 1035 [2019-11-27 22:35:46,652 INFO L226 Difference]: Without dead ends: 542 [2019-11-27 22:35:46,654 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:46,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2019-11-27 22:35:46,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 532. [2019-11-27 22:35:46,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 532 states. [2019-11-27 22:35:46,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 820 transitions. [2019-11-27 22:35:46,682 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 820 transitions. Word has length 61 [2019-11-27 22:35:46,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:46,683 INFO L462 AbstractCegarLoop]: Abstraction has 532 states and 820 transitions. [2019-11-27 22:35:46,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:46,684 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 820 transitions. [2019-11-27 22:35:46,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-27 22:35:46,686 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:46,686 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:46,687 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:46,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:46,687 INFO L82 PathProgramCache]: Analyzing trace with hash 27094997, now seen corresponding path program 1 times [2019-11-27 22:35:46,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:46,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863493727] [2019-11-27 22:35:46,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:46,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:46,739 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:35:46,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863493727] [2019-11-27 22:35:46,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:46,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:46,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872721391] [2019-11-27 22:35:46,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:46,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:46,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:46,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:46,742 INFO L87 Difference]: Start difference. First operand 532 states and 820 transitions. Second operand 3 states. [2019-11-27 22:35:46,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:46,919 INFO L93 Difference]: Finished difference Result 1095 states and 1685 transitions. [2019-11-27 22:35:46,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:46,920 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-11-27 22:35:46,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:46,923 INFO L225 Difference]: With dead ends: 1095 [2019-11-27 22:35:46,923 INFO L226 Difference]: Without dead ends: 570 [2019-11-27 22:35:46,926 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:46,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2019-11-27 22:35:46,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 570. [2019-11-27 22:35:46,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2019-11-27 22:35:46,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 873 transitions. [2019-11-27 22:35:46,954 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 873 transitions. Word has length 61 [2019-11-27 22:35:46,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:46,955 INFO L462 AbstractCegarLoop]: Abstraction has 570 states and 873 transitions. [2019-11-27 22:35:46,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:46,955 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 873 transitions. [2019-11-27 22:35:46,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-27 22:35:46,957 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:46,957 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:46,957 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:46,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:46,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1141694985, now seen corresponding path program 1 times [2019-11-27 22:35:46,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:46,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006857826] [2019-11-27 22:35:46,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:46,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:47,000 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-27 22:35:47,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006857826] [2019-11-27 22:35:47,003 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:47,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:47,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939728808] [2019-11-27 22:35:47,004 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:47,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:47,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:47,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:47,005 INFO L87 Difference]: Start difference. First operand 570 states and 873 transitions. Second operand 3 states. [2019-11-27 22:35:47,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:47,155 INFO L93 Difference]: Finished difference Result 1143 states and 1749 transitions. [2019-11-27 22:35:47,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:47,156 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-11-27 22:35:47,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:47,159 INFO L225 Difference]: With dead ends: 1143 [2019-11-27 22:35:47,159 INFO L226 Difference]: Without dead ends: 580 [2019-11-27 22:35:47,160 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:47,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2019-11-27 22:35:47,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 570. [2019-11-27 22:35:47,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2019-11-27 22:35:47,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 868 transitions. [2019-11-27 22:35:47,185 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 868 transitions. Word has length 62 [2019-11-27 22:35:47,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:47,186 INFO L462 AbstractCegarLoop]: Abstraction has 570 states and 868 transitions. [2019-11-27 22:35:47,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:47,186 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 868 transitions. [2019-11-27 22:35:47,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-27 22:35:47,187 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:47,188 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:47,188 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:47,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:47,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1688729156, now seen corresponding path program 1 times [2019-11-27 22:35:47,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:47,189 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304490744] [2019-11-27 22:35:47,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:47,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:47,222 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:35:47,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304490744] [2019-11-27 22:35:47,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:47,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:47,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135329761] [2019-11-27 22:35:47,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:47,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:47,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:47,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:47,225 INFO L87 Difference]: Start difference. First operand 570 states and 868 transitions. Second operand 3 states. [2019-11-27 22:35:47,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:47,384 INFO L93 Difference]: Finished difference Result 1180 states and 1793 transitions. [2019-11-27 22:35:47,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:47,385 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-11-27 22:35:47,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:47,388 INFO L225 Difference]: With dead ends: 1180 [2019-11-27 22:35:47,388 INFO L226 Difference]: Without dead ends: 617 [2019-11-27 22:35:47,390 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:47,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-11-27 22:35:47,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 613. [2019-11-27 22:35:47,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2019-11-27 22:35:47,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 929 transitions. [2019-11-27 22:35:47,415 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 929 transitions. Word has length 73 [2019-11-27 22:35:47,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:47,416 INFO L462 AbstractCegarLoop]: Abstraction has 613 states and 929 transitions. [2019-11-27 22:35:47,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:47,416 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 929 transitions. [2019-11-27 22:35:47,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-27 22:35:47,418 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:47,418 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:47,418 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:47,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:47,419 INFO L82 PathProgramCache]: Analyzing trace with hash -628849429, now seen corresponding path program 1 times [2019-11-27 22:35:47,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:47,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628921366] [2019-11-27 22:35:47,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:47,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:47,452 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:35:47,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628921366] [2019-11-27 22:35:47,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:47,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:47,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709222318] [2019-11-27 22:35:47,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:47,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:47,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:47,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:47,459 INFO L87 Difference]: Start difference. First operand 613 states and 929 transitions. Second operand 3 states. [2019-11-27 22:35:47,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:47,620 INFO L93 Difference]: Finished difference Result 1223 states and 1851 transitions. [2019-11-27 22:35:47,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:47,621 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-11-27 22:35:47,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:47,624 INFO L225 Difference]: With dead ends: 1223 [2019-11-27 22:35:47,624 INFO L226 Difference]: Without dead ends: 617 [2019-11-27 22:35:47,625 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:47,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-11-27 22:35:47,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 613. [2019-11-27 22:35:47,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2019-11-27 22:35:47,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 926 transitions. [2019-11-27 22:35:47,651 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 926 transitions. Word has length 74 [2019-11-27 22:35:47,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:47,651 INFO L462 AbstractCegarLoop]: Abstraction has 613 states and 926 transitions. [2019-11-27 22:35:47,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:47,651 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 926 transitions. [2019-11-27 22:35:47,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-27 22:35:47,653 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:47,653 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1] [2019-11-27 22:35:47,654 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:47,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:47,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1361446465, now seen corresponding path program 1 times [2019-11-27 22:35:47,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:47,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476910627] [2019-11-27 22:35:47,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:47,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:47,722 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-27 22:35:47,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476910627] [2019-11-27 22:35:47,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:47,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:47,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833790462] [2019-11-27 22:35:47,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:47,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:47,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:47,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:47,727 INFO L87 Difference]: Start difference. First operand 613 states and 926 transitions. Second operand 3 states. [2019-11-27 22:35:47,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:47,915 INFO L93 Difference]: Finished difference Result 1255 states and 1894 transitions. [2019-11-27 22:35:47,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:47,916 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-11-27 22:35:47,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:47,921 INFO L225 Difference]: With dead ends: 1255 [2019-11-27 22:35:47,921 INFO L226 Difference]: Without dead ends: 649 [2019-11-27 22:35:47,923 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:47,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2019-11-27 22:35:47,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 641. [2019-11-27 22:35:47,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 641 states. [2019-11-27 22:35:47,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 960 transitions. [2019-11-27 22:35:47,961 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 960 transitions. Word has length 83 [2019-11-27 22:35:47,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:47,962 INFO L462 AbstractCegarLoop]: Abstraction has 641 states and 960 transitions. [2019-11-27 22:35:47,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:47,962 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 960 transitions. [2019-11-27 22:35:47,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-27 22:35:47,965 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:47,965 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-11-27 22:35:47,966 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:47,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:47,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1716915501, now seen corresponding path program 1 times [2019-11-27 22:35:47,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:47,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782830298] [2019-11-27 22:35:47,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:47,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:48,021 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-27 22:35:48,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782830298] [2019-11-27 22:35:48,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:48,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:48,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895554212] [2019-11-27 22:35:48,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:48,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:48,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:48,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:48,025 INFO L87 Difference]: Start difference. First operand 641 states and 960 transitions. Second operand 3 states. [2019-11-27 22:35:48,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:48,220 INFO L93 Difference]: Finished difference Result 1283 states and 1921 transitions. [2019-11-27 22:35:48,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:48,221 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-27 22:35:48,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:48,226 INFO L225 Difference]: With dead ends: 1283 [2019-11-27 22:35:48,226 INFO L226 Difference]: Without dead ends: 649 [2019-11-27 22:35:48,229 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:48,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2019-11-27 22:35:48,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 641. [2019-11-27 22:35:48,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 641 states. [2019-11-27 22:35:48,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 953 transitions. [2019-11-27 22:35:48,266 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 953 transitions. Word has length 84 [2019-11-27 22:35:48,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:48,266 INFO L462 AbstractCegarLoop]: Abstraction has 641 states and 953 transitions. [2019-11-27 22:35:48,267 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:48,267 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 953 transitions. [2019-11-27 22:35:48,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-27 22:35:48,268 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:48,269 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-27 22:35:48,269 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:48,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:48,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1450581597, now seen corresponding path program 1 times [2019-11-27 22:35:48,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:48,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905372340] [2019-11-27 22:35:48,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:48,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:48,322 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-27 22:35:48,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905372340] [2019-11-27 22:35:48,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:48,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:48,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619438169] [2019-11-27 22:35:48,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:48,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:48,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:48,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:48,328 INFO L87 Difference]: Start difference. First operand 641 states and 953 transitions. Second operand 3 states. [2019-11-27 22:35:48,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:48,536 INFO L93 Difference]: Finished difference Result 1315 states and 1948 transitions. [2019-11-27 22:35:48,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:48,537 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2019-11-27 22:35:48,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:48,542 INFO L225 Difference]: With dead ends: 1315 [2019-11-27 22:35:48,542 INFO L226 Difference]: Without dead ends: 681 [2019-11-27 22:35:48,547 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:48,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2019-11-27 22:35:48,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 677. [2019-11-27 22:35:48,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 677 states. [2019-11-27 22:35:48,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 997 transitions. [2019-11-27 22:35:48,588 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 997 transitions. Word has length 88 [2019-11-27 22:35:48,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:48,589 INFO L462 AbstractCegarLoop]: Abstraction has 677 states and 997 transitions. [2019-11-27 22:35:48,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:48,589 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 997 transitions. [2019-11-27 22:35:48,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-27 22:35:48,592 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:48,592 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:48,593 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:48,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:48,593 INFO L82 PathProgramCache]: Analyzing trace with hash -398439497, now seen corresponding path program 1 times [2019-11-27 22:35:48,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:48,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924812942] [2019-11-27 22:35:48,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:48,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:48,639 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-27 22:35:48,640 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924812942] [2019-11-27 22:35:48,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:48,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:48,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194455019] [2019-11-27 22:35:48,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:48,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:48,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:48,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:48,643 INFO L87 Difference]: Start difference. First operand 677 states and 997 transitions. Second operand 3 states. [2019-11-27 22:35:48,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:48,852 INFO L93 Difference]: Finished difference Result 1351 states and 1987 transitions. [2019-11-27 22:35:48,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:48,854 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-11-27 22:35:48,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:48,860 INFO L225 Difference]: With dead ends: 1351 [2019-11-27 22:35:48,860 INFO L226 Difference]: Without dead ends: 681 [2019-11-27 22:35:48,863 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:48,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2019-11-27 22:35:48,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 677. [2019-11-27 22:35:48,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 677 states. [2019-11-27 22:35:48,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 992 transitions. [2019-11-27 22:35:48,908 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 992 transitions. Word has length 89 [2019-11-27 22:35:48,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:48,908 INFO L462 AbstractCegarLoop]: Abstraction has 677 states and 992 transitions. [2019-11-27 22:35:48,909 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:48,909 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 992 transitions. [2019-11-27 22:35:48,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-27 22:35:48,912 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:48,913 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:48,913 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:48,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:48,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1868895208, now seen corresponding path program 1 times [2019-11-27 22:35:48,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:48,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588091733] [2019-11-27 22:35:48,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:48,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:48,994 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-27 22:35:48,994 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588091733] [2019-11-27 22:35:48,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:48,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:48,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130280227] [2019-11-27 22:35:48,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:48,999 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:49,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:49,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:49,002 INFO L87 Difference]: Start difference. First operand 677 states and 992 transitions. Second operand 3 states. [2019-11-27 22:35:49,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:49,097 INFO L93 Difference]: Finished difference Result 2003 states and 2928 transitions. [2019-11-27 22:35:49,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:49,098 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-11-27 22:35:49,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:49,108 INFO L225 Difference]: With dead ends: 2003 [2019-11-27 22:35:49,109 INFO L226 Difference]: Without dead ends: 1333 [2019-11-27 22:35:49,111 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:49,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1333 states. [2019-11-27 22:35:49,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1333 to 679. [2019-11-27 22:35:49,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 679 states. [2019-11-27 22:35:49,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 994 transitions. [2019-11-27 22:35:49,177 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 994 transitions. Word has length 100 [2019-11-27 22:35:49,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:49,178 INFO L462 AbstractCegarLoop]: Abstraction has 679 states and 994 transitions. [2019-11-27 22:35:49,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:49,178 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 994 transitions. [2019-11-27 22:35:49,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-27 22:35:49,182 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:49,182 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:49,183 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:49,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:49,184 INFO L82 PathProgramCache]: Analyzing trace with hash 589031530, now seen corresponding path program 1 times [2019-11-27 22:35:49,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:49,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246241765] [2019-11-27 22:35:49,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:49,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:49,312 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-27 22:35:49,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246241765] [2019-11-27 22:35:49,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:49,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:49,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127674209] [2019-11-27 22:35:49,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:49,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:49,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:49,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:49,315 INFO L87 Difference]: Start difference. First operand 679 states and 994 transitions. Second operand 3 states. [2019-11-27 22:35:49,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:49,375 INFO L93 Difference]: Finished difference Result 1362 states and 1992 transitions. [2019-11-27 22:35:49,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:49,375 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-11-27 22:35:49,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:49,380 INFO L225 Difference]: With dead ends: 1362 [2019-11-27 22:35:49,380 INFO L226 Difference]: Without dead ends: 690 [2019-11-27 22:35:49,382 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:49,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2019-11-27 22:35:49,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 677. [2019-11-27 22:35:49,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 677 states. [2019-11-27 22:35:49,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 987 transitions. [2019-11-27 22:35:49,430 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 987 transitions. Word has length 100 [2019-11-27 22:35:49,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:49,431 INFO L462 AbstractCegarLoop]: Abstraction has 677 states and 987 transitions. [2019-11-27 22:35:49,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:49,431 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 987 transitions. [2019-11-27 22:35:49,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-27 22:35:49,434 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:49,434 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:49,434 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:49,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:49,435 INFO L82 PathProgramCache]: Analyzing trace with hash 303396910, now seen corresponding path program 1 times [2019-11-27 22:35:49,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:49,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731958594] [2019-11-27 22:35:49,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:49,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:49,492 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-27 22:35:49,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731958594] [2019-11-27 22:35:49,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:49,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:49,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270773361] [2019-11-27 22:35:49,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:49,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:49,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:49,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:49,494 INFO L87 Difference]: Start difference. First operand 677 states and 987 transitions. Second operand 3 states. [2019-11-27 22:35:49,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:49,583 INFO L93 Difference]: Finished difference Result 2017 states and 2939 transitions. [2019-11-27 22:35:49,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:49,583 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-11-27 22:35:49,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:49,590 INFO L225 Difference]: With dead ends: 2017 [2019-11-27 22:35:49,590 INFO L226 Difference]: Without dead ends: 1347 [2019-11-27 22:35:49,592 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:49,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2019-11-27 22:35:49,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 1345. [2019-11-27 22:35:49,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1345 states. [2019-11-27 22:35:49,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1345 states to 1345 states and 1950 transitions. [2019-11-27 22:35:49,653 INFO L78 Accepts]: Start accepts. Automaton has 1345 states and 1950 transitions. Word has length 101 [2019-11-27 22:35:49,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:49,653 INFO L462 AbstractCegarLoop]: Abstraction has 1345 states and 1950 transitions. [2019-11-27 22:35:49,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:49,653 INFO L276 IsEmpty]: Start isEmpty. Operand 1345 states and 1950 transitions. [2019-11-27 22:35:49,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-27 22:35:49,656 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:49,656 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:49,657 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:49,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:49,657 INFO L82 PathProgramCache]: Analyzing trace with hash -283409104, now seen corresponding path program 1 times [2019-11-27 22:35:49,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:49,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040614652] [2019-11-27 22:35:49,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:49,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-27 22:35:49,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-27 22:35:49,778 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-27 22:35:49,778 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-27 22:35:49,836 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 10:35:49 BoogieIcfgContainer [2019-11-27 22:35:49,836 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-27 22:35:49,837 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-27 22:35:49,837 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-27 22:35:49,837 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-27 22:35:49,838 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:35:42" (3/4) ... [2019-11-27 22:35:49,840 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-27 22:35:49,938 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-27 22:35:49,939 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-27 22:35:49,941 INFO L168 Benchmark]: Toolchain (without parser) took 8889.99 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 318.2 MB). Free memory was 957.7 MB in the beginning and 1.2 GB in the end (delta: -219.6 MB). Peak memory consumption was 98.6 MB. Max. memory is 11.5 GB. [2019-11-27 22:35:49,942 INFO L168 Benchmark]: CDTParser took 0.57 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 22:35:49,942 INFO L168 Benchmark]: CACSL2BoogieTranslator took 523.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -167.3 MB). Peak memory consumption was 27.5 MB. Max. memory is 11.5 GB. [2019-11-27 22:35:49,943 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-27 22:35:49,943 INFO L168 Benchmark]: Boogie Preprocessor took 42.89 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 22:35:49,943 INFO L168 Benchmark]: RCFGBuilder took 955.72 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: 58.7 MB). Peak memory consumption was 58.7 MB. Max. memory is 11.5 GB. [2019-11-27 22:35:49,944 INFO L168 Benchmark]: TraceAbstraction took 7195.46 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 183.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -127.0 MB). Peak memory consumption was 56.0 MB. Max. memory is 11.5 GB. [2019-11-27 22:35:49,944 INFO L168 Benchmark]: Witness Printer took 101.90 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 11.5 GB. [2019-11-27 22:35:49,946 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.57 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 523.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -167.3 MB). Peak memory consumption was 27.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 65.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 42.89 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 955.72 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: 58.7 MB). Peak memory consumption was 58.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7195.46 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 183.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -127.0 MB). Peak memory consumption was 56.0 MB. Max. memory is 11.5 GB. * Witness Printer took 101.90 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 642]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L647] int s ; [L648] int tmp ; [L652] s = 8464 [L11] int s__info_callback = __VERIFIER_nondet_int() ; [L12] int s__in_handshake = __VERIFIER_nondet_int() ; [L13] int s__state ; [L14] int s__new_session ; [L15] int s__server ; [L16] int s__version = __VERIFIER_nondet_int() ; [L17] int s__type ; [L18] int s__init_num ; [L19] int s__hit = __VERIFIER_nondet_int() ; [L20] int s__rwstate ; [L21] int s__init_buf___0 = 1; [L22] int s__debug = __VERIFIER_nondet_int() ; [L23] int s__shutdown ; [L24] int s__cert = __VERIFIER_nondet_int() ; [L25] int s__options = __VERIFIER_nondet_int() ; [L26] int s__verify_mode = __VERIFIER_nondet_int() ; [L27] int s__session__peer = __VERIFIER_nondet_int() ; [L28] int s__cert__pkeys__AT0__privatekey = __VERIFIER_nondet_int() ; [L29] int s__ctx__info_callback = __VERIFIER_nondet_int() ; [L30] int s__ctx__stats__sess_accept_renegotiate = __VERIFIER_nondet_int() ; [L31] int s__ctx__stats__sess_accept = __VERIFIER_nondet_int() ; [L32] int s__ctx__stats__sess_accept_good = __VERIFIER_nondet_int() ; [L33] int s__s3__tmp__cert_request ; [L34] int s__s3__tmp__reuse_message ; [L35] int s__s3__tmp__use_rsa_tmp ; [L36] int s__s3__tmp__new_cipher = __VERIFIER_nondet_int() ; [L37] int s__s3__tmp__new_cipher__algorithms ; [L38] int s__s3__tmp__next_state___0 ; [L39] int s__s3__tmp__new_cipher__algo_strength ; [L40] int s__session__cipher ; [L41] int buf ; [L42] unsigned long l ; [L43] unsigned long Time ; [L44] unsigned long tmp ; [L45] int cb ; [L46] long num1 = __VERIFIER_nondet_long() ; [L47] int ret ; [L48] int new_state ; [L49] int state ; [L50] int skip ; [L51] int got_new_session ; [L52] int tmp___1 = __VERIFIER_nondet_int() ; [L53] int tmp___2 = __VERIFIER_nondet_int() ; [L54] int tmp___3 = __VERIFIER_nondet_int() ; [L55] int tmp___4 = __VERIFIER_nondet_int() ; [L56] int tmp___5 = __VERIFIER_nondet_int() ; [L57] int tmp___6 = __VERIFIER_nondet_int() ; [L58] int tmp___7 = __VERIFIER_nondet_int() ; [L59] long tmp___8 = __VERIFIER_nondet_long() ; [L60] int tmp___9 = __VERIFIER_nondet_int() ; [L61] int tmp___10 = __VERIFIER_nondet_int() ; [L62] int blastFlag ; [L63] int __cil_tmp55 ; [L64] unsigned long __cil_tmp56 ; [L65] unsigned long __cil_tmp57 ; [L66] unsigned long __cil_tmp58 ; [L67] unsigned long __cil_tmp59 ; [L68] int __cil_tmp60 ; [L69] unsigned long __cil_tmp61 ; [L72] s__state = initial_state [L73] blastFlag = 0 [L74] tmp = __VERIFIER_nondet_int() [L75] Time = tmp [L76] cb = 0 [L77] ret = -1 [L78] skip = 0 [L79] got_new_session = 0 [L80] COND TRUE s__info_callback != 0 [L81] cb = s__info_callback [L87] s__in_handshake ++ [L88] COND FALSE !(tmp___1 + 12288) [L93] COND FALSE !(s__cert == 0) [L97] COND TRUE 1 [L99] state = s__state [L100] COND FALSE !(s__state == 12292) [L103] COND FALSE !(s__state == 16384) [L106] COND FALSE !(s__state == 8192) [L109] COND FALSE !(s__state == 24576) [L112] COND FALSE !(s__state == 8195) [L115] COND FALSE !(s__state == 8480) [L118] COND FALSE !(s__state == 8481) [L121] COND FALSE !(s__state == 8482) [L124] COND TRUE s__state == 8464 [L270] s__shutdown = 0 [L271] ret = __VERIFIER_nondet_int() [L272] COND TRUE blastFlag == 0 [L273] blastFlag = 1 [L275] COND FALSE !(ret <= 0) [L278] got_new_session = 1 [L279] s__state = 8496 [L280] s__init_num = 0 [L599] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L600] COND FALSE !(! s__s3__tmp__reuse_message) [L631] skip = 0 [L97] COND TRUE 1 [L99] state = s__state [L100] COND FALSE !(s__state == 12292) [L103] COND FALSE !(s__state == 16384) [L106] COND FALSE !(s__state == 8192) [L109] COND FALSE !(s__state == 24576) [L112] COND FALSE !(s__state == 8195) [L115] COND FALSE !(s__state == 8480) [L118] COND FALSE !(s__state == 8481) [L121] COND FALSE !(s__state == 8482) [L124] COND FALSE !(s__state == 8464) [L127] COND FALSE !(s__state == 8465) [L130] COND FALSE !(s__state == 8466) [L133] COND TRUE s__state == 8496 [L284] ret = __VERIFIER_nondet_int() [L285] COND TRUE blastFlag == 1 [L286] blastFlag = 2 [L288] COND FALSE !(ret <= 0) [L291] COND FALSE !(\read(s__hit)) [L294] s__state = 8512 [L296] s__init_num = 0 [L599] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L600] COND FALSE !(! s__s3__tmp__reuse_message) [L631] skip = 0 [L97] COND TRUE 1 [L99] state = s__state [L100] COND FALSE !(s__state == 12292) [L103] COND FALSE !(s__state == 16384) [L106] COND FALSE !(s__state == 8192) [L109] COND FALSE !(s__state == 24576) [L112] COND FALSE !(s__state == 8195) [L115] COND FALSE !(s__state == 8480) [L118] COND FALSE !(s__state == 8481) [L121] COND FALSE !(s__state == 8482) [L124] COND FALSE !(s__state == 8464) [L127] COND FALSE !(s__state == 8465) [L130] COND FALSE !(s__state == 8466) [L133] COND FALSE !(s__state == 8496) [L136] COND FALSE !(s__state == 8497) [L139] COND TRUE s__state == 8512 [L301] s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() [L302] __cil_tmp56 = (unsigned long )s__s3__tmp__new_cipher__algorithms [L303] COND TRUE __cil_tmp56 + 256UL [L304] skip = 1 [L315] s__state = 8528 [L316] s__init_num = 0 [L599] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L600] COND FALSE !(! s__s3__tmp__reuse_message) [L631] skip = 0 [L97] COND TRUE 1 [L99] state = s__state [L100] COND FALSE !(s__state == 12292) [L103] COND FALSE !(s__state == 16384) [L106] COND FALSE !(s__state == 8192) [L109] COND FALSE !(s__state == 24576) [L112] COND FALSE !(s__state == 8195) [L115] COND FALSE !(s__state == 8480) [L118] COND FALSE !(s__state == 8481) [L121] COND FALSE !(s__state == 8482) [L124] COND FALSE !(s__state == 8464) [L127] COND FALSE !(s__state == 8465) [L130] COND FALSE !(s__state == 8466) [L133] COND FALSE !(s__state == 8496) [L136] COND FALSE !(s__state == 8497) [L139] COND FALSE !(s__state == 8512) [L142] COND FALSE !(s__state == 8513) [L145] COND TRUE s__state == 8528 [L320] s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() [L321] l = (unsigned long )s__s3__tmp__new_cipher__algorithms [L323] __cil_tmp57 = (unsigned long )s__options [L324] COND TRUE __cil_tmp57 + 2097152UL [L325] s__s3__tmp__use_rsa_tmp = 1 [L330] COND TRUE \read(s__s3__tmp__use_rsa_tmp) [L357] ret = __VERIFIER_nondet_int() [L358] COND FALSE !(blastFlag == 6) [L361] COND FALSE !(ret <= 0) [L378] s__state = 8544 [L379] s__init_num = 0 [L599] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L600] COND TRUE ! s__s3__tmp__reuse_message [L601] COND TRUE ! skip [L602] COND TRUE state == 8528 [L603] COND TRUE s__state == 8544 [L604] COND TRUE tmp___7 != 1024 [L605] COND TRUE tmp___7 != 512 [L606] COND TRUE __cil_tmp58 != 4294967294 [L607] COND TRUE l != 4294967266 [L642] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 152 locations, 1 error locations. Result: UNSAFE, OverallTime: 7.0s, OverallIterations: 26, TraceHistogramMax: 4, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4244 SDtfs, 4375 SDslu, 1279 SDs, 0 SdLazy, 2053 SolverSat, 917 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1345occurred in iteration=25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 25 MinimizatonAttempts, 865 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 1497 NumberOfCodeBlocks, 1497 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1371 ConstructedInterpolants, 0 QuantifiedInterpolants, 179497 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 PerfectInterpolantSequences, 646/646 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...