./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-invgen/sendmail-close-angle.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-invgen/sendmail-close-angle.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 305e9c546a6cc2591d6267bc612ab5ec3e8adaa4 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 17:06:27,781 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 17:06:27,784 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 17:06:27,802 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 17:06:27,803 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 17:06:27,805 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 17:06:27,807 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 17:06:27,817 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 17:06:27,822 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 17:06:27,826 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 17:06:27,828 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 17:06:27,831 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 17:06:27,831 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 17:06:27,834 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 17:06:27,836 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 17:06:27,838 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 17:06:27,839 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 17:06:27,840 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 17:06:27,843 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 17:06:27,847 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 17:06:27,851 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 17:06:27,856 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 17:06:27,857 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 17:06:27,859 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 17:06:27,863 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 17:06:27,864 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 17:06:27,864 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 17:06:27,866 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 17:06:27,866 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 17:06:27,867 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 17:06:27,868 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 17:06:27,869 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 17:06:27,869 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 17:06:27,871 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 17:06:27,872 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 17:06:27,872 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 17:06:27,873 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 17:06:27,874 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 17:06:27,874 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 17:06:27,875 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 17:06:27,876 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 17:06:27,877 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 17:06:27,900 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 17:06:27,900 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 17:06:27,902 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 17:06:27,904 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 17:06:27,904 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 17:06:27,904 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 17:06:27,906 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 17:06:27,906 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 17:06:27,906 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 17:06:27,908 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 17:06:27,908 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 17:06:27,908 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 17:06:27,908 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 17:06:27,909 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 17:06:27,909 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 17:06:27,909 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 17:06:27,909 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 17:06:27,910 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 17:06:27,911 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 17:06:27,911 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 17:06:27,911 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 17:06:27,912 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 17:06:27,912 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 17:06:27,912 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 17:06:27,913 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 17:06:27,913 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 17:06:27,913 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 17:06:27,913 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 17:06:27,913 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 17:06:27,914 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 305e9c546a6cc2591d6267bc612ab5ec3e8adaa4 [2019-11-28 17:06:28,215 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 17:06:28,229 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 17:06:28,232 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 17:06:28,234 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 17:06:28,235 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 17:06:28,236 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/sendmail-close-angle.i [2019-11-28 17:06:28,295 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c5f73a47/8d32b52f00f54f3f9164d4a5dc17fe4c/FLAGbde1f06fb [2019-11-28 17:06:28,740 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 17:06:28,740 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/sendmail-close-angle.i [2019-11-28 17:06:28,747 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c5f73a47/8d32b52f00f54f3f9164d4a5dc17fe4c/FLAGbde1f06fb [2019-11-28 17:06:29,136 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c5f73a47/8d32b52f00f54f3f9164d4a5dc17fe4c [2019-11-28 17:06:29,140 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 17:06:29,142 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 17:06:29,143 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 17:06:29,143 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 17:06:29,148 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 17:06:29,149 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:06:29" (1/1) ... [2019-11-28 17:06:29,152 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9334ae0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:06:29, skipping insertion in model container [2019-11-28 17:06:29,152 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:06:29" (1/1) ... [2019-11-28 17:06:29,160 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 17:06:29,183 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 17:06:29,348 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:06:29,352 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 17:06:29,371 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:06:29,384 INFO L208 MainTranslator]: Completed translation [2019-11-28 17:06:29,385 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:06:29 WrapperNode [2019-11-28 17:06:29,385 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 17:06:29,386 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 17:06:29,386 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 17:06:29,386 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 17:06:29,395 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:06:29" (1/1) ... [2019-11-28 17:06:29,400 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:06:29" (1/1) ... [2019-11-28 17:06:29,486 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 17:06:29,486 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 17:06:29,487 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 17:06:29,487 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 17:06:29,494 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:06:29" (1/1) ... [2019-11-28 17:06:29,495 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:06:29" (1/1) ... [2019-11-28 17:06:29,496 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:06:29" (1/1) ... [2019-11-28 17:06:29,496 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:06:29" (1/1) ... [2019-11-28 17:06:29,499 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:06:29" (1/1) ... [2019-11-28 17:06:29,505 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:06:29" (1/1) ... [2019-11-28 17:06:29,507 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:06:29" (1/1) ... [2019-11-28 17:06:29,510 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 17:06:29,510 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 17:06:29,510 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 17:06:29,510 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 17:06:29,511 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:06:29" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 17:06:29,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 17:06:29,575 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 17:06:29,871 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 17:06:29,871 INFO L287 CfgBuilder]: Removed 21 assume(true) statements. [2019-11-28 17:06:29,872 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:06:29 BoogieIcfgContainer [2019-11-28 17:06:29,873 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 17:06:29,874 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 17:06:29,874 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 17:06:29,886 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 17:06:29,887 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 05:06:29" (1/3) ... [2019-11-28 17:06:29,893 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6207225c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:06:29, skipping insertion in model container [2019-11-28 17:06:29,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:06:29" (2/3) ... [2019-11-28 17:06:29,894 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6207225c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:06:29, skipping insertion in model container [2019-11-28 17:06:29,895 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:06:29" (3/3) ... [2019-11-28 17:06:29,900 INFO L109 eAbstractionObserver]: Analyzing ICFG sendmail-close-angle.i [2019-11-28 17:06:29,917 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 17:06:29,923 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2019-11-28 17:06:29,934 INFO L249 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-11-28 17:06:29,959 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 17:06:29,959 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 17:06:29,960 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 17:06:29,960 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 17:06:29,960 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 17:06:29,960 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 17:06:29,960 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 17:06:29,961 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 17:06:29,978 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2019-11-28 17:06:29,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-28 17:06:29,983 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:06:29,984 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:06:29,985 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:06:29,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:06:29,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1436471502, now seen corresponding path program 1 times [2019-11-28 17:06:30,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:06:30,000 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003282336] [2019-11-28 17:06:30,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:06:30,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:06:30,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:06:30,104 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003282336] [2019-11-28 17:06:30,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:06:30,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 17:06:30,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873593822] [2019-11-28 17:06:30,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-28 17:06:30,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:06:30,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 17:06:30,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 17:06:30,129 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 2 states. [2019-11-28 17:06:30,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:06:30,152 INFO L93 Difference]: Finished difference Result 85 states and 108 transitions. [2019-11-28 17:06:30,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 17:06:30,154 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2019-11-28 17:06:30,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:06:30,164 INFO L225 Difference]: With dead ends: 85 [2019-11-28 17:06:30,164 INFO L226 Difference]: Without dead ends: 40 [2019-11-28 17:06:30,168 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 17:06:30,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-11-28 17:06:30,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-11-28 17:06:30,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-28 17:06:30,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2019-11-28 17:06:30,225 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 9 [2019-11-28 17:06:30,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:06:30,226 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2019-11-28 17:06:30,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-28 17:06:30,227 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2019-11-28 17:06:30,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-28 17:06:30,230 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:06:30,230 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:06:30,232 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:06:30,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:06:30,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1526631753, now seen corresponding path program 1 times [2019-11-28 17:06:30,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:06:30,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751006863] [2019-11-28 17:06:30,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:06:30,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:06:30,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:06:30,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751006863] [2019-11-28 17:06:30,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:06:30,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 17:06:30,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410324761] [2019-11-28 17:06:30,368 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 17:06:30,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:06:30,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 17:06:30,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 17:06:30,372 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 4 states. [2019-11-28 17:06:30,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:06:30,477 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2019-11-28 17:06:30,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 17:06:30,478 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-28 17:06:30,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:06:30,479 INFO L225 Difference]: With dead ends: 44 [2019-11-28 17:06:30,479 INFO L226 Difference]: Without dead ends: 38 [2019-11-28 17:06:30,481 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:06:30,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-11-28 17:06:30,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 34. [2019-11-28 17:06:30,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-28 17:06:30,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2019-11-28 17:06:30,489 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 10 [2019-11-28 17:06:30,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:06:30,489 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2019-11-28 17:06:30,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 17:06:30,490 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2019-11-28 17:06:30,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-28 17:06:30,491 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:06:30,491 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:06:30,491 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:06:30,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:06:30,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1785542740, now seen corresponding path program 1 times [2019-11-28 17:06:30,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:06:30,493 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274029359] [2019-11-28 17:06:30,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:06:30,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:06:30,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:06:30,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274029359] [2019-11-28 17:06:30,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:06:30,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 17:06:30,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827324920] [2019-11-28 17:06:30,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:06:30,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:06:30,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:06:30,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:06:30,544 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 5 states. [2019-11-28 17:06:30,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:06:30,709 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2019-11-28 17:06:30,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 17:06:30,711 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-11-28 17:06:30,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:06:30,712 INFO L225 Difference]: With dead ends: 50 [2019-11-28 17:06:30,712 INFO L226 Difference]: Without dead ends: 46 [2019-11-28 17:06:30,714 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-28 17:06:30,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-11-28 17:06:30,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2019-11-28 17:06:30,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-28 17:06:30,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2019-11-28 17:06:30,734 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 12 [2019-11-28 17:06:30,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:06:30,738 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2019-11-28 17:06:30,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:06:30,738 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2019-11-28 17:06:30,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 17:06:30,739 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:06:30,739 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:06:30,739 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:06:30,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:06:30,742 INFO L82 PathProgramCache]: Analyzing trace with hash -734801565, now seen corresponding path program 1 times [2019-11-28 17:06:30,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:06:30,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275919653] [2019-11-28 17:06:30,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:06:30,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:06:30,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:06:30,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275919653] [2019-11-28 17:06:30,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:06:30,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 17:06:30,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549716226] [2019-11-28 17:06:30,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 17:06:30,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:06:30,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 17:06:30,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 17:06:30,828 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand 4 states. [2019-11-28 17:06:30,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:06:30,899 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2019-11-28 17:06:30,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 17:06:30,900 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-28 17:06:30,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:06:30,901 INFO L225 Difference]: With dead ends: 44 [2019-11-28 17:06:30,901 INFO L226 Difference]: Without dead ends: 42 [2019-11-28 17:06:30,902 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:06:30,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-11-28 17:06:30,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-11-28 17:06:30,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-28 17:06:30,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2019-11-28 17:06:30,910 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 15 [2019-11-28 17:06:30,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:06:30,910 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2019-11-28 17:06:30,910 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 17:06:30,911 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2019-11-28 17:06:30,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 17:06:30,911 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:06:30,912 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:06:30,912 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:06:30,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:06:30,913 INFO L82 PathProgramCache]: Analyzing trace with hash -2090765742, now seen corresponding path program 1 times [2019-11-28 17:06:30,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:06:30,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189352386] [2019-11-28 17:06:30,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:06:30,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:06:30,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:06:30,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189352386] [2019-11-28 17:06:30,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:06:30,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 17:06:30,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014522907] [2019-11-28 17:06:30,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 17:06:30,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:06:30,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 17:06:30,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 17:06:30,987 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 6 states. [2019-11-28 17:06:31,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:06:31,203 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2019-11-28 17:06:31,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 17:06:31,204 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-11-28 17:06:31,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:06:31,205 INFO L225 Difference]: With dead ends: 71 [2019-11-28 17:06:31,206 INFO L226 Difference]: Without dead ends: 57 [2019-11-28 17:06:31,206 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-11-28 17:06:31,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-28 17:06:31,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 53. [2019-11-28 17:06:31,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-28 17:06:31,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2019-11-28 17:06:31,215 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 16 [2019-11-28 17:06:31,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:06:31,216 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2019-11-28 17:06:31,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 17:06:31,216 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2019-11-28 17:06:31,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 17:06:31,219 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:06:31,219 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:06:31,220 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:06:31,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:06:31,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1769510362, now seen corresponding path program 1 times [2019-11-28 17:06:31,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:06:31,221 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702548338] [2019-11-28 17:06:31,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:06:31,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:06:31,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:06:31,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702548338] [2019-11-28 17:06:31,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:06:31,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 17:06:31,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30102969] [2019-11-28 17:06:31,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 17:06:31,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:06:31,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 17:06:31,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-28 17:06:31,331 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 7 states. [2019-11-28 17:06:31,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:06:31,514 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2019-11-28 17:06:31,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 17:06:31,516 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2019-11-28 17:06:31,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:06:31,518 INFO L225 Difference]: With dead ends: 63 [2019-11-28 17:06:31,518 INFO L226 Difference]: Without dead ends: 61 [2019-11-28 17:06:31,522 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-11-28 17:06:31,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-11-28 17:06:31,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 53. [2019-11-28 17:06:31,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-28 17:06:31,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2019-11-28 17:06:31,541 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 17 [2019-11-28 17:06:31,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:06:31,542 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2019-11-28 17:06:31,543 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 17:06:31,543 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2019-11-28 17:06:31,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 17:06:31,545 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:06:31,545 INFO L410 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, 1, 1] [2019-11-28 17:06:31,546 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:06:31,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:06:31,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1110583474, now seen corresponding path program 1 times [2019-11-28 17:06:31,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:06:31,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133257887] [2019-11-28 17:06:31,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:06:31,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:06:31,723 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:06:31,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133257887] [2019-11-28 17:06:31,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [977404289] [2019-11-28 17:06:31,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:06:31,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:06:31,774 INFO L264 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-28 17:06:31,781 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:06:31,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:06:31,955 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:06:31,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:06:31,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 14 [2019-11-28 17:06:31,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307472565] [2019-11-28 17:06:31,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-28 17:06:31,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:06:31,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-28 17:06:31,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2019-11-28 17:06:31,958 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand 14 states. [2019-11-28 17:06:32,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:06:32,922 INFO L93 Difference]: Finished difference Result 121 states and 131 transitions. [2019-11-28 17:06:32,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-11-28 17:06:32,923 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 27 [2019-11-28 17:06:32,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:06:32,927 INFO L225 Difference]: With dead ends: 121 [2019-11-28 17:06:32,927 INFO L226 Difference]: Without dead ends: 94 [2019-11-28 17:06:32,930 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=440, Invalid=1042, Unknown=0, NotChecked=0, Total=1482 [2019-11-28 17:06:32,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-11-28 17:06:32,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 75. [2019-11-28 17:06:32,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-28 17:06:32,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2019-11-28 17:06:32,952 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 27 [2019-11-28 17:06:32,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:06:32,952 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2019-11-28 17:06:32,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-28 17:06:32,953 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2019-11-28 17:06:32,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-28 17:06:32,955 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:06:32,955 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:06:33,181 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:06:33,182 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:06:33,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:06:33,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1311932474, now seen corresponding path program 1 times [2019-11-28 17:06:33,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:06:33,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955929022] [2019-11-28 17:06:33,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:06:33,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:06:33,261 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:06:33,262 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955929022] [2019-11-28 17:06:33,262 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494038240] [2019-11-28 17:06:33,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:06:33,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:06:33,291 INFO L264 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-28 17:06:33,293 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:06:33,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:06:33,357 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:06:33,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:06:33,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2019-11-28 17:06:33,358 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30376404] [2019-11-28 17:06:33,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 17:06:33,358 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:06:33,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 17:06:33,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-11-28 17:06:33,359 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand 12 states. [2019-11-28 17:06:33,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:06:33,538 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2019-11-28 17:06:33,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-28 17:06:33,538 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2019-11-28 17:06:33,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:06:33,539 INFO L225 Difference]: With dead ends: 77 [2019-11-28 17:06:33,539 INFO L226 Difference]: Without dead ends: 75 [2019-11-28 17:06:33,540 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=148, Invalid=314, Unknown=0, NotChecked=0, Total=462 [2019-11-28 17:06:33,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-11-28 17:06:33,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-11-28 17:06:33,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-28 17:06:33,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2019-11-28 17:06:33,548 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 28 [2019-11-28 17:06:33,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:06:33,549 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2019-11-28 17:06:33,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 17:06:33,549 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2019-11-28 17:06:33,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-28 17:06:33,550 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:06:33,550 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:06:33,757 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:06:33,758 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:06:33,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:06:33,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1348445734, now seen corresponding path program 2 times [2019-11-28 17:06:33,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:06:33,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959720660] [2019-11-28 17:06:33,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:06:33,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:06:33,935 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:06:33,936 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959720660] [2019-11-28 17:06:33,936 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [344920396] [2019-11-28 17:06:33,936 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:06:33,993 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 17:06:33,993 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:06:33,994 INFO L264 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-28 17:06:33,998 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:06:34,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:06:34,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:06:34,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:06:34,218 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:06:34,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:06:34,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 22 [2019-11-28 17:06:34,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257854848] [2019-11-28 17:06:34,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-28 17:06:34,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:06:34,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-28 17:06:34,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=393, Unknown=0, NotChecked=0, Total=462 [2019-11-28 17:06:34,221 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand 22 states. [2019-11-28 17:06:35,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:06:35,314 INFO L93 Difference]: Finished difference Result 99 states and 101 transitions. [2019-11-28 17:06:35,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-28 17:06:35,315 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 39 [2019-11-28 17:06:35,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:06:35,317 INFO L225 Difference]: With dead ends: 99 [2019-11-28 17:06:35,317 INFO L226 Difference]: Without dead ends: 97 [2019-11-28 17:06:35,318 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=330, Invalid=1476, Unknown=0, NotChecked=0, Total=1806 [2019-11-28 17:06:35,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-11-28 17:06:35,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 75. [2019-11-28 17:06:35,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-28 17:06:35,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2019-11-28 17:06:35,327 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 39 [2019-11-28 17:06:35,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:06:35,328 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2019-11-28 17:06:35,328 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-28 17:06:35,328 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2019-11-28 17:06:35,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-28 17:06:35,329 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:06:35,330 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:06:35,533 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:06:35,534 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:06:35,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:06:35,535 INFO L82 PathProgramCache]: Analyzing trace with hash 670000306, now seen corresponding path program 2 times [2019-11-28 17:06:35,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:06:35,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110635805] [2019-11-28 17:06:35,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:06:35,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:06:35,720 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-28 17:06:35,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110635805] [2019-11-28 17:06:35,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [629074468] [2019-11-28 17:06:35,722 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:06:35,772 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 17:06:35,772 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:06:35,773 INFO L264 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-28 17:06:35,777 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:06:35,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:06:35,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:06:36,010 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 17 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:06:36,010 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:06:36,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 19 [2019-11-28 17:06:36,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320677407] [2019-11-28 17:06:36,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-28 17:06:36,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:06:36,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-28 17:06:36,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2019-11-28 17:06:36,012 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand 19 states. [2019-11-28 17:06:36,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:06:36,607 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2019-11-28 17:06:36,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-28 17:06:36,607 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 49 [2019-11-28 17:06:36,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:06:36,608 INFO L225 Difference]: With dead ends: 75 [2019-11-28 17:06:36,608 INFO L226 Difference]: Without dead ends: 57 [2019-11-28 17:06:36,609 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=296, Invalid=826, Unknown=0, NotChecked=0, Total=1122 [2019-11-28 17:06:36,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-28 17:06:36,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 51. [2019-11-28 17:06:36,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-11-28 17:06:36,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-11-28 17:06:36,616 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2019-11-28 17:06:36,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:06:36,616 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-11-28 17:06:36,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-28 17:06:36,617 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-11-28 17:06:36,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-28 17:06:36,617 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:06:36,618 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:06:36,821 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:06:36,822 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:06:36,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:06:36,823 INFO L82 PathProgramCache]: Analyzing trace with hash -2085108794, now seen corresponding path program 3 times [2019-11-28 17:06:36,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:06:36,824 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932165883] [2019-11-28 17:06:36,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:06:36,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:06:36,989 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-28 17:06:36,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932165883] [2019-11-28 17:06:36,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1503547849] [2019-11-28 17:06:36,990 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:06:37,033 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-28 17:06:37,033 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:06:37,034 INFO L264 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-28 17:06:37,038 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:06:37,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:06:37,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:06:37,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:06:37,280 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:06:37,280 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:06:37,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 25 [2019-11-28 17:06:37,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430402733] [2019-11-28 17:06:37,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-28 17:06:37,282 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:06:37,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-28 17:06:37,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=517, Unknown=0, NotChecked=0, Total=600 [2019-11-28 17:06:37,282 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 25 states. [2019-11-28 17:06:39,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:06:39,327 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2019-11-28 17:06:39,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-11-28 17:06:39,327 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 50 [2019-11-28 17:06:39,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:06:39,328 INFO L225 Difference]: With dead ends: 70 [2019-11-28 17:06:39,328 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 17:06:39,330 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1026 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=730, Invalid=3176, Unknown=0, NotChecked=0, Total=3906 [2019-11-28 17:06:39,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 17:06:39,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 17:06:39,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 17:06:39,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 17:06:39,331 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 50 [2019-11-28 17:06:39,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:06:39,331 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 17:06:39,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-28 17:06:39,331 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 17:06:39,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 17:06:39,532 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:06:39,535 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 17:06:39,989 WARN L192 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 35 [2019-11-28 17:06:40,248 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 33 [2019-11-28 17:06:40,494 WARN L192 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2019-11-28 17:06:40,708 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 34 [2019-11-28 17:06:40,712 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-28 17:06:40,712 INFO L246 CegarLoopResult]: For program point L19(line 19) no Hoare annotation was computed. [2019-11-28 17:06:40,713 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-28 17:06:40,713 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 17:06:40,713 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 17:06:40,713 INFO L246 CegarLoopResult]: For program point L4(lines 4 6) no Hoare annotation was computed. [2019-11-28 17:06:40,713 INFO L242 CegarLoopResult]: At program point L4-2(lines 3 8) the Hoare annotation is: (let ((.cse0 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse1 (< ULTIMATE.start_main_~bufferlen~0 ULTIMATE.start_main_~inlen~0)) (.cse2 (= (+ ULTIMATE.start_main_~buflim~0 2) ULTIMATE.start_main_~bufferlen~0)) (.cse3 (< ULTIMATE.start_main_~buf~0 ULTIMATE.start_main_~buflim~0))) (or (and (= ULTIMATE.start_main_~in~0 0) (= 0 ULTIMATE.start_main_~buf~0) .cse0 .cse1 .cse2 .cse3) (and (<= 3 ULTIMATE.start_main_~buf~0) (<= (+ ULTIMATE.start_main_~bufferlen~0 1) ULTIMATE.start_main_~inlen~0) .cse0 (<= (+ ULTIMATE.start_main_~buflim~0 ULTIMATE.start_main_~in~0 3) (+ ULTIMATE.start_main_~buf~0 ULTIMATE.start_main_~inlen~0)) (<= 0 ULTIMATE.start_main_~in~0) .cse2 .cse3) (and (= ULTIMATE.start_main_~in~0 2) (<= 2 ULTIMATE.start_main_~buf~0) .cse0 .cse1 .cse2 .cse3) (and (<= ULTIMATE.start_main_~buf~0 1) .cse0 .cse1 (<= 1 ULTIMATE.start_main_~buf~0) (= ULTIMATE.start_main_~in~0 1) .cse2 .cse3))) [2019-11-28 17:06:40,713 INFO L246 CegarLoopResult]: For program point L4-3(lines 4 6) no Hoare annotation was computed. [2019-11-28 17:06:40,714 INFO L242 CegarLoopResult]: At program point L4-5(lines 3 8) the Hoare annotation is: (let ((.cse0 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse1 (< ULTIMATE.start_main_~bufferlen~0 ULTIMATE.start_main_~inlen~0)) (.cse2 (= (+ ULTIMATE.start_main_~buflim~0 2) ULTIMATE.start_main_~bufferlen~0)) (.cse3 (< ULTIMATE.start_main_~buf~0 ULTIMATE.start_main_~buflim~0))) (or (and (= ULTIMATE.start_main_~in~0 0) (= 0 ULTIMATE.start_main_~buf~0) .cse0 .cse1 .cse2 .cse3) (and (<= 3 ULTIMATE.start_main_~buf~0) (<= (+ ULTIMATE.start_main_~bufferlen~0 1) ULTIMATE.start_main_~inlen~0) .cse0 (<= (+ ULTIMATE.start_main_~buflim~0 ULTIMATE.start_main_~in~0 3) (+ ULTIMATE.start_main_~buf~0 ULTIMATE.start_main_~inlen~0)) (<= 0 ULTIMATE.start_main_~in~0) .cse2 .cse3) (and (= ULTIMATE.start_main_~in~0 2) (<= 2 ULTIMATE.start_main_~buf~0) .cse0 .cse1 .cse2 .cse3) (and (<= ULTIMATE.start_main_~buf~0 1) .cse0 .cse1 (<= 1 ULTIMATE.start_main_~buf~0) (= ULTIMATE.start_main_~in~0 1) .cse2 .cse3))) [2019-11-28 17:06:40,714 INFO L246 CegarLoopResult]: For program point L4-6(lines 4 6) no Hoare annotation was computed. [2019-11-28 17:06:40,714 INFO L242 CegarLoopResult]: At program point L4-8(lines 3 8) the Hoare annotation is: (let ((.cse2 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse3 (< ULTIMATE.start_main_~bufferlen~0 ULTIMATE.start_main_~inlen~0)) (.cse0 (= (+ ULTIMATE.start_main_~buflim~0 2) ULTIMATE.start_main_~bufferlen~0)) (.cse1 (<= ULTIMATE.start_main_~buf~0 ULTIMATE.start_main_~buflim~0))) (or (and (<= 3 ULTIMATE.start_main_~buf~0) (<= (+ ULTIMATE.start_main_~bufferlen~0 1) ULTIMATE.start_main_~inlen~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= (+ ULTIMATE.start_main_~buflim~0 ULTIMATE.start_main_~in~0 3) (+ ULTIMATE.start_main_~buf~0 ULTIMATE.start_main_~inlen~0)) (<= 0 ULTIMATE.start_main_~in~0) .cse0 .cse1) (and (<= ULTIMATE.start_main_~buf~0 1) .cse2 .cse3 (<= 1 ULTIMATE.start_main_~buf~0) (= ULTIMATE.start_main_~in~0 1) .cse0 .cse1) (and (= ULTIMATE.start_main_~in~0 2) (<= 2 ULTIMATE.start_main_~buf~0) .cse2 .cse3 .cse0 .cse1))) [2019-11-28 17:06:40,714 INFO L246 CegarLoopResult]: For program point L4-9(lines 4 6) no Hoare annotation was computed. [2019-11-28 17:06:40,715 INFO L242 CegarLoopResult]: At program point L4-11(lines 3 34) the Hoare annotation is: (let ((.cse0 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse1 (< ULTIMATE.start_main_~bufferlen~0 ULTIMATE.start_main_~inlen~0)) (.cse2 (= (+ ULTIMATE.start_main_~buflim~0 2) ULTIMATE.start_main_~bufferlen~0)) (.cse3 (<= ULTIMATE.start_main_~buf~0 ULTIMATE.start_main_~buflim~0))) (or (and (<= ULTIMATE.start_main_~buf~0 1) .cse0 .cse1 (<= 1 ULTIMATE.start_main_~buf~0) (= ULTIMATE.start_main_~in~0 1) .cse2 .cse3) (and (<= 3 ULTIMATE.start_main_~buf~0) (<= (+ ULTIMATE.start_main_~bufferlen~0 1) ULTIMATE.start_main_~inlen~0) .cse0 (<= (+ ULTIMATE.start_main_~buflim~0 ULTIMATE.start_main_~in~0 3) (+ ULTIMATE.start_main_~buf~0 ULTIMATE.start_main_~inlen~0)) (<= 0 ULTIMATE.start_main_~in~0) .cse2 .cse3) (and (= ULTIMATE.start_main_~in~0 2) (<= 2 ULTIMATE.start_main_~buf~0) .cse0 .cse1 .cse2 .cse3) (and (= ULTIMATE.start_main_~in~0 0) (= 0 ULTIMATE.start_main_~buf~0) .cse1 .cse2 .cse3))) [2019-11-28 17:06:40,719 INFO L246 CegarLoopResult]: For program point L4-12(lines 4 6) no Hoare annotation was computed. [2019-11-28 17:06:40,719 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-28 17:06:40,720 INFO L242 CegarLoopResult]: At program point L4-14(lines 3 8) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~buf~0 2) ULTIMATE.start_main_~bufferlen~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= 0 ULTIMATE.start_main_~buf~0) (<= 0 ULTIMATE.start_main_~in~0)) [2019-11-28 17:06:40,720 INFO L246 CegarLoopResult]: For program point L4-15(lines 4 6) no Hoare annotation was computed. [2019-11-28 17:06:40,720 INFO L242 CegarLoopResult]: At program point L4-17(lines 3 8) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~buf~0 2) ULTIMATE.start_main_~bufferlen~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= 0 ULTIMATE.start_main_~buf~0) (<= 0 ULTIMATE.start_main_~in~0)) [2019-11-28 17:06:40,720 INFO L246 CegarLoopResult]: For program point L4-18(lines 4 6) no Hoare annotation was computed. [2019-11-28 17:06:40,721 INFO L242 CegarLoopResult]: At program point L4-20(lines 3 8) the Hoare annotation is: (and (<= 2 ULTIMATE.start_main_~bufferlen~0) (<= (+ ULTIMATE.start_main_~buf~0 1) ULTIMATE.start_main_~bufferlen~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= 0 ULTIMATE.start_main_~buf~0) (<= 0 ULTIMATE.start_main_~in~0)) [2019-11-28 17:06:40,721 INFO L246 CegarLoopResult]: For program point L4-21(lines 4 6) no Hoare annotation was computed. [2019-11-28 17:06:40,721 INFO L249 CegarLoopResult]: At program point L4-23(lines 3 8) the Hoare annotation is: true [2019-11-28 17:06:40,721 INFO L246 CegarLoopResult]: For program point L5(line 5) no Hoare annotation was computed. [2019-11-28 17:06:40,722 INFO L246 CegarLoopResult]: For program point L5-1(line 5) no Hoare annotation was computed. [2019-11-28 17:06:40,723 INFO L246 CegarLoopResult]: For program point L5-2(line 5) no Hoare annotation was computed. [2019-11-28 17:06:40,723 INFO L246 CegarLoopResult]: For program point L5-3(line 5) no Hoare annotation was computed. [2019-11-28 17:06:40,723 INFO L246 CegarLoopResult]: For program point L5-4(line 5) no Hoare annotation was computed. [2019-11-28 17:06:40,723 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-28 17:06:40,723 INFO L246 CegarLoopResult]: For program point L5-5(line 5) no Hoare annotation was computed. [2019-11-28 17:06:40,724 INFO L246 CegarLoopResult]: For program point L5-6(line 5) no Hoare annotation was computed. [2019-11-28 17:06:40,724 INFO L246 CegarLoopResult]: For program point L30(lines 30 31) no Hoare annotation was computed. [2019-11-28 17:06:40,724 INFO L246 CegarLoopResult]: For program point L5-7(line 5) no Hoare annotation was computed. [2019-11-28 17:06:40,725 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-28 17:06:40,728 INFO L246 CegarLoopResult]: For program point L23-1(lines 23 34) no Hoare annotation was computed. [2019-11-28 17:06:40,729 INFO L246 CegarLoopResult]: For program point L23-3(lines 23 34) no Hoare annotation was computed. [2019-11-28 17:06:40,730 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-28 17:06:40,731 INFO L249 CegarLoopResult]: At program point L41(lines 11 42) the Hoare annotation is: true [2019-11-28 17:06:40,731 INFO L249 CegarLoopResult]: At program point L41-1(lines 10 42) the Hoare annotation is: true [2019-11-28 17:06:40,731 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 17:06:40,731 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-28 17:06:40,731 INFO L246 CegarLoopResult]: For program point L25(lines 25 26) no Hoare annotation was computed. [2019-11-28 17:06:40,731 INFO L246 CegarLoopResult]: For program point L17(line 17) no Hoare annotation was computed. [2019-11-28 17:06:40,732 INFO L246 CegarLoopResult]: For program point L17-1(lines 11 42) no Hoare annotation was computed. [2019-11-28 17:06:40,732 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-28 17:06:40,732 INFO L246 CegarLoopResult]: For program point L18(lines 11 42) no Hoare annotation was computed. [2019-11-28 17:06:40,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 05:06:40 BoogieIcfgContainer [2019-11-28 17:06:40,780 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 17:06:40,781 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 17:06:40,781 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 17:06:40,781 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 17:06:40,782 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:06:29" (3/4) ... [2019-11-28 17:06:40,788 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 17:06:40,806 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2019-11-28 17:06:40,806 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 17:06:40,925 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 17:06:40,926 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 17:06:40,935 INFO L168 Benchmark]: Toolchain (without parser) took 11793.68 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 312.5 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -124.6 MB). Peak memory consumption was 187.9 MB. Max. memory is 11.5 GB. [2019-11-28 17:06:40,936 INFO L168 Benchmark]: CDTParser took 0.36 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 17:06:40,936 INFO L168 Benchmark]: CACSL2BoogieTranslator took 242.19 ms. Allocated memory is still 1.0 GB. Free memory was 961.7 MB in the beginning and 951.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 17:06:40,937 INFO L168 Benchmark]: Boogie Procedure Inliner took 100.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -194.4 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2019-11-28 17:06:40,937 INFO L168 Benchmark]: Boogie Preprocessor took 23.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 17:06:40,937 INFO L168 Benchmark]: RCFGBuilder took 362.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. [2019-11-28 17:06:40,938 INFO L168 Benchmark]: TraceAbstraction took 10906.60 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 163.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.6 MB). Peak memory consumption was 187.2 MB. Max. memory is 11.5 GB. [2019-11-28 17:06:40,938 INFO L168 Benchmark]: Witness Printer took 152.74 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 11.5 GB. [2019-11-28 17:06:40,941 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.36 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 242.19 ms. Allocated memory is still 1.0 GB. Free memory was 961.7 MB in the beginning and 951.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 100.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -194.4 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 362.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 10906.60 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 163.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.6 MB). Peak memory consumption was 187.2 MB. Max. memory is 11.5 GB. * Witness Printer took 152.74 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: (((((((in == 0 && 0 == buf) && 1 == cond) && bufferlen < inlen) && buflim + 2 == bufferlen) && buf < buflim) || ((((((3 <= buf && bufferlen + 1 <= inlen) && 1 == cond) && buflim + in + 3 <= buf + inlen) && 0 <= in) && buflim + 2 == bufferlen) && buf < buflim)) || (((((in == 2 && 2 <= buf) && 1 == cond) && bufferlen < inlen) && buflim + 2 == bufferlen) && buf < buflim)) || ((((((buf <= 1 && 1 == cond) && bufferlen < inlen) && 1 <= buf) && in == 1) && buflim + 2 == bufferlen) && buf < buflim) - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: (((2 <= bufferlen && buf + 1 <= bufferlen) && !(0 == cond)) && 0 <= buf) && 0 <= in - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((buf + 2 <= bufferlen && !(0 == cond)) && 0 <= buf) && 0 <= in - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: (((((((3 <= buf && bufferlen + 1 <= inlen) && !(0 == cond)) && buflim + in + 3 <= buf + inlen) && 0 <= in) && buflim + 2 == bufferlen) && buf <= buflim) || ((((((buf <= 1 && 1 == cond) && bufferlen < inlen) && 1 <= buf) && in == 1) && buflim + 2 == bufferlen) && buf <= buflim)) || (((((in == 2 && 2 <= buf) && 1 == cond) && bufferlen < inlen) && buflim + 2 == bufferlen) && buf <= buflim) - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: (((((((in == 0 && 0 == buf) && 1 == cond) && bufferlen < inlen) && buflim + 2 == bufferlen) && buf < buflim) || ((((((3 <= buf && bufferlen + 1 <= inlen) && 1 == cond) && buflim + in + 3 <= buf + inlen) && 0 <= in) && buflim + 2 == bufferlen) && buf < buflim)) || (((((in == 2 && 2 <= buf) && 1 == cond) && bufferlen < inlen) && buflim + 2 == bufferlen) && buf < buflim)) || ((((((buf <= 1 && 1 == cond) && bufferlen < inlen) && 1 <= buf) && in == 1) && buflim + 2 == bufferlen) && buf < buflim) - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((buf + 2 <= bufferlen && !(0 == cond)) && 0 <= buf) && 0 <= in - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((((((((buf <= 1 && 1 == cond) && bufferlen < inlen) && 1 <= buf) && in == 1) && buflim + 2 == bufferlen) && buf <= buflim) || ((((((3 <= buf && bufferlen + 1 <= inlen) && 1 == cond) && buflim + in + 3 <= buf + inlen) && 0 <= in) && buflim + 2 == bufferlen) && buf <= buflim)) || (((((in == 2 && 2 <= buf) && 1 == cond) && bufferlen < inlen) && buflim + 2 == bufferlen) && buf <= buflim)) || ((((in == 0 && 0 == buf) && bufferlen < inlen) && buflim + 2 == bufferlen) && buf <= buflim) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 45 locations, 8 error locations. Result: SAFE, OverallTime: 9.5s, OverallIterations: 11, TraceHistogramMax: 4, AutomataDifference: 5.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.1s, HoareTripleCheckerStatistics: 329 SDtfs, 1146 SDslu, 1123 SDs, 0 SdLazy, 1556 SolverSat, 632 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 394 GetRequests, 169 SyntacticMatches, 2 SemanticMatches, 223 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2187 ImplicationChecksByTransitivity, 4.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=75occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 65 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 10 PreInvPairs, 51 NumberOfFragments, 423 HoareAnnotationTreeSize, 10 FomulaSimplifications, 8352 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 10 FomulaSimplificationsInter, 1014 FormulaSimplificationTreeSizeReductionInter, 0.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 465 NumberOfCodeBlocks, 465 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 449 ConstructedInterpolants, 0 QuantifiedInterpolants, 122483 SizeOfPredicates, 41 NumberOfNonLiveVariables, 521 ConjunctsInSsa, 109 ConjunctsInUnsatCore, 16 InterpolantComputations, 6 PerfectInterpolantSequences, 41/302 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...