./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem01_label01.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem01_label01.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dab50d57c53f23a15c1109c01d840c6793808077 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-27 22:38:15,933 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 22:38:15,935 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 22:38:15,954 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 22:38:15,954 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 22:38:15,956 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 22:38:15,958 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 22:38:15,968 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 22:38:15,974 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 22:38:15,978 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 22:38:15,980 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 22:38:15,982 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 22:38:15,982 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 22:38:15,987 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 22:38:15,988 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 22:38:15,990 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 22:38:15,992 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 22:38:15,993 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 22:38:15,996 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 22:38:16,000 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 22:38:16,005 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 22:38:16,010 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 22:38:16,011 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 22:38:16,012 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 22:38:16,017 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 22:38:16,017 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 22:38:16,018 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 22:38:16,020 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 22:38:16,020 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 22:38:16,021 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 22:38:16,022 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 22:38:16,023 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 22:38:16,023 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 22:38:16,025 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 22:38:16,026 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 22:38:16,026 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 22:38:16,027 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 22:38:16,028 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 22:38:16,028 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 22:38:16,029 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 22:38:16,031 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 22:38:16,031 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-27 22:38:16,066 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 22:38:16,069 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 22:38:16,070 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 22:38:16,074 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 22:38:16,075 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 22:38:16,075 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 22:38:16,075 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 22:38:16,076 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 22:38:16,076 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 22:38:16,076 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 22:38:16,076 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-27 22:38:16,076 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 22:38:16,077 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-27 22:38:16,077 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 22:38:16,077 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-27 22:38:16,077 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 22:38:16,078 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-27 22:38:16,079 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 22:38:16,079 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 22:38:16,080 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 22:38:16,080 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 22:38:16,080 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 22:38:16,080 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 22:38:16,082 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 22:38:16,082 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-27 22:38:16,082 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-27 22:38:16,083 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-27 22:38:16,083 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-27 22:38:16,084 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 -> dab50d57c53f23a15c1109c01d840c6793808077 [2019-11-27 22:38:16,415 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 22:38:16,435 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 22:38:16,439 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 22:38:16,440 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 22:38:16,440 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 22:38:16,441 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem01_label01.c [2019-11-27 22:38:16,508 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af8b1f184/7df485acbb7e400d83050ba7d97cf58e/FLAG174e9992d [2019-11-27 22:38:17,153 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 22:38:17,154 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label01.c [2019-11-27 22:38:17,170 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af8b1f184/7df485acbb7e400d83050ba7d97cf58e/FLAG174e9992d [2019-11-27 22:38:17,398 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af8b1f184/7df485acbb7e400d83050ba7d97cf58e [2019-11-27 22:38:17,403 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 22:38:17,404 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-27 22:38:17,407 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 22:38:17,407 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 22:38:17,411 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 22:38:17,412 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:38:17" (1/1) ... [2019-11-27 22:38:17,415 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7947f582 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:38:17, skipping insertion in model container [2019-11-27 22:38:17,416 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:38:17" (1/1) ... [2019-11-27 22:38:17,424 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 22:38:17,469 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 22:38:17,978 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:38:17,986 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 22:38:18,134 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:38:18,151 INFO L208 MainTranslator]: Completed translation [2019-11-27 22:38:18,152 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:38:18 WrapperNode [2019-11-27 22:38:18,152 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 22:38:18,153 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-27 22:38:18,153 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-27 22:38:18,153 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-27 22:38:18,162 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:38:18" (1/1) ... [2019-11-27 22:38:18,181 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:38:18" (1/1) ... [2019-11-27 22:38:18,248 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-27 22:38:18,249 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 22:38:18,250 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 22:38:18,250 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 22:38:18,260 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:38:18" (1/1) ... [2019-11-27 22:38:18,260 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:38:18" (1/1) ... [2019-11-27 22:38:18,265 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:38:18" (1/1) ... [2019-11-27 22:38:18,265 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:38:18" (1/1) ... [2019-11-27 22:38:18,289 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:38:18" (1/1) ... [2019-11-27 22:38:18,310 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:38:18" (1/1) ... [2019-11-27 22:38:18,322 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:38:18" (1/1) ... [2019-11-27 22:38:18,333 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 22:38:18,334 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 22:38:18,334 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 22:38:18,334 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 22:38:18,336 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:38:18" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 22:38:18,403 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 22:38:18,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 22:38:19,800 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 22:38:19,800 INFO L297 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-27 22:38:19,801 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:38:19 BoogieIcfgContainer [2019-11-27 22:38:19,802 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 22:38:19,803 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 22:38:19,803 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 22:38:19,807 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 22:38:19,807 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 10:38:17" (1/3) ... [2019-11-27 22:38:19,808 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cd7bcde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:38:19, skipping insertion in model container [2019-11-27 22:38:19,808 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:38:18" (2/3) ... [2019-11-27 22:38:19,809 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cd7bcde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:38:19, skipping insertion in model container [2019-11-27 22:38:19,809 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:38:19" (3/3) ... [2019-11-27 22:38:19,811 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label01.c [2019-11-27 22:38:19,821 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 22:38:19,829 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-27 22:38:19,842 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-27 22:38:19,873 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 22:38:19,873 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-27 22:38:19,873 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 22:38:19,873 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 22:38:19,874 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 22:38:19,874 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 22:38:19,874 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 22:38:19,874 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 22:38:19,896 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-11-27 22:38:19,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-27 22:38:19,906 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:38:19,907 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:38:19,908 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:38:19,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:38:19,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1687716446, now seen corresponding path program 1 times [2019-11-27 22:38:19,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:38:19,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040720461] [2019-11-27 22:38:19,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:38:20,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:38:20,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:38:20,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040720461] [2019-11-27 22:38:20,407 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:38:20,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:38:20,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105517650] [2019-11-27 22:38:20,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:38:20,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:38:20,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:38:20,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:38:20,439 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 4 states. [2019-11-27 22:38:21,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:38:21,911 INFO L93 Difference]: Finished difference Result 662 states and 1178 transitions. [2019-11-27 22:38:21,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 22:38:21,912 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-11-27 22:38:21,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:38:21,943 INFO L225 Difference]: With dead ends: 662 [2019-11-27 22:38:21,943 INFO L226 Difference]: Without dead ends: 397 [2019-11-27 22:38:21,955 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:38:21,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-11-27 22:38:22,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2019-11-27 22:38:22,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-11-27 22:38:22,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 559 transitions. [2019-11-27 22:38:22,037 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 559 transitions. Word has length 91 [2019-11-27 22:38:22,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:38:22,038 INFO L462 AbstractCegarLoop]: Abstraction has 397 states and 559 transitions. [2019-11-27 22:38:22,038 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:38:22,038 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 559 transitions. [2019-11-27 22:38:22,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-27 22:38:22,046 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:38:22,047 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:38:22,047 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:38:22,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:38:22,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1583336838, now seen corresponding path program 1 times [2019-11-27 22:38:22,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:38:22,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210729061] [2019-11-27 22:38:22,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:38:22,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:38:22,166 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:38:22,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210729061] [2019-11-27 22:38:22,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:38:22,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:38:22,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105528768] [2019-11-27 22:38:22,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:38:22,171 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:38:22,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:38:22,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:38:22,172 INFO L87 Difference]: Start difference. First operand 397 states and 559 transitions. Second operand 4 states. [2019-11-27 22:38:22,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:38:22,827 INFO L93 Difference]: Finished difference Result 1185 states and 1672 transitions. [2019-11-27 22:38:22,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:38:22,827 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-11-27 22:38:22,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:38:22,832 INFO L225 Difference]: With dead ends: 1185 [2019-11-27 22:38:22,832 INFO L226 Difference]: Without dead ends: 790 [2019-11-27 22:38:22,834 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:38:22,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2019-11-27 22:38:22,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 790. [2019-11-27 22:38:22,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2019-11-27 22:38:22,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1066 transitions. [2019-11-27 22:38:22,867 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1066 transitions. Word has length 96 [2019-11-27 22:38:22,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:38:22,867 INFO L462 AbstractCegarLoop]: Abstraction has 790 states and 1066 transitions. [2019-11-27 22:38:22,867 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:38:22,868 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1066 transitions. [2019-11-27 22:38:22,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-27 22:38:22,874 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:38:22,874 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:38:22,874 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:38:22,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:38:22,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1473567844, now seen corresponding path program 1 times [2019-11-27 22:38:22,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:38:22,875 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908443621] [2019-11-27 22:38:22,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:38:22,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:38:22,948 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-27 22:38:22,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908443621] [2019-11-27 22:38:22,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:38:22,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:38:22,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027042257] [2019-11-27 22:38:22,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:38:22,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:38:22,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:38:22,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:38:22,951 INFO L87 Difference]: Start difference. First operand 790 states and 1066 transitions. Second operand 3 states. [2019-11-27 22:38:23,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:38:23,436 INFO L93 Difference]: Finished difference Result 1971 states and 2686 transitions. [2019-11-27 22:38:23,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:38:23,437 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2019-11-27 22:38:23,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:38:23,443 INFO L225 Difference]: With dead ends: 1971 [2019-11-27 22:38:23,443 INFO L226 Difference]: Without dead ends: 1183 [2019-11-27 22:38:23,445 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:38:23,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2019-11-27 22:38:23,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 921. [2019-11-27 22:38:23,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 921 states. [2019-11-27 22:38:23,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1246 transitions. [2019-11-27 22:38:23,475 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1246 transitions. Word has length 117 [2019-11-27 22:38:23,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:38:23,476 INFO L462 AbstractCegarLoop]: Abstraction has 921 states and 1246 transitions. [2019-11-27 22:38:23,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:38:23,476 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1246 transitions. [2019-11-27 22:38:23,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-11-27 22:38:23,482 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:38:23,483 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:38:23,483 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:38:23,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:38:23,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1222693529, now seen corresponding path program 1 times [2019-11-27 22:38:23,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:38:23,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046509099] [2019-11-27 22:38:23,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:38:23,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:38:23,571 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-11-27 22:38:23,571 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046509099] [2019-11-27 22:38:23,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:38:23,572 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:38:23,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570656964] [2019-11-27 22:38:23,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:38:23,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:38:23,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:38:23,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:38:23,574 INFO L87 Difference]: Start difference. First operand 921 states and 1246 transitions. Second operand 3 states. [2019-11-27 22:38:24,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:38:24,103 INFO L93 Difference]: Finished difference Result 2233 states and 2997 transitions. [2019-11-27 22:38:24,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:38:24,103 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 153 [2019-11-27 22:38:24,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:38:24,111 INFO L225 Difference]: With dead ends: 2233 [2019-11-27 22:38:24,111 INFO L226 Difference]: Without dead ends: 1314 [2019-11-27 22:38:24,114 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:38:24,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2019-11-27 22:38:24,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1183. [2019-11-27 22:38:24,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1183 states. [2019-11-27 22:38:24,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1508 transitions. [2019-11-27 22:38:24,148 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1508 transitions. Word has length 153 [2019-11-27 22:38:24,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:38:24,148 INFO L462 AbstractCegarLoop]: Abstraction has 1183 states and 1508 transitions. [2019-11-27 22:38:24,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:38:24,149 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1508 transitions. [2019-11-27 22:38:24,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-11-27 22:38:24,153 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:38:24,154 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:38:24,154 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:38:24,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:38:24,155 INFO L82 PathProgramCache]: Analyzing trace with hash 160905897, now seen corresponding path program 1 times [2019-11-27 22:38:24,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:38:24,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069694510] [2019-11-27 22:38:24,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:38:24,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:38:24,312 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-11-27 22:38:24,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069694510] [2019-11-27 22:38:24,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:38:24,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:38:24,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802947769] [2019-11-27 22:38:24,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:38:24,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:38:24,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:38:24,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:38:24,315 INFO L87 Difference]: Start difference. First operand 1183 states and 1508 transitions. Second operand 3 states. [2019-11-27 22:38:24,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:38:24,911 INFO L93 Difference]: Finished difference Result 3150 states and 4004 transitions. [2019-11-27 22:38:24,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:38:24,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2019-11-27 22:38:24,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:38:24,923 INFO L225 Difference]: With dead ends: 3150 [2019-11-27 22:38:24,923 INFO L226 Difference]: Without dead ends: 1969 [2019-11-27 22:38:24,927 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:38:24,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2019-11-27 22:38:24,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1707. [2019-11-27 22:38:24,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1707 states. [2019-11-27 22:38:24,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 2134 transitions. [2019-11-27 22:38:24,975 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 2134 transitions. Word has length 172 [2019-11-27 22:38:24,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:38:24,975 INFO L462 AbstractCegarLoop]: Abstraction has 1707 states and 2134 transitions. [2019-11-27 22:38:24,975 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:38:24,976 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 2134 transitions. [2019-11-27 22:38:24,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-11-27 22:38:24,981 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:38:24,981 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:38:24,982 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:38:24,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:38:24,982 INFO L82 PathProgramCache]: Analyzing trace with hash -645359518, now seen corresponding path program 1 times [2019-11-27 22:38:24,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:38:24,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916668049] [2019-11-27 22:38:24,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:38:25,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:38:25,098 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-11-27 22:38:25,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916668049] [2019-11-27 22:38:25,100 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:38:25,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:38:25,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053743242] [2019-11-27 22:38:25,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:38:25,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:38:25,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:38:25,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:38:25,103 INFO L87 Difference]: Start difference. First operand 1707 states and 2134 transitions. Second operand 3 states. [2019-11-27 22:38:25,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:38:25,602 INFO L93 Difference]: Finished difference Result 3674 states and 4582 transitions. [2019-11-27 22:38:25,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:38:25,603 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2019-11-27 22:38:25,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:38:25,614 INFO L225 Difference]: With dead ends: 3674 [2019-11-27 22:38:25,615 INFO L226 Difference]: Without dead ends: 1969 [2019-11-27 22:38:25,619 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:38:25,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2019-11-27 22:38:25,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1969. [2019-11-27 22:38:25,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1969 states. [2019-11-27 22:38:25,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2408 transitions. [2019-11-27 22:38:25,689 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2408 transitions. Word has length 175 [2019-11-27 22:38:25,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:38:25,692 INFO L462 AbstractCegarLoop]: Abstraction has 1969 states and 2408 transitions. [2019-11-27 22:38:25,692 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:38:25,692 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2408 transitions. [2019-11-27 22:38:25,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-11-27 22:38:25,699 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:38:25,700 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:38:25,700 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:38:25,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:38:25,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1056675030, now seen corresponding path program 1 times [2019-11-27 22:38:25,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:38:25,709 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18156237] [2019-11-27 22:38:25,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:38:25,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:38:25,962 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-11-27 22:38:25,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18156237] [2019-11-27 22:38:25,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:38:25,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-27 22:38:25,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638382674] [2019-11-27 22:38:25,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-27 22:38:25,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:38:25,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-27 22:38:25,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-27 22:38:25,976 INFO L87 Difference]: Start difference. First operand 1969 states and 2408 transitions. Second operand 8 states. [2019-11-27 22:38:27,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:38:27,252 INFO L93 Difference]: Finished difference Result 4106 states and 4990 transitions. [2019-11-27 22:38:27,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-27 22:38:27,253 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 179 [2019-11-27 22:38:27,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:38:27,262 INFO L225 Difference]: With dead ends: 4106 [2019-11-27 22:38:27,263 INFO L226 Difference]: Without dead ends: 2139 [2019-11-27 22:38:27,265 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-27 22:38:27,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2139 states. [2019-11-27 22:38:27,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2139 to 1969. [2019-11-27 22:38:27,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1969 states. [2019-11-27 22:38:27,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2396 transitions. [2019-11-27 22:38:27,310 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2396 transitions. Word has length 179 [2019-11-27 22:38:27,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:38:27,310 INFO L462 AbstractCegarLoop]: Abstraction has 1969 states and 2396 transitions. [2019-11-27 22:38:27,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-27 22:38:27,311 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2396 transitions. [2019-11-27 22:38:27,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-11-27 22:38:27,316 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:38:27,317 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:38:27,317 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:38:27,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:38:27,318 INFO L82 PathProgramCache]: Analyzing trace with hash 916250074, now seen corresponding path program 1 times [2019-11-27 22:38:27,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:38:27,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178180318] [2019-11-27 22:38:27,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:38:27,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:38:27,447 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-11-27 22:38:27,447 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178180318] [2019-11-27 22:38:27,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:38:27,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-27 22:38:27,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100038806] [2019-11-27 22:38:27,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:38:27,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:38:27,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:38:27,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:38:27,450 INFO L87 Difference]: Start difference. First operand 1969 states and 2396 transitions. Second operand 4 states. [2019-11-27 22:38:28,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:38:28,290 INFO L93 Difference]: Finished difference Result 4198 states and 5112 transitions. [2019-11-27 22:38:28,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 22:38:28,297 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 212 [2019-11-27 22:38:28,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:38:28,307 INFO L225 Difference]: With dead ends: 4198 [2019-11-27 22:38:28,308 INFO L226 Difference]: Without dead ends: 2231 [2019-11-27 22:38:28,311 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:38:28,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2231 states. [2019-11-27 22:38:28,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2231 to 2100. [2019-11-27 22:38:28,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2100 states. [2019-11-27 22:38:28,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2100 states to 2100 states and 2461 transitions. [2019-11-27 22:38:28,356 INFO L78 Accepts]: Start accepts. Automaton has 2100 states and 2461 transitions. Word has length 212 [2019-11-27 22:38:28,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:38:28,356 INFO L462 AbstractCegarLoop]: Abstraction has 2100 states and 2461 transitions. [2019-11-27 22:38:28,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:38:28,357 INFO L276 IsEmpty]: Start isEmpty. Operand 2100 states and 2461 transitions. [2019-11-27 22:38:28,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-11-27 22:38:28,363 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:38:28,363 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:38:28,363 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:38:28,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:38:28,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1317230938, now seen corresponding path program 1 times [2019-11-27 22:38:28,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:38:28,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681790427] [2019-11-27 22:38:28,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:38:28,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:38:28,546 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 246 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-11-27 22:38:28,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681790427] [2019-11-27 22:38:28,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:38:28,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-27 22:38:28,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349636988] [2019-11-27 22:38:28,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:38:28,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:38:28,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:38:28,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:38:28,555 INFO L87 Difference]: Start difference. First operand 2100 states and 2461 transitions. Second operand 4 states. [2019-11-27 22:38:29,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:38:29,227 INFO L93 Difference]: Finished difference Result 4722 states and 5498 transitions. [2019-11-27 22:38:29,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 22:38:29,228 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 238 [2019-11-27 22:38:29,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:38:29,242 INFO L225 Difference]: With dead ends: 4722 [2019-11-27 22:38:29,242 INFO L226 Difference]: Without dead ends: 2624 [2019-11-27 22:38:29,247 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:38:29,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2624 states. [2019-11-27 22:38:29,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2624 to 1969. [2019-11-27 22:38:29,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1969 states. [2019-11-27 22:38:29,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2311 transitions. [2019-11-27 22:38:29,418 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2311 transitions. Word has length 238 [2019-11-27 22:38:29,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:38:29,419 INFO L462 AbstractCegarLoop]: Abstraction has 1969 states and 2311 transitions. [2019-11-27 22:38:29,419 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:38:29,419 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2311 transitions. [2019-11-27 22:38:29,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-11-27 22:38:29,431 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:38:29,431 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:38:29,432 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:38:29,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:38:29,432 INFO L82 PathProgramCache]: Analyzing trace with hash 503715675, now seen corresponding path program 1 times [2019-11-27 22:38:29,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:38:29,433 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732382776] [2019-11-27 22:38:29,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:38:29,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:38:29,750 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2019-11-27 22:38:29,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732382776] [2019-11-27 22:38:29,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:38:29,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-27 22:38:29,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402708150] [2019-11-27 22:38:29,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-27 22:38:29,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:38:29,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-27 22:38:29,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-27 22:38:29,754 INFO L87 Difference]: Start difference. First operand 1969 states and 2311 transitions. Second operand 6 states. [2019-11-27 22:38:30,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:38:30,882 INFO L93 Difference]: Finished difference Result 4105 states and 4795 transitions. [2019-11-27 22:38:30,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 22:38:30,885 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 259 [2019-11-27 22:38:30,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:38:30,900 INFO L225 Difference]: With dead ends: 4105 [2019-11-27 22:38:30,900 INFO L226 Difference]: Without dead ends: 2138 [2019-11-27 22:38:30,904 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-27 22:38:30,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2138 states. [2019-11-27 22:38:30,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2138 to 1838. [2019-11-27 22:38:30,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-11-27 22:38:30,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2102 transitions. [2019-11-27 22:38:30,958 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2102 transitions. Word has length 259 [2019-11-27 22:38:30,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:38:30,960 INFO L462 AbstractCegarLoop]: Abstraction has 1838 states and 2102 transitions. [2019-11-27 22:38:30,961 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-27 22:38:30,961 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2102 transitions. [2019-11-27 22:38:30,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2019-11-27 22:38:30,973 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:38:30,973 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:38:30,974 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:38:30,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:38:30,974 INFO L82 PathProgramCache]: Analyzing trace with hash 221877156, now seen corresponding path program 1 times [2019-11-27 22:38:30,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:38:30,975 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033823875] [2019-11-27 22:38:30,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:38:31,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:38:32,863 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 351 proven. 8 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2019-11-27 22:38:32,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033823875] [2019-11-27 22:38:32,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1609016036] [2019-11-27 22:38:32,865 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-27 22:38:33,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:38:33,155 INFO L255 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-27 22:38:33,200 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:38:33,417 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 291 proven. 0 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2019-11-27 22:38:33,417 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-27 22:38:33,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 14 [2019-11-27 22:38:33,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008205553] [2019-11-27 22:38:33,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:38:33,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:38:33,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:38:33,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-11-27 22:38:33,422 INFO L87 Difference]: Start difference. First operand 1838 states and 2102 transitions. Second operand 3 states. [2019-11-27 22:38:33,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:38:33,970 INFO L93 Difference]: Finished difference Result 3672 states and 4201 transitions. [2019-11-27 22:38:33,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:38:33,971 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 281 [2019-11-27 22:38:33,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:38:33,973 INFO L225 Difference]: With dead ends: 3672 [2019-11-27 22:38:33,974 INFO L226 Difference]: Without dead ends: 0 [2019-11-27 22:38:33,979 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 285 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-11-27 22:38:33,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-27 22:38:33,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-27 22:38:33,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-27 22:38:33,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-27 22:38:33,980 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 281 [2019-11-27 22:38:33,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:38:33,981 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-27 22:38:33,981 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:38:33,981 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-27 22:38:33,981 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-27 22:38:34,187 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:38:34,190 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-27 22:38:34,318 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 86 [2019-11-27 22:38:34,428 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 87 [2019-11-27 22:38:35,017 WARN L192 SmtUtils]: Spent 586.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 38 [2019-11-27 22:38:35,497 WARN L192 SmtUtils]: Spent 476.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 38 [2019-11-27 22:38:35,500 INFO L246 CegarLoopResult]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-27 22:38:35,500 INFO L246 CegarLoopResult]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-27 22:38:35,501 INFO L246 CegarLoopResult]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:35,501 INFO L246 CegarLoopResult]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:35,501 INFO L246 CegarLoopResult]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:35,501 INFO L246 CegarLoopResult]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:35,501 INFO L246 CegarLoopResult]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:35,502 INFO L246 CegarLoopResult]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:35,502 INFO L246 CegarLoopResult]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-27 22:38:35,502 INFO L246 CegarLoopResult]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-27 22:38:35,502 INFO L246 CegarLoopResult]: For program point L566(line 566) no Hoare annotation was computed. [2019-11-27 22:38:35,502 INFO L246 CegarLoopResult]: For program point L533(line 533) no Hoare annotation was computed. [2019-11-27 22:38:35,502 INFO L246 CegarLoopResult]: For program point L500(line 500) no Hoare annotation was computed. [2019-11-27 22:38:35,502 INFO L246 CegarLoopResult]: For program point L467(line 467) no Hoare annotation was computed. [2019-11-27 22:38:35,503 INFO L246 CegarLoopResult]: For program point L434(line 434) no Hoare annotation was computed. [2019-11-27 22:38:35,503 INFO L246 CegarLoopResult]: For program point L401(line 401) no Hoare annotation was computed. [2019-11-27 22:38:35,503 INFO L246 CegarLoopResult]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-27 22:38:35,503 INFO L246 CegarLoopResult]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-27 22:38:35,503 INFO L246 CegarLoopResult]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:35,503 INFO L246 CegarLoopResult]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:35,503 INFO L246 CegarLoopResult]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:35,503 INFO L246 CegarLoopResult]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:35,503 INFO L246 CegarLoopResult]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:35,504 INFO L246 CegarLoopResult]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:35,506 INFO L246 CegarLoopResult]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-27 22:38:35,507 INFO L246 CegarLoopResult]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-27 22:38:35,507 INFO L246 CegarLoopResult]: For program point L569(line 569) no Hoare annotation was computed. [2019-11-27 22:38:35,507 INFO L246 CegarLoopResult]: For program point L536(line 536) no Hoare annotation was computed. [2019-11-27 22:38:35,507 INFO L246 CegarLoopResult]: For program point L503(line 503) no Hoare annotation was computed. [2019-11-27 22:38:35,508 INFO L246 CegarLoopResult]: For program point L470(line 470) no Hoare annotation was computed. [2019-11-27 22:38:35,508 INFO L246 CegarLoopResult]: For program point L437(line 437) no Hoare annotation was computed. [2019-11-27 22:38:35,508 INFO L246 CegarLoopResult]: For program point L404(line 404) no Hoare annotation was computed. [2019-11-27 22:38:35,508 INFO L246 CegarLoopResult]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-27 22:38:35,509 INFO L246 CegarLoopResult]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-27 22:38:35,509 INFO L246 CegarLoopResult]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-27 22:38:35,509 INFO L246 CegarLoopResult]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-27 22:38:35,513 INFO L246 CegarLoopResult]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-27 22:38:35,514 INFO L246 CegarLoopResult]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-27 22:38:35,514 INFO L246 CegarLoopResult]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2019-11-27 22:38:35,514 INFO L246 CegarLoopResult]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:35,514 INFO L246 CegarLoopResult]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:35,514 INFO L246 CegarLoopResult]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:35,514 INFO L246 CegarLoopResult]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:35,515 INFO L246 CegarLoopResult]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:35,515 INFO L246 CegarLoopResult]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-27 22:38:35,515 INFO L246 CegarLoopResult]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-27 22:38:35,515 INFO L246 CegarLoopResult]: For program point L572(line 572) no Hoare annotation was computed. [2019-11-27 22:38:35,515 INFO L246 CegarLoopResult]: For program point L539(line 539) no Hoare annotation was computed. [2019-11-27 22:38:35,516 INFO L246 CegarLoopResult]: For program point L506(line 506) no Hoare annotation was computed. [2019-11-27 22:38:35,516 INFO L246 CegarLoopResult]: For program point L473(line 473) no Hoare annotation was computed. [2019-11-27 22:38:35,516 INFO L246 CegarLoopResult]: For program point L440(line 440) no Hoare annotation was computed. [2019-11-27 22:38:35,516 INFO L246 CegarLoopResult]: For program point L407(line 407) no Hoare annotation was computed. [2019-11-27 22:38:35,516 INFO L246 CegarLoopResult]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-27 22:38:35,518 INFO L242 CegarLoopResult]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse8 (= ~a16~0 6))) (let ((.cse3 (= ~a20~0 1)) (.cse4 (= 15 ~a8~0)) (.cse5 (not .cse8)) (.cse0 (not (= 1 ~a7~0))) (.cse7 (= ~a16~0 4)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a21~0 0)) (.cse1 (= ~a17~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse2 (= ~a16~0 5)) (and (or (and .cse2 .cse3 .cse4) (and .cse5 .cse2 .cse3)) .cse1) (and .cse6 .cse7 (<= ~a17~0 0)) (and .cse0 .cse2 .cse4 .cse8) (and .cse6 .cse8) (and .cse5 .cse0 .cse1 .cse2) (and .cse7 .cse2 (not .cse1)) (and .cse6 .cse1)))) [2019-11-27 22:38:35,518 INFO L246 CegarLoopResult]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:35,519 INFO L246 CegarLoopResult]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:35,519 INFO L246 CegarLoopResult]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:35,519 INFO L246 CegarLoopResult]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:35,519 INFO L246 CegarLoopResult]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:35,520 INFO L246 CegarLoopResult]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-27 22:38:35,520 INFO L246 CegarLoopResult]: For program point L542(line 542) no Hoare annotation was computed. [2019-11-27 22:38:35,520 INFO L246 CegarLoopResult]: For program point L509(line 509) no Hoare annotation was computed. [2019-11-27 22:38:35,520 INFO L246 CegarLoopResult]: For program point L476(line 476) no Hoare annotation was computed. [2019-11-27 22:38:35,521 INFO L246 CegarLoopResult]: For program point L443(line 443) no Hoare annotation was computed. [2019-11-27 22:38:35,521 INFO L246 CegarLoopResult]: For program point L410(line 410) no Hoare annotation was computed. [2019-11-27 22:38:35,521 INFO L246 CegarLoopResult]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-27 22:38:35,521 INFO L246 CegarLoopResult]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-27 22:38:35,522 INFO L246 CegarLoopResult]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-27 22:38:35,522 INFO L246 CegarLoopResult]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-27 22:38:35,522 INFO L246 CegarLoopResult]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-27 22:38:35,522 INFO L246 CegarLoopResult]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-27 22:38:35,523 INFO L246 CegarLoopResult]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-27 22:38:35,523 INFO L249 CegarLoopResult]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-27 22:38:35,523 INFO L246 CegarLoopResult]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:35,524 INFO L246 CegarLoopResult]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:35,524 INFO L246 CegarLoopResult]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:35,524 INFO L246 CegarLoopResult]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:35,524 INFO L246 CegarLoopResult]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:35,524 INFO L246 CegarLoopResult]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-27 22:38:35,525 INFO L246 CegarLoopResult]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-27 22:38:35,525 INFO L246 CegarLoopResult]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-27 22:38:35,525 INFO L246 CegarLoopResult]: For program point L545(line 545) no Hoare annotation was computed. [2019-11-27 22:38:35,525 INFO L246 CegarLoopResult]: For program point L512(line 512) no Hoare annotation was computed. [2019-11-27 22:38:35,525 INFO L246 CegarLoopResult]: For program point L479(line 479) no Hoare annotation was computed. [2019-11-27 22:38:35,525 INFO L246 CegarLoopResult]: For program point L446(line 446) no Hoare annotation was computed. [2019-11-27 22:38:35,526 INFO L246 CegarLoopResult]: For program point L413(line 413) no Hoare annotation was computed. [2019-11-27 22:38:35,526 INFO L246 CegarLoopResult]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-27 22:38:35,527 INFO L246 CegarLoopResult]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:35,527 INFO L246 CegarLoopResult]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:35,527 INFO L246 CegarLoopResult]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:35,527 INFO L246 CegarLoopResult]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:35,527 INFO L246 CegarLoopResult]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-27 22:38:35,527 INFO L246 CegarLoopResult]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:35,528 INFO L246 CegarLoopResult]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-27 22:38:35,528 INFO L246 CegarLoopResult]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-27 22:38:35,528 INFO L246 CegarLoopResult]: For program point L548(line 548) no Hoare annotation was computed. [2019-11-27 22:38:35,528 INFO L246 CegarLoopResult]: For program point L515(line 515) no Hoare annotation was computed. [2019-11-27 22:38:35,529 INFO L246 CegarLoopResult]: For program point L482(line 482) no Hoare annotation was computed. [2019-11-27 22:38:35,529 INFO L246 CegarLoopResult]: For program point L449(line 449) no Hoare annotation was computed. [2019-11-27 22:38:35,529 INFO L246 CegarLoopResult]: For program point L416(line 416) no Hoare annotation was computed. [2019-11-27 22:38:35,529 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-27 22:38:35,530 INFO L246 CegarLoopResult]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-27 22:38:35,530 INFO L246 CegarLoopResult]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-27 22:38:35,530 INFO L246 CegarLoopResult]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-27 22:38:35,530 INFO L246 CegarLoopResult]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-27 22:38:35,531 INFO L246 CegarLoopResult]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-27 22:38:35,531 INFO L246 CegarLoopResult]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-27 22:38:35,531 INFO L246 CegarLoopResult]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:35,532 INFO L242 CegarLoopResult]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse8 (= ~a16~0 6))) (let ((.cse3 (= ~a20~0 1)) (.cse4 (= 15 ~a8~0)) (.cse5 (not .cse8)) (.cse0 (not (= 1 ~a7~0))) (.cse7 (= ~a16~0 4)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a21~0 0)) (.cse1 (= ~a17~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse2 (= ~a16~0 5)) (and (or (and .cse2 .cse3 .cse4) (and .cse5 .cse2 .cse3)) .cse1) (and .cse6 .cse7 (<= ~a17~0 0)) (and .cse0 .cse2 .cse4 .cse8) (and .cse6 .cse8) (and .cse5 .cse0 .cse1 .cse2) (and .cse7 .cse2 (not .cse1)) (and .cse6 .cse1)))) [2019-11-27 22:38:35,532 INFO L246 CegarLoopResult]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:35,532 INFO L246 CegarLoopResult]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:35,532 INFO L246 CegarLoopResult]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:35,533 INFO L246 CegarLoopResult]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:35,533 INFO L246 CegarLoopResult]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-27 22:38:35,533 INFO L246 CegarLoopResult]: For program point L551(line 551) no Hoare annotation was computed. [2019-11-27 22:38:35,533 INFO L246 CegarLoopResult]: For program point L518(line 518) no Hoare annotation was computed. [2019-11-27 22:38:35,533 INFO L246 CegarLoopResult]: For program point L485(line 485) no Hoare annotation was computed. [2019-11-27 22:38:35,534 INFO L246 CegarLoopResult]: For program point L452(line 452) no Hoare annotation was computed. [2019-11-27 22:38:35,534 INFO L246 CegarLoopResult]: For program point L419(line 419) no Hoare annotation was computed. [2019-11-27 22:38:35,534 INFO L246 CegarLoopResult]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-27 22:38:35,534 INFO L246 CegarLoopResult]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-27 22:38:35,534 INFO L246 CegarLoopResult]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:35,535 INFO L246 CegarLoopResult]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:35,535 INFO L246 CegarLoopResult]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:35,535 INFO L246 CegarLoopResult]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:35,535 INFO L246 CegarLoopResult]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:35,535 INFO L246 CegarLoopResult]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-27 22:38:35,535 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-27 22:38:35,536 INFO L246 CegarLoopResult]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-27 22:38:35,536 INFO L246 CegarLoopResult]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-27 22:38:35,536 INFO L246 CegarLoopResult]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-27 22:38:35,536 INFO L246 CegarLoopResult]: For program point L554(line 554) no Hoare annotation was computed. [2019-11-27 22:38:35,536 INFO L246 CegarLoopResult]: For program point L521(line 521) no Hoare annotation was computed. [2019-11-27 22:38:35,536 INFO L246 CegarLoopResult]: For program point L488(line 488) no Hoare annotation was computed. [2019-11-27 22:38:35,537 INFO L246 CegarLoopResult]: For program point L455(line 455) no Hoare annotation was computed. [2019-11-27 22:38:35,537 INFO L246 CegarLoopResult]: For program point L422(line 422) no Hoare annotation was computed. [2019-11-27 22:38:35,537 INFO L246 CegarLoopResult]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-27 22:38:35,537 INFO L246 CegarLoopResult]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-27 22:38:35,537 INFO L246 CegarLoopResult]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-27 22:38:35,538 INFO L246 CegarLoopResult]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:35,538 INFO L246 CegarLoopResult]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:35,538 INFO L246 CegarLoopResult]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:35,538 INFO L246 CegarLoopResult]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:35,539 INFO L246 CegarLoopResult]: For program point L391(lines 391 393) no Hoare annotation was computed. [2019-11-27 22:38:35,539 INFO L246 CegarLoopResult]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:35,539 INFO L246 CegarLoopResult]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:35,539 INFO L246 CegarLoopResult]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-27 22:38:35,540 INFO L246 CegarLoopResult]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-27 22:38:35,540 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-27 22:38:35,540 INFO L246 CegarLoopResult]: For program point L557(line 557) no Hoare annotation was computed. [2019-11-27 22:38:35,540 INFO L246 CegarLoopResult]: For program point L524(line 524) no Hoare annotation was computed. [2019-11-27 22:38:35,541 INFO L246 CegarLoopResult]: For program point L491(line 491) no Hoare annotation was computed. [2019-11-27 22:38:35,541 INFO L246 CegarLoopResult]: For program point L458(line 458) no Hoare annotation was computed. [2019-11-27 22:38:35,541 INFO L246 CegarLoopResult]: For program point L425(line 425) no Hoare annotation was computed. [2019-11-27 22:38:35,541 INFO L246 CegarLoopResult]: For program point L392(line 392) no Hoare annotation was computed. [2019-11-27 22:38:35,542 INFO L246 CegarLoopResult]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-27 22:38:35,542 INFO L246 CegarLoopResult]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-27 22:38:35,542 INFO L246 CegarLoopResult]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-27 22:38:35,542 INFO L246 CegarLoopResult]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-27 22:38:35,542 INFO L246 CegarLoopResult]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:35,543 INFO L246 CegarLoopResult]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:35,543 INFO L246 CegarLoopResult]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:35,543 INFO L246 CegarLoopResult]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:35,543 INFO L246 CegarLoopResult]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:35,543 INFO L246 CegarLoopResult]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-27 22:38:35,544 INFO L246 CegarLoopResult]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:35,544 INFO L246 CegarLoopResult]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-27 22:38:35,544 INFO L246 CegarLoopResult]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-27 22:38:35,544 INFO L246 CegarLoopResult]: For program point L560(line 560) no Hoare annotation was computed. [2019-11-27 22:38:35,544 INFO L246 CegarLoopResult]: For program point L527(line 527) no Hoare annotation was computed. [2019-11-27 22:38:35,544 INFO L246 CegarLoopResult]: For program point L494(line 494) no Hoare annotation was computed. [2019-11-27 22:38:35,545 INFO L246 CegarLoopResult]: For program point L461(line 461) no Hoare annotation was computed. [2019-11-27 22:38:35,545 INFO L246 CegarLoopResult]: For program point L428(line 428) no Hoare annotation was computed. [2019-11-27 22:38:35,545 INFO L246 CegarLoopResult]: For program point L395(line 395) no Hoare annotation was computed. [2019-11-27 22:38:35,545 INFO L246 CegarLoopResult]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-27 22:38:35,545 INFO L246 CegarLoopResult]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-27 22:38:35,546 INFO L246 CegarLoopResult]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-27 22:38:35,546 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-27 22:38:35,546 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 449) no Hoare annotation was computed. [2019-11-27 22:38:35,546 INFO L246 CegarLoopResult]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-27 22:38:35,546 INFO L246 CegarLoopResult]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-27 22:38:35,546 INFO L246 CegarLoopResult]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-27 22:38:35,547 INFO L246 CegarLoopResult]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:35,547 INFO L246 CegarLoopResult]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:35,547 INFO L246 CegarLoopResult]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:35,547 INFO L246 CegarLoopResult]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:35,547 INFO L246 CegarLoopResult]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:35,547 INFO L246 CegarLoopResult]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:35,548 INFO L246 CegarLoopResult]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-27 22:38:35,548 INFO L246 CegarLoopResult]: For program point L563(line 563) no Hoare annotation was computed. [2019-11-27 22:38:35,548 INFO L246 CegarLoopResult]: For program point L530(line 530) no Hoare annotation was computed. [2019-11-27 22:38:35,548 INFO L246 CegarLoopResult]: For program point L497(line 497) no Hoare annotation was computed. [2019-11-27 22:38:35,548 INFO L246 CegarLoopResult]: For program point L464(line 464) no Hoare annotation was computed. [2019-11-27 22:38:35,548 INFO L246 CegarLoopResult]: For program point L431(line 431) no Hoare annotation was computed. [2019-11-27 22:38:35,549 INFO L246 CegarLoopResult]: For program point L398(line 398) no Hoare annotation was computed. [2019-11-27 22:38:35,549 INFO L246 CegarLoopResult]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-27 22:38:35,549 INFO L246 CegarLoopResult]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-27 22:38:35,549 INFO L246 CegarLoopResult]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-27 22:38:35,590 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 10:38:35 BoogieIcfgContainer [2019-11-27 22:38:35,591 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-27 22:38:35,592 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-27 22:38:35,592 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-27 22:38:35,592 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-27 22:38:35,593 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:38:19" (3/4) ... [2019-11-27 22:38:35,597 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-27 22:38:35,621 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-27 22:38:35,622 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-27 22:38:35,849 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-27 22:38:35,849 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-27 22:38:35,851 INFO L168 Benchmark]: Toolchain (without parser) took 18446.70 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 406.3 MB). Free memory was 952.3 MB in the beginning and 918.7 MB in the end (delta: 33.6 MB). Peak memory consumption was 439.9 MB. Max. memory is 11.5 GB. [2019-11-27 22:38:35,851 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 22:38:35,852 INFO L168 Benchmark]: CACSL2BoogieTranslator took 745.66 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.3 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -122.5 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. [2019-11-27 22:38:35,852 INFO L168 Benchmark]: Boogie Procedure Inliner took 96.37 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-11-27 22:38:35,853 INFO L168 Benchmark]: Boogie Preprocessor took 84.15 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-11-27 22:38:35,853 INFO L168 Benchmark]: RCFGBuilder took 1467.94 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 954.6 MB in the end (delta: 101.1 MB). Peak memory consumption was 101.1 MB. Max. memory is 11.5 GB. [2019-11-27 22:38:35,854 INFO L168 Benchmark]: TraceAbstraction took 15788.63 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 303.0 MB). Free memory was 954.6 MB in the beginning and 931.4 MB in the end (delta: 23.2 MB). Peak memory consumption was 326.2 MB. Max. memory is 11.5 GB. [2019-11-27 22:38:35,854 INFO L168 Benchmark]: Witness Printer took 257.26 ms. Allocated memory is still 1.4 GB. Free memory was 931.4 MB in the beginning and 918.7 MB in the end (delta: 12.7 MB). Peak memory consumption was 12.7 MB. Max. memory is 11.5 GB. [2019-11-27 22:38:35,856 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.27 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 745.66 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.3 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -122.5 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 96.37 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 84.15 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1467.94 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 954.6 MB in the end (delta: 101.1 MB). Peak memory consumption was 101.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 15788.63 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 303.0 MB). Free memory was 954.6 MB in the beginning and 931.4 MB in the end (delta: 23.2 MB). Peak memory consumption was 326.2 MB. Max. memory is 11.5 GB. * Witness Printer took 257.26 ms. Allocated memory is still 1.4 GB. Free memory was 931.4 MB in the beginning and 918.7 MB in the end (delta: 12.7 MB). Peak memory consumption was 12.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 449]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((((((((((!(1 == a7) && a17 == 1) && a21 == 1) && a20 == 1) || (a21 == 1 && a16 == 5)) || ((((a21 == 1 && a20 == 1) && 15 == a8) || ((!(a16 == 6) && a21 == 1) && a20 == 1)) && a17 == 1)) || ((a21 <= 0 && a16 == 4) && a17 <= 0)) || (((!(1 == a7) && a21 == 1) && 15 == a8) && a16 == 6)) || (a21 <= 0 && a16 == 6)) || (((!(a16 == 6) && !(1 == a7)) && a17 == 1) && a21 == 1)) || ((a16 == 4 && a21 == 1) && !(a17 == 1))) || (a21 <= 0 && a17 == 1) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((((((((!(1 == a7) && a17 == 1) && a21 == 1) && a20 == 1) || (a21 == 1 && a16 == 5)) || ((((a21 == 1 && a20 == 1) && 15 == a8) || ((!(a16 == 6) && a21 == 1) && a20 == 1)) && a17 == 1)) || ((a21 <= 0 && a16 == 4) && a17 <= 0)) || (((!(1 == a7) && a21 == 1) && 15 == a8) && a16 == 6)) || (a21 <= 0 && a16 == 6)) || (((!(a16 == 6) && !(1 == a7)) && a17 == 1) && a21 == 1)) || ((a16 == 4 && a21 == 1) && !(a17 == 1))) || (a21 <= 0 && a17 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. Result: SAFE, OverallTime: 14.3s, OverallIterations: 11, TraceHistogramMax: 7, AutomataDifference: 8.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.3s, HoareTripleCheckerStatistics: 951 SDtfs, 2137 SDslu, 120 SDs, 0 SdLazy, 5988 SolverSat, 954 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 338 GetRequests, 299 SyntacticMatches, 5 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2100occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 11 MinimizatonAttempts, 1911 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 34 NumberOfFragments, 225 HoareAnnotationTreeSize, 3 FomulaSimplifications, 6228 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 3 FomulaSimplificationsInter, 4081 FormulaSimplificationTreeSizeReductionInter, 1.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 2254 NumberOfCodeBlocks, 2254 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2242 ConstructedInterpolants, 0 QuantifiedInterpolants, 1623912 SizeOfPredicates, 1 NumberOfNonLiveVariables, 513 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 12 InterpolantComputations, 11 PerfectInterpolantSequences, 2711/2719 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...