./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ssh-simplified/s3_clnt_3.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c 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_clnt_3.cil-1.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 5377418547a5706dafa6030007433e8164dafce8 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 15:39:58,804 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 15:39:58,806 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 15:39:58,818 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 15:39:58,819 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 15:39:58,820 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 15:39:58,821 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 15:39:58,823 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 15:39:58,825 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 15:39:58,827 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 15:39:58,828 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 15:39:58,829 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 15:39:58,830 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 15:39:58,831 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 15:39:58,832 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 15:39:58,834 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 15:39:58,835 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 15:39:58,836 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 15:39:58,838 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 15:39:58,840 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 15:39:58,842 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 15:39:58,843 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 15:39:58,845 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 15:39:58,846 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 15:39:58,848 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 15:39:58,850 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 15:39:58,850 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 15:39:58,852 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 15:39:58,852 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 15:39:58,853 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 15:39:58,854 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 15:39:58,855 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 15:39:58,855 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 15:39:58,856 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 15:39:58,857 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 15:39:58,858 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 15:39:58,859 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 15:39:58,859 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 15:39:58,859 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 15:39:58,860 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 15:39:58,861 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 15:39:58,862 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 15:39:58,877 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 15:39:58,878 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 15:39:58,879 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 15:39:58,880 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 15:39:58,880 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 15:39:58,880 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 15:39:58,881 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 15:39:58,881 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 15:39:58,881 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 15:39:58,881 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 15:39:58,882 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 15:39:58,882 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 15:39:58,882 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 15:39:58,883 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 15:39:58,883 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 15:39:58,883 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 15:39:58,884 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 15:39:58,884 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 15:39:58,884 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 15:39:58,885 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 15:39:58,885 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 15:39:58,885 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 15:39:58,885 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 15:39:58,886 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 15:39:58,886 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 15:39:58,886 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 15:39:58,887 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 15:39:58,887 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 15:39:58,887 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 15:39:58,887 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 -> 5377418547a5706dafa6030007433e8164dafce8 [2019-11-28 15:39:59,187 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 15:39:59,200 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 15:39:59,203 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 15:39:59,205 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 15:39:59,206 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 15:39:59,206 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ssh-simplified/s3_clnt_3.cil-1.c [2019-11-28 15:39:59,283 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4df51731/e8a216c2c176474fa6e2b4e612b20296/FLAG93c6ac7e2 [2019-11-28 15:39:59,826 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 15:39:59,827 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ssh-simplified/s3_clnt_3.cil-1.c [2019-11-28 15:39:59,844 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4df51731/e8a216c2c176474fa6e2b4e612b20296/FLAG93c6ac7e2 [2019-11-28 15:40:00,154 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4df51731/e8a216c2c176474fa6e2b4e612b20296 [2019-11-28 15:40:00,158 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 15:40:00,160 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 15:40:00,164 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 15:40:00,164 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 15:40:00,168 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 15:40:00,169 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:40:00" (1/1) ... [2019-11-28 15:40:00,173 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@170cd080 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:00, skipping insertion in model container [2019-11-28 15:40:00,173 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:40:00" (1/1) ... [2019-11-28 15:40:00,183 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 15:40:00,249 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 15:40:00,505 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 15:40:00,509 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 15:40:00,640 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 15:40:00,662 INFO L208 MainTranslator]: Completed translation [2019-11-28 15:40:00,662 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:00 WrapperNode [2019-11-28 15:40:00,662 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 15:40:00,663 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 15:40:00,663 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 15:40:00,664 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 15:40:00,672 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:00" (1/1) ... [2019-11-28 15:40:00,681 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:00" (1/1) ... [2019-11-28 15:40:00,734 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 15:40:00,734 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 15:40:00,735 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 15:40:00,735 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 15:40:00,743 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:00" (1/1) ... [2019-11-28 15:40:00,744 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:00" (1/1) ... [2019-11-28 15:40:00,746 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:00" (1/1) ... [2019-11-28 15:40:00,747 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:00" (1/1) ... [2019-11-28 15:40:00,753 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:00" (1/1) ... [2019-11-28 15:40:00,764 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:00" (1/1) ... [2019-11-28 15:40:00,767 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:00" (1/1) ... [2019-11-28 15:40:00,771 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 15:40:00,772 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 15:40:00,772 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 15:40:00,773 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 15:40:00,774 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:00" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 15:40:00,846 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 15:40:00,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 15:40:01,002 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-28 15:40:01,616 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-11-28 15:40:01,616 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-11-28 15:40:01,618 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 15:40:01,618 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-28 15:40:01,620 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:40:01 BoogieIcfgContainer [2019-11-28 15:40:01,620 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 15:40:01,621 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 15:40:01,621 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 15:40:01,625 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 15:40:01,625 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:40:00" (1/3) ... [2019-11-28 15:40:01,626 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25ff725 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:40:01, skipping insertion in model container [2019-11-28 15:40:01,626 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:00" (2/3) ... [2019-11-28 15:40:01,627 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25ff725 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:40:01, skipping insertion in model container [2019-11-28 15:40:01,627 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:40:01" (3/3) ... [2019-11-28 15:40:01,629 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_3.cil-1.c [2019-11-28 15:40:01,640 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 15:40:01,647 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 15:40:01,658 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 15:40:01,683 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 15:40:01,683 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 15:40:01,683 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 15:40:01,684 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 15:40:01,684 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 15:40:01,684 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 15:40:01,684 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 15:40:01,684 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 15:40:01,706 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states. [2019-11-28 15:40:01,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 15:40:01,714 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:01,716 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] [2019-11-28 15:40:01,716 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:01,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:01,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1449578949, now seen corresponding path program 1 times [2019-11-28 15:40:01,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:01,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996964384] [2019-11-28 15:40:01,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:01,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:01,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:01,908 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996964384] [2019-11-28 15:40:01,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:01,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:01,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491710363] [2019-11-28 15:40:01,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:01,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:01,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:01,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:01,937 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 3 states. [2019-11-28 15:40:02,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:02,167 INFO L93 Difference]: Finished difference Result 243 states and 418 transitions. [2019-11-28 15:40:02,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:02,170 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-28 15:40:02,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:02,184 INFO L225 Difference]: With dead ends: 243 [2019-11-28 15:40:02,185 INFO L226 Difference]: Without dead ends: 111 [2019-11-28 15:40:02,189 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-28 15:40:02,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-11-28 15:40:02,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-11-28 15:40:02,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-11-28 15:40:02,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 168 transitions. [2019-11-28 15:40:02,241 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 168 transitions. Word has length 23 [2019-11-28 15:40:02,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:02,241 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 168 transitions. [2019-11-28 15:40:02,242 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:02,242 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 168 transitions. [2019-11-28 15:40:02,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-28 15:40:02,243 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:02,244 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:02,244 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:02,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:02,245 INFO L82 PathProgramCache]: Analyzing trace with hash 800883515, now seen corresponding path program 1 times [2019-11-28 15:40:02,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:02,245 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723535973] [2019-11-28 15:40:02,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:02,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:02,335 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:02,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723535973] [2019-11-28 15:40:02,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:02,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:02,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049845099] [2019-11-28 15:40:02,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:02,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:02,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:02,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:02,341 INFO L87 Difference]: Start difference. First operand 111 states and 168 transitions. Second operand 3 states. [2019-11-28 15:40:02,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:02,525 INFO L93 Difference]: Finished difference Result 231 states and 353 transitions. [2019-11-28 15:40:02,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:02,525 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-11-28 15:40:02,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:02,529 INFO L225 Difference]: With dead ends: 231 [2019-11-28 15:40:02,529 INFO L226 Difference]: Without dead ends: 129 [2019-11-28 15:40:02,532 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-28 15:40:02,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-11-28 15:40:02,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 126. [2019-11-28 15:40:02,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-11-28 15:40:02,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 188 transitions. [2019-11-28 15:40:02,555 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 188 transitions. Word has length 35 [2019-11-28 15:40:02,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:02,556 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 188 transitions. [2019-11-28 15:40:02,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:02,556 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 188 transitions. [2019-11-28 15:40:02,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-28 15:40:02,560 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:02,560 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:02,561 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:02,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:02,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1382730084, now seen corresponding path program 1 times [2019-11-28 15:40:02,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:02,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195948050] [2019-11-28 15:40:02,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:02,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:02,690 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-28 15:40:02,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195948050] [2019-11-28 15:40:02,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:02,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:02,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172137708] [2019-11-28 15:40:02,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:02,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:02,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:02,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:02,698 INFO L87 Difference]: Start difference. First operand 126 states and 188 transitions. Second operand 3 states. [2019-11-28 15:40:02,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:02,866 INFO L93 Difference]: Finished difference Result 265 states and 401 transitions. [2019-11-28 15:40:02,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:02,867 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-11-28 15:40:02,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:02,869 INFO L225 Difference]: With dead ends: 265 [2019-11-28 15:40:02,869 INFO L226 Difference]: Without dead ends: 148 [2019-11-28 15:40:02,871 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-28 15:40:02,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-11-28 15:40:02,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 143. [2019-11-28 15:40:02,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-11-28 15:40:02,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 210 transitions. [2019-11-28 15:40:02,885 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 210 transitions. Word has length 49 [2019-11-28 15:40:02,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:02,886 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 210 transitions. [2019-11-28 15:40:02,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:02,886 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 210 transitions. [2019-11-28 15:40:02,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-28 15:40:02,888 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:02,889 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 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] [2019-11-28 15:40:02,889 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:02,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:02,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1259053610, now seen corresponding path program 1 times [2019-11-28 15:40:02,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:02,890 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463663773] [2019-11-28 15:40:02,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:02,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:03,000 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-28 15:40:03,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463663773] [2019-11-28 15:40:03,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:03,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:03,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268880690] [2019-11-28 15:40:03,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:03,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:03,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:03,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:03,004 INFO L87 Difference]: Start difference. First operand 143 states and 210 transitions. Second operand 3 states. [2019-11-28 15:40:03,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:03,227 INFO L93 Difference]: Finished difference Result 327 states and 495 transitions. [2019-11-28 15:40:03,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:03,228 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-11-28 15:40:03,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:03,230 INFO L225 Difference]: With dead ends: 327 [2019-11-28 15:40:03,230 INFO L226 Difference]: Without dead ends: 192 [2019-11-28 15:40:03,232 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-28 15:40:03,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-11-28 15:40:03,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 184. [2019-11-28 15:40:03,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-11-28 15:40:03,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 260 transitions. [2019-11-28 15:40:03,245 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 260 transitions. Word has length 66 [2019-11-28 15:40:03,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:03,245 INFO L462 AbstractCegarLoop]: Abstraction has 184 states and 260 transitions. [2019-11-28 15:40:03,246 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:03,246 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 260 transitions. [2019-11-28 15:40:03,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-28 15:40:03,250 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:03,250 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 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] [2019-11-28 15:40:03,251 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:03,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:03,251 INFO L82 PathProgramCache]: Analyzing trace with hash -546384724, now seen corresponding path program 1 times [2019-11-28 15:40:03,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:03,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058948594] [2019-11-28 15:40:03,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:03,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:03,336 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-28 15:40:03,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058948594] [2019-11-28 15:40:03,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:03,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:03,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546163553] [2019-11-28 15:40:03,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:03,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:03,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:03,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:03,339 INFO L87 Difference]: Start difference. First operand 184 states and 260 transitions. Second operand 3 states. [2019-11-28 15:40:03,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:03,487 INFO L93 Difference]: Finished difference Result 382 states and 547 transitions. [2019-11-28 15:40:03,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:03,488 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-11-28 15:40:03,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:03,490 INFO L225 Difference]: With dead ends: 382 [2019-11-28 15:40:03,490 INFO L226 Difference]: Without dead ends: 207 [2019-11-28 15:40:03,491 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-28 15:40:03,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-11-28 15:40:03,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 203. [2019-11-28 15:40:03,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-11-28 15:40:03,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 284 transitions. [2019-11-28 15:40:03,507 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 284 transitions. Word has length 66 [2019-11-28 15:40:03,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:03,508 INFO L462 AbstractCegarLoop]: Abstraction has 203 states and 284 transitions. [2019-11-28 15:40:03,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:03,508 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 284 transitions. [2019-11-28 15:40:03,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-28 15:40:03,515 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:03,516 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:03,516 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:03,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:03,517 INFO L82 PathProgramCache]: Analyzing trace with hash 819829122, now seen corresponding path program 1 times [2019-11-28 15:40:03,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:03,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484434855] [2019-11-28 15:40:03,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:03,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:03,625 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-11-28 15:40:03,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484434855] [2019-11-28 15:40:03,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:03,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:03,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928083638] [2019-11-28 15:40:03,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:03,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:03,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:03,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:03,631 INFO L87 Difference]: Start difference. First operand 203 states and 284 transitions. Second operand 3 states. [2019-11-28 15:40:03,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:03,782 INFO L93 Difference]: Finished difference Result 421 states and 597 transitions. [2019-11-28 15:40:03,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:03,782 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-11-28 15:40:03,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:03,785 INFO L225 Difference]: With dead ends: 421 [2019-11-28 15:40:03,785 INFO L226 Difference]: Without dead ends: 227 [2019-11-28 15:40:03,787 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-28 15:40:03,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-11-28 15:40:03,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 224. [2019-11-28 15:40:03,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-11-28 15:40:03,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 310 transitions. [2019-11-28 15:40:03,802 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 310 transitions. Word has length 82 [2019-11-28 15:40:03,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:03,802 INFO L462 AbstractCegarLoop]: Abstraction has 224 states and 310 transitions. [2019-11-28 15:40:03,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:03,803 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 310 transitions. [2019-11-28 15:40:03,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-28 15:40:03,804 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:03,805 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:03,805 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:03,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:03,805 INFO L82 PathProgramCache]: Analyzing trace with hash 426015802, now seen corresponding path program 1 times [2019-11-28 15:40:03,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:03,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828871085] [2019-11-28 15:40:03,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:03,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:03,908 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-28 15:40:03,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828871085] [2019-11-28 15:40:03,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:03,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:03,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232979255] [2019-11-28 15:40:03,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:03,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:03,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:03,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:03,921 INFO L87 Difference]: Start difference. First operand 224 states and 310 transitions. Second operand 3 states. [2019-11-28 15:40:03,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:03,967 INFO L93 Difference]: Finished difference Result 652 states and 903 transitions. [2019-11-28 15:40:03,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:03,969 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-11-28 15:40:03,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:03,973 INFO L225 Difference]: With dead ends: 652 [2019-11-28 15:40:03,974 INFO L226 Difference]: Without dead ends: 437 [2019-11-28 15:40:03,975 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-28 15:40:03,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2019-11-28 15:40:03,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 437. [2019-11-28 15:40:03,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2019-11-28 15:40:04,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 603 transitions. [2019-11-28 15:40:04,001 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 603 transitions. Word has length 102 [2019-11-28 15:40:04,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:04,001 INFO L462 AbstractCegarLoop]: Abstraction has 437 states and 603 transitions. [2019-11-28 15:40:04,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:04,002 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 603 transitions. [2019-11-28 15:40:04,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-28 15:40:04,005 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:04,005 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:04,006 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:04,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:04,006 INFO L82 PathProgramCache]: Analyzing trace with hash -527041180, now seen corresponding path program 1 times [2019-11-28 15:40:04,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:04,007 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758336121] [2019-11-28 15:40:04,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:04,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:04,107 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-11-28 15:40:04,108 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758336121] [2019-11-28 15:40:04,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:04,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:04,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334132162] [2019-11-28 15:40:04,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:04,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:04,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:04,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:04,110 INFO L87 Difference]: Start difference. First operand 437 states and 603 transitions. Second operand 3 states. [2019-11-28 15:40:04,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:04,160 INFO L93 Difference]: Finished difference Result 652 states and 900 transitions. [2019-11-28 15:40:04,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:04,161 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-11-28 15:40:04,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:04,165 INFO L225 Difference]: With dead ends: 652 [2019-11-28 15:40:04,165 INFO L226 Difference]: Without dead ends: 650 [2019-11-28 15:40:04,165 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-28 15:40:04,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2019-11-28 15:40:04,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 650. [2019-11-28 15:40:04,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 650 states. [2019-11-28 15:40:04,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 898 transitions. [2019-11-28 15:40:04,182 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 898 transitions. Word has length 104 [2019-11-28 15:40:04,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:04,183 INFO L462 AbstractCegarLoop]: Abstraction has 650 states and 898 transitions. [2019-11-28 15:40:04,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:04,183 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 898 transitions. [2019-11-28 15:40:04,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-28 15:40:04,185 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:04,186 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:04,186 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:04,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:04,186 INFO L82 PathProgramCache]: Analyzing trace with hash -892474837, now seen corresponding path program 1 times [2019-11-28 15:40:04,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:04,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202533302] [2019-11-28 15:40:04,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:04,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:04,265 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 259 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2019-11-28 15:40:04,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202533302] [2019-11-28 15:40:04,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:04,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:04,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258589656] [2019-11-28 15:40:04,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:04,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:04,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:04,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:04,274 INFO L87 Difference]: Start difference. First operand 650 states and 898 transitions. Second operand 3 states. [2019-11-28 15:40:04,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:04,445 INFO L93 Difference]: Finished difference Result 1441 states and 2047 transitions. [2019-11-28 15:40:04,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:04,446 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-11-28 15:40:04,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:04,451 INFO L225 Difference]: With dead ends: 1441 [2019-11-28 15:40:04,451 INFO L226 Difference]: Without dead ends: 797 [2019-11-28 15:40:04,453 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-28 15:40:04,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2019-11-28 15:40:04,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 767. [2019-11-28 15:40:04,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 767 states. [2019-11-28 15:40:04,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 1087 transitions. [2019-11-28 15:40:04,476 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 1087 transitions. Word has length 158 [2019-11-28 15:40:04,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:04,477 INFO L462 AbstractCegarLoop]: Abstraction has 767 states and 1087 transitions. [2019-11-28 15:40:04,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:04,477 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 1087 transitions. [2019-11-28 15:40:04,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-11-28 15:40:04,480 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:04,481 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 9, 9, 9, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:04,481 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:04,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:04,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1787424402, now seen corresponding path program 1 times [2019-11-28 15:40:04,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:04,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196216705] [2019-11-28 15:40:04,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:04,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:04,557 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 325 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2019-11-28 15:40:04,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196216705] [2019-11-28 15:40:04,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:04,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:04,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135753003] [2019-11-28 15:40:04,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:04,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:04,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:04,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:04,561 INFO L87 Difference]: Start difference. First operand 767 states and 1087 transitions. Second operand 3 states. [2019-11-28 15:40:04,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:04,784 INFO L93 Difference]: Finished difference Result 1803 states and 2628 transitions. [2019-11-28 15:40:04,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:04,785 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 184 [2019-11-28 15:40:04,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:04,791 INFO L225 Difference]: With dead ends: 1803 [2019-11-28 15:40:04,792 INFO L226 Difference]: Without dead ends: 994 [2019-11-28 15:40:04,794 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-28 15:40:04,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2019-11-28 15:40:04,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 956. [2019-11-28 15:40:04,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 956 states. [2019-11-28 15:40:04,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 956 states and 1339 transitions. [2019-11-28 15:40:04,840 INFO L78 Accepts]: Start accepts. Automaton has 956 states and 1339 transitions. Word has length 184 [2019-11-28 15:40:04,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:04,841 INFO L462 AbstractCegarLoop]: Abstraction has 956 states and 1339 transitions. [2019-11-28 15:40:04,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:04,841 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 1339 transitions. [2019-11-28 15:40:04,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-11-28 15:40:04,847 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:04,847 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 10, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:04,847 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:04,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:04,848 INFO L82 PathProgramCache]: Analyzing trace with hash 78119093, now seen corresponding path program 1 times [2019-11-28 15:40:04,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:04,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723665744] [2019-11-28 15:40:04,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:04,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:04,956 INFO L134 CoverageAnalysis]: Checked inductivity of 657 backedges. 402 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2019-11-28 15:40:04,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723665744] [2019-11-28 15:40:04,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:04,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:04,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978150598] [2019-11-28 15:40:04,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:04,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:04,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:04,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:04,960 INFO L87 Difference]: Start difference. First operand 956 states and 1339 transitions. Second operand 3 states. [2019-11-28 15:40:05,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:05,189 INFO L93 Difference]: Finished difference Result 2059 states and 2905 transitions. [2019-11-28 15:40:05,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:05,190 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 205 [2019-11-28 15:40:05,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:05,197 INFO L225 Difference]: With dead ends: 2059 [2019-11-28 15:40:05,197 INFO L226 Difference]: Without dead ends: 1067 [2019-11-28 15:40:05,199 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-28 15:40:05,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states. [2019-11-28 15:40:05,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 1031. [2019-11-28 15:40:05,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1031 states. [2019-11-28 15:40:05,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 1031 states and 1435 transitions. [2019-11-28 15:40:05,231 INFO L78 Accepts]: Start accepts. Automaton has 1031 states and 1435 transitions. Word has length 205 [2019-11-28 15:40:05,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:05,231 INFO L462 AbstractCegarLoop]: Abstraction has 1031 states and 1435 transitions. [2019-11-28 15:40:05,231 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:05,231 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 1435 transitions. [2019-11-28 15:40:05,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-11-28 15:40:05,237 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:05,237 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 11, 11, 11, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 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-28 15:40:05,237 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:05,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:05,238 INFO L82 PathProgramCache]: Analyzing trace with hash 2106820770, now seen corresponding path program 1 times [2019-11-28 15:40:05,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:05,240 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674640763] [2019-11-28 15:40:05,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:05,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:05,352 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 477 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2019-11-28 15:40:05,353 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674640763] [2019-11-28 15:40:05,353 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:05,353 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:05,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415024729] [2019-11-28 15:40:05,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:05,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:05,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:05,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:05,355 INFO L87 Difference]: Start difference. First operand 1031 states and 1435 transitions. Second operand 3 states. [2019-11-28 15:40:05,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:05,544 INFO L93 Difference]: Finished difference Result 2209 states and 3094 transitions. [2019-11-28 15:40:05,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:05,545 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 229 [2019-11-28 15:40:05,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:05,552 INFO L225 Difference]: With dead ends: 2209 [2019-11-28 15:40:05,552 INFO L226 Difference]: Without dead ends: 1148 [2019-11-28 15:40:05,554 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-28 15:40:05,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1148 states. [2019-11-28 15:40:05,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1148 to 1115. [2019-11-28 15:40:05,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1115 states. [2019-11-28 15:40:05,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 1546 transitions. [2019-11-28 15:40:05,605 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 1546 transitions. Word has length 229 [2019-11-28 15:40:05,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:05,606 INFO L462 AbstractCegarLoop]: Abstraction has 1115 states and 1546 transitions. [2019-11-28 15:40:05,606 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:05,606 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1546 transitions. [2019-11-28 15:40:05,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-11-28 15:40:05,612 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:05,612 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 11, 11, 11, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 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-28 15:40:05,612 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:05,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:05,613 INFO L82 PathProgramCache]: Analyzing trace with hash 73426724, now seen corresponding path program 1 times [2019-11-28 15:40:05,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:05,613 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694359622] [2019-11-28 15:40:05,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:05,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:05,705 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 477 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2019-11-28 15:40:05,705 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694359622] [2019-11-28 15:40:05,705 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:05,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:05,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329507025] [2019-11-28 15:40:05,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:05,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:05,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:05,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:05,708 INFO L87 Difference]: Start difference. First operand 1115 states and 1546 transitions. Second operand 3 states. [2019-11-28 15:40:05,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:05,886 INFO L93 Difference]: Finished difference Result 2377 states and 3319 transitions. [2019-11-28 15:40:05,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:05,887 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 229 [2019-11-28 15:40:05,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:05,894 INFO L225 Difference]: With dead ends: 2377 [2019-11-28 15:40:05,894 INFO L226 Difference]: Without dead ends: 1244 [2019-11-28 15:40:05,897 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-28 15:40:05,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1244 states. [2019-11-28 15:40:05,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1244 to 1208. [2019-11-28 15:40:05,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1208 states. [2019-11-28 15:40:05,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1208 states to 1208 states and 1678 transitions. [2019-11-28 15:40:05,935 INFO L78 Accepts]: Start accepts. Automaton has 1208 states and 1678 transitions. Word has length 229 [2019-11-28 15:40:05,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:05,935 INFO L462 AbstractCegarLoop]: Abstraction has 1208 states and 1678 transitions. [2019-11-28 15:40:05,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:05,936 INFO L276 IsEmpty]: Start isEmpty. Operand 1208 states and 1678 transitions. [2019-11-28 15:40:05,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-11-28 15:40:05,941 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:05,941 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 12, 12, 12, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:05,941 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:05,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:05,942 INFO L82 PathProgramCache]: Analyzing trace with hash 837799332, now seen corresponding path program 1 times [2019-11-28 15:40:05,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:05,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830943706] [2019-11-28 15:40:05,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:05,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:06,054 INFO L134 CoverageAnalysis]: Checked inductivity of 973 backedges. 552 proven. 0 refuted. 0 times theorem prover too weak. 421 trivial. 0 not checked. [2019-11-28 15:40:06,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830943706] [2019-11-28 15:40:06,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:06,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:06,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531631786] [2019-11-28 15:40:06,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:06,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:06,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:06,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:06,057 INFO L87 Difference]: Start difference. First operand 1208 states and 1678 transitions. Second operand 3 states. [2019-11-28 15:40:06,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:06,250 INFO L93 Difference]: Finished difference Result 2560 states and 3577 transitions. [2019-11-28 15:40:06,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:06,251 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 259 [2019-11-28 15:40:06,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:06,259 INFO L225 Difference]: With dead ends: 2560 [2019-11-28 15:40:06,259 INFO L226 Difference]: Without dead ends: 1346 [2019-11-28 15:40:06,263 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-28 15:40:06,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1346 states. [2019-11-28 15:40:06,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1346 to 1313. [2019-11-28 15:40:06,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1313 states. [2019-11-28 15:40:06,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1313 states to 1313 states and 1834 transitions. [2019-11-28 15:40:06,301 INFO L78 Accepts]: Start accepts. Automaton has 1313 states and 1834 transitions. Word has length 259 [2019-11-28 15:40:06,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:06,302 INFO L462 AbstractCegarLoop]: Abstraction has 1313 states and 1834 transitions. [2019-11-28 15:40:06,302 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:06,302 INFO L276 IsEmpty]: Start isEmpty. Operand 1313 states and 1834 transitions. [2019-11-28 15:40:06,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2019-11-28 15:40:06,310 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:06,310 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 13, 13, 13, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 15:40:06,311 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:06,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:06,312 INFO L82 PathProgramCache]: Analyzing trace with hash 298818312, now seen corresponding path program 1 times [2019-11-28 15:40:06,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:06,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975502977] [2019-11-28 15:40:06,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:06,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:06,428 INFO L134 CoverageAnalysis]: Checked inductivity of 1167 backedges. 627 proven. 0 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2019-11-28 15:40:06,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975502977] [2019-11-28 15:40:06,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:06,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:06,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859963184] [2019-11-28 15:40:06,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:06,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:06,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:06,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:06,431 INFO L87 Difference]: Start difference. First operand 1313 states and 1834 transitions. Second operand 3 states. [2019-11-28 15:40:06,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:06,613 INFO L93 Difference]: Finished difference Result 2656 states and 3703 transitions. [2019-11-28 15:40:06,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:06,613 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 294 [2019-11-28 15:40:06,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:06,621 INFO L225 Difference]: With dead ends: 2656 [2019-11-28 15:40:06,622 INFO L226 Difference]: Without dead ends: 1343 [2019-11-28 15:40:06,626 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-28 15:40:06,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1343 states. [2019-11-28 15:40:06,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1343 to 1310. [2019-11-28 15:40:06,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1310 states. [2019-11-28 15:40:06,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1310 states to 1310 states and 1816 transitions. [2019-11-28 15:40:06,672 INFO L78 Accepts]: Start accepts. Automaton has 1310 states and 1816 transitions. Word has length 294 [2019-11-28 15:40:06,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:06,672 INFO L462 AbstractCegarLoop]: Abstraction has 1310 states and 1816 transitions. [2019-11-28 15:40:06,673 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:06,673 INFO L276 IsEmpty]: Start isEmpty. Operand 1310 states and 1816 transitions. [2019-11-28 15:40:06,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2019-11-28 15:40:06,680 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:06,680 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 13, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:06,681 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:06,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:06,681 INFO L82 PathProgramCache]: Analyzing trace with hash 430194802, now seen corresponding path program 1 times [2019-11-28 15:40:06,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:06,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952699591] [2019-11-28 15:40:06,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:06,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:06,874 INFO L134 CoverageAnalysis]: Checked inductivity of 1174 backedges. 561 proven. 0 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2019-11-28 15:40:06,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952699591] [2019-11-28 15:40:06,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:06,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:06,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418646553] [2019-11-28 15:40:06,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:06,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:06,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:06,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:06,878 INFO L87 Difference]: Start difference. First operand 1310 states and 1816 transitions. Second operand 3 states. [2019-11-28 15:40:07,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:07,034 INFO L93 Difference]: Finished difference Result 2638 states and 3652 transitions. [2019-11-28 15:40:07,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:07,035 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 304 [2019-11-28 15:40:07,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:07,043 INFO L225 Difference]: With dead ends: 2638 [2019-11-28 15:40:07,044 INFO L226 Difference]: Without dead ends: 1337 [2019-11-28 15:40:07,046 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-28 15:40:07,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1337 states. [2019-11-28 15:40:07,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1337 to 1310. [2019-11-28 15:40:07,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1310 states. [2019-11-28 15:40:07,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1310 states to 1310 states and 1789 transitions. [2019-11-28 15:40:07,083 INFO L78 Accepts]: Start accepts. Automaton has 1310 states and 1789 transitions. Word has length 304 [2019-11-28 15:40:07,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:07,084 INFO L462 AbstractCegarLoop]: Abstraction has 1310 states and 1789 transitions. [2019-11-28 15:40:07,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:07,084 INFO L276 IsEmpty]: Start isEmpty. Operand 1310 states and 1789 transitions. [2019-11-28 15:40:07,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2019-11-28 15:40:07,092 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:07,092 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 14, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 15:40:07,092 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:07,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:07,093 INFO L82 PathProgramCache]: Analyzing trace with hash 863432469, now seen corresponding path program 1 times [2019-11-28 15:40:07,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:07,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98317969] [2019-11-28 15:40:07,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:07,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:07,215 INFO L134 CoverageAnalysis]: Checked inductivity of 1418 backedges. 729 proven. 0 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-11-28 15:40:07,215 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98317969] [2019-11-28 15:40:07,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:07,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:07,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164699893] [2019-11-28 15:40:07,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:07,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:07,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:07,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:07,217 INFO L87 Difference]: Start difference. First operand 1310 states and 1789 transitions. Second operand 3 states. [2019-11-28 15:40:07,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:07,430 INFO L93 Difference]: Finished difference Result 2761 states and 3742 transitions. [2019-11-28 15:40:07,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:07,431 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 331 [2019-11-28 15:40:07,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:07,441 INFO L225 Difference]: With dead ends: 2761 [2019-11-28 15:40:07,441 INFO L226 Difference]: Without dead ends: 1460 [2019-11-28 15:40:07,445 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-28 15:40:07,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1460 states. [2019-11-28 15:40:07,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1460 to 1355. [2019-11-28 15:40:07,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1355 states. [2019-11-28 15:40:07,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1355 states to 1355 states and 1849 transitions. [2019-11-28 15:40:07,498 INFO L78 Accepts]: Start accepts. Automaton has 1355 states and 1849 transitions. Word has length 331 [2019-11-28 15:40:07,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:07,499 INFO L462 AbstractCegarLoop]: Abstraction has 1355 states and 1849 transitions. [2019-11-28 15:40:07,499 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:07,499 INFO L276 IsEmpty]: Start isEmpty. Operand 1355 states and 1849 transitions. [2019-11-28 15:40:07,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-11-28 15:40:07,509 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:07,509 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 14, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 15:40:07,509 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:07,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:07,510 INFO L82 PathProgramCache]: Analyzing trace with hash 762439870, now seen corresponding path program 1 times [2019-11-28 15:40:07,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:07,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781988580] [2019-11-28 15:40:07,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:07,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:07,696 INFO L134 CoverageAnalysis]: Checked inductivity of 1418 backedges. 869 proven. 0 refuted. 0 times theorem prover too weak. 549 trivial. 0 not checked. [2019-11-28 15:40:07,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781988580] [2019-11-28 15:40:07,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:07,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:07,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875586305] [2019-11-28 15:40:07,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:07,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:07,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:07,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:07,698 INFO L87 Difference]: Start difference. First operand 1355 states and 1849 transitions. Second operand 3 states. [2019-11-28 15:40:07,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:07,786 INFO L93 Difference]: Finished difference Result 3852 states and 5281 transitions. [2019-11-28 15:40:07,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:07,786 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 332 [2019-11-28 15:40:07,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:07,799 INFO L225 Difference]: With dead ends: 3852 [2019-11-28 15:40:07,799 INFO L226 Difference]: Without dead ends: 2506 [2019-11-28 15:40:07,801 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-28 15:40:07,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2506 states. [2019-11-28 15:40:07,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2506 to 2504. [2019-11-28 15:40:07,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2504 states. [2019-11-28 15:40:07,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2504 states to 2504 states and 3435 transitions. [2019-11-28 15:40:07,876 INFO L78 Accepts]: Start accepts. Automaton has 2504 states and 3435 transitions. Word has length 332 [2019-11-28 15:40:07,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:07,876 INFO L462 AbstractCegarLoop]: Abstraction has 2504 states and 3435 transitions. [2019-11-28 15:40:07,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:07,877 INFO L276 IsEmpty]: Start isEmpty. Operand 2504 states and 3435 transitions. [2019-11-28 15:40:07,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2019-11-28 15:40:07,886 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:07,886 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 14, 14, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:07,886 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:07,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:07,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1156712834, now seen corresponding path program 1 times [2019-11-28 15:40:07,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:07,889 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267887384] [2019-11-28 15:40:07,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:07,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:08,031 INFO L134 CoverageAnalysis]: Checked inductivity of 1415 backedges. 790 proven. 12 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2019-11-28 15:40:08,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267887384] [2019-11-28 15:40:08,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1174179656] [2019-11-28 15:40:08,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:40:08,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:08,147 INFO L264 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 15:40:08,163 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:40:08,388 INFO L134 CoverageAnalysis]: Checked inductivity of 1415 backedges. 728 proven. 0 refuted. 0 times theorem prover too weak. 687 trivial. 0 not checked. [2019-11-28 15:40:08,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 15:40:08,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-28 15:40:08,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001765900] [2019-11-28 15:40:08,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:08,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:08,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:08,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 15:40:08,390 INFO L87 Difference]: Start difference. First operand 2504 states and 3435 transitions. Second operand 3 states. [2019-11-28 15:40:08,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:08,482 INFO L93 Difference]: Finished difference Result 5826 states and 7988 transitions. [2019-11-28 15:40:08,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:08,483 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 342 [2019-11-28 15:40:08,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:08,499 INFO L225 Difference]: With dead ends: 5826 [2019-11-28 15:40:08,500 INFO L226 Difference]: Without dead ends: 3331 [2019-11-28 15:40:08,505 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 15:40:08,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3331 states. [2019-11-28 15:40:08,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3331 to 3331. [2019-11-28 15:40:08,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3331 states. [2019-11-28 15:40:08,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3331 states to 3331 states and 4560 transitions. [2019-11-28 15:40:08,652 INFO L78 Accepts]: Start accepts. Automaton has 3331 states and 4560 transitions. Word has length 342 [2019-11-28 15:40:08,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:08,653 INFO L462 AbstractCegarLoop]: Abstraction has 3331 states and 4560 transitions. [2019-11-28 15:40:08,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:08,654 INFO L276 IsEmpty]: Start isEmpty. Operand 3331 states and 4560 transitions. [2019-11-28 15:40:08,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2019-11-28 15:40:08,674 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:08,675 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 14, 14, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:08,882 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:40:08,883 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:08,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:08,884 INFO L82 PathProgramCache]: Analyzing trace with hash 938688742, now seen corresponding path program 1 times [2019-11-28 15:40:08,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:08,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977270724] [2019-11-28 15:40:08,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:08,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:09,295 INFO L134 CoverageAnalysis]: Checked inductivity of 1417 backedges. 792 proven. 12 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2019-11-28 15:40:09,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977270724] [2019-11-28 15:40:09,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [738579685] [2019-11-28 15:40:09,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:40:09,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:09,419 INFO L264 TraceCheckSpWp]: Trace formula consists of 562 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 15:40:09,440 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:40:09,547 INFO L134 CoverageAnalysis]: Checked inductivity of 1417 backedges. 792 proven. 12 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2019-11-28 15:40:09,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 15:40:09,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-28 15:40:09,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303681729] [2019-11-28 15:40:09,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 15:40:09,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:09,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 15:40:09,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:40:09,551 INFO L87 Difference]: Start difference. First operand 3331 states and 4560 transitions. Second operand 4 states. [2019-11-28 15:40:09,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:09,984 INFO L93 Difference]: Finished difference Result 6603 states and 9028 transitions. [2019-11-28 15:40:09,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 15:40:09,985 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 344 [2019-11-28 15:40:09,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:10,008 INFO L225 Difference]: With dead ends: 6603 [2019-11-28 15:40:10,010 INFO L226 Difference]: Without dead ends: 4983 [2019-11-28 15:40:10,015 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 346 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 15:40:10,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4983 states. [2019-11-28 15:40:10,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4983 to 3683. [2019-11-28 15:40:10,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3683 states. [2019-11-28 15:40:10,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3683 states to 3683 states and 4980 transitions. [2019-11-28 15:40:10,155 INFO L78 Accepts]: Start accepts. Automaton has 3683 states and 4980 transitions. Word has length 344 [2019-11-28 15:40:10,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:10,156 INFO L462 AbstractCegarLoop]: Abstraction has 3683 states and 4980 transitions. [2019-11-28 15:40:10,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 15:40:10,156 INFO L276 IsEmpty]: Start isEmpty. Operand 3683 states and 4980 transitions. [2019-11-28 15:40:10,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2019-11-28 15:40:10,171 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:10,172 INFO L410 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 15:40:10,377 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:40:10,378 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:10,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:10,378 INFO L82 PathProgramCache]: Analyzing trace with hash 741254605, now seen corresponding path program 1 times [2019-11-28 15:40:10,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:10,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329106855] [2019-11-28 15:40:10,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:10,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:10,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-11-28 15:40:10,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329106855] [2019-11-28 15:40:10,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1810981669] [2019-11-28 15:40:10,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:40:10,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:10,643 INFO L264 TraceCheckSpWp]: Trace formula consists of 618 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 15:40:10,647 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:40:10,762 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-11-28 15:40:10,763 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 15:40:10,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-28 15:40:10,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464182267] [2019-11-28 15:40:10,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 15:40:10,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:10,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 15:40:10,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:40:10,766 INFO L87 Difference]: Start difference. First operand 3683 states and 4980 transitions. Second operand 4 states. [2019-11-28 15:40:11,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:11,134 INFO L93 Difference]: Finished difference Result 8481 states and 11469 transitions. [2019-11-28 15:40:11,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 15:40:11,135 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 370 [2019-11-28 15:40:11,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:11,170 INFO L225 Difference]: With dead ends: 8481 [2019-11-28 15:40:11,171 INFO L226 Difference]: Without dead ends: 4798 [2019-11-28 15:40:11,177 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 372 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 15:40:11,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4798 states. [2019-11-28 15:40:11,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4798 to 3841. [2019-11-28 15:40:11,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3841 states. [2019-11-28 15:40:11,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3841 states to 3841 states and 5140 transitions. [2019-11-28 15:40:11,295 INFO L78 Accepts]: Start accepts. Automaton has 3841 states and 5140 transitions. Word has length 370 [2019-11-28 15:40:11,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:11,295 INFO L462 AbstractCegarLoop]: Abstraction has 3841 states and 5140 transitions. [2019-11-28 15:40:11,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 15:40:11,296 INFO L276 IsEmpty]: Start isEmpty. Operand 3841 states and 5140 transitions. [2019-11-28 15:40:11,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2019-11-28 15:40:11,307 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:11,307 INFO L410 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 16, 16, 16, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 15:40:11,511 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:40:11,511 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:11,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:11,512 INFO L82 PathProgramCache]: Analyzing trace with hash 232077189, now seen corresponding path program 1 times [2019-11-28 15:40:11,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:11,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388939019] [2019-11-28 15:40:11,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:11,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:11,674 INFO L134 CoverageAnalysis]: Checked inductivity of 1970 backedges. 885 proven. 0 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2019-11-28 15:40:11,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388939019] [2019-11-28 15:40:11,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:11,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:11,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979475048] [2019-11-28 15:40:11,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:11,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:11,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:11,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:11,681 INFO L87 Difference]: Start difference. First operand 3841 states and 5140 transitions. Second operand 3 states. [2019-11-28 15:40:11,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:11,883 INFO L93 Difference]: Finished difference Result 7373 states and 9714 transitions. [2019-11-28 15:40:11,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:11,884 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 409 [2019-11-28 15:40:11,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:11,890 INFO L225 Difference]: With dead ends: 7373 [2019-11-28 15:40:11,891 INFO L226 Difference]: Without dead ends: 1985 [2019-11-28 15:40:11,898 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-28 15:40:11,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1985 states. [2019-11-28 15:40:11,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1985 to 1893. [2019-11-28 15:40:11,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1893 states. [2019-11-28 15:40:11,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1893 states to 1893 states and 2533 transitions. [2019-11-28 15:40:11,941 INFO L78 Accepts]: Start accepts. Automaton has 1893 states and 2533 transitions. Word has length 409 [2019-11-28 15:40:11,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:11,942 INFO L462 AbstractCegarLoop]: Abstraction has 1893 states and 2533 transitions. [2019-11-28 15:40:11,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:11,942 INFO L276 IsEmpty]: Start isEmpty. Operand 1893 states and 2533 transitions. [2019-11-28 15:40:11,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 494 [2019-11-28 15:40:11,953 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:11,954 INFO L410 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 17, 17, 17, 16, 16, 14, 14, 13, 13, 12, 12, 10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:11,954 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:11,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:11,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1256651121, now seen corresponding path program 1 times [2019-11-28 15:40:11,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:11,955 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155727492] [2019-11-28 15:40:11,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:11,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:12,240 INFO L134 CoverageAnalysis]: Checked inductivity of 2606 backedges. 1545 proven. 14 refuted. 0 times theorem prover too weak. 1047 trivial. 0 not checked. [2019-11-28 15:40:12,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155727492] [2019-11-28 15:40:12,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1020897828] [2019-11-28 15:40:12,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:40:12,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:12,375 INFO L264 TraceCheckSpWp]: Trace formula consists of 739 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 15:40:12,381 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:40:12,553 INFO L134 CoverageAnalysis]: Checked inductivity of 2606 backedges. 268 proven. 0 refuted. 0 times theorem prover too weak. 2338 trivial. 0 not checked. [2019-11-28 15:40:12,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 15:40:12,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-28 15:40:12,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477900063] [2019-11-28 15:40:12,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:12,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:12,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:12,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 15:40:12,556 INFO L87 Difference]: Start difference. First operand 1893 states and 2533 transitions. Second operand 3 states. [2019-11-28 15:40:12,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:12,729 INFO L93 Difference]: Finished difference Result 3956 states and 5317 transitions. [2019-11-28 15:40:12,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:12,730 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 493 [2019-11-28 15:40:12,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:12,734 INFO L225 Difference]: With dead ends: 3956 [2019-11-28 15:40:12,734 INFO L226 Difference]: Without dead ends: 1991 [2019-11-28 15:40:12,737 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 496 GetRequests, 493 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 15:40:12,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1991 states. [2019-11-28 15:40:12,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1991 to 1987. [2019-11-28 15:40:12,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1987 states. [2019-11-28 15:40:12,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1987 states to 1987 states and 2576 transitions. [2019-11-28 15:40:12,779 INFO L78 Accepts]: Start accepts. Automaton has 1987 states and 2576 transitions. Word has length 493 [2019-11-28 15:40:12,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:12,780 INFO L462 AbstractCegarLoop]: Abstraction has 1987 states and 2576 transitions. [2019-11-28 15:40:12,780 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:12,780 INFO L276 IsEmpty]: Start isEmpty. Operand 1987 states and 2576 transitions. [2019-11-28 15:40:12,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 494 [2019-11-28 15:40:12,790 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:12,790 INFO L410 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 18, 18, 18, 17, 17, 15, 15, 13, 13, 11, 11, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 15:40:12,997 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:40:12,997 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:12,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:12,997 INFO L82 PathProgramCache]: Analyzing trace with hash 709390269, now seen corresponding path program 1 times [2019-11-28 15:40:12,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:12,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493963213] [2019-11-28 15:40:12,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:13,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:13,230 INFO L134 CoverageAnalysis]: Checked inductivity of 2711 backedges. 1570 proven. 14 refuted. 0 times theorem prover too weak. 1127 trivial. 0 not checked. [2019-11-28 15:40:13,231 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493963213] [2019-11-28 15:40:13,231 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [886062532] [2019-11-28 15:40:13,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:40:13,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:13,401 INFO L264 TraceCheckSpWp]: Trace formula consists of 752 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 15:40:13,408 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:40:13,760 INFO L134 CoverageAnalysis]: Checked inductivity of 2711 backedges. 1019 proven. 0 refuted. 0 times theorem prover too weak. 1692 trivial. 0 not checked. [2019-11-28 15:40:13,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 15:40:13,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-28 15:40:13,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742280746] [2019-11-28 15:40:13,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:13,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:13,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:13,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 15:40:13,763 INFO L87 Difference]: Start difference. First operand 1987 states and 2576 transitions. Second operand 3 states. [2019-11-28 15:40:13,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:13,790 INFO L93 Difference]: Finished difference Result 2038 states and 2641 transitions. [2019-11-28 15:40:13,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:13,791 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 493 [2019-11-28 15:40:13,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:13,795 INFO L225 Difference]: With dead ends: 2038 [2019-11-28 15:40:13,795 INFO L226 Difference]: Without dead ends: 1835 [2019-11-28 15:40:13,796 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 496 GetRequests, 493 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 15:40:13,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1835 states. [2019-11-28 15:40:13,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1835 to 1786. [2019-11-28 15:40:13,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1786 states. [2019-11-28 15:40:13,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1786 states to 1786 states and 2314 transitions. [2019-11-28 15:40:13,828 INFO L78 Accepts]: Start accepts. Automaton has 1786 states and 2314 transitions. Word has length 493 [2019-11-28 15:40:13,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:13,829 INFO L462 AbstractCegarLoop]: Abstraction has 1786 states and 2314 transitions. [2019-11-28 15:40:13,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:13,829 INFO L276 IsEmpty]: Start isEmpty. Operand 1786 states and 2314 transitions. [2019-11-28 15:40:13,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 604 [2019-11-28 15:40:13,843 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:13,843 INFO L410 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 20, 20, 19, 19, 17, 17, 16, 16, 15, 15, 13, 13, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 15:40:14,048 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:40:14,049 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:14,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:14,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1730430293, now seen corresponding path program 2 times [2019-11-28 15:40:14,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:14,050 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106109] [2019-11-28 15:40:14,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:14,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:14,353 INFO L134 CoverageAnalysis]: Checked inductivity of 3925 backedges. 2052 proven. 14 refuted. 0 times theorem prover too weak. 1859 trivial. 0 not checked. [2019-11-28 15:40:14,353 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106109] [2019-11-28 15:40:14,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1026606891] [2019-11-28 15:40:14,354 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:40:14,541 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 15:40:14,542 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 15:40:14,544 INFO L264 TraceCheckSpWp]: Trace formula consists of 882 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 15:40:14,550 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:40:14,844 INFO L134 CoverageAnalysis]: Checked inductivity of 3925 backedges. 2052 proven. 14 refuted. 0 times theorem prover too weak. 1859 trivial. 0 not checked. [2019-11-28 15:40:14,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 15:40:14,847 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-28 15:40:14,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865568488] [2019-11-28 15:40:14,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 15:40:14,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:14,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 15:40:14,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:40:14,850 INFO L87 Difference]: Start difference. First operand 1786 states and 2314 transitions. Second operand 4 states. [2019-11-28 15:40:15,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:15,016 INFO L93 Difference]: Finished difference Result 2046 states and 2645 transitions. [2019-11-28 15:40:15,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 15:40:15,017 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 603 [2019-11-28 15:40:15,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:15,017 INFO L225 Difference]: With dead ends: 2046 [2019-11-28 15:40:15,017 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 15:40:15,020 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 608 GetRequests, 605 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 15:40:15,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 15:40:15,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 15:40:15,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 15:40:15,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 15:40:15,021 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 603 [2019-11-28 15:40:15,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:15,021 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 15:40:15,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 15:40:15,021 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 15:40:15,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 15:40:15,228 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:40:15,231 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 15:40:15,805 WARN L192 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 220 DAG size of output: 103 [2019-11-28 15:40:16,011 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 30 [2019-11-28 15:40:16,489 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 27 [2019-11-28 15:40:16,751 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 7 [2019-11-28 15:40:16,858 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 29 [2019-11-28 15:40:17,558 WARN L192 SmtUtils]: Spent 629.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 62 [2019-11-28 15:40:17,658 INFO L246 CegarLoopResult]: For program point L366(lines 366 370) no Hoare annotation was computed. [2019-11-28 15:40:17,659 INFO L246 CegarLoopResult]: For program point L366-2(lines 366 370) no Hoare annotation was computed. [2019-11-28 15:40:17,659 INFO L246 CegarLoopResult]: For program point L565(lines 565 593) no Hoare annotation was computed. [2019-11-28 15:40:17,659 INFO L246 CegarLoopResult]: For program point L169(lines 169 540) no Hoare annotation was computed. [2019-11-28 15:40:17,659 INFO L246 CegarLoopResult]: For program point L136(lines 136 551) no Hoare annotation was computed. [2019-11-28 15:40:17,659 INFO L246 CegarLoopResult]: For program point L103(lines 103 562) no Hoare annotation was computed. [2019-11-28 15:40:17,659 INFO L246 CegarLoopResult]: For program point L566(lines 566 590) no Hoare annotation was computed. [2019-11-28 15:40:17,659 INFO L246 CegarLoopResult]: For program point L500-1(lines 198 528) no Hoare annotation was computed. [2019-11-28 15:40:17,659 INFO L246 CegarLoopResult]: For program point L335(lines 335 340) no Hoare annotation was computed. [2019-11-28 15:40:17,659 INFO L246 CegarLoopResult]: For program point L302-1(lines 302 316) no Hoare annotation was computed. [2019-11-28 15:40:17,660 INFO L242 CegarLoopResult]: At program point L203(lines 100 563) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) [2019-11-28 15:40:17,661 INFO L242 CegarLoopResult]: At program point L170(lines 166 541) the Hoare annotation is: (let ((.cse1 (<= (mod (+ ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0)) (.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4512)) (.cse2 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) (.cse3 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse3) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse1 .cse2 .cse3) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse2 .cse3))) [2019-11-28 15:40:17,661 INFO L246 CegarLoopResult]: For program point L600(lines 600 604) no Hoare annotation was computed. [2019-11-28 15:40:17,661 INFO L246 CegarLoopResult]: For program point L567(lines 567 576) no Hoare annotation was computed. [2019-11-28 15:40:17,661 INFO L246 CegarLoopResult]: For program point L600-2(lines 600 604) no Hoare annotation was computed. [2019-11-28 15:40:17,662 INFO L246 CegarLoopResult]: For program point L567-2(lines 566 588) no Hoare annotation was computed. [2019-11-28 15:40:17,662 INFO L246 CegarLoopResult]: For program point L270(lines 270 274) no Hoare annotation was computed. [2019-11-28 15:40:17,662 INFO L246 CegarLoopResult]: For program point L172(lines 172 539) no Hoare annotation was computed. [2019-11-28 15:40:17,662 INFO L246 CegarLoopResult]: For program point L139(lines 139 550) no Hoare annotation was computed. [2019-11-28 15:40:17,662 INFO L246 CegarLoopResult]: For program point L106(lines 106 561) no Hoare annotation was computed. [2019-11-28 15:40:17,663 INFO L246 CegarLoopResult]: For program point L569(lines 569 573) no Hoare annotation was computed. [2019-11-28 15:40:17,663 INFO L246 CegarLoopResult]: For program point L437(lines 437 442) no Hoare annotation was computed. [2019-11-28 15:40:17,663 INFO L242 CegarLoopResult]: At program point L140(lines 136 551) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4448)) (.cse1 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) (.cse2 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse0 .cse1 .cse2) (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (<= (mod (+ ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0) .cse0 .cse1 .cse2))) [2019-11-28 15:40:17,663 INFO L246 CegarLoopResult]: For program point L74(lines 74 82) no Hoare annotation was computed. [2019-11-28 15:40:17,664 INFO L246 CegarLoopResult]: For program point L471(lines 471 475) no Hoare annotation was computed. [2019-11-28 15:40:17,664 INFO L246 CegarLoopResult]: For program point L306(lines 306 310) no Hoare annotation was computed. [2019-11-28 15:40:17,664 INFO L246 CegarLoopResult]: For program point L306-2(lines 304 316) no Hoare annotation was computed. [2019-11-28 15:40:17,664 INFO L246 CegarLoopResult]: For program point L505-1(lines 505 509) no Hoare annotation was computed. [2019-11-28 15:40:17,664 INFO L246 CegarLoopResult]: For program point L406(lines 406 410) no Hoare annotation was computed. [2019-11-28 15:40:17,665 INFO L246 CegarLoopResult]: For program point L208(lines 208 212) no Hoare annotation was computed. [2019-11-28 15:40:17,665 INFO L246 CegarLoopResult]: For program point L175(lines 175 538) no Hoare annotation was computed. [2019-11-28 15:40:17,665 INFO L246 CegarLoopResult]: For program point L142(lines 142 549) no Hoare annotation was computed. [2019-11-28 15:40:17,665 INFO L246 CegarLoopResult]: For program point L208-2(lines 198 528) no Hoare annotation was computed. [2019-11-28 15:40:17,665 INFO L246 CegarLoopResult]: For program point L109(lines 109 560) no Hoare annotation was computed. [2019-11-28 15:40:17,666 INFO L242 CegarLoopResult]: At program point L176(lines 172 539) the Hoare annotation is: (let ((.cse3 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) (.cse5 (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528)) (.cse4 (<= (mod (+ ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0)) (.cse2 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse4 .cse2 .cse3) (and .cse5 .cse0 .cse1) (and .cse5 .cse0 .cse4 .cse2 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)))) [2019-11-28 15:40:17,666 INFO L246 CegarLoopResult]: For program point L77(lines 77 81) no Hoare annotation was computed. [2019-11-28 15:40:17,666 INFO L246 CegarLoopResult]: For program point L77-2(lines 74 82) no Hoare annotation was computed. [2019-11-28 15:40:17,666 INFO L249 CegarLoopResult]: At program point L607(lines 7 609) the Hoare annotation is: true [2019-11-28 15:40:17,667 INFO L246 CegarLoopResult]: For program point L244(lines 244 249) no Hoare annotation was computed. [2019-11-28 15:40:17,667 INFO L246 CegarLoopResult]: For program point L178(lines 178 537) no Hoare annotation was computed. [2019-11-28 15:40:17,667 INFO L246 CegarLoopResult]: For program point L145(lines 145 548) no Hoare annotation was computed. [2019-11-28 15:40:17,667 INFO L246 CegarLoopResult]: For program point L112(lines 112 559) no Hoare annotation was computed. [2019-11-28 15:40:17,667 INFO L246 CegarLoopResult]: For program point L476(lines 476 480) no Hoare annotation was computed. [2019-11-28 15:40:17,668 INFO L246 CegarLoopResult]: For program point L476-2(lines 476 480) no Hoare annotation was computed. [2019-11-28 15:40:17,668 INFO L242 CegarLoopResult]: At program point L146(lines 142 549) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4464)) (.cse1 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) (.cse2 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (<= (mod (+ ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0) .cse1 .cse2) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1 .cse2))) [2019-11-28 15:40:17,668 INFO L246 CegarLoopResult]: For program point L378(lines 378 382) no Hoare annotation was computed. [2019-11-28 15:40:17,668 INFO L246 CegarLoopResult]: For program point L345(lines 345 349) no Hoare annotation was computed. [2019-11-28 15:40:17,669 INFO L246 CegarLoopResult]: For program point L279(lines 279 287) no Hoare annotation was computed. [2019-11-28 15:40:17,669 INFO L242 CegarLoopResult]: At program point L346(lines 60 608) the Hoare annotation is: false [2019-11-28 15:40:17,669 INFO L246 CegarLoopResult]: For program point L181(lines 181 536) no Hoare annotation was computed. [2019-11-28 15:40:17,669 INFO L246 CegarLoopResult]: For program point L148(lines 148 547) no Hoare annotation was computed. [2019-11-28 15:40:17,669 INFO L246 CegarLoopResult]: For program point L115(lines 115 558) no Hoare annotation was computed. [2019-11-28 15:40:17,670 INFO L246 CegarLoopResult]: For program point L578(lines 578 584) no Hoare annotation was computed. [2019-11-28 15:40:17,670 INFO L246 CegarLoopResult]: For program point L512(lines 512 516) no Hoare annotation was computed. [2019-11-28 15:40:17,670 INFO L246 CegarLoopResult]: For program point L512-2(lines 512 516) no Hoare annotation was computed. [2019-11-28 15:40:17,670 INFO L242 CegarLoopResult]: At program point L182(lines 178 537) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) (.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse4 (<= (mod (+ ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0)) (.cse2 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) (.cse3 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse2 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse3) (and (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~0) .cse0 .cse1) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse4 .cse2 .cse3))) [2019-11-28 15:40:17,670 INFO L242 CegarLoopResult]: At program point L116(lines 112 559) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432) (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-28 15:40:17,671 INFO L246 CegarLoopResult]: For program point L447(lines 447 451) no Hoare annotation was computed. [2019-11-28 15:40:17,671 INFO L246 CegarLoopResult]: For program point L282(lines 282 286) no Hoare annotation was computed. [2019-11-28 15:40:17,671 INFO L246 CegarLoopResult]: For program point L282-2(lines 198 528) no Hoare annotation was computed. [2019-11-28 15:40:17,671 INFO L246 CegarLoopResult]: For program point L84(lines 84 92) no Hoare annotation was computed. [2019-11-28 15:40:17,671 INFO L246 CegarLoopResult]: For program point L184(lines 184 535) no Hoare annotation was computed. [2019-11-28 15:40:17,671 INFO L246 CegarLoopResult]: For program point L151(lines 151 546) no Hoare annotation was computed. [2019-11-28 15:40:17,672 INFO L246 CegarLoopResult]: For program point L118(lines 118 557) no Hoare annotation was computed. [2019-11-28 15:40:17,672 INFO L246 CegarLoopResult]: For program point L85(lines 85 89) no Hoare annotation was computed. [2019-11-28 15:40:17,672 INFO L246 CegarLoopResult]: For program point L350(lines 350 354) no Hoare annotation was computed. [2019-11-28 15:40:17,672 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 15:40:17,672 INFO L246 CegarLoopResult]: For program point L484-1(lines 484 496) no Hoare annotation was computed. [2019-11-28 15:40:17,672 INFO L246 CegarLoopResult]: For program point L418(lines 418 422) no Hoare annotation was computed. [2019-11-28 15:40:17,673 INFO L246 CegarLoopResult]: For program point L220(lines 220 237) no Hoare annotation was computed. [2019-11-28 15:40:17,673 INFO L246 CegarLoopResult]: For program point L187(lines 187 534) no Hoare annotation was computed. [2019-11-28 15:40:17,673 INFO L246 CegarLoopResult]: For program point L154(lines 154 545) no Hoare annotation was computed. [2019-11-28 15:40:17,673 INFO L246 CegarLoopResult]: For program point L220-2(lines 198 528) no Hoare annotation was computed. [2019-11-28 15:40:17,673 INFO L246 CegarLoopResult]: For program point L121(lines 121 556) no Hoare annotation was computed. [2019-11-28 15:40:17,674 INFO L242 CegarLoopResult]: At program point L188(lines 184 535) the Hoare annotation is: (let ((.cse0 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) (.cse1 (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse2 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse3 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) (.cse4 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse5 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560))) (or (and (not .cse0) .cse1 .cse2 .cse3) (and .cse1 .cse2 (<= (mod (+ ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0) .cse4 .cse0 .cse5) (and .cse1 .cse2 .cse3 .cse4 .cse5))) [2019-11-28 15:40:17,674 INFO L242 CegarLoopResult]: At program point L122(lines 118 557) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432) (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-28 15:40:17,674 INFO L249 CegarLoopResult]: At program point L618(lines 610 620) the Hoare annotation is: true [2019-11-28 15:40:17,674 INFO L246 CegarLoopResult]: For program point L519(lines 519 523) no Hoare annotation was computed. [2019-11-28 15:40:17,675 INFO L246 CegarLoopResult]: For program point L222(lines 222 227) no Hoare annotation was computed. [2019-11-28 15:40:17,675 INFO L246 CegarLoopResult]: For program point L487(lines 487 492) no Hoare annotation was computed. [2019-11-28 15:40:17,675 INFO L246 CegarLoopResult]: For program point L454(lines 454 465) no Hoare annotation was computed. [2019-11-28 15:40:17,675 INFO L246 CegarLoopResult]: For program point L454-1(lines 454 465) no Hoare annotation was computed. [2019-11-28 15:40:17,675 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 15:40:17,675 INFO L246 CegarLoopResult]: For program point L190(lines 190 533) no Hoare annotation was computed. [2019-11-28 15:40:17,676 INFO L246 CegarLoopResult]: For program point L157(lines 157 544) no Hoare annotation was computed. [2019-11-28 15:40:17,676 INFO L246 CegarLoopResult]: For program point L124(lines 124 555) no Hoare annotation was computed. [2019-11-28 15:40:17,676 INFO L246 CegarLoopResult]: For program point L389(lines 389 393) no Hoare annotation was computed. [2019-11-28 15:40:17,676 INFO L246 CegarLoopResult]: For program point L323(lines 323 327) no Hoare annotation was computed. [2019-11-28 15:40:17,676 INFO L246 CegarLoopResult]: For program point L323-2(lines 198 528) no Hoare annotation was computed. [2019-11-28 15:40:17,677 INFO L242 CegarLoopResult]: At program point L191(lines 190 533) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4352)) (.cse5 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) (.cse1 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse2 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse3 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) (.cse4 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560))) (or (and .cse0 (<= (mod (+ ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0) .cse1 .cse2 .cse3 .cse4) (and (not .cse3) .cse0 .cse5 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse1) (and .cse0 .cse5 .cse1 .cse2 .cse3 .cse4))) [2019-11-28 15:40:17,677 INFO L242 CegarLoopResult]: At program point L158(lines 148 547) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4480)) (.cse1 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) (.cse2 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1 .cse2) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (<= (mod (+ ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0) .cse1 .cse2))) [2019-11-28 15:40:17,677 INFO L246 CegarLoopResult]: For program point L456(lines 456 462) no Hoare annotation was computed. [2019-11-28 15:40:17,677 INFO L246 CegarLoopResult]: For program point L258(lines 258 262) no Hoare annotation was computed. [2019-11-28 15:40:17,677 INFO L246 CegarLoopResult]: For program point L258-2(lines 198 528) no Hoare annotation was computed. [2019-11-28 15:40:17,678 INFO L246 CegarLoopResult]: For program point L193(lines 193 532) no Hoare annotation was computed. [2019-11-28 15:40:17,678 INFO L246 CegarLoopResult]: For program point L160(lines 160 543) no Hoare annotation was computed. [2019-11-28 15:40:17,678 INFO L246 CegarLoopResult]: For program point L127(lines 127 554) no Hoare annotation was computed. [2019-11-28 15:40:17,678 INFO L246 CegarLoopResult]: For program point L94-1(lines 60 608) no Hoare annotation was computed. [2019-11-28 15:40:17,678 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 15:40:17,678 INFO L246 CegarLoopResult]: For program point L293(lines 293 297) no Hoare annotation was computed. [2019-11-28 15:40:17,679 INFO L246 CegarLoopResult]: For program point L293-2(lines 293 297) no Hoare annotation was computed. [2019-11-28 15:40:17,679 INFO L249 CegarLoopResult]: At program point L194(lines 193 532) the Hoare annotation is: true [2019-11-28 15:40:17,679 INFO L242 CegarLoopResult]: At program point L128(lines 124 555) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432)) (.cse1 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse2 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (or (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse0 .cse1 .cse2) (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse0 (<= (mod (+ ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0) .cse1 .cse2 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)))) [2019-11-28 15:40:17,679 INFO L246 CegarLoopResult]: For program point L95(line 95) no Hoare annotation was computed. [2019-11-28 15:40:17,680 INFO L246 CegarLoopResult]: For program point L426(lines 426 430) no Hoare annotation was computed. [2019-11-28 15:40:17,680 INFO L246 CegarLoopResult]: For program point L426-2(lines 198 528) no Hoare annotation was computed. [2019-11-28 15:40:17,680 INFO L246 CegarLoopResult]: For program point L228(lines 228 233) no Hoare annotation was computed. [2019-11-28 15:40:17,680 INFO L246 CegarLoopResult]: For program point L361(lines 361 365) no Hoare annotation was computed. [2019-11-28 15:40:17,680 INFO L246 CegarLoopResult]: For program point L163(lines 163 542) no Hoare annotation was computed. [2019-11-28 15:40:17,680 INFO L246 CegarLoopResult]: For program point L130(lines 130 553) no Hoare annotation was computed. [2019-11-28 15:40:17,681 INFO L246 CegarLoopResult]: For program point L97(lines 97 564) no Hoare annotation was computed. [2019-11-28 15:40:17,681 INFO L246 CegarLoopResult]: For program point L395(lines 395 400) no Hoare annotation was computed. [2019-11-28 15:40:17,681 INFO L246 CegarLoopResult]: For program point L395-2(lines 395 400) no Hoare annotation was computed. [2019-11-28 15:40:17,681 INFO L249 CegarLoopResult]: At program point L197(lines 196 531) the Hoare annotation is: true [2019-11-28 15:40:17,681 INFO L242 CegarLoopResult]: At program point L164(lines 160 543) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4512)) (.cse1 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) (.cse2 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (<= (mod (+ ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0) .cse1 .cse2) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1 .cse2))) [2019-11-28 15:40:17,682 INFO L242 CegarLoopResult]: At program point L98(lines 97 564) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (= 12292 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-28 15:40:17,682 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 606) no Hoare annotation was computed. [2019-11-28 15:40:17,682 INFO L242 CegarLoopResult]: At program point L529(lines 94 595) the Hoare annotation is: (let ((.cse6 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (let ((.cse2 (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse3 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse10 (<= ULTIMATE.start_ssl3_connect_~s__state~0 3)) (.cse4 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4)) (.cse5 (<= (mod (+ ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0)) (.cse1 (not .cse6)) (.cse16 (= 4416 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse14 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4352)) (.cse15 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse9 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse7 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse12 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse8 (= 4400 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse13 (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse11 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528)) (.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2))) (or (and .cse0 (= 4368 ULTIMATE.start_ssl3_connect_~s__state~0)) (and .cse1 .cse2 .cse3 .cse0) (and .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse2 .cse3 .cse5 .cse9 .cse6 .cse7) (and .cse10 .cse5 .cse7) (and .cse0 .cse10 .cse6) (and .cse2 .cse3 .cse0 .cse9 .cse7) (and .cse11 .cse4 .cse5 .cse6 .cse12) (and .cse13 .cse11 .cse5 .cse6 .cse7) (and .cse14 .cse5 .cse15 .cse9 .cse6 .cse7) (and .cse0 .cse10 .cse7) (and .cse16 .cse4 .cse5 .cse6) (and .cse1 .cse14 .cse0 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse15) (and .cse0 (= 4384 ULTIMATE.start_ssl3_connect_~s__state~0)) (and .cse16 .cse0 .cse6) (and .cse14 .cse0 .cse15 .cse9 .cse6 .cse7) (and .cse11 .cse0 .cse6 .cse12) (and .cse0 .cse6 .cse8) (and .cse13 .cse11 .cse0)))) [2019-11-28 15:40:17,683 INFO L246 CegarLoopResult]: For program point L166(lines 166 541) no Hoare annotation was computed. [2019-11-28 15:40:17,683 INFO L246 CegarLoopResult]: For program point L133(lines 133 552) no Hoare annotation was computed. [2019-11-28 15:40:17,683 INFO L246 CegarLoopResult]: For program point L100(lines 100 563) no Hoare annotation was computed. [2019-11-28 15:40:17,683 INFO L249 CegarLoopResult]: At program point L596(lines 93 597) the Hoare annotation is: true [2019-11-28 15:40:17,683 INFO L242 CegarLoopResult]: At program point L134(lines 130 553) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432)) (.cse1 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse2 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (or (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse0 .cse1 .cse2) (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse0 (<= (mod (+ ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0) .cse1 .cse2))) [2019-11-28 15:40:17,732 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 03:40:17 BoogieIcfgContainer [2019-11-28 15:40:17,732 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 15:40:17,732 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 15:40:17,733 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 15:40:17,733 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 15:40:17,733 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:40:01" (3/4) ... [2019-11-28 15:40:17,737 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 15:40:17,766 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-28 15:40:17,767 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 15:40:17,893 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 15:40:17,893 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 15:40:17,895 INFO L168 Benchmark]: Toolchain (without parser) took 17735.28 ms. Allocated memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: 969.4 MB). Free memory was 961.7 MB in the beginning and 1.5 GB in the end (delta: -503.3 MB). Peak memory consumption was 466.1 MB. Max. memory is 11.5 GB. [2019-11-28 15:40:17,895 INFO L168 Benchmark]: CDTParser took 0.34 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 15:40:17,895 INFO L168 Benchmark]: CACSL2BoogieTranslator took 499.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -167.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2019-11-28 15:40:17,896 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.81 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 15:40:17,896 INFO L168 Benchmark]: Boogie Preprocessor took 37.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 15:40:17,896 INFO L168 Benchmark]: RCFGBuilder took 848.16 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: 44.9 MB). Peak memory consumption was 44.9 MB. Max. memory is 11.5 GB. [2019-11-28 15:40:17,897 INFO L168 Benchmark]: TraceAbstraction took 16110.81 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 828.9 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -387.8 MB). Peak memory consumption was 441.1 MB. Max. memory is 11.5 GB. [2019-11-28 15:40:17,897 INFO L168 Benchmark]: Witness Printer took 160.85 ms. Allocated memory is still 2.0 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2019-11-28 15:40:17,899 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.34 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 499.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -167.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 70.81 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 37.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 848.16 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: 44.9 MB). Peak memory consumption was 44.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 16110.81 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 828.9 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -387.8 MB). Peak memory consumption was 441.1 MB. Max. memory is 11.5 GB. * Witness Printer took 160.85 ms. Allocated memory is still 2.0 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 606]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 118]: Loop Invariant Derived loop invariant: (blastFlag <= 2 && s__state <= 4432) && 4352 <= s__state - InvariantResult [Line: 196]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 172]: Loop Invariant Derived loop invariant: (((((s__state <= 4528 && blastFlag <= 2) && 0 == s__hit) && 4432 <= s__state) || ((((s__state <= 4528 && blastFlag <= 4) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 0 == s__hit) && 4432 <= s__state)) || ((4512 <= s__state && s__state <= 4528) && blastFlag <= 2)) || ((((4512 <= s__state && s__state <= 4528) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) - InvariantResult [Line: 130]: Loop Invariant Derived loop invariant: (((blastFlag <= 2 && s__state <= 4432) && 4352 <= s__state) && 0 == s__hit) || ((((blastFlag <= 4 && s__state <= 4432) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 4352 <= s__state) && 0 == s__hit) - InvariantResult [Line: 184]: Loop Invariant Derived loop invariant: ((((!(0 == s__hit) && 4560 <= s__state) && s__state <= 4560) && blastFlag <= 2) || (((((4560 <= s__state && s__state <= 4560) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560)) || ((((4560 <= s__state && s__state <= 4560) && blastFlag <= 2) && 4560 <= s__s3__tmp__next_state___0) && s__s3__tmp__next_state___0 <= 4560) - InvariantResult [Line: 142]: Loop Invariant Derived loop invariant: ((((s__state <= 4464 && blastFlag <= 4) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 0 == s__hit) && 4432 <= s__state) || (((s__state <= 4464 && blastFlag <= 2) && 0 == s__hit) && 4432 <= s__state) - InvariantResult [Line: 148]: Loop Invariant Derived loop invariant: (((s__state <= 4480 && blastFlag <= 2) && 0 == s__hit) && 4432 <= s__state) || ((((s__state <= 4480 && blastFlag <= 4) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 0 == s__hit) && 4432 <= s__state) - InvariantResult [Line: 610]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 112]: Loop Invariant Derived loop invariant: (blastFlag <= 2 && s__state <= 4432) && 4352 <= s__state - InvariantResult [Line: 93]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 190]: Loop Invariant Derived loop invariant: ((((((s__state <= 4352 && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 4352 <= s__state) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) || ((((!(0 == s__hit) && s__state <= 4352) && blastFlag <= 2) && s__s3__tmp__next_state___0 <= 3) && 4352 <= s__state)) || (((((s__state <= 4352 && blastFlag <= 2) && 4352 <= s__state) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) - InvariantResult [Line: 166]: Loop Invariant Derived loop invariant: (((((s__state <= 4512 && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) && 4432 <= s__state) || ((((s__state <= 4512 && blastFlag <= 4) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 0 == s__hit) && 4432 <= s__state)) || (((s__state <= 4512 && blastFlag <= 2) && 0 == s__hit) && 4432 <= s__state) - InvariantResult [Line: 124]: Loop Invariant Derived loop invariant: (((blastFlag <= 2 && s__state <= 4432) && 4352 <= s__state) && 0 == s__hit) || (((((blastFlag <= 4 && s__state <= 4432) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 4352 <= s__state) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) - InvariantResult [Line: 100]: Loop Invariant Derived loop invariant: s__state <= 4560 && blastFlag <= 2 - InvariantResult [Line: 178]: Loop Invariant Derived loop invariant: (((((s__state <= 4560 && blastFlag <= 2) && 0 == s__hit) && 4432 <= s__state) || ((((s__state <= 4560 && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) && 4432 <= s__state)) || ((4512 <= s__state && s__state <= 4560) && blastFlag <= 2)) || ((((s__state <= 4560 && blastFlag <= 4) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 0 == s__hit) && 4432 <= s__state) - InvariantResult [Line: 136]: Loop Invariant Derived loop invariant: (((blastFlag <= 2 && s__state <= 4448) && 0 == s__hit) && 4432 <= s__state) || ((((blastFlag <= 4 && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && s__state <= 4448) && 0 == s__hit) && 4432 <= s__state) - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: blastFlag <= 2 && 12292 == s__state - InvariantResult [Line: 94]: Loop Invariant Derived loop invariant: ((((((((((((((((((blastFlag <= 2 && 4368 == s__state) || (((!(0 == s__hit) && 4560 <= s__state) && s__state <= 4560) && blastFlag <= 2)) || ((((blastFlag <= 4 && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) && 4400 == s__state)) || (((((4560 <= s__state && s__state <= 4560) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560)) || ((s__state <= 3 && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && s__s3__tmp__next_state___0 <= 4560)) || ((blastFlag <= 2 && s__state <= 3) && 0 == s__hit)) || ((((4560 <= s__state && s__state <= 4560) && blastFlag <= 2) && 4560 <= s__s3__tmp__next_state___0) && s__s3__tmp__next_state___0 <= 4560)) || ((((s__state <= 4528 && blastFlag <= 4) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 0 == s__hit) && 4432 <= s__state)) || ((((4512 <= s__state && s__state <= 4528) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560)) || (((((s__state <= 4352 && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 4352 <= s__state) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560)) || ((blastFlag <= 2 && s__state <= 3) && s__s3__tmp__next_state___0 <= 4560)) || (((4416 == s__state && blastFlag <= 4) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 0 == s__hit)) || ((((!(0 == s__hit) && s__state <= 4352) && blastFlag <= 2) && s__s3__tmp__next_state___0 <= 3) && 4352 <= s__state)) || (blastFlag <= 2 && 4384 == s__state)) || ((4416 == s__state && blastFlag <= 2) && 0 == s__hit)) || (((((s__state <= 4352 && blastFlag <= 2) && 4352 <= s__state) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560)) || (((s__state <= 4528 && blastFlag <= 2) && 0 == s__hit) && 4432 <= s__state)) || ((blastFlag <= 2 && 0 == s__hit) && 4400 == s__state)) || ((4512 <= s__state && s__state <= 4528) && blastFlag <= 2) - InvariantResult [Line: 193]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 60]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 160]: Loop Invariant Derived loop invariant: ((((s__state <= 4512 && blastFlag <= 4) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 0 == s__hit) && 4432 <= s__state) || (((s__state <= 4512 && blastFlag <= 2) && 0 == s__hit) && 4432 <= s__state) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 123 locations, 1 error locations. Result: SAFE, OverallTime: 13.5s, OverallIterations: 25, TraceHistogramMax: 21, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.4s, HoareTripleCheckerStatistics: 4391 SDtfs, 2019 SDslu, 2246 SDs, 0 SdLazy, 2459 SolverSat, 611 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2725 GetRequests, 2688 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3841occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 25 MinimizatonAttempts, 2798 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 22 PreInvPairs, 127 NumberOfFragments, 824 HoareAnnotationTreeSize, 22 FomulaSimplifications, 30206 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 22 FomulaSimplificationsInter, 24380 FormulaSimplificationTreeSizeReductionInter, 1.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 8751 NumberOfCodeBlocks, 8751 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 8720 ConstructedInterpolants, 0 QuantifiedInterpolants, 4981326 SizeOfPredicates, 8 NumberOfNonLiveVariables, 4110 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 31 InterpolantComputations, 22 PerfectInterpolantSequences, 39090/39192 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...