/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/psyco/psyco_io_1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 22:46:01,660 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 22:46:01,665 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 22:46:01,689 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 22:46:01,689 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 22:46:01,692 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 22:46:01,694 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 22:46:01,707 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 22:46:01,712 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 22:46:01,714 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 22:46:01,717 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 22:46:01,719 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 22:46:01,719 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 22:46:01,722 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 22:46:01,725 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 22:46:01,727 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 22:46:01,729 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 22:46:01,731 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 22:46:01,733 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 22:46:01,741 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 22:46:01,743 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 22:46:01,748 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 22:46:01,749 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 22:46:01,750 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 22:46:01,752 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 22:46:01,752 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 22:46:01,752 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 22:46:01,753 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 22:46:01,754 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 22:46:01,755 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 22:46:01,755 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 22:46:01,756 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 22:46:01,757 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 22:46:01,758 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 22:46:01,759 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 22:46:01,759 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 22:46:01,761 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 22:46:01,761 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 22:46:01,761 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 22:46:01,762 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 22:46:01,763 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 22:46:01,764 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-17 22:46:01,780 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 22:46:01,780 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 22:46:01,782 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-17 22:46:01,782 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-17 22:46:01,782 INFO L138 SettingsManager]: * Use SBE=true [2020-07-17 22:46:01,783 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 22:46:01,783 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 22:46:01,783 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 22:46:01,783 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 22:46:01,784 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 22:46:01,784 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 22:46:01,784 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 22:46:01,784 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 22:46:01,784 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 22:46:01,785 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 22:46:01,785 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 22:46:01,785 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 22:46:01,785 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 22:46:01,785 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-17 22:46:01,786 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 22:46:01,786 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 22:46:01,786 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:46:01,786 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 22:46:01,787 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-17 22:46:01,787 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-17 22:46:01,787 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-17 22:46:01,787 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-17 22:46:01,788 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 22:46:01,788 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-17 22:46:01,788 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-17 22:46:02,158 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 22:46:02,187 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 22:46:02,193 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 22:46:02,196 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 22:46:02,196 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 22:46:02,198 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/psyco/psyco_io_1.c [2020-07-17 22:46:02,308 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6635d828/8fde1e7e2f5e43b88362ce30a696ba5b/FLAG115b8745f [2020-07-17 22:46:02,919 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 22:46:02,920 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/psyco/psyco_io_1.c [2020-07-17 22:46:02,934 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6635d828/8fde1e7e2f5e43b88362ce30a696ba5b/FLAG115b8745f [2020-07-17 22:46:03,243 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6635d828/8fde1e7e2f5e43b88362ce30a696ba5b [2020-07-17 22:46:03,254 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 22:46:03,258 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 22:46:03,265 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 22:46:03,265 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 22:46:03,271 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 22:46:03,273 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:46:03" (1/1) ... [2020-07-17 22:46:03,277 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74cb0d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:46:03, skipping insertion in model container [2020-07-17 22:46:03,278 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:46:03" (1/1) ... [2020-07-17 22:46:03,288 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 22:46:03,343 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 22:46:03,661 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:46:03,668 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 22:46:03,723 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:46:03,749 INFO L208 MainTranslator]: Completed translation [2020-07-17 22:46:03,749 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:46:03 WrapperNode [2020-07-17 22:46:03,749 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 22:46:03,751 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 22:46:03,751 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 22:46:03,751 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 22:46:03,872 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:46:03" (1/1) ... [2020-07-17 22:46:03,875 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:46:03" (1/1) ... [2020-07-17 22:46:03,893 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:46:03" (1/1) ... [2020-07-17 22:46:03,893 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:46:03" (1/1) ... [2020-07-17 22:46:03,919 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:46:03" (1/1) ... [2020-07-17 22:46:03,942 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:46:03" (1/1) ... [2020-07-17 22:46:03,944 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:46:03" (1/1) ... [2020-07-17 22:46:03,948 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 22:46:03,948 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 22:46:03,949 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 22:46:03,949 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 22:46:03,950 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:46:03" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:46:04,026 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 22:46:04,026 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 22:46:04,027 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 22:46:04,027 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-17 22:46:04,027 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 22:46:04,027 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 22:46:04,028 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 22:46:04,028 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 22:46:04,949 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 22:46:04,949 INFO L295 CfgBuilder]: Removed 5 assume(true) statements. [2020-07-17 22:46:04,956 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:46:04 BoogieIcfgContainer [2020-07-17 22:46:04,956 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 22:46:04,958 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 22:46:04,958 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 22:46:04,963 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 22:46:04,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 10:46:03" (1/3) ... [2020-07-17 22:46:04,966 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a91e32a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:46:04, skipping insertion in model container [2020-07-17 22:46:04,966 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:46:03" (2/3) ... [2020-07-17 22:46:04,967 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a91e32a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:46:04, skipping insertion in model container [2020-07-17 22:46:04,967 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:46:04" (3/3) ... [2020-07-17 22:46:04,970 INFO L109 eAbstractionObserver]: Analyzing ICFG psyco_io_1.c [2020-07-17 22:46:04,984 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-17 22:46:04,995 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 22:46:05,011 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 22:46:05,037 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 22:46:05,038 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 22:46:05,038 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-17 22:46:05,038 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 22:46:05,039 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 22:46:05,039 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 22:46:05,039 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 22:46:05,040 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 22:46:05,065 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states. [2020-07-17 22:46:05,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-17 22:46:05,073 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:46:05,074 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:46:05,075 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:46:05,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:46:05,081 INFO L82 PathProgramCache]: Analyzing trace with hash -901605196, now seen corresponding path program 1 times [2020-07-17 22:46:05,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:46:05,094 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545742576] [2020-07-17 22:46:05,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:46:05,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:46:05,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:46:05,343 INFO L280 TraceCheckUtils]: 0: Hoare triple {81#(and (= ~m_connect_1~0 |old(~m_connect_1~0)|) (= ~m_close~0 |old(~m_close~0)|) (= ~m_PipedOutputStream~0 |old(~m_PipedOutputStream~0)|) (= ~m_write~0 |old(~m_write~0)|) (= ~m_flush~0 |old(~m_flush~0)|) (= ~m_connect_2~0 |old(~m_connect_2~0)|))} ~m_flush~0 := 1;~m_PipedOutputStream~0 := 2;~m_close~0 := 3;~m_write~0 := 4;~m_connect_1~0 := 5;~m_connect_2~0 := 6; {76#true} is VALID [2020-07-17 22:46:05,344 INFO L280 TraceCheckUtils]: 1: Hoare triple {76#true} assume true; {76#true} is VALID [2020-07-17 22:46:05,345 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {76#true} {76#true} #324#return; {76#true} is VALID [2020-07-17 22:46:05,350 INFO L263 TraceCheckUtils]: 0: Hoare triple {76#true} call ULTIMATE.init(); {81#(and (= ~m_connect_1~0 |old(~m_connect_1~0)|) (= ~m_close~0 |old(~m_close~0)|) (= ~m_PipedOutputStream~0 |old(~m_PipedOutputStream~0)|) (= ~m_write~0 |old(~m_write~0)|) (= ~m_flush~0 |old(~m_flush~0)|) (= ~m_connect_2~0 |old(~m_connect_2~0)|))} is VALID [2020-07-17 22:46:05,351 INFO L280 TraceCheckUtils]: 1: Hoare triple {81#(and (= ~m_connect_1~0 |old(~m_connect_1~0)|) (= ~m_close~0 |old(~m_close~0)|) (= ~m_PipedOutputStream~0 |old(~m_PipedOutputStream~0)|) (= ~m_write~0 |old(~m_write~0)|) (= ~m_flush~0 |old(~m_flush~0)|) (= ~m_connect_2~0 |old(~m_connect_2~0)|))} ~m_flush~0 := 1;~m_PipedOutputStream~0 := 2;~m_close~0 := 3;~m_write~0 := 4;~m_connect_1~0 := 5;~m_connect_2~0 := 6; {76#true} is VALID [2020-07-17 22:46:05,352 INFO L280 TraceCheckUtils]: 2: Hoare triple {76#true} assume true; {76#true} is VALID [2020-07-17 22:46:05,352 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {76#true} {76#true} #324#return; {76#true} is VALID [2020-07-17 22:46:05,353 INFO L263 TraceCheckUtils]: 4: Hoare triple {76#true} call #t~ret22 := main(); {76#true} is VALID [2020-07-17 22:46:05,353 INFO L280 TraceCheckUtils]: 5: Hoare triple {76#true} ~q~0 := 0;havoc ~method_id~0;~this_sink~0 := 0;~this_sinkConnected~0 := 0; {76#true} is VALID [2020-07-17 22:46:05,354 INFO L280 TraceCheckUtils]: 6: Hoare triple {76#true} goto; {76#true} is VALID [2020-07-17 22:46:05,354 INFO L280 TraceCheckUtils]: 7: Hoare triple {76#true} assume !false;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~P1~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~P2~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~P3~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~P4~0 := #t~nondet3;havoc #t~nondet3; {76#true} is VALID [2020-07-17 22:46:05,355 INFO L280 TraceCheckUtils]: 8: Hoare triple {76#true} assume 0 == ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {76#true} is VALID [2020-07-17 22:46:05,355 INFO L280 TraceCheckUtils]: 9: Hoare triple {76#true} assume 0 != #t~nondet4;havoc #t~nondet4; {76#true} is VALID [2020-07-17 22:46:05,356 INFO L280 TraceCheckUtils]: 10: Hoare triple {76#true} ~method_id~0 := 2; {76#true} is VALID [2020-07-17 22:46:05,358 INFO L280 TraceCheckUtils]: 11: Hoare triple {76#true} assume false; {77#false} is VALID [2020-07-17 22:46:05,359 INFO L280 TraceCheckUtils]: 12: Hoare triple {77#false} assume !false; {77#false} is VALID [2020-07-17 22:46:05,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:46:05,362 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545742576] [2020-07-17 22:46:05,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:46:05,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:46:05,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525909837] [2020-07-17 22:46:05,376 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-07-17 22:46:05,380 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:46:05,385 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:46:05,422 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:46:05,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:46:05,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:46:05,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:46:05,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:46:05,441 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 3 states. [2020-07-17 22:46:05,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:46:05,869 INFO L93 Difference]: Finished difference Result 136 states and 250 transitions. [2020-07-17 22:46:05,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:46:05,870 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-07-17 22:46:05,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:46:05,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:46:05,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 250 transitions. [2020-07-17 22:46:05,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:46:05,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 250 transitions. [2020-07-17 22:46:05,900 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 250 transitions. [2020-07-17 22:46:06,348 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 250 edges. 250 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:46:06,367 INFO L225 Difference]: With dead ends: 136 [2020-07-17 22:46:06,367 INFO L226 Difference]: Without dead ends: 61 [2020-07-17 22:46:06,373 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:46:06,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-07-17 22:46:06,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2020-07-17 22:46:06,445 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:46:06,446 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand 61 states. [2020-07-17 22:46:06,446 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 61 states. [2020-07-17 22:46:06,447 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 61 states. [2020-07-17 22:46:06,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:46:06,454 INFO L93 Difference]: Finished difference Result 61 states and 91 transitions. [2020-07-17 22:46:06,454 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 91 transitions. [2020-07-17 22:46:06,456 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:46:06,456 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:46:06,456 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 61 states. [2020-07-17 22:46:06,456 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 61 states. [2020-07-17 22:46:06,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:46:06,463 INFO L93 Difference]: Finished difference Result 61 states and 91 transitions. [2020-07-17 22:46:06,464 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 91 transitions. [2020-07-17 22:46:06,465 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:46:06,465 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:46:06,465 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:46:06,465 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:46:06,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-07-17 22:46:06,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 91 transitions. [2020-07-17 22:46:06,472 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 91 transitions. Word has length 13 [2020-07-17 22:46:06,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:46:06,473 INFO L479 AbstractCegarLoop]: Abstraction has 61 states and 91 transitions. [2020-07-17 22:46:06,473 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:46:06,473 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 91 transitions. [2020-07-17 22:46:06,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-17 22:46:06,475 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:46:06,475 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:46:06,475 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 22:46:06,476 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:46:06,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:46:06,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1647463811, now seen corresponding path program 1 times [2020-07-17 22:46:06,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:46:06,477 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679819819] [2020-07-17 22:46:06,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:46:06,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:46:06,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:46:06,624 INFO L280 TraceCheckUtils]: 0: Hoare triple {426#(and (= ~m_connect_1~0 |old(~m_connect_1~0)|) (= ~m_close~0 |old(~m_close~0)|) (= ~m_PipedOutputStream~0 |old(~m_PipedOutputStream~0)|) (= ~m_write~0 |old(~m_write~0)|) (= ~m_flush~0 |old(~m_flush~0)|) (= ~m_connect_2~0 |old(~m_connect_2~0)|))} ~m_flush~0 := 1;~m_PipedOutputStream~0 := 2;~m_close~0 := 3;~m_write~0 := 4;~m_connect_1~0 := 5;~m_connect_2~0 := 6; {420#true} is VALID [2020-07-17 22:46:06,624 INFO L280 TraceCheckUtils]: 1: Hoare triple {420#true} assume true; {420#true} is VALID [2020-07-17 22:46:06,625 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {420#true} {420#true} #324#return; {420#true} is VALID [2020-07-17 22:46:06,627 INFO L263 TraceCheckUtils]: 0: Hoare triple {420#true} call ULTIMATE.init(); {426#(and (= ~m_connect_1~0 |old(~m_connect_1~0)|) (= ~m_close~0 |old(~m_close~0)|) (= ~m_PipedOutputStream~0 |old(~m_PipedOutputStream~0)|) (= ~m_write~0 |old(~m_write~0)|) (= ~m_flush~0 |old(~m_flush~0)|) (= ~m_connect_2~0 |old(~m_connect_2~0)|))} is VALID [2020-07-17 22:46:06,627 INFO L280 TraceCheckUtils]: 1: Hoare triple {426#(and (= ~m_connect_1~0 |old(~m_connect_1~0)|) (= ~m_close~0 |old(~m_close~0)|) (= ~m_PipedOutputStream~0 |old(~m_PipedOutputStream~0)|) (= ~m_write~0 |old(~m_write~0)|) (= ~m_flush~0 |old(~m_flush~0)|) (= ~m_connect_2~0 |old(~m_connect_2~0)|))} ~m_flush~0 := 1;~m_PipedOutputStream~0 := 2;~m_close~0 := 3;~m_write~0 := 4;~m_connect_1~0 := 5;~m_connect_2~0 := 6; {420#true} is VALID [2020-07-17 22:46:06,628 INFO L280 TraceCheckUtils]: 2: Hoare triple {420#true} assume true; {420#true} is VALID [2020-07-17 22:46:06,628 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {420#true} {420#true} #324#return; {420#true} is VALID [2020-07-17 22:46:06,629 INFO L263 TraceCheckUtils]: 4: Hoare triple {420#true} call #t~ret22 := main(); {420#true} is VALID [2020-07-17 22:46:06,629 INFO L280 TraceCheckUtils]: 5: Hoare triple {420#true} ~q~0 := 0;havoc ~method_id~0;~this_sink~0 := 0;~this_sinkConnected~0 := 0; {425#(= 0 main_~q~0)} is VALID [2020-07-17 22:46:06,630 INFO L280 TraceCheckUtils]: 6: Hoare triple {425#(= 0 main_~q~0)} goto; {425#(= 0 main_~q~0)} is VALID [2020-07-17 22:46:06,631 INFO L280 TraceCheckUtils]: 7: Hoare triple {425#(= 0 main_~q~0)} assume !false;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~P1~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~P2~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~P3~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~P4~0 := #t~nondet3;havoc #t~nondet3; {425#(= 0 main_~q~0)} is VALID [2020-07-17 22:46:06,632 INFO L280 TraceCheckUtils]: 8: Hoare triple {425#(= 0 main_~q~0)} assume !(0 == ~q~0); {421#false} is VALID [2020-07-17 22:46:06,633 INFO L280 TraceCheckUtils]: 9: Hoare triple {421#false} assume 1 == ~q~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {421#false} is VALID [2020-07-17 22:46:06,634 INFO L280 TraceCheckUtils]: 10: Hoare triple {421#false} assume 0 != #t~nondet5;havoc #t~nondet5; {421#false} is VALID [2020-07-17 22:46:06,634 INFO L280 TraceCheckUtils]: 11: Hoare triple {421#false} ~method_id~0 := 4; {421#false} is VALID [2020-07-17 22:46:06,634 INFO L280 TraceCheckUtils]: 12: Hoare triple {421#false} assume 0 != ~this_sink~0; {421#false} is VALID [2020-07-17 22:46:06,635 INFO L280 TraceCheckUtils]: 13: Hoare triple {421#false} assume !false; {421#false} is VALID [2020-07-17 22:46:06,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:46:06,637 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679819819] [2020-07-17 22:46:06,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:46:06,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-17 22:46:06,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273663472] [2020-07-17 22:46:06,640 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-07-17 22:46:06,641 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:46:06,642 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-17 22:46:06,664 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:46:06,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-17 22:46:06,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:46:06,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-17 22:46:06,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-17 22:46:06,666 INFO L87 Difference]: Start difference. First operand 61 states and 91 transitions. Second operand 4 states. [2020-07-17 22:46:07,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:46:07,255 INFO L93 Difference]: Finished difference Result 119 states and 180 transitions. [2020-07-17 22:46:07,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-17 22:46:07,256 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-07-17 22:46:07,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:46:07,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:46:07,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 180 transitions. [2020-07-17 22:46:07,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:46:07,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 180 transitions. [2020-07-17 22:46:07,268 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 180 transitions. [2020-07-17 22:46:07,567 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 180 edges. 180 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:46:07,573 INFO L225 Difference]: With dead ends: 119 [2020-07-17 22:46:07,574 INFO L226 Difference]: Without dead ends: 64 [2020-07-17 22:46:07,576 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:46:07,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-07-17 22:46:07,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2020-07-17 22:46:07,616 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:46:07,617 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand 64 states. [2020-07-17 22:46:07,617 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 64 states. [2020-07-17 22:46:07,617 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 64 states. [2020-07-17 22:46:07,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:46:07,621 INFO L93 Difference]: Finished difference Result 64 states and 94 transitions. [2020-07-17 22:46:07,622 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 94 transitions. [2020-07-17 22:46:07,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:46:07,623 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:46:07,623 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 64 states. [2020-07-17 22:46:07,623 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 64 states. [2020-07-17 22:46:07,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:46:07,628 INFO L93 Difference]: Finished difference Result 64 states and 94 transitions. [2020-07-17 22:46:07,628 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 94 transitions. [2020-07-17 22:46:07,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:46:07,630 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:46:07,630 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:46:07,630 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:46:07,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-07-17 22:46:07,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 94 transitions. [2020-07-17 22:46:07,635 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 94 transitions. Word has length 14 [2020-07-17 22:46:07,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:46:07,635 INFO L479 AbstractCegarLoop]: Abstraction has 64 states and 94 transitions. [2020-07-17 22:46:07,635 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-17 22:46:07,636 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 94 transitions. [2020-07-17 22:46:07,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-17 22:46:07,637 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:46:07,637 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:46:07,637 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-17 22:46:07,638 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:46:07,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:46:07,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1212559863, now seen corresponding path program 1 times [2020-07-17 22:46:07,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:46:07,639 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429995766] [2020-07-17 22:46:07,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:46:07,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:46:07,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:46:07,761 INFO L280 TraceCheckUtils]: 0: Hoare triple {769#(and (= ~m_connect_1~0 |old(~m_connect_1~0)|) (= ~m_close~0 |old(~m_close~0)|) (= ~m_PipedOutputStream~0 |old(~m_PipedOutputStream~0)|) (= ~m_write~0 |old(~m_write~0)|) (= ~m_flush~0 |old(~m_flush~0)|) (= ~m_connect_2~0 |old(~m_connect_2~0)|))} ~m_flush~0 := 1;~m_PipedOutputStream~0 := 2;~m_close~0 := 3;~m_write~0 := 4;~m_connect_1~0 := 5;~m_connect_2~0 := 6; {763#true} is VALID [2020-07-17 22:46:07,762 INFO L280 TraceCheckUtils]: 1: Hoare triple {763#true} assume true; {763#true} is VALID [2020-07-17 22:46:07,762 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {763#true} {763#true} #324#return; {763#true} is VALID [2020-07-17 22:46:07,766 INFO L263 TraceCheckUtils]: 0: Hoare triple {763#true} call ULTIMATE.init(); {769#(and (= ~m_connect_1~0 |old(~m_connect_1~0)|) (= ~m_close~0 |old(~m_close~0)|) (= ~m_PipedOutputStream~0 |old(~m_PipedOutputStream~0)|) (= ~m_write~0 |old(~m_write~0)|) (= ~m_flush~0 |old(~m_flush~0)|) (= ~m_connect_2~0 |old(~m_connect_2~0)|))} is VALID [2020-07-17 22:46:07,767 INFO L280 TraceCheckUtils]: 1: Hoare triple {769#(and (= ~m_connect_1~0 |old(~m_connect_1~0)|) (= ~m_close~0 |old(~m_close~0)|) (= ~m_PipedOutputStream~0 |old(~m_PipedOutputStream~0)|) (= ~m_write~0 |old(~m_write~0)|) (= ~m_flush~0 |old(~m_flush~0)|) (= ~m_connect_2~0 |old(~m_connect_2~0)|))} ~m_flush~0 := 1;~m_PipedOutputStream~0 := 2;~m_close~0 := 3;~m_write~0 := 4;~m_connect_1~0 := 5;~m_connect_2~0 := 6; {763#true} is VALID [2020-07-17 22:46:07,767 INFO L280 TraceCheckUtils]: 2: Hoare triple {763#true} assume true; {763#true} is VALID [2020-07-17 22:46:07,767 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {763#true} {763#true} #324#return; {763#true} is VALID [2020-07-17 22:46:07,768 INFO L263 TraceCheckUtils]: 4: Hoare triple {763#true} call #t~ret22 := main(); {763#true} is VALID [2020-07-17 22:46:07,768 INFO L280 TraceCheckUtils]: 5: Hoare triple {763#true} ~q~0 := 0;havoc ~method_id~0;~this_sink~0 := 0;~this_sinkConnected~0 := 0; {763#true} is VALID [2020-07-17 22:46:07,768 INFO L280 TraceCheckUtils]: 6: Hoare triple {763#true} goto; {763#true} is VALID [2020-07-17 22:46:07,768 INFO L280 TraceCheckUtils]: 7: Hoare triple {763#true} assume !false;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~P1~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~P2~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~P3~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~P4~0 := #t~nondet3;havoc #t~nondet3; {763#true} is VALID [2020-07-17 22:46:07,769 INFO L280 TraceCheckUtils]: 8: Hoare triple {763#true} assume 0 == ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {763#true} is VALID [2020-07-17 22:46:07,769 INFO L280 TraceCheckUtils]: 9: Hoare triple {763#true} assume 0 != #t~nondet4;havoc #t~nondet4; {763#true} is VALID [2020-07-17 22:46:07,769 INFO L280 TraceCheckUtils]: 10: Hoare triple {763#true} ~method_id~0 := 2; {763#true} is VALID [2020-07-17 22:46:07,771 INFO L280 TraceCheckUtils]: 11: Hoare triple {763#true} assume !false;~q~0 := 2;~this_sink~0 := 0;~this_sinkConnected~0 := 0; {768#(<= 2 main_~q~0)} is VALID [2020-07-17 22:46:07,773 INFO L280 TraceCheckUtils]: 12: Hoare triple {768#(<= 2 main_~q~0)} assume !false;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~P1~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~P2~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~P3~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~P4~0 := #t~nondet3;havoc #t~nondet3; {768#(<= 2 main_~q~0)} is VALID [2020-07-17 22:46:07,774 INFO L280 TraceCheckUtils]: 13: Hoare triple {768#(<= 2 main_~q~0)} assume !(0 == ~q~0); {768#(<= 2 main_~q~0)} is VALID [2020-07-17 22:46:07,780 INFO L280 TraceCheckUtils]: 14: Hoare triple {768#(<= 2 main_~q~0)} assume 1 == ~q~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {764#false} is VALID [2020-07-17 22:46:07,781 INFO L280 TraceCheckUtils]: 15: Hoare triple {764#false} assume 0 != #t~nondet5;havoc #t~nondet5; {764#false} is VALID [2020-07-17 22:46:07,782 INFO L280 TraceCheckUtils]: 16: Hoare triple {764#false} ~method_id~0 := 4; {764#false} is VALID [2020-07-17 22:46:07,782 INFO L280 TraceCheckUtils]: 17: Hoare triple {764#false} assume 0 != ~this_sink~0; {764#false} is VALID [2020-07-17 22:46:07,782 INFO L280 TraceCheckUtils]: 18: Hoare triple {764#false} assume !false; {764#false} is VALID [2020-07-17 22:46:07,784 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:46:07,789 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429995766] [2020-07-17 22:46:07,790 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:46:07,790 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-17 22:46:07,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142573740] [2020-07-17 22:46:07,791 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2020-07-17 22:46:07,791 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:46:07,791 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-17 22:46:07,818 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:46:07,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-17 22:46:07,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:46:07,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-17 22:46:07,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-17 22:46:07,820 INFO L87 Difference]: Start difference. First operand 64 states and 94 transitions. Second operand 4 states. [2020-07-17 22:46:08,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:46:08,188 INFO L93 Difference]: Finished difference Result 113 states and 169 transitions. [2020-07-17 22:46:08,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-17 22:46:08,188 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2020-07-17 22:46:08,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:46:08,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:46:08,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 167 transitions. [2020-07-17 22:46:08,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:46:08,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 167 transitions. [2020-07-17 22:46:08,203 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 167 transitions. [2020-07-17 22:46:08,465 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 167 edges. 167 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:46:08,467 INFO L225 Difference]: With dead ends: 113 [2020-07-17 22:46:08,467 INFO L226 Difference]: Without dead ends: 56 [2020-07-17 22:46:08,468 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:46:08,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2020-07-17 22:46:08,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2020-07-17 22:46:08,506 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:46:08,507 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 56 states. [2020-07-17 22:46:08,507 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 56 states. [2020-07-17 22:46:08,507 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 56 states. [2020-07-17 22:46:08,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:46:08,511 INFO L93 Difference]: Finished difference Result 56 states and 80 transitions. [2020-07-17 22:46:08,511 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 80 transitions. [2020-07-17 22:46:08,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:46:08,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:46:08,512 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 56 states. [2020-07-17 22:46:08,512 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 56 states. [2020-07-17 22:46:08,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:46:08,516 INFO L93 Difference]: Finished difference Result 56 states and 80 transitions. [2020-07-17 22:46:08,516 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 80 transitions. [2020-07-17 22:46:08,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:46:08,517 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:46:08,517 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:46:08,518 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:46:08,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-07-17 22:46:08,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 80 transitions. [2020-07-17 22:46:08,521 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 80 transitions. Word has length 19 [2020-07-17 22:46:08,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:46:08,522 INFO L479 AbstractCegarLoop]: Abstraction has 56 states and 80 transitions. [2020-07-17 22:46:08,522 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-17 22:46:08,522 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 80 transitions. [2020-07-17 22:46:08,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-17 22:46:08,523 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:46:08,524 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:46:08,524 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-17 22:46:08,524 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:46:08,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:46:08,525 INFO L82 PathProgramCache]: Analyzing trace with hash -2054021688, now seen corresponding path program 1 times [2020-07-17 22:46:08,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:46:08,525 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735505992] [2020-07-17 22:46:08,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:46:08,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:46:08,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:46:08,632 INFO L280 TraceCheckUtils]: 0: Hoare triple {1084#(and (= ~m_connect_1~0 |old(~m_connect_1~0)|) (= ~m_close~0 |old(~m_close~0)|) (= ~m_PipedOutputStream~0 |old(~m_PipedOutputStream~0)|) (= ~m_write~0 |old(~m_write~0)|) (= ~m_flush~0 |old(~m_flush~0)|) (= ~m_connect_2~0 |old(~m_connect_2~0)|))} ~m_flush~0 := 1;~m_PipedOutputStream~0 := 2;~m_close~0 := 3;~m_write~0 := 4;~m_connect_1~0 := 5;~m_connect_2~0 := 6; {1078#true} is VALID [2020-07-17 22:46:08,632 INFO L280 TraceCheckUtils]: 1: Hoare triple {1078#true} assume true; {1078#true} is VALID [2020-07-17 22:46:08,633 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1078#true} {1078#true} #324#return; {1078#true} is VALID [2020-07-17 22:46:08,635 INFO L263 TraceCheckUtils]: 0: Hoare triple {1078#true} call ULTIMATE.init(); {1084#(and (= ~m_connect_1~0 |old(~m_connect_1~0)|) (= ~m_close~0 |old(~m_close~0)|) (= ~m_PipedOutputStream~0 |old(~m_PipedOutputStream~0)|) (= ~m_write~0 |old(~m_write~0)|) (= ~m_flush~0 |old(~m_flush~0)|) (= ~m_connect_2~0 |old(~m_connect_2~0)|))} is VALID [2020-07-17 22:46:08,636 INFO L280 TraceCheckUtils]: 1: Hoare triple {1084#(and (= ~m_connect_1~0 |old(~m_connect_1~0)|) (= ~m_close~0 |old(~m_close~0)|) (= ~m_PipedOutputStream~0 |old(~m_PipedOutputStream~0)|) (= ~m_write~0 |old(~m_write~0)|) (= ~m_flush~0 |old(~m_flush~0)|) (= ~m_connect_2~0 |old(~m_connect_2~0)|))} ~m_flush~0 := 1;~m_PipedOutputStream~0 := 2;~m_close~0 := 3;~m_write~0 := 4;~m_connect_1~0 := 5;~m_connect_2~0 := 6; {1078#true} is VALID [2020-07-17 22:46:08,636 INFO L280 TraceCheckUtils]: 2: Hoare triple {1078#true} assume true; {1078#true} is VALID [2020-07-17 22:46:08,636 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1078#true} {1078#true} #324#return; {1078#true} is VALID [2020-07-17 22:46:08,637 INFO L263 TraceCheckUtils]: 4: Hoare triple {1078#true} call #t~ret22 := main(); {1078#true} is VALID [2020-07-17 22:46:08,637 INFO L280 TraceCheckUtils]: 5: Hoare triple {1078#true} ~q~0 := 0;havoc ~method_id~0;~this_sink~0 := 0;~this_sinkConnected~0 := 0; {1078#true} is VALID [2020-07-17 22:46:08,637 INFO L280 TraceCheckUtils]: 6: Hoare triple {1078#true} goto; {1078#true} is VALID [2020-07-17 22:46:08,638 INFO L280 TraceCheckUtils]: 7: Hoare triple {1078#true} assume !false;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~P1~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~P2~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~P3~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~P4~0 := #t~nondet3;havoc #t~nondet3; {1078#true} is VALID [2020-07-17 22:46:08,638 INFO L280 TraceCheckUtils]: 8: Hoare triple {1078#true} assume 0 == ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1078#true} is VALID [2020-07-17 22:46:08,641 INFO L280 TraceCheckUtils]: 9: Hoare triple {1078#true} assume 0 != #t~nondet4;havoc #t~nondet4; {1078#true} is VALID [2020-07-17 22:46:08,642 INFO L280 TraceCheckUtils]: 10: Hoare triple {1078#true} ~method_id~0 := 2; {1078#true} is VALID [2020-07-17 22:46:08,643 INFO L280 TraceCheckUtils]: 11: Hoare triple {1078#true} assume !false;~q~0 := 2;~this_sink~0 := 0;~this_sinkConnected~0 := 0; {1083#(= 0 main_~this_sink~0)} is VALID [2020-07-17 22:46:08,645 INFO L280 TraceCheckUtils]: 12: Hoare triple {1083#(= 0 main_~this_sink~0)} assume !false;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~P1~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~P2~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~P3~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~P4~0 := #t~nondet3;havoc #t~nondet3; {1083#(= 0 main_~this_sink~0)} is VALID [2020-07-17 22:46:08,646 INFO L280 TraceCheckUtils]: 13: Hoare triple {1083#(= 0 main_~this_sink~0)} assume !(0 == ~q~0); {1083#(= 0 main_~this_sink~0)} is VALID [2020-07-17 22:46:08,647 INFO L280 TraceCheckUtils]: 14: Hoare triple {1083#(= 0 main_~this_sink~0)} assume !(1 == ~q~0); {1083#(= 0 main_~this_sink~0)} is VALID [2020-07-17 22:46:08,648 INFO L280 TraceCheckUtils]: 15: Hoare triple {1083#(= 0 main_~this_sink~0)} assume 2 == ~q~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {1083#(= 0 main_~this_sink~0)} is VALID [2020-07-17 22:46:08,650 INFO L280 TraceCheckUtils]: 16: Hoare triple {1083#(= 0 main_~this_sink~0)} assume !(0 != #t~nondet8);havoc #t~nondet8;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; {1083#(= 0 main_~this_sink~0)} is VALID [2020-07-17 22:46:08,651 INFO L280 TraceCheckUtils]: 17: Hoare triple {1083#(= 0 main_~this_sink~0)} assume !(0 != #t~nondet9);havoc #t~nondet9;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647; {1083#(= 0 main_~this_sink~0)} is VALID [2020-07-17 22:46:08,652 INFO L280 TraceCheckUtils]: 18: Hoare triple {1083#(= 0 main_~this_sink~0)} assume !(0 != #t~nondet10);havoc #t~nondet10;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647; {1083#(= 0 main_~this_sink~0)} is VALID [2020-07-17 22:46:08,654 INFO L280 TraceCheckUtils]: 19: Hoare triple {1083#(= 0 main_~this_sink~0)} assume !(0 != #t~nondet11);havoc #t~nondet11;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647; {1083#(= 0 main_~this_sink~0)} is VALID [2020-07-17 22:46:08,655 INFO L280 TraceCheckUtils]: 20: Hoare triple {1083#(= 0 main_~this_sink~0)} assume 0 != #t~nondet12;havoc #t~nondet12; {1083#(= 0 main_~this_sink~0)} is VALID [2020-07-17 22:46:08,656 INFO L280 TraceCheckUtils]: 21: Hoare triple {1083#(= 0 main_~this_sink~0)} ~method_id~0 := 4; {1083#(= 0 main_~this_sink~0)} is VALID [2020-07-17 22:46:08,657 INFO L280 TraceCheckUtils]: 22: Hoare triple {1083#(= 0 main_~this_sink~0)} assume 0 != ~this_sink~0; {1079#false} is VALID [2020-07-17 22:46:08,658 INFO L280 TraceCheckUtils]: 23: Hoare triple {1079#false} assume !false; {1079#false} is VALID [2020-07-17 22:46:08,659 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:46:08,660 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735505992] [2020-07-17 22:46:08,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:46:08,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-17 22:46:08,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624544536] [2020-07-17 22:46:08,661 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-07-17 22:46:08,662 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:46:08,662 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-17 22:46:08,692 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:46:08,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-17 22:46:08,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:46:08,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-17 22:46:08,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-17 22:46:08,694 INFO L87 Difference]: Start difference. First operand 56 states and 80 transitions. Second operand 4 states. [2020-07-17 22:46:09,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:46:09,264 INFO L93 Difference]: Finished difference Result 140 states and 210 transitions. [2020-07-17 22:46:09,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-17 22:46:09,265 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-07-17 22:46:09,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:46:09,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:46:09,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 208 transitions. [2020-07-17 22:46:09,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:46:09,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 208 transitions. [2020-07-17 22:46:09,272 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 208 transitions. [2020-07-17 22:46:09,561 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 208 edges. 208 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:46:09,565 INFO L225 Difference]: With dead ends: 140 [2020-07-17 22:46:09,565 INFO L226 Difference]: Without dead ends: 94 [2020-07-17 22:46:09,566 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:46:09,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2020-07-17 22:46:09,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2020-07-17 22:46:09,603 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:46:09,603 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand 91 states. [2020-07-17 22:46:09,604 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand 91 states. [2020-07-17 22:46:09,604 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 91 states. [2020-07-17 22:46:09,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:46:09,609 INFO L93 Difference]: Finished difference Result 94 states and 134 transitions. [2020-07-17 22:46:09,609 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 134 transitions. [2020-07-17 22:46:09,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:46:09,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:46:09,610 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand 94 states. [2020-07-17 22:46:09,610 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 94 states. [2020-07-17 22:46:09,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:46:09,615 INFO L93 Difference]: Finished difference Result 94 states and 134 transitions. [2020-07-17 22:46:09,615 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 134 transitions. [2020-07-17 22:46:09,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:46:09,615 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:46:09,616 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:46:09,616 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:46:09,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-07-17 22:46:09,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 132 transitions. [2020-07-17 22:46:09,620 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 132 transitions. Word has length 24 [2020-07-17 22:46:09,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:46:09,621 INFO L479 AbstractCegarLoop]: Abstraction has 91 states and 132 transitions. [2020-07-17 22:46:09,621 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-17 22:46:09,621 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 132 transitions. [2020-07-17 22:46:09,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-17 22:46:09,622 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:46:09,622 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:46:09,622 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-17 22:46:09,622 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:46:09,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:46:09,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1279925660, now seen corresponding path program 1 times [2020-07-17 22:46:09,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:46:09,623 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257073902] [2020-07-17 22:46:09,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:46:09,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:46:09,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:46:09,695 INFO L280 TraceCheckUtils]: 0: Hoare triple {1541#(and (= ~m_connect_1~0 |old(~m_connect_1~0)|) (= ~m_close~0 |old(~m_close~0)|) (= ~m_PipedOutputStream~0 |old(~m_PipedOutputStream~0)|) (= ~m_write~0 |old(~m_write~0)|) (= ~m_flush~0 |old(~m_flush~0)|) (= ~m_connect_2~0 |old(~m_connect_2~0)|))} ~m_flush~0 := 1;~m_PipedOutputStream~0 := 2;~m_close~0 := 3;~m_write~0 := 4;~m_connect_1~0 := 5;~m_connect_2~0 := 6; {1535#true} is VALID [2020-07-17 22:46:09,696 INFO L280 TraceCheckUtils]: 1: Hoare triple {1535#true} assume true; {1535#true} is VALID [2020-07-17 22:46:09,696 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1535#true} {1535#true} #324#return; {1535#true} is VALID [2020-07-17 22:46:09,697 INFO L263 TraceCheckUtils]: 0: Hoare triple {1535#true} call ULTIMATE.init(); {1541#(and (= ~m_connect_1~0 |old(~m_connect_1~0)|) (= ~m_close~0 |old(~m_close~0)|) (= ~m_PipedOutputStream~0 |old(~m_PipedOutputStream~0)|) (= ~m_write~0 |old(~m_write~0)|) (= ~m_flush~0 |old(~m_flush~0)|) (= ~m_connect_2~0 |old(~m_connect_2~0)|))} is VALID [2020-07-17 22:46:09,697 INFO L280 TraceCheckUtils]: 1: Hoare triple {1541#(and (= ~m_connect_1~0 |old(~m_connect_1~0)|) (= ~m_close~0 |old(~m_close~0)|) (= ~m_PipedOutputStream~0 |old(~m_PipedOutputStream~0)|) (= ~m_write~0 |old(~m_write~0)|) (= ~m_flush~0 |old(~m_flush~0)|) (= ~m_connect_2~0 |old(~m_connect_2~0)|))} ~m_flush~0 := 1;~m_PipedOutputStream~0 := 2;~m_close~0 := 3;~m_write~0 := 4;~m_connect_1~0 := 5;~m_connect_2~0 := 6; {1535#true} is VALID [2020-07-17 22:46:09,698 INFO L280 TraceCheckUtils]: 2: Hoare triple {1535#true} assume true; {1535#true} is VALID [2020-07-17 22:46:09,698 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1535#true} {1535#true} #324#return; {1535#true} is VALID [2020-07-17 22:46:09,698 INFO L263 TraceCheckUtils]: 4: Hoare triple {1535#true} call #t~ret22 := main(); {1535#true} is VALID [2020-07-17 22:46:09,699 INFO L280 TraceCheckUtils]: 5: Hoare triple {1535#true} ~q~0 := 0;havoc ~method_id~0;~this_sink~0 := 0;~this_sinkConnected~0 := 0; {1535#true} is VALID [2020-07-17 22:46:09,699 INFO L280 TraceCheckUtils]: 6: Hoare triple {1535#true} goto; {1535#true} is VALID [2020-07-17 22:46:09,699 INFO L280 TraceCheckUtils]: 7: Hoare triple {1535#true} assume !false;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~P1~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~P2~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~P3~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~P4~0 := #t~nondet3;havoc #t~nondet3; {1535#true} is VALID [2020-07-17 22:46:09,700 INFO L280 TraceCheckUtils]: 8: Hoare triple {1535#true} assume 0 == ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1535#true} is VALID [2020-07-17 22:46:09,700 INFO L280 TraceCheckUtils]: 9: Hoare triple {1535#true} assume 0 != #t~nondet4;havoc #t~nondet4; {1535#true} is VALID [2020-07-17 22:46:09,700 INFO L280 TraceCheckUtils]: 10: Hoare triple {1535#true} ~method_id~0 := 2; {1535#true} is VALID [2020-07-17 22:46:09,701 INFO L280 TraceCheckUtils]: 11: Hoare triple {1535#true} assume !false;~q~0 := 2;~this_sink~0 := 0;~this_sinkConnected~0 := 0; {1540#(= 2 main_~q~0)} is VALID [2020-07-17 22:46:09,702 INFO L280 TraceCheckUtils]: 12: Hoare triple {1540#(= 2 main_~q~0)} assume !false;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~P1~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~P2~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~P3~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~P4~0 := #t~nondet3;havoc #t~nondet3; {1540#(= 2 main_~q~0)} is VALID [2020-07-17 22:46:09,702 INFO L280 TraceCheckUtils]: 13: Hoare triple {1540#(= 2 main_~q~0)} assume !(0 == ~q~0); {1540#(= 2 main_~q~0)} is VALID [2020-07-17 22:46:09,703 INFO L280 TraceCheckUtils]: 14: Hoare triple {1540#(= 2 main_~q~0)} assume !(1 == ~q~0); {1540#(= 2 main_~q~0)} is VALID [2020-07-17 22:46:09,703 INFO L280 TraceCheckUtils]: 15: Hoare triple {1540#(= 2 main_~q~0)} assume !(2 == ~q~0); {1536#false} is VALID [2020-07-17 22:46:09,704 INFO L280 TraceCheckUtils]: 16: Hoare triple {1536#false} assume 3 == ~q~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647; {1536#false} is VALID [2020-07-17 22:46:09,704 INFO L280 TraceCheckUtils]: 17: Hoare triple {1536#false} assume !(0 != #t~nondet15);havoc #t~nondet15;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647; {1536#false} is VALID [2020-07-17 22:46:09,704 INFO L280 TraceCheckUtils]: 18: Hoare triple {1536#false} assume !(0 != #t~nondet16);havoc #t~nondet16;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647; {1536#false} is VALID [2020-07-17 22:46:09,705 INFO L280 TraceCheckUtils]: 19: Hoare triple {1536#false} assume !(0 != #t~nondet17);havoc #t~nondet17;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647; {1536#false} is VALID [2020-07-17 22:46:09,705 INFO L280 TraceCheckUtils]: 20: Hoare triple {1536#false} assume !(0 != #t~nondet18);havoc #t~nondet18;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647; {1536#false} is VALID [2020-07-17 22:46:09,705 INFO L280 TraceCheckUtils]: 21: Hoare triple {1536#false} assume 0 != #t~nondet19;havoc #t~nondet19; {1536#false} is VALID [2020-07-17 22:46:09,705 INFO L280 TraceCheckUtils]: 22: Hoare triple {1536#false} ~method_id~0 := 4; {1536#false} is VALID [2020-07-17 22:46:09,706 INFO L280 TraceCheckUtils]: 23: Hoare triple {1536#false} assume 0 == ~this_sink~0; {1536#false} is VALID [2020-07-17 22:46:09,706 INFO L280 TraceCheckUtils]: 24: Hoare triple {1536#false} assume !false; {1536#false} is VALID [2020-07-17 22:46:09,707 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:46:09,707 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257073902] [2020-07-17 22:46:09,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:46:09,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-17 22:46:09,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515471313] [2020-07-17 22:46:09,708 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2020-07-17 22:46:09,709 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:46:09,709 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-17 22:46:09,736 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:46:09,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-17 22:46:09,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:46:09,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-17 22:46:09,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-17 22:46:09,738 INFO L87 Difference]: Start difference. First operand 91 states and 132 transitions. Second operand 4 states. [2020-07-17 22:46:10,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:46:10,130 INFO L93 Difference]: Finished difference Result 180 states and 262 transitions. [2020-07-17 22:46:10,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-17 22:46:10,131 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2020-07-17 22:46:10,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:46:10,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:46:10,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2020-07-17 22:46:10,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:46:10,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2020-07-17 22:46:10,138 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 151 transitions. [2020-07-17 22:46:10,371 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:46:10,374 INFO L225 Difference]: With dead ends: 180 [2020-07-17 22:46:10,374 INFO L226 Difference]: Without dead ends: 101 [2020-07-17 22:46:10,376 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:46:10,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2020-07-17 22:46:10,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2020-07-17 22:46:10,441 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:46:10,441 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand 99 states. [2020-07-17 22:46:10,441 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 99 states. [2020-07-17 22:46:10,441 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 99 states. [2020-07-17 22:46:10,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:46:10,446 INFO L93 Difference]: Finished difference Result 101 states and 141 transitions. [2020-07-17 22:46:10,446 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 141 transitions. [2020-07-17 22:46:10,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:46:10,447 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:46:10,447 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand 101 states. [2020-07-17 22:46:10,447 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 101 states. [2020-07-17 22:46:10,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:46:10,452 INFO L93 Difference]: Finished difference Result 101 states and 141 transitions. [2020-07-17 22:46:10,452 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 141 transitions. [2020-07-17 22:46:10,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:46:10,453 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:46:10,453 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:46:10,453 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:46:10,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2020-07-17 22:46:10,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 140 transitions. [2020-07-17 22:46:10,458 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 140 transitions. Word has length 25 [2020-07-17 22:46:10,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:46:10,458 INFO L479 AbstractCegarLoop]: Abstraction has 99 states and 140 transitions. [2020-07-17 22:46:10,459 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-17 22:46:10,459 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 140 transitions. [2020-07-17 22:46:10,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-07-17 22:46:10,460 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:46:10,460 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-07-17 22:46:10,460 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-17 22:46:10,461 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:46:10,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:46:10,461 INFO L82 PathProgramCache]: Analyzing trace with hash -964230168, now seen corresponding path program 1 times [2020-07-17 22:46:10,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:46:10,462 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590098403] [2020-07-17 22:46:10,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:46:10,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:46:10,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:46:10,582 INFO L280 TraceCheckUtils]: 0: Hoare triple {2066#(and (= ~m_connect_1~0 |old(~m_connect_1~0)|) (= ~m_close~0 |old(~m_close~0)|) (= ~m_PipedOutputStream~0 |old(~m_PipedOutputStream~0)|) (= ~m_write~0 |old(~m_write~0)|) (= ~m_flush~0 |old(~m_flush~0)|) (= ~m_connect_2~0 |old(~m_connect_2~0)|))} ~m_flush~0 := 1;~m_PipedOutputStream~0 := 2;~m_close~0 := 3;~m_write~0 := 4;~m_connect_1~0 := 5;~m_connect_2~0 := 6; {2060#true} is VALID [2020-07-17 22:46:10,582 INFO L280 TraceCheckUtils]: 1: Hoare triple {2060#true} assume true; {2060#true} is VALID [2020-07-17 22:46:10,583 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2060#true} {2060#true} #324#return; {2060#true} is VALID [2020-07-17 22:46:10,584 INFO L263 TraceCheckUtils]: 0: Hoare triple {2060#true} call ULTIMATE.init(); {2066#(and (= ~m_connect_1~0 |old(~m_connect_1~0)|) (= ~m_close~0 |old(~m_close~0)|) (= ~m_PipedOutputStream~0 |old(~m_PipedOutputStream~0)|) (= ~m_write~0 |old(~m_write~0)|) (= ~m_flush~0 |old(~m_flush~0)|) (= ~m_connect_2~0 |old(~m_connect_2~0)|))} is VALID [2020-07-17 22:46:10,585 INFO L280 TraceCheckUtils]: 1: Hoare triple {2066#(and (= ~m_connect_1~0 |old(~m_connect_1~0)|) (= ~m_close~0 |old(~m_close~0)|) (= ~m_PipedOutputStream~0 |old(~m_PipedOutputStream~0)|) (= ~m_write~0 |old(~m_write~0)|) (= ~m_flush~0 |old(~m_flush~0)|) (= ~m_connect_2~0 |old(~m_connect_2~0)|))} ~m_flush~0 := 1;~m_PipedOutputStream~0 := 2;~m_close~0 := 3;~m_write~0 := 4;~m_connect_1~0 := 5;~m_connect_2~0 := 6; {2060#true} is VALID [2020-07-17 22:46:10,585 INFO L280 TraceCheckUtils]: 2: Hoare triple {2060#true} assume true; {2060#true} is VALID [2020-07-17 22:46:10,585 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2060#true} {2060#true} #324#return; {2060#true} is VALID [2020-07-17 22:46:10,586 INFO L263 TraceCheckUtils]: 4: Hoare triple {2060#true} call #t~ret22 := main(); {2060#true} is VALID [2020-07-17 22:46:10,586 INFO L280 TraceCheckUtils]: 5: Hoare triple {2060#true} ~q~0 := 0;havoc ~method_id~0;~this_sink~0 := 0;~this_sinkConnected~0 := 0; {2060#true} is VALID [2020-07-17 22:46:10,586 INFO L280 TraceCheckUtils]: 6: Hoare triple {2060#true} goto; {2060#true} is VALID [2020-07-17 22:46:10,586 INFO L280 TraceCheckUtils]: 7: Hoare triple {2060#true} assume !false;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~P1~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~P2~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~P3~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~P4~0 := #t~nondet3;havoc #t~nondet3; {2060#true} is VALID [2020-07-17 22:46:10,587 INFO L280 TraceCheckUtils]: 8: Hoare triple {2060#true} assume 0 == ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {2060#true} is VALID [2020-07-17 22:46:10,587 INFO L280 TraceCheckUtils]: 9: Hoare triple {2060#true} assume 0 != #t~nondet4;havoc #t~nondet4; {2060#true} is VALID [2020-07-17 22:46:10,587 INFO L280 TraceCheckUtils]: 10: Hoare triple {2060#true} ~method_id~0 := 2; {2060#true} is VALID [2020-07-17 22:46:10,588 INFO L280 TraceCheckUtils]: 11: Hoare triple {2060#true} assume !false;~q~0 := 2;~this_sink~0 := 0;~this_sinkConnected~0 := 0; {2060#true} is VALID [2020-07-17 22:46:10,588 INFO L280 TraceCheckUtils]: 12: Hoare triple {2060#true} assume !false;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~P1~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~P2~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~P3~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~P4~0 := #t~nondet3;havoc #t~nondet3; {2060#true} is VALID [2020-07-17 22:46:10,588 INFO L280 TraceCheckUtils]: 13: Hoare triple {2060#true} assume !(0 == ~q~0); {2060#true} is VALID [2020-07-17 22:46:10,588 INFO L280 TraceCheckUtils]: 14: Hoare triple {2060#true} assume !(1 == ~q~0); {2060#true} is VALID [2020-07-17 22:46:10,588 INFO L280 TraceCheckUtils]: 15: Hoare triple {2060#true} assume 2 == ~q~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {2060#true} is VALID [2020-07-17 22:46:10,589 INFO L280 TraceCheckUtils]: 16: Hoare triple {2060#true} assume !(0 != #t~nondet8);havoc #t~nondet8;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; {2060#true} is VALID [2020-07-17 22:46:10,589 INFO L280 TraceCheckUtils]: 17: Hoare triple {2060#true} assume !(0 != #t~nondet9);havoc #t~nondet9;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647; {2060#true} is VALID [2020-07-17 22:46:10,589 INFO L280 TraceCheckUtils]: 18: Hoare triple {2060#true} assume !(0 != #t~nondet10);havoc #t~nondet10;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647; {2060#true} is VALID [2020-07-17 22:46:10,593 INFO L280 TraceCheckUtils]: 19: Hoare triple {2060#true} assume !(0 != #t~nondet11);havoc #t~nondet11;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647; {2060#true} is VALID [2020-07-17 22:46:10,593 INFO L280 TraceCheckUtils]: 20: Hoare triple {2060#true} assume !(0 != #t~nondet12);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647; {2060#true} is VALID [2020-07-17 22:46:10,593 INFO L280 TraceCheckUtils]: 21: Hoare triple {2060#true} assume 0 != #t~nondet13;havoc #t~nondet13; {2060#true} is VALID [2020-07-17 22:46:10,594 INFO L280 TraceCheckUtils]: 22: Hoare triple {2060#true} assume 1 != ~P2~0 && 0 != ~P1~0;~method_id~0 := 5; {2060#true} is VALID [2020-07-17 22:46:10,595 INFO L280 TraceCheckUtils]: 23: Hoare triple {2060#true} assume !((0 != ~this_sink~0 && 0 != ~P1~0) && 1 != ~P2~0 && 0 != ~P1~0);~q~0 := 3;~this_sink~0 := ~P1~0;~this_sinkConnected~0 := 1; {2065#(<= 3 main_~q~0)} is VALID [2020-07-17 22:46:10,596 INFO L280 TraceCheckUtils]: 24: Hoare triple {2065#(<= 3 main_~q~0)} assume !false;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~P1~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~P2~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~P3~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~P4~0 := #t~nondet3;havoc #t~nondet3; {2065#(<= 3 main_~q~0)} is VALID [2020-07-17 22:46:10,597 INFO L280 TraceCheckUtils]: 25: Hoare triple {2065#(<= 3 main_~q~0)} assume !(0 == ~q~0); {2065#(<= 3 main_~q~0)} is VALID [2020-07-17 22:46:10,597 INFO L280 TraceCheckUtils]: 26: Hoare triple {2065#(<= 3 main_~q~0)} assume !(1 == ~q~0); {2065#(<= 3 main_~q~0)} is VALID [2020-07-17 22:46:10,598 INFO L280 TraceCheckUtils]: 27: Hoare triple {2065#(<= 3 main_~q~0)} assume 2 == ~q~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {2061#false} is VALID [2020-07-17 22:46:10,599 INFO L280 TraceCheckUtils]: 28: Hoare triple {2061#false} assume !(0 != #t~nondet8);havoc #t~nondet8;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; {2061#false} is VALID [2020-07-17 22:46:10,599 INFO L280 TraceCheckUtils]: 29: Hoare triple {2061#false} assume !(0 != #t~nondet9);havoc #t~nondet9;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647; {2061#false} is VALID [2020-07-17 22:46:10,600 INFO L280 TraceCheckUtils]: 30: Hoare triple {2061#false} assume !(0 != #t~nondet10);havoc #t~nondet10;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647; {2061#false} is VALID [2020-07-17 22:46:10,600 INFO L280 TraceCheckUtils]: 31: Hoare triple {2061#false} assume !(0 != #t~nondet11);havoc #t~nondet11;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647; {2061#false} is VALID [2020-07-17 22:46:10,600 INFO L280 TraceCheckUtils]: 32: Hoare triple {2061#false} assume 0 != #t~nondet12;havoc #t~nondet12; {2061#false} is VALID [2020-07-17 22:46:10,601 INFO L280 TraceCheckUtils]: 33: Hoare triple {2061#false} ~method_id~0 := 4; {2061#false} is VALID [2020-07-17 22:46:10,601 INFO L280 TraceCheckUtils]: 34: Hoare triple {2061#false} assume 0 != ~this_sink~0; {2061#false} is VALID [2020-07-17 22:46:10,601 INFO L280 TraceCheckUtils]: 35: Hoare triple {2061#false} assume !false; {2061#false} is VALID [2020-07-17 22:46:10,604 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-17 22:46:10,604 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590098403] [2020-07-17 22:46:10,604 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:46:10,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-17 22:46:10,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201602985] [2020-07-17 22:46:10,605 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2020-07-17 22:46:10,606 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:46:10,606 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-17 22:46:10,656 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:46:10,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-17 22:46:10,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:46:10,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-17 22:46:10,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-17 22:46:10,658 INFO L87 Difference]: Start difference. First operand 99 states and 140 transitions. Second operand 4 states. [2020-07-17 22:46:10,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:46:10,994 INFO L93 Difference]: Finished difference Result 164 states and 234 transitions. [2020-07-17 22:46:10,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-17 22:46:10,994 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2020-07-17 22:46:10,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:46:10,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:46:10,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 142 transitions. [2020-07-17 22:46:10,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:46:11,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 142 transitions. [2020-07-17 22:46:11,000 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 142 transitions. [2020-07-17 22:46:11,188 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:46:11,194 INFO L225 Difference]: With dead ends: 164 [2020-07-17 22:46:11,194 INFO L226 Difference]: Without dead ends: 77 [2020-07-17 22:46:11,195 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:46:11,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-07-17 22:46:11,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2020-07-17 22:46:11,264 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:46:11,264 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand 77 states. [2020-07-17 22:46:11,264 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 77 states. [2020-07-17 22:46:11,264 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 77 states. [2020-07-17 22:46:11,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:46:11,269 INFO L93 Difference]: Finished difference Result 77 states and 105 transitions. [2020-07-17 22:46:11,269 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 105 transitions. [2020-07-17 22:46:11,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:46:11,270 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:46:11,270 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 77 states. [2020-07-17 22:46:11,270 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 77 states. [2020-07-17 22:46:11,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:46:11,274 INFO L93 Difference]: Finished difference Result 77 states and 105 transitions. [2020-07-17 22:46:11,274 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 105 transitions. [2020-07-17 22:46:11,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:46:11,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:46:11,274 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:46:11,275 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:46:11,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-07-17 22:46:11,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 105 transitions. [2020-07-17 22:46:11,278 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 105 transitions. Word has length 36 [2020-07-17 22:46:11,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:46:11,279 INFO L479 AbstractCegarLoop]: Abstraction has 77 states and 105 transitions. [2020-07-17 22:46:11,279 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-17 22:46:11,279 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 105 transitions. [2020-07-17 22:46:11,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-17 22:46:11,280 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:46:11,280 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-07-17 22:46:11,280 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-17 22:46:11,280 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:46:11,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:46:11,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1856126908, now seen corresponding path program 1 times [2020-07-17 22:46:11,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:46:11,281 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784283804] [2020-07-17 22:46:11,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:46:11,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:46:11,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:46:11,382 INFO L280 TraceCheckUtils]: 0: Hoare triple {2505#(and (= ~m_connect_1~0 |old(~m_connect_1~0)|) (= ~m_close~0 |old(~m_close~0)|) (= ~m_PipedOutputStream~0 |old(~m_PipedOutputStream~0)|) (= ~m_write~0 |old(~m_write~0)|) (= ~m_flush~0 |old(~m_flush~0)|) (= ~m_connect_2~0 |old(~m_connect_2~0)|))} ~m_flush~0 := 1;~m_PipedOutputStream~0 := 2;~m_close~0 := 3;~m_write~0 := 4;~m_connect_1~0 := 5;~m_connect_2~0 := 6; {2498#true} is VALID [2020-07-17 22:46:11,382 INFO L280 TraceCheckUtils]: 1: Hoare triple {2498#true} assume true; {2498#true} is VALID [2020-07-17 22:46:11,383 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2498#true} {2498#true} #324#return; {2498#true} is VALID [2020-07-17 22:46:11,384 INFO L263 TraceCheckUtils]: 0: Hoare triple {2498#true} call ULTIMATE.init(); {2505#(and (= ~m_connect_1~0 |old(~m_connect_1~0)|) (= ~m_close~0 |old(~m_close~0)|) (= ~m_PipedOutputStream~0 |old(~m_PipedOutputStream~0)|) (= ~m_write~0 |old(~m_write~0)|) (= ~m_flush~0 |old(~m_flush~0)|) (= ~m_connect_2~0 |old(~m_connect_2~0)|))} is VALID [2020-07-17 22:46:11,384 INFO L280 TraceCheckUtils]: 1: Hoare triple {2505#(and (= ~m_connect_1~0 |old(~m_connect_1~0)|) (= ~m_close~0 |old(~m_close~0)|) (= ~m_PipedOutputStream~0 |old(~m_PipedOutputStream~0)|) (= ~m_write~0 |old(~m_write~0)|) (= ~m_flush~0 |old(~m_flush~0)|) (= ~m_connect_2~0 |old(~m_connect_2~0)|))} ~m_flush~0 := 1;~m_PipedOutputStream~0 := 2;~m_close~0 := 3;~m_write~0 := 4;~m_connect_1~0 := 5;~m_connect_2~0 := 6; {2498#true} is VALID [2020-07-17 22:46:11,385 INFO L280 TraceCheckUtils]: 2: Hoare triple {2498#true} assume true; {2498#true} is VALID [2020-07-17 22:46:11,385 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2498#true} {2498#true} #324#return; {2498#true} is VALID [2020-07-17 22:46:11,385 INFO L263 TraceCheckUtils]: 4: Hoare triple {2498#true} call #t~ret22 := main(); {2498#true} is VALID [2020-07-17 22:46:11,386 INFO L280 TraceCheckUtils]: 5: Hoare triple {2498#true} ~q~0 := 0;havoc ~method_id~0;~this_sink~0 := 0;~this_sinkConnected~0 := 0; {2498#true} is VALID [2020-07-17 22:46:11,386 INFO L280 TraceCheckUtils]: 6: Hoare triple {2498#true} goto; {2498#true} is VALID [2020-07-17 22:46:11,386 INFO L280 TraceCheckUtils]: 7: Hoare triple {2498#true} assume !false;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~P1~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~P2~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~P3~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~P4~0 := #t~nondet3;havoc #t~nondet3; {2498#true} is VALID [2020-07-17 22:46:11,386 INFO L280 TraceCheckUtils]: 8: Hoare triple {2498#true} assume 0 == ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {2498#true} is VALID [2020-07-17 22:46:11,387 INFO L280 TraceCheckUtils]: 9: Hoare triple {2498#true} assume 0 != #t~nondet4;havoc #t~nondet4; {2498#true} is VALID [2020-07-17 22:46:11,387 INFO L280 TraceCheckUtils]: 10: Hoare triple {2498#true} ~method_id~0 := 2; {2498#true} is VALID [2020-07-17 22:46:11,387 INFO L280 TraceCheckUtils]: 11: Hoare triple {2498#true} assume !false;~q~0 := 2;~this_sink~0 := 0;~this_sinkConnected~0 := 0; {2498#true} is VALID [2020-07-17 22:46:11,388 INFO L280 TraceCheckUtils]: 12: Hoare triple {2498#true} assume !false;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~P1~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~P2~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~P3~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~P4~0 := #t~nondet3;havoc #t~nondet3; {2498#true} is VALID [2020-07-17 22:46:11,388 INFO L280 TraceCheckUtils]: 13: Hoare triple {2498#true} assume !(0 == ~q~0); {2498#true} is VALID [2020-07-17 22:46:11,388 INFO L280 TraceCheckUtils]: 14: Hoare triple {2498#true} assume !(1 == ~q~0); {2498#true} is VALID [2020-07-17 22:46:11,388 INFO L280 TraceCheckUtils]: 15: Hoare triple {2498#true} assume 2 == ~q~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {2498#true} is VALID [2020-07-17 22:46:11,389 INFO L280 TraceCheckUtils]: 16: Hoare triple {2498#true} assume !(0 != #t~nondet8);havoc #t~nondet8;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; {2498#true} is VALID [2020-07-17 22:46:11,389 INFO L280 TraceCheckUtils]: 17: Hoare triple {2498#true} assume !(0 != #t~nondet9);havoc #t~nondet9;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647; {2498#true} is VALID [2020-07-17 22:46:11,389 INFO L280 TraceCheckUtils]: 18: Hoare triple {2498#true} assume !(0 != #t~nondet10);havoc #t~nondet10;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647; {2498#true} is VALID [2020-07-17 22:46:11,390 INFO L280 TraceCheckUtils]: 19: Hoare triple {2498#true} assume !(0 != #t~nondet11);havoc #t~nondet11;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647; {2498#true} is VALID [2020-07-17 22:46:11,390 INFO L280 TraceCheckUtils]: 20: Hoare triple {2498#true} assume !(0 != #t~nondet12);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647; {2498#true} is VALID [2020-07-17 22:46:11,390 INFO L280 TraceCheckUtils]: 21: Hoare triple {2498#true} assume 0 != #t~nondet13;havoc #t~nondet13; {2498#true} is VALID [2020-07-17 22:46:11,391 INFO L280 TraceCheckUtils]: 22: Hoare triple {2498#true} assume 1 != ~P2~0 && 0 != ~P1~0;~method_id~0 := 5; {2503#(not (= 0 main_~P1~0))} is VALID [2020-07-17 22:46:11,395 INFO L280 TraceCheckUtils]: 23: Hoare triple {2503#(not (= 0 main_~P1~0))} assume !((0 != ~this_sink~0 && 0 != ~P1~0) && 1 != ~P2~0 && 0 != ~P1~0);~q~0 := 3;~this_sink~0 := ~P1~0;~this_sinkConnected~0 := 1; {2504#(not (= 0 main_~this_sink~0))} is VALID [2020-07-17 22:46:11,397 INFO L280 TraceCheckUtils]: 24: Hoare triple {2504#(not (= 0 main_~this_sink~0))} assume !false;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~P1~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~P2~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~P3~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~P4~0 := #t~nondet3;havoc #t~nondet3; {2504#(not (= 0 main_~this_sink~0))} is VALID [2020-07-17 22:46:11,398 INFO L280 TraceCheckUtils]: 25: Hoare triple {2504#(not (= 0 main_~this_sink~0))} assume !(0 == ~q~0); {2504#(not (= 0 main_~this_sink~0))} is VALID [2020-07-17 22:46:11,399 INFO L280 TraceCheckUtils]: 26: Hoare triple {2504#(not (= 0 main_~this_sink~0))} assume !(1 == ~q~0); {2504#(not (= 0 main_~this_sink~0))} is VALID [2020-07-17 22:46:11,399 INFO L280 TraceCheckUtils]: 27: Hoare triple {2504#(not (= 0 main_~this_sink~0))} assume !(2 == ~q~0); {2504#(not (= 0 main_~this_sink~0))} is VALID [2020-07-17 22:46:11,400 INFO L280 TraceCheckUtils]: 28: Hoare triple {2504#(not (= 0 main_~this_sink~0))} assume 3 == ~q~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647; {2504#(not (= 0 main_~this_sink~0))} is VALID [2020-07-17 22:46:11,401 INFO L280 TraceCheckUtils]: 29: Hoare triple {2504#(not (= 0 main_~this_sink~0))} assume !(0 != #t~nondet15);havoc #t~nondet15;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647; {2504#(not (= 0 main_~this_sink~0))} is VALID [2020-07-17 22:46:11,402 INFO L280 TraceCheckUtils]: 30: Hoare triple {2504#(not (= 0 main_~this_sink~0))} assume !(0 != #t~nondet16);havoc #t~nondet16;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647; {2504#(not (= 0 main_~this_sink~0))} is VALID [2020-07-17 22:46:11,403 INFO L280 TraceCheckUtils]: 31: Hoare triple {2504#(not (= 0 main_~this_sink~0))} assume !(0 != #t~nondet17);havoc #t~nondet17;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647; {2504#(not (= 0 main_~this_sink~0))} is VALID [2020-07-17 22:46:11,404 INFO L280 TraceCheckUtils]: 32: Hoare triple {2504#(not (= 0 main_~this_sink~0))} assume !(0 != #t~nondet18);havoc #t~nondet18;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647; {2504#(not (= 0 main_~this_sink~0))} is VALID [2020-07-17 22:46:11,404 INFO L280 TraceCheckUtils]: 33: Hoare triple {2504#(not (= 0 main_~this_sink~0))} assume 0 != #t~nondet19;havoc #t~nondet19; {2504#(not (= 0 main_~this_sink~0))} is VALID [2020-07-17 22:46:11,405 INFO L280 TraceCheckUtils]: 34: Hoare triple {2504#(not (= 0 main_~this_sink~0))} ~method_id~0 := 4; {2504#(not (= 0 main_~this_sink~0))} is VALID [2020-07-17 22:46:11,405 INFO L280 TraceCheckUtils]: 35: Hoare triple {2504#(not (= 0 main_~this_sink~0))} assume 0 == ~this_sink~0; {2499#false} is VALID [2020-07-17 22:46:11,406 INFO L280 TraceCheckUtils]: 36: Hoare triple {2499#false} assume !false; {2499#false} is VALID [2020-07-17 22:46:11,408 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-17 22:46:11,409 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784283804] [2020-07-17 22:46:11,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:46:11,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-17 22:46:11,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294851751] [2020-07-17 22:46:11,410 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2020-07-17 22:46:11,410 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:46:11,410 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-17 22:46:11,452 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:46:11,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 22:46:11,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:46:11,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 22:46:11,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:46:11,453 INFO L87 Difference]: Start difference. First operand 77 states and 105 transitions. Second operand 5 states. [2020-07-17 22:46:11,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:46:11,981 INFO L93 Difference]: Finished difference Result 80 states and 108 transitions. [2020-07-17 22:46:11,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-17 22:46:11,981 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2020-07-17 22:46:11,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:46:11,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:46:11,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 107 transitions. [2020-07-17 22:46:11,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:46:11,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 107 transitions. [2020-07-17 22:46:11,999 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 107 transitions. [2020-07-17 22:46:12,177 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:46:12,177 INFO L225 Difference]: With dead ends: 80 [2020-07-17 22:46:12,177 INFO L226 Difference]: Without dead ends: 0 [2020-07-17 22:46:12,178 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-07-17 22:46:12,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-17 22:46:12,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-17 22:46:12,179 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:46:12,179 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-17 22:46:12,179 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-17 22:46:12,179 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-17 22:46:12,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:46:12,180 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-17 22:46:12,180 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:46:12,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:46:12,182 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:46:12,182 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-17 22:46:12,182 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-17 22:46:12,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:46:12,183 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-17 22:46:12,183 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:46:12,183 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:46:12,183 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:46:12,184 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:46:12,184 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:46:12,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-17 22:46:12,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-17 22:46:12,184 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2020-07-17 22:46:12,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:46:12,185 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-17 22:46:12,185 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 22:46:12,185 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:46:12,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:46:12,185 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-17 22:46:12,187 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-17 22:46:12,455 INFO L268 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-07-17 22:46:12,457 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~m_connect_1~0 |old(~m_connect_1~0)|) (= ~m_close~0 |old(~m_close~0)|) (= ~m_PipedOutputStream~0 |old(~m_PipedOutputStream~0)|) (= ~m_write~0 |old(~m_write~0)|) (= ~m_flush~0 |old(~m_flush~0)|) (= ~m_connect_2~0 |old(~m_connect_2~0)|)) [2020-07-17 22:46:12,458 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-17 22:46:12,458 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-17 22:46:12,458 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-17 22:46:12,459 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-17 22:46:12,459 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-17 22:46:12,459 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 13 344) no Hoare annotation was computed. [2020-07-17 22:46:12,459 INFO L268 CegarLoopResult]: For program point L36(lines 36 47) no Hoare annotation was computed. [2020-07-17 22:46:12,459 INFO L268 CegarLoopResult]: For program point L86(lines 86 101) no Hoare annotation was computed. [2020-07-17 22:46:12,459 INFO L268 CegarLoopResult]: For program point L53(lines 53 104) no Hoare annotation was computed. [2020-07-17 22:46:12,460 INFO L268 CegarLoopResult]: For program point L202(lines 202 217) no Hoare annotation was computed. [2020-07-17 22:46:12,461 INFO L268 CegarLoopResult]: For program point L70(lines 70 85) no Hoare annotation was computed. [2020-07-17 22:46:12,462 INFO L268 CegarLoopResult]: For program point L318(lines 318 333) no Hoare annotation was computed. [2020-07-17 22:46:12,462 INFO L268 CegarLoopResult]: For program point L186(lines 186 201) no Hoare annotation was computed. [2020-07-17 22:46:12,462 INFO L268 CegarLoopResult]: For program point L54(lines 54 69) no Hoare annotation was computed. [2020-07-17 22:46:12,462 INFO L264 CegarLoopResult]: At program point L335(lines 23 339) the Hoare annotation is: (let ((.cse0 (= 0 main_~this_sink~0))) (or (and (= 0 main_~q~0) .cse0) (and .cse0 (= 2 main_~q~0)) (and (<= 3 main_~q~0) (not .cse0)))) [2020-07-17 22:46:12,463 INFO L268 CegarLoopResult]: For program point L302(lines 302 317) no Hoare annotation was computed. [2020-07-17 22:46:12,463 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 13 344) no Hoare annotation was computed. [2020-07-17 22:46:12,463 INFO L268 CegarLoopResult]: For program point L170(lines 170 185) no Hoare annotation was computed. [2020-07-17 22:46:12,463 INFO L268 CegarLoopResult]: For program point L286(lines 286 301) no Hoare annotation was computed. [2020-07-17 22:46:12,463 INFO L268 CegarLoopResult]: For program point L154(lines 154 169) no Hoare annotation was computed. [2020-07-17 22:46:12,463 INFO L268 CegarLoopResult]: For program point L88(lines 88 99) no Hoare annotation was computed. [2020-07-17 22:46:12,464 INFO L268 CegarLoopResult]: For program point L270(lines 270 285) no Hoare annotation was computed. [2020-07-17 22:46:12,464 INFO L268 CegarLoopResult]: For program point L204(lines 204 215) no Hoare annotation was computed. [2020-07-17 22:46:12,464 INFO L268 CegarLoopResult]: For program point L138(lines 138 153) no Hoare annotation was computed. [2020-07-17 22:46:12,464 INFO L268 CegarLoopResult]: For program point L105(lines 105 220) no Hoare annotation was computed. [2020-07-17 22:46:12,466 INFO L268 CegarLoopResult]: For program point L72(lines 72 83) no Hoare annotation was computed. [2020-07-17 22:46:12,466 INFO L268 CegarLoopResult]: For program point L320(lines 320 331) no Hoare annotation was computed. [2020-07-17 22:46:12,467 INFO L268 CegarLoopResult]: For program point L254(lines 254 269) no Hoare annotation was computed. [2020-07-17 22:46:12,467 INFO L268 CegarLoopResult]: For program point L221(lines 221 336) no Hoare annotation was computed. [2020-07-17 22:46:12,467 INFO L268 CegarLoopResult]: For program point L188(lines 188 199) no Hoare annotation was computed. [2020-07-17 22:46:12,467 INFO L268 CegarLoopResult]: For program point L122(lines 122 137) no Hoare annotation was computed. [2020-07-17 22:46:12,467 INFO L268 CegarLoopResult]: For program point L56(lines 56 67) no Hoare annotation was computed. [2020-07-17 22:46:12,468 INFO L264 CegarLoopResult]: At program point L23-2(lines 23 339) the Hoare annotation is: (let ((.cse0 (= 0 main_~this_sink~0))) (or (and (= 0 main_~q~0) .cse0) (and (<= 3 main_~q~0) (not .cse0)))) [2020-07-17 22:46:12,468 INFO L268 CegarLoopResult]: For program point L23-3(lines 23 339) no Hoare annotation was computed. [2020-07-17 22:46:12,468 INFO L268 CegarLoopResult]: For program point L304(lines 304 315) no Hoare annotation was computed. [2020-07-17 22:46:12,468 INFO L268 CegarLoopResult]: For program point L238(lines 238 253) no Hoare annotation was computed. [2020-07-17 22:46:12,468 INFO L268 CegarLoopResult]: For program point L172(lines 172 183) no Hoare annotation was computed. [2020-07-17 22:46:12,469 INFO L268 CegarLoopResult]: For program point L106(lines 106 121) no Hoare annotation was computed. [2020-07-17 22:46:12,469 INFO L268 CegarLoopResult]: For program point L40(lines 40 42) no Hoare annotation was computed. [2020-07-17 22:46:12,469 INFO L268 CegarLoopResult]: For program point L288(lines 288 299) no Hoare annotation was computed. [2020-07-17 22:46:12,469 INFO L268 CegarLoopResult]: For program point L222(lines 222 237) no Hoare annotation was computed. [2020-07-17 22:46:12,469 INFO L268 CegarLoopResult]: For program point L156(lines 156 167) no Hoare annotation was computed. [2020-07-17 22:46:12,469 INFO L268 CegarLoopResult]: For program point L272(lines 272 283) no Hoare annotation was computed. [2020-07-17 22:46:12,470 INFO L268 CegarLoopResult]: For program point L140(lines 140 151) no Hoare annotation was computed. [2020-07-17 22:46:12,470 INFO L268 CegarLoopResult]: For program point L256(lines 256 267) no Hoare annotation was computed. [2020-07-17 22:46:12,470 INFO L268 CegarLoopResult]: For program point L124(lines 124 135) no Hoare annotation was computed. [2020-07-17 22:46:12,470 INFO L268 CegarLoopResult]: For program point L240(lines 240 251) no Hoare annotation was computed. [2020-07-17 22:46:12,470 INFO L268 CegarLoopResult]: For program point L108(lines 108 119) no Hoare annotation was computed. [2020-07-17 22:46:12,470 INFO L268 CegarLoopResult]: For program point L224(lines 224 235) no Hoare annotation was computed. [2020-07-17 22:46:12,471 INFO L268 CegarLoopResult]: For program point L92(lines 92 94) no Hoare annotation was computed. [2020-07-17 22:46:12,471 INFO L268 CegarLoopResult]: For program point L208(lines 208 210) no Hoare annotation was computed. [2020-07-17 22:46:12,471 INFO L268 CegarLoopResult]: For program point L76(lines 76 78) no Hoare annotation was computed. [2020-07-17 22:46:12,471 INFO L268 CegarLoopResult]: For program point L324(lines 324 326) no Hoare annotation was computed. [2020-07-17 22:46:12,471 INFO L268 CegarLoopResult]: For program point L192(lines 192 194) no Hoare annotation was computed. [2020-07-17 22:46:12,472 INFO L268 CegarLoopResult]: For program point L60(lines 60 62) no Hoare annotation was computed. [2020-07-17 22:46:12,472 INFO L268 CegarLoopResult]: For program point L308(lines 308 310) no Hoare annotation was computed. [2020-07-17 22:46:12,472 INFO L268 CegarLoopResult]: For program point L176(lines 176 178) no Hoare annotation was computed. [2020-07-17 22:46:12,472 INFO L264 CegarLoopResult]: At program point L325(lines 13 344) the Hoare annotation is: false [2020-07-17 22:46:12,473 INFO L268 CegarLoopResult]: For program point L292(lines 292 294) no Hoare annotation was computed. [2020-07-17 22:46:12,473 INFO L268 CegarLoopResult]: For program point L160(lines 160 162) no Hoare annotation was computed. [2020-07-17 22:46:12,474 INFO L268 CegarLoopResult]: For program point L276(lines 276 278) no Hoare annotation was computed. [2020-07-17 22:46:12,474 INFO L268 CegarLoopResult]: For program point L144(lines 144 146) no Hoare annotation was computed. [2020-07-17 22:46:12,474 INFO L268 CegarLoopResult]: For program point L260(lines 260 262) no Hoare annotation was computed. [2020-07-17 22:46:12,474 INFO L268 CegarLoopResult]: For program point L128(lines 128 130) no Hoare annotation was computed. [2020-07-17 22:46:12,475 INFO L268 CegarLoopResult]: For program point L244(lines 244 246) no Hoare annotation was computed. [2020-07-17 22:46:12,475 INFO L268 CegarLoopResult]: For program point L112(lines 112 114) no Hoare annotation was computed. [2020-07-17 22:46:12,475 INFO L268 CegarLoopResult]: For program point L228(lines 228 230) no Hoare annotation was computed. [2020-07-17 22:46:12,475 INFO L268 CegarLoopResult]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 343) no Hoare annotation was computed. [2020-07-17 22:46:12,475 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 13 344) the Hoare annotation is: true [2020-07-17 22:46:12,476 INFO L268 CegarLoopResult]: For program point L33(lines 33 52) no Hoare annotation was computed. [2020-07-17 22:46:12,476 INFO L268 CegarLoopResult]: For program point L34(lines 34 49) no Hoare annotation was computed. [2020-07-17 22:46:12,483 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-17 22:46:12,487 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-17 22:46:12,487 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:46:12,488 WARN L170 areAnnotationChecker]: L23-3 has no Hoare annotation [2020-07-17 22:46:12,488 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:46:12,489 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:46:12,489 WARN L170 areAnnotationChecker]: L23-3 has no Hoare annotation [2020-07-17 22:46:12,489 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2020-07-17 22:46:12,489 WARN L170 areAnnotationChecker]: L23-3 has no Hoare annotation [2020-07-17 22:46:12,489 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2020-07-17 22:46:12,489 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2020-07-17 22:46:12,489 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-17 22:46:12,489 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2020-07-17 22:46:12,490 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2020-07-17 22:46:12,490 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2020-07-17 22:46:12,490 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2020-07-17 22:46:12,490 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-17 22:46:12,490 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2020-07-17 22:46:12,490 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2020-07-17 22:46:12,490 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2020-07-17 22:46:12,490 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2020-07-17 22:46:12,490 WARN L170 areAnnotationChecker]: L105 has no Hoare annotation [2020-07-17 22:46:12,491 WARN L170 areAnnotationChecker]: L105 has no Hoare annotation [2020-07-17 22:46:12,491 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2020-07-17 22:46:12,491 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2020-07-17 22:46:12,491 WARN L170 areAnnotationChecker]: L56 has no Hoare annotation [2020-07-17 22:46:12,491 WARN L170 areAnnotationChecker]: L56 has no Hoare annotation [2020-07-17 22:46:12,491 WARN L170 areAnnotationChecker]: L70 has no Hoare annotation [2020-07-17 22:46:12,491 WARN L170 areAnnotationChecker]: L70 has no Hoare annotation [2020-07-17 22:46:12,491 WARN L170 areAnnotationChecker]: L106 has no Hoare annotation [2020-07-17 22:46:12,491 WARN L170 areAnnotationChecker]: L106 has no Hoare annotation [2020-07-17 22:46:12,492 WARN L170 areAnnotationChecker]: L221 has no Hoare annotation [2020-07-17 22:46:12,492 WARN L170 areAnnotationChecker]: L221 has no Hoare annotation [2020-07-17 22:46:12,492 WARN L170 areAnnotationChecker]: mainErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2020-07-17 22:46:12,492 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-17 22:46:12,492 WARN L170 areAnnotationChecker]: L60 has no Hoare annotation [2020-07-17 22:46:12,493 WARN L170 areAnnotationChecker]: L60 has no Hoare annotation [2020-07-17 22:46:12,493 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2020-07-17 22:46:12,493 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2020-07-17 22:46:12,493 WARN L170 areAnnotationChecker]: L86 has no Hoare annotation [2020-07-17 22:46:12,493 WARN L170 areAnnotationChecker]: L86 has no Hoare annotation [2020-07-17 22:46:12,493 WARN L170 areAnnotationChecker]: L108 has no Hoare annotation [2020-07-17 22:46:12,493 WARN L170 areAnnotationChecker]: L108 has no Hoare annotation [2020-07-17 22:46:12,493 WARN L170 areAnnotationChecker]: L122 has no Hoare annotation [2020-07-17 22:46:12,493 WARN L170 areAnnotationChecker]: L122 has no Hoare annotation [2020-07-17 22:46:12,494 WARN L170 areAnnotationChecker]: L222 has no Hoare annotation [2020-07-17 22:46:12,494 WARN L170 areAnnotationChecker]: L222 has no Hoare annotation [2020-07-17 22:46:12,494 WARN L170 areAnnotationChecker]: L76 has no Hoare annotation [2020-07-17 22:46:12,494 WARN L170 areAnnotationChecker]: L76 has no Hoare annotation [2020-07-17 22:46:12,494 WARN L170 areAnnotationChecker]: L88 has no Hoare annotation [2020-07-17 22:46:12,494 WARN L170 areAnnotationChecker]: L88 has no Hoare annotation [2020-07-17 22:46:12,494 WARN L170 areAnnotationChecker]: L112 has no Hoare annotation [2020-07-17 22:46:12,494 WARN L170 areAnnotationChecker]: L112 has no Hoare annotation [2020-07-17 22:46:12,494 WARN L170 areAnnotationChecker]: L124 has no Hoare annotation [2020-07-17 22:46:12,495 WARN L170 areAnnotationChecker]: L124 has no Hoare annotation [2020-07-17 22:46:12,495 WARN L170 areAnnotationChecker]: L138 has no Hoare annotation [2020-07-17 22:46:12,495 WARN L170 areAnnotationChecker]: L138 has no Hoare annotation [2020-07-17 22:46:12,495 WARN L170 areAnnotationChecker]: L224 has no Hoare annotation [2020-07-17 22:46:12,495 WARN L170 areAnnotationChecker]: L224 has no Hoare annotation [2020-07-17 22:46:12,495 WARN L170 areAnnotationChecker]: L238 has no Hoare annotation [2020-07-17 22:46:12,495 WARN L170 areAnnotationChecker]: L238 has no Hoare annotation [2020-07-17 22:46:12,495 WARN L170 areAnnotationChecker]: L92 has no Hoare annotation [2020-07-17 22:46:12,495 WARN L170 areAnnotationChecker]: L92 has no Hoare annotation [2020-07-17 22:46:12,496 WARN L170 areAnnotationChecker]: L128 has no Hoare annotation [2020-07-17 22:46:12,496 WARN L170 areAnnotationChecker]: L128 has no Hoare annotation [2020-07-17 22:46:12,496 WARN L170 areAnnotationChecker]: L140 has no Hoare annotation [2020-07-17 22:46:12,496 WARN L170 areAnnotationChecker]: L140 has no Hoare annotation [2020-07-17 22:46:12,496 WARN L170 areAnnotationChecker]: L154 has no Hoare annotation [2020-07-17 22:46:12,496 WARN L170 areAnnotationChecker]: L154 has no Hoare annotation [2020-07-17 22:46:12,496 WARN L170 areAnnotationChecker]: L228 has no Hoare annotation [2020-07-17 22:46:12,496 WARN L170 areAnnotationChecker]: L228 has no Hoare annotation [2020-07-17 22:46:12,496 WARN L170 areAnnotationChecker]: L240 has no Hoare annotation [2020-07-17 22:46:12,497 WARN L170 areAnnotationChecker]: L240 has no Hoare annotation [2020-07-17 22:46:12,497 WARN L170 areAnnotationChecker]: L254 has no Hoare annotation [2020-07-17 22:46:12,497 WARN L170 areAnnotationChecker]: L254 has no Hoare annotation [2020-07-17 22:46:12,497 WARN L170 areAnnotationChecker]: L144 has no Hoare annotation [2020-07-17 22:46:12,497 WARN L170 areAnnotationChecker]: L144 has no Hoare annotation [2020-07-17 22:46:12,497 WARN L170 areAnnotationChecker]: L156 has no Hoare annotation [2020-07-17 22:46:12,497 WARN L170 areAnnotationChecker]: L156 has no Hoare annotation [2020-07-17 22:46:12,497 WARN L170 areAnnotationChecker]: L170 has no Hoare annotation [2020-07-17 22:46:12,497 WARN L170 areAnnotationChecker]: L170 has no Hoare annotation [2020-07-17 22:46:12,497 WARN L170 areAnnotationChecker]: L244 has no Hoare annotation [2020-07-17 22:46:12,498 WARN L170 areAnnotationChecker]: L244 has no Hoare annotation [2020-07-17 22:46:12,498 WARN L170 areAnnotationChecker]: L256 has no Hoare annotation [2020-07-17 22:46:12,498 WARN L170 areAnnotationChecker]: L256 has no Hoare annotation [2020-07-17 22:46:12,498 WARN L170 areAnnotationChecker]: L270 has no Hoare annotation [2020-07-17 22:46:12,498 WARN L170 areAnnotationChecker]: L270 has no Hoare annotation [2020-07-17 22:46:12,498 WARN L170 areAnnotationChecker]: L160 has no Hoare annotation [2020-07-17 22:46:12,498 WARN L170 areAnnotationChecker]: L160 has no Hoare annotation [2020-07-17 22:46:12,498 WARN L170 areAnnotationChecker]: L172 has no Hoare annotation [2020-07-17 22:46:12,498 WARN L170 areAnnotationChecker]: L172 has no Hoare annotation [2020-07-17 22:46:12,499 WARN L170 areAnnotationChecker]: L186 has no Hoare annotation [2020-07-17 22:46:12,499 WARN L170 areAnnotationChecker]: L186 has no Hoare annotation [2020-07-17 22:46:12,499 WARN L170 areAnnotationChecker]: L260 has no Hoare annotation [2020-07-17 22:46:12,499 WARN L170 areAnnotationChecker]: L260 has no Hoare annotation [2020-07-17 22:46:12,499 WARN L170 areAnnotationChecker]: L272 has no Hoare annotation [2020-07-17 22:46:12,499 WARN L170 areAnnotationChecker]: L272 has no Hoare annotation [2020-07-17 22:46:12,499 WARN L170 areAnnotationChecker]: L286 has no Hoare annotation [2020-07-17 22:46:12,499 WARN L170 areAnnotationChecker]: L286 has no Hoare annotation [2020-07-17 22:46:12,499 WARN L170 areAnnotationChecker]: L176 has no Hoare annotation [2020-07-17 22:46:12,500 WARN L170 areAnnotationChecker]: L176 has no Hoare annotation [2020-07-17 22:46:12,500 WARN L170 areAnnotationChecker]: L188 has no Hoare annotation [2020-07-17 22:46:12,500 WARN L170 areAnnotationChecker]: L188 has no Hoare annotation [2020-07-17 22:46:12,500 WARN L170 areAnnotationChecker]: L202 has no Hoare annotation [2020-07-17 22:46:12,500 WARN L170 areAnnotationChecker]: L202 has no Hoare annotation [2020-07-17 22:46:12,500 WARN L170 areAnnotationChecker]: L276 has no Hoare annotation [2020-07-17 22:46:12,500 WARN L170 areAnnotationChecker]: L276 has no Hoare annotation [2020-07-17 22:46:12,500 WARN L170 areAnnotationChecker]: L288 has no Hoare annotation [2020-07-17 22:46:12,500 WARN L170 areAnnotationChecker]: L288 has no Hoare annotation [2020-07-17 22:46:12,501 WARN L170 areAnnotationChecker]: L302 has no Hoare annotation [2020-07-17 22:46:12,501 WARN L170 areAnnotationChecker]: L302 has no Hoare annotation [2020-07-17 22:46:12,501 WARN L170 areAnnotationChecker]: L192 has no Hoare annotation [2020-07-17 22:46:12,501 WARN L170 areAnnotationChecker]: L192 has no Hoare annotation [2020-07-17 22:46:12,501 WARN L170 areAnnotationChecker]: L204 has no Hoare annotation [2020-07-17 22:46:12,501 WARN L170 areAnnotationChecker]: L204 has no Hoare annotation [2020-07-17 22:46:12,501 WARN L170 areAnnotationChecker]: L292 has no Hoare annotation [2020-07-17 22:46:12,501 WARN L170 areAnnotationChecker]: L292 has no Hoare annotation [2020-07-17 22:46:12,501 WARN L170 areAnnotationChecker]: L304 has no Hoare annotation [2020-07-17 22:46:12,501 WARN L170 areAnnotationChecker]: L304 has no Hoare annotation [2020-07-17 22:46:12,502 WARN L170 areAnnotationChecker]: L318 has no Hoare annotation [2020-07-17 22:46:12,502 WARN L170 areAnnotationChecker]: L318 has no Hoare annotation [2020-07-17 22:46:12,502 WARN L170 areAnnotationChecker]: L208 has no Hoare annotation [2020-07-17 22:46:12,502 WARN L170 areAnnotationChecker]: L208 has no Hoare annotation [2020-07-17 22:46:12,502 WARN L170 areAnnotationChecker]: L308 has no Hoare annotation [2020-07-17 22:46:12,502 WARN L170 areAnnotationChecker]: L308 has no Hoare annotation [2020-07-17 22:46:12,502 WARN L170 areAnnotationChecker]: L320 has no Hoare annotation [2020-07-17 22:46:12,502 WARN L170 areAnnotationChecker]: L320 has no Hoare annotation [2020-07-17 22:46:12,502 WARN L170 areAnnotationChecker]: L324 has no Hoare annotation [2020-07-17 22:46:12,502 WARN L170 areAnnotationChecker]: L324 has no Hoare annotation [2020-07-17 22:46:12,503 INFO L163 areAnnotationChecker]: CFG has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-17 22:46:12,523 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 10:46:12 BoogieIcfgContainer [2020-07-17 22:46:12,523 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 22:46:12,528 INFO L168 Benchmark]: Toolchain (without parser) took 9270.31 ms. Allocated memory was 143.7 MB in the beginning and 326.6 MB in the end (delta: 183.0 MB). Free memory was 101.9 MB in the beginning and 150.0 MB in the end (delta: -48.2 MB). Peak memory consumption was 134.8 MB. Max. memory is 7.1 GB. [2020-07-17 22:46:12,536 INFO L168 Benchmark]: CDTParser took 1.56 ms. Allocated memory is still 143.7 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-17 22:46:12,538 INFO L168 Benchmark]: CACSL2BoogieTranslator took 484.99 ms. Allocated memory is still 143.7 MB. Free memory was 101.4 MB in the beginning and 88.3 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 7.1 GB. [2020-07-17 22:46:12,539 INFO L168 Benchmark]: Boogie Preprocessor took 197.58 ms. Allocated memory was 143.7 MB in the beginning and 199.2 MB in the end (delta: 55.6 MB). Free memory was 88.3 MB in the beginning and 176.1 MB in the end (delta: -87.8 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. [2020-07-17 22:46:12,540 INFO L168 Benchmark]: RCFGBuilder took 1007.81 ms. Allocated memory is still 199.2 MB. Free memory was 176.1 MB in the beginning and 129.4 MB in the end (delta: 46.8 MB). Peak memory consumption was 46.8 MB. Max. memory is 7.1 GB. [2020-07-17 22:46:12,543 INFO L168 Benchmark]: TraceAbstraction took 7565.47 ms. Allocated memory was 199.2 MB in the beginning and 326.6 MB in the end (delta: 127.4 MB). Free memory was 128.7 MB in the beginning and 150.0 MB in the end (delta: -21.4 MB). Peak memory consumption was 106.0 MB. Max. memory is 7.1 GB. [2020-07-17 22:46:12,551 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.56 ms. Allocated memory is still 143.7 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 484.99 ms. Allocated memory is still 143.7 MB. Free memory was 101.4 MB in the beginning and 88.3 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 197.58 ms. Allocated memory was 143.7 MB in the beginning and 199.2 MB in the end (delta: 55.6 MB). Free memory was 88.3 MB in the beginning and 176.1 MB in the end (delta: -87.8 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1007.81 ms. Allocated memory is still 199.2 MB. Free memory was 176.1 MB in the beginning and 129.4 MB in the end (delta: 46.8 MB). Peak memory consumption was 46.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7565.47 ms. Allocated memory was 199.2 MB in the beginning and 326.6 MB in the end (delta: 127.4 MB). Free memory was 128.7 MB in the beginning and 150.0 MB in the end (delta: -21.4 MB). Peak memory consumption was 106.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 343]: 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: 23]: Loop Invariant Derived loop invariant: ((0 == q && 0 == this_sink) || (0 == this_sink && 2 == q)) || (3 <= q && !(0 == this_sink)) - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: (0 == q && 0 == this_sink) || (3 <= q && !(0 == this_sink)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 73 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 7.1s, OverallIterations: 7, TraceHistogramMax: 3, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 549 SDtfs, 777 SDslu, 50 SDs, 0 SdLazy, 351 SolverSat, 47 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=99occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 7 MinimizatonAttempts, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 14 NumberOfFragments, 62 HoareAnnotationTreeSize, 7 FomulaSimplifications, 65 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 117 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 168 NumberOfCodeBlocks, 168 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 161 ConstructedInterpolants, 0 QuantifiedInterpolants, 9729 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 27/27 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...