./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.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/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.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 e55536c26dc3d2371d51cd4bd073d4d19c2d7077 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 00:01:54,120 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 00:01:54,123 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 00:01:54,140 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 00:01:54,140 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 00:01:54,142 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 00:01:54,144 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 00:01:54,153 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 00:01:54,158 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 00:01:54,161 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 00:01:54,162 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 00:01:54,164 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 00:01:54,165 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 00:01:54,167 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 00:01:54,168 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 00:01:54,169 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 00:01:54,171 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 00:01:54,172 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 00:01:54,174 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 00:01:54,178 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 00:01:54,182 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 00:01:54,186 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 00:01:54,187 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 00:01:54,188 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 00:01:54,190 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 00:01:54,191 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 00:01:54,191 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 00:01:54,193 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 00:01:54,193 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 00:01:54,194 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 00:01:54,194 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 00:01:54,195 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 00:01:54,196 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 00:01:54,197 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 00:01:54,198 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 00:01:54,199 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 00:01:54,200 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 00:01:54,200 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 00:01:54,200 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 00:01:54,201 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 00:01:54,202 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 00:01:54,203 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 00:01:54,238 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 00:01:54,238 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 00:01:54,239 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 00:01:54,242 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 00:01:54,245 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 00:01:54,245 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 00:01:54,245 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 00:01:54,245 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 00:01:54,245 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 00:01:54,246 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 00:01:54,246 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 00:01:54,246 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 00:01:54,246 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 00:01:54,246 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 00:01:54,247 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 00:01:54,247 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 00:01:54,247 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 00:01:54,247 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 00:01:54,248 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 00:01:54,248 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 00:01:54,248 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 00:01:54,248 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 00:01:54,248 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 00:01:54,249 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 00:01:54,249 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 00:01:54,249 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 00:01:54,249 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 00:01:54,250 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 00:01:54,250 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 -> e55536c26dc3d2371d51cd4bd073d4d19c2d7077 [2019-11-28 00:01:54,534 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 00:01:54,556 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 00:01:54,559 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 00:01:54,561 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 00:01:54,561 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 00:01:54,562 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c [2019-11-28 00:01:54,634 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdbadd4b8/ae71629827b04affa886b1eae484cc2c/FLAG6a5538e0f [2019-11-28 00:01:55,116 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 00:01:55,117 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c [2019-11-28 00:01:55,127 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdbadd4b8/ae71629827b04affa886b1eae484cc2c/FLAG6a5538e0f [2019-11-28 00:01:55,483 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdbadd4b8/ae71629827b04affa886b1eae484cc2c [2019-11-28 00:01:55,487 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 00:01:55,488 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 00:01:55,490 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 00:01:55,491 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 00:01:55,494 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 00:01:55,495 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:01:55" (1/1) ... [2019-11-28 00:01:55,498 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@762a845e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:01:55, skipping insertion in model container [2019-11-28 00:01:55,499 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:01:55" (1/1) ... [2019-11-28 00:01:55,506 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 00:01:55,558 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 00:01:55,768 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:01:55,774 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 00:01:55,813 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:01:55,891 INFO L208 MainTranslator]: Completed translation [2019-11-28 00:01:55,892 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:01:55 WrapperNode [2019-11-28 00:01:55,892 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 00:01:55,893 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 00:01:55,893 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 00:01:55,893 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 00:01:55,903 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:01:55" (1/1) ... [2019-11-28 00:01:55,909 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:01:55" (1/1) ... [2019-11-28 00:01:55,946 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 00:01:55,946 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 00:01:55,946 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 00:01:55,946 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 00:01:55,955 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:01:55" (1/1) ... [2019-11-28 00:01:55,956 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:01:55" (1/1) ... [2019-11-28 00:01:55,958 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:01:55" (1/1) ... [2019-11-28 00:01:55,959 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:01:55" (1/1) ... [2019-11-28 00:01:55,964 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:01:55" (1/1) ... [2019-11-28 00:01:55,967 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:01:55" (1/1) ... [2019-11-28 00:01:55,969 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:01:55" (1/1) ... [2019-11-28 00:01:55,972 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 00:01:55,973 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 00:01:55,973 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 00:01:55,973 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 00:01:55,974 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:01:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 00:01:56,046 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 00:01:56,046 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 00:01:56,482 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 00:01:56,483 INFO L297 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-28 00:01:56,484 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:01:56 BoogieIcfgContainer [2019-11-28 00:01:56,484 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 00:01:56,486 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 00:01:56,486 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 00:01:56,489 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 00:01:56,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 12:01:55" (1/3) ... [2019-11-28 00:01:56,490 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@617ab84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:01:56, skipping insertion in model container [2019-11-28 00:01:56,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:01:55" (2/3) ... [2019-11-28 00:01:56,491 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@617ab84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:01:56, skipping insertion in model container [2019-11-28 00:01:56,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:01:56" (3/3) ... [2019-11-28 00:01:56,493 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i.v+cfa-reducer.c [2019-11-28 00:01:56,503 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 00:01:56,511 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 18 error locations. [2019-11-28 00:01:56,524 INFO L249 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2019-11-28 00:01:56,554 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 00:01:56,554 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 00:01:56,554 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 00:01:56,555 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 00:01:56,555 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 00:01:56,555 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 00:01:56,555 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 00:01:56,555 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 00:01:56,580 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states. [2019-11-28 00:01:56,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 00:01:56,586 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:01:56,587 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:01:56,588 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:01:56,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:01:56,593 INFO L82 PathProgramCache]: Analyzing trace with hash -2034435078, now seen corresponding path program 1 times [2019-11-28 00:01:56,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:01:56,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250043917] [2019-11-28 00:01:56,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:01:56,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:01:56,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:01:56,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250043917] [2019-11-28 00:01:56,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:01:56,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:01:56,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166294273] [2019-11-28 00:01:56,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:01:56,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:01:56,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:01:56,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:01:56,797 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 3 states. [2019-11-28 00:01:56,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:01:56,832 INFO L93 Difference]: Finished difference Result 88 states and 123 transitions. [2019-11-28 00:01:56,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:01:56,835 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-28 00:01:56,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:01:56,850 INFO L225 Difference]: With dead ends: 88 [2019-11-28 00:01:56,850 INFO L226 Difference]: Without dead ends: 76 [2019-11-28 00:01:56,856 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:01:56,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-11-28 00:01:56,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-11-28 00:01:56,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-11-28 00:01:56,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2019-11-28 00:01:56,901 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 15 [2019-11-28 00:01:56,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:01:56,902 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2019-11-28 00:01:56,902 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:01:56,902 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2019-11-28 00:01:56,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 00:01:56,903 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:01:56,903 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:01:56,904 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:01:56,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:01:56,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1357026114, now seen corresponding path program 1 times [2019-11-28 00:01:56,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:01:56,905 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742115796] [2019-11-28 00:01:56,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:01:56,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:01:57,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:01:57,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742115796] [2019-11-28 00:01:57,026 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:01:57,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 00:01:57,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108061441] [2019-11-28 00:01:57,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 00:01:57,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:01:57,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 00:01:57,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 00:01:57,035 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand 6 states. [2019-11-28 00:01:57,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:01:57,213 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2019-11-28 00:01:57,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 00:01:57,215 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-11-28 00:01:57,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:01:57,216 INFO L225 Difference]: With dead ends: 76 [2019-11-28 00:01:57,216 INFO L226 Difference]: Without dead ends: 74 [2019-11-28 00:01:57,218 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-28 00:01:57,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-28 00:01:57,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-11-28 00:01:57,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-28 00:01:57,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2019-11-28 00:01:57,228 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 16 [2019-11-28 00:01:57,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:01:57,229 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2019-11-28 00:01:57,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 00:01:57,229 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2019-11-28 00:01:57,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 00:01:57,230 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:01:57,230 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:01:57,231 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:01:57,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:01:57,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1567835227, now seen corresponding path program 1 times [2019-11-28 00:01:57,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:01:57,232 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603704286] [2019-11-28 00:01:57,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:01:57,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:01:57,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:01:57,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603704286] [2019-11-28 00:01:57,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:01:57,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:01:57,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876871044] [2019-11-28 00:01:57,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 00:01:57,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:01:57,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 00:01:57,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 00:01:57,299 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand 4 states. [2019-11-28 00:01:57,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:01:57,395 INFO L93 Difference]: Finished difference Result 97 states and 102 transitions. [2019-11-28 00:01:57,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 00:01:57,395 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-11-28 00:01:57,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:01:57,397 INFO L225 Difference]: With dead ends: 97 [2019-11-28 00:01:57,397 INFO L226 Difference]: Without dead ends: 95 [2019-11-28 00:01:57,398 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:01:57,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-11-28 00:01:57,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 72. [2019-11-28 00:01:57,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-28 00:01:57,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 75 transitions. [2019-11-28 00:01:57,408 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 75 transitions. Word has length 18 [2019-11-28 00:01:57,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:01:57,409 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 75 transitions. [2019-11-28 00:01:57,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 00:01:57,409 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2019-11-28 00:01:57,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 00:01:57,410 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:01:57,410 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:01:57,411 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:01:57,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:01:57,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1358247672, now seen corresponding path program 1 times [2019-11-28 00:01:57,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:01:57,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819931681] [2019-11-28 00:01:57,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:01:57,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:01:57,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:01:57,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819931681] [2019-11-28 00:01:57,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:01:57,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:01:57,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578016898] [2019-11-28 00:01:57,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:01:57,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:01:57,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:01:57,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:01:57,498 INFO L87 Difference]: Start difference. First operand 72 states and 75 transitions. Second operand 5 states. [2019-11-28 00:01:57,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:01:57,583 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2019-11-28 00:01:57,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 00:01:57,584 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-11-28 00:01:57,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:01:57,585 INFO L225 Difference]: With dead ends: 72 [2019-11-28 00:01:57,585 INFO L226 Difference]: Without dead ends: 70 [2019-11-28 00:01:57,586 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 00:01:57,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-11-28 00:01:57,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-11-28 00:01:57,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-11-28 00:01:57,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2019-11-28 00:01:57,595 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 19 [2019-11-28 00:01:57,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:01:57,595 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2019-11-28 00:01:57,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:01:57,596 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2019-11-28 00:01:57,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 00:01:57,597 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:01:57,597 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] [2019-11-28 00:01:57,597 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:01:57,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:01:57,598 INFO L82 PathProgramCache]: Analyzing trace with hash -665385716, now seen corresponding path program 1 times [2019-11-28 00:01:57,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:01:57,599 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49470254] [2019-11-28 00:01:57,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:01:57,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:01:57,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:01:57,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49470254] [2019-11-28 00:01:57,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:01:57,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:01:57,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190539072] [2019-11-28 00:01:57,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:01:57,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:01:57,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:01:57,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:01:57,706 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand 5 states. [2019-11-28 00:01:57,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:01:57,913 INFO L93 Difference]: Finished difference Result 137 states and 143 transitions. [2019-11-28 00:01:57,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 00:01:57,914 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-28 00:01:57,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:01:57,915 INFO L225 Difference]: With dead ends: 137 [2019-11-28 00:01:57,916 INFO L226 Difference]: Without dead ends: 135 [2019-11-28 00:01:57,916 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-28 00:01:57,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-11-28 00:01:57,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 73. [2019-11-28 00:01:57,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-11-28 00:01:57,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2019-11-28 00:01:57,937 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 22 [2019-11-28 00:01:57,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:01:57,938 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2019-11-28 00:01:57,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:01:57,938 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2019-11-28 00:01:57,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 00:01:57,939 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:01:57,939 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] [2019-11-28 00:01:57,941 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:01:57,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:01:57,941 INFO L82 PathProgramCache]: Analyzing trace with hash -661217951, now seen corresponding path program 1 times [2019-11-28 00:01:57,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:01:57,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128040579] [2019-11-28 00:01:57,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:01:57,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:01:58,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:01:58,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128040579] [2019-11-28 00:01:58,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:01:58,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:01:58,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326922414] [2019-11-28 00:01:58,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:01:58,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:01:58,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:01:58,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:01:58,050 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand 5 states. [2019-11-28 00:01:58,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:01:58,230 INFO L93 Difference]: Finished difference Result 104 states and 110 transitions. [2019-11-28 00:01:58,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 00:01:58,231 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-28 00:01:58,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:01:58,232 INFO L225 Difference]: With dead ends: 104 [2019-11-28 00:01:58,232 INFO L226 Difference]: Without dead ends: 102 [2019-11-28 00:01:58,233 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-28 00:01:58,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-11-28 00:01:58,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 75. [2019-11-28 00:01:58,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-28 00:01:58,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2019-11-28 00:01:58,242 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 22 [2019-11-28 00:01:58,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:01:58,242 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2019-11-28 00:01:58,242 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:01:58,242 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2019-11-28 00:01:58,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 00:01:58,243 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:01:58,243 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:01:58,244 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:01:58,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:01:58,244 INFO L82 PathProgramCache]: Analyzing trace with hash 847883539, now seen corresponding path program 1 times [2019-11-28 00:01:58,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:01:58,245 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974420046] [2019-11-28 00:01:58,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:01:58,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:01:58,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:01:58,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974420046] [2019-11-28 00:01:58,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:01:58,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:01:58,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622432162] [2019-11-28 00:01:58,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:01:58,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:01:58,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:01:58,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:01:58,325 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand 5 states. [2019-11-28 00:01:58,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:01:58,486 INFO L93 Difference]: Finished difference Result 117 states and 123 transitions. [2019-11-28 00:01:58,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 00:01:58,488 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-11-28 00:01:58,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:01:58,489 INFO L225 Difference]: With dead ends: 117 [2019-11-28 00:01:58,489 INFO L226 Difference]: Without dead ends: 115 [2019-11-28 00:01:58,490 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 00:01:58,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-11-28 00:01:58,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 73. [2019-11-28 00:01:58,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-11-28 00:01:58,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2019-11-28 00:01:58,505 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 23 [2019-11-28 00:01:58,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:01:58,506 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2019-11-28 00:01:58,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:01:58,506 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2019-11-28 00:01:58,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 00:01:58,510 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:01:58,511 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:01:58,511 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:01:58,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:01:58,512 INFO L82 PathProgramCache]: Analyzing trace with hash 977084131, now seen corresponding path program 1 times [2019-11-28 00:01:58,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:01:58,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618950962] [2019-11-28 00:01:58,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:01:58,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:01:58,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:01:58,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618950962] [2019-11-28 00:01:58,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:01:58,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:01:58,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136426567] [2019-11-28 00:01:58,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:01:58,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:01:58,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:01:58,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:01:58,602 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand 5 states. [2019-11-28 00:01:58,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:01:58,701 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2019-11-28 00:01:58,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 00:01:58,702 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-11-28 00:01:58,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:01:58,703 INFO L225 Difference]: With dead ends: 73 [2019-11-28 00:01:58,703 INFO L226 Difference]: Without dead ends: 71 [2019-11-28 00:01:58,703 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 00:01:58,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-28 00:01:58,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-11-28 00:01:58,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-28 00:01:58,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 76 transitions. [2019-11-28 00:01:58,710 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 76 transitions. Word has length 23 [2019-11-28 00:01:58,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:01:58,710 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 76 transitions. [2019-11-28 00:01:58,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:01:58,710 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2019-11-28 00:01:58,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 00:01:58,711 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:01:58,712 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:01:58,712 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:01:58,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:01:58,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1619855478, now seen corresponding path program 1 times [2019-11-28 00:01:58,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:01:58,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414699680] [2019-11-28 00:01:58,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:01:58,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:01:58,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:01:58,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414699680] [2019-11-28 00:01:58,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:01:58,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:01:58,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063040207] [2019-11-28 00:01:58,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:01:58,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:01:58,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:01:58,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:01:58,754 INFO L87 Difference]: Start difference. First operand 71 states and 76 transitions. Second operand 3 states. [2019-11-28 00:01:58,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:01:58,808 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2019-11-28 00:01:58,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:01:58,809 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-28 00:01:58,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:01:58,810 INFO L225 Difference]: With dead ends: 111 [2019-11-28 00:01:58,810 INFO L226 Difference]: Without dead ends: 71 [2019-11-28 00:01:58,811 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:01:58,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-28 00:01:58,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-11-28 00:01:58,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-28 00:01:58,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2019-11-28 00:01:58,818 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 25 [2019-11-28 00:01:58,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:01:58,818 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2019-11-28 00:01:58,819 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:01:58,819 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2019-11-28 00:01:58,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 00:01:58,820 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:01:58,820 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:01:58,821 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:01:58,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:01:58,821 INFO L82 PathProgramCache]: Analyzing trace with hash 595608307, now seen corresponding path program 1 times [2019-11-28 00:01:58,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:01:58,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394311843] [2019-11-28 00:01:58,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:01:58,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:01:58,878 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 00:01:58,879 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394311843] [2019-11-28 00:01:58,879 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [399279740] [2019-11-28 00:01:58,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:01:58,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:01:58,944 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-28 00:01:58,951 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:01:59,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 00:01:59,046 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 00:01:59,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:01:59,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 7 [2019-11-28 00:01:59,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298833205] [2019-11-28 00:01:59,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 00:01:59,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:01:59,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 00:01:59,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-28 00:01:59,054 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand 7 states. [2019-11-28 00:01:59,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:01:59,195 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2019-11-28 00:01:59,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 00:01:59,195 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-11-28 00:01:59,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:01:59,196 INFO L225 Difference]: With dead ends: 111 [2019-11-28 00:01:59,196 INFO L226 Difference]: Without dead ends: 109 [2019-11-28 00:01:59,199 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-28 00:01:59,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-11-28 00:01:59,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 68. [2019-11-28 00:01:59,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-28 00:01:59,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2019-11-28 00:01:59,206 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 26 [2019-11-28 00:01:59,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:01:59,210 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2019-11-28 00:01:59,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 00:01:59,210 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2019-11-28 00:01:59,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 00:01:59,211 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:01:59,211 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:01:59,412 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:01:59,413 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:01:59,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:01:59,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1780382557, now seen corresponding path program 1 times [2019-11-28 00:01:59,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:01:59,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408864703] [2019-11-28 00:01:59,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:01:59,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:01:59,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:01:59,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408864703] [2019-11-28 00:01:59,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:01:59,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:01:59,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368427616] [2019-11-28 00:01:59,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:01:59,476 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:01:59,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:01:59,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:01:59,477 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand 5 states. [2019-11-28 00:01:59,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:01:59,552 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2019-11-28 00:01:59,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 00:01:59,552 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-11-28 00:01:59,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:01:59,553 INFO L225 Difference]: With dead ends: 69 [2019-11-28 00:01:59,553 INFO L226 Difference]: Without dead ends: 67 [2019-11-28 00:01:59,554 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-28 00:01:59,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-11-28 00:01:59,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2019-11-28 00:01:59,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-28 00:01:59,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2019-11-28 00:01:59,559 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 26 [2019-11-28 00:01:59,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:01:59,560 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2019-11-28 00:01:59,560 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:01:59,560 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2019-11-28 00:01:59,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 00:01:59,561 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:01:59,561 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:01:59,561 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:01:59,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:01:59,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1280139623, now seen corresponding path program 1 times [2019-11-28 00:01:59,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:01:59,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452138741] [2019-11-28 00:01:59,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:01:59,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:01:59,659 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 00:01:59,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452138741] [2019-11-28 00:01:59,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151216944] [2019-11-28 00:01:59,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:01:59,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:01:59,707 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-28 00:01:59,709 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:01:59,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 00:01:59,814 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 00:01:59,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:01:59,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 7 [2019-11-28 00:01:59,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253408840] [2019-11-28 00:01:59,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 00:01:59,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:01:59,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 00:01:59,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-28 00:01:59,819 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand 7 states. [2019-11-28 00:01:59,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:01:59,941 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2019-11-28 00:01:59,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 00:01:59,944 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2019-11-28 00:01:59,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:01:59,945 INFO L225 Difference]: With dead ends: 67 [2019-11-28 00:01:59,945 INFO L226 Difference]: Without dead ends: 65 [2019-11-28 00:01:59,945 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-28 00:01:59,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-11-28 00:01:59,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 60. [2019-11-28 00:01:59,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-28 00:01:59,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2019-11-28 00:01:59,951 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 27 [2019-11-28 00:01:59,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:01:59,951 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2019-11-28 00:01:59,951 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 00:01:59,952 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2019-11-28 00:01:59,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 00:01:59,954 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:01:59,954 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:02:00,157 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:02:00,158 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:02:00,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:02:00,159 INFO L82 PathProgramCache]: Analyzing trace with hash -642711428, now seen corresponding path program 1 times [2019-11-28 00:02:00,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:02:00,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467854753] [2019-11-28 00:02:00,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:02:00,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:02:00,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:02:00,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467854753] [2019-11-28 00:02:00,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:02:00,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:02:00,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578767667] [2019-11-28 00:02:00,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:02:00,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:02:00,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:02:00,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:02:00,195 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 5 states. [2019-11-28 00:02:00,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:02:00,266 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2019-11-28 00:02:00,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 00:02:00,266 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-11-28 00:02:00,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:02:00,267 INFO L225 Difference]: With dead ends: 60 [2019-11-28 00:02:00,267 INFO L226 Difference]: Without dead ends: 58 [2019-11-28 00:02:00,268 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 00:02:00,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-11-28 00:02:00,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-11-28 00:02:00,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-28 00:02:00,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2019-11-28 00:02:00,272 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 27 [2019-11-28 00:02:00,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:02:00,272 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2019-11-28 00:02:00,272 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:02:00,272 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2019-11-28 00:02:00,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-28 00:02:00,273 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:02:00,273 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] [2019-11-28 00:02:00,273 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:02:00,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:02:00,274 INFO L82 PathProgramCache]: Analyzing trace with hash -47880409, now seen corresponding path program 1 times [2019-11-28 00:02:00,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:02:00,274 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47811019] [2019-11-28 00:02:00,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:02:00,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:02:00,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:02:00,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47811019] [2019-11-28 00:02:00,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:02:00,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:02:00,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150256150] [2019-11-28 00:02:00,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:02:00,320 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:02:00,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:02:00,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:02:00,321 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 5 states. [2019-11-28 00:02:00,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:02:00,384 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2019-11-28 00:02:00,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 00:02:00,384 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-11-28 00:02:00,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:02:00,385 INFO L225 Difference]: With dead ends: 59 [2019-11-28 00:02:00,385 INFO L226 Difference]: Without dead ends: 57 [2019-11-28 00:02:00,386 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-28 00:02:00,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-28 00:02:00,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2019-11-28 00:02:00,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-11-28 00:02:00,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2019-11-28 00:02:00,390 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 30 [2019-11-28 00:02:00,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:02:00,391 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2019-11-28 00:02:00,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:02:00,391 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2019-11-28 00:02:00,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 00:02:00,391 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:02:00,392 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] [2019-11-28 00:02:00,392 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:02:00,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:02:00,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1484288504, now seen corresponding path program 1 times [2019-11-28 00:02:00,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:02:00,393 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250926392] [2019-11-28 00:02:00,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:02:00,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:02:00,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:02:00,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250926392] [2019-11-28 00:02:00,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:02:00,436 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 00:02:00,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80842330] [2019-11-28 00:02:00,436 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 00:02:00,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:02:00,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 00:02:00,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 00:02:00,437 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 6 states. [2019-11-28 00:02:00,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:02:00,529 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2019-11-28 00:02:00,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 00:02:00,529 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2019-11-28 00:02:00,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:02:00,530 INFO L225 Difference]: With dead ends: 67 [2019-11-28 00:02:00,530 INFO L226 Difference]: Without dead ends: 65 [2019-11-28 00:02:00,531 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-11-28 00:02:00,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-11-28 00:02:00,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 54. [2019-11-28 00:02:00,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-28 00:02:00,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2019-11-28 00:02:00,535 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 31 [2019-11-28 00:02:00,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:02:00,535 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2019-11-28 00:02:00,535 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 00:02:00,535 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2019-11-28 00:02:00,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-28 00:02:00,536 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:02:00,536 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] [2019-11-28 00:02:00,536 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:02:00,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:02:00,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1746453711, now seen corresponding path program 1 times [2019-11-28 00:02:00,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:02:00,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184964713] [2019-11-28 00:02:00,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:02:00,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:02:00,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:02:00,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184964713] [2019-11-28 00:02:00,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:02:00,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:02:00,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140264800] [2019-11-28 00:02:00,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:02:00,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:02:00,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:02:00,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:02:00,584 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand 5 states. [2019-11-28 00:02:00,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:02:00,699 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2019-11-28 00:02:00,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 00:02:00,699 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-11-28 00:02:00,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:02:00,700 INFO L225 Difference]: With dead ends: 87 [2019-11-28 00:02:00,700 INFO L226 Difference]: Without dead ends: 85 [2019-11-28 00:02:00,701 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 00:02:00,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-11-28 00:02:00,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 57. [2019-11-28 00:02:00,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-11-28 00:02:00,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2019-11-28 00:02:00,706 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 34 [2019-11-28 00:02:00,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:02:00,706 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2019-11-28 00:02:00,706 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:02:00,707 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2019-11-28 00:02:00,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-28 00:02:00,707 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:02:00,708 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] [2019-11-28 00:02:00,708 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:02:00,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:02:00,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1694514003, now seen corresponding path program 1 times [2019-11-28 00:02:00,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:02:00,709 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085351537] [2019-11-28 00:02:00,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:02:00,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:02:00,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:02:00,756 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085351537] [2019-11-28 00:02:00,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:02:00,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:02:00,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124257847] [2019-11-28 00:02:00,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:02:00,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:02:00,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:02:00,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:02:00,757 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand 5 states. [2019-11-28 00:02:00,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:02:00,855 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2019-11-28 00:02:00,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 00:02:00,856 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2019-11-28 00:02:00,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:02:00,856 INFO L225 Difference]: With dead ends: 57 [2019-11-28 00:02:00,856 INFO L226 Difference]: Without dead ends: 55 [2019-11-28 00:02:00,857 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 00:02:00,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-28 00:02:00,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-11-28 00:02:00,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-11-28 00:02:00,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2019-11-28 00:02:00,865 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 35 [2019-11-28 00:02:00,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:02:00,866 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2019-11-28 00:02:00,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:02:00,866 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2019-11-28 00:02:00,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-28 00:02:00,870 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:02:00,870 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] [2019-11-28 00:02:00,870 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:02:00,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:02:00,871 INFO L82 PathProgramCache]: Analyzing trace with hash 635482230, now seen corresponding path program 1 times [2019-11-28 00:02:00,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:02:00,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954928160] [2019-11-28 00:02:00,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:02:00,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:02:00,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:02:00,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954928160] [2019-11-28 00:02:00,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:02:00,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:02:00,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817701224] [2019-11-28 00:02:00,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:02:00,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:02:00,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:02:00,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:02:00,923 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand 5 states. [2019-11-28 00:02:00,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:02:00,947 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2019-11-28 00:02:00,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 00:02:00,947 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-11-28 00:02:00,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:02:00,948 INFO L225 Difference]: With dead ends: 66 [2019-11-28 00:02:00,948 INFO L226 Difference]: Without dead ends: 64 [2019-11-28 00:02:00,949 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:02:00,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-28 00:02:00,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2019-11-28 00:02:00,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-28 00:02:00,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2019-11-28 00:02:00,954 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 37 [2019-11-28 00:02:00,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:02:00,955 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2019-11-28 00:02:00,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:02:00,955 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2019-11-28 00:02:00,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-28 00:02:00,956 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:02:00,956 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] [2019-11-28 00:02:00,956 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:02:00,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:02:00,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1774883137, now seen corresponding path program 1 times [2019-11-28 00:02:00,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:02:00,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796626433] [2019-11-28 00:02:00,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:02:00,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:02:01,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:02:01,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796626433] [2019-11-28 00:02:01,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:02:01,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:02:01,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882347606] [2019-11-28 00:02:01,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:02:01,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:02:01,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:02:01,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:02:01,007 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand 5 states. [2019-11-28 00:02:01,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:02:01,045 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2019-11-28 00:02:01,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 00:02:01,046 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2019-11-28 00:02:01,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:02:01,046 INFO L225 Difference]: With dead ends: 64 [2019-11-28 00:02:01,047 INFO L226 Difference]: Without dead ends: 62 [2019-11-28 00:02:01,047 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 00:02:01,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-11-28 00:02:01,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2019-11-28 00:02:01,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-28 00:02:01,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2019-11-28 00:02:01,054 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 38 [2019-11-28 00:02:01,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:02:01,054 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2019-11-28 00:02:01,054 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:02:01,054 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2019-11-28 00:02:01,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-28 00:02:01,055 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:02:01,055 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:02:01,056 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:02:01,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:02:01,056 INFO L82 PathProgramCache]: Analyzing trace with hash 813201821, now seen corresponding path program 1 times [2019-11-28 00:02:01,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:02:01,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058098157] [2019-11-28 00:02:01,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:02:01,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:02:01,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:02:01,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058098157] [2019-11-28 00:02:01,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:02:01,106 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:02:01,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782710521] [2019-11-28 00:02:01,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:02:01,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:02:01,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:02:01,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:02:01,107 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 5 states. [2019-11-28 00:02:01,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:02:01,237 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2019-11-28 00:02:01,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 00:02:01,237 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-11-28 00:02:01,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:02:01,238 INFO L225 Difference]: With dead ends: 86 [2019-11-28 00:02:01,238 INFO L226 Difference]: Without dead ends: 84 [2019-11-28 00:02:01,239 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 00:02:01,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-11-28 00:02:01,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 65. [2019-11-28 00:02:01,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-28 00:02:01,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2019-11-28 00:02:01,244 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 39 [2019-11-28 00:02:01,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:02:01,244 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2019-11-28 00:02:01,245 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:02:01,245 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2019-11-28 00:02:01,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-28 00:02:01,245 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:02:01,245 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:02:01,246 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:02:01,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:02:01,246 INFO L82 PathProgramCache]: Analyzing trace with hash -560543098, now seen corresponding path program 1 times [2019-11-28 00:02:01,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:02:01,247 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291021421] [2019-11-28 00:02:01,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:02:01,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:02:01,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:02:01,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291021421] [2019-11-28 00:02:01,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:02:01,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:02:01,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514246708] [2019-11-28 00:02:01,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:02:01,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:02:01,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:02:01,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:02:01,311 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand 5 states. [2019-11-28 00:02:01,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:02:01,389 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2019-11-28 00:02:01,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 00:02:01,389 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-11-28 00:02:01,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:02:01,390 INFO L225 Difference]: With dead ends: 71 [2019-11-28 00:02:01,390 INFO L226 Difference]: Without dead ends: 69 [2019-11-28 00:02:01,390 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 00:02:01,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-11-28 00:02:01,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 63. [2019-11-28 00:02:01,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-28 00:02:01,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2019-11-28 00:02:01,395 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 40 [2019-11-28 00:02:01,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:02:01,395 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2019-11-28 00:02:01,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:02:01,396 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2019-11-28 00:02:01,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-28 00:02:01,396 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:02:01,396 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:02:01,397 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:02:01,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:02:01,397 INFO L82 PathProgramCache]: Analyzing trace with hash 375780089, now seen corresponding path program 1 times [2019-11-28 00:02:01,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:02:01,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59755126] [2019-11-28 00:02:01,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:02:01,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:02:01,478 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:02:01,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59755126] [2019-11-28 00:02:01,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [729988719] [2019-11-28 00:02:01,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:02:01,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:02:01,536 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-28 00:02:01,543 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:02:01,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 00:02:01,599 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:02:01,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:02:01,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2019-11-28 00:02:01,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521018713] [2019-11-28 00:02:01,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 00:02:01,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:02:01,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 00:02:01,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-28 00:02:01,601 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand 8 states. [2019-11-28 00:02:01,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:02:01,777 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2019-11-28 00:02:01,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 00:02:01,780 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2019-11-28 00:02:01,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:02:01,781 INFO L225 Difference]: With dead ends: 64 [2019-11-28 00:02:01,781 INFO L226 Difference]: Without dead ends: 62 [2019-11-28 00:02:01,781 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 37 SyntacticMatches, 7 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-11-28 00:02:01,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-11-28 00:02:01,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2019-11-28 00:02:01,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-28 00:02:01,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2019-11-28 00:02:01,787 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 40 [2019-11-28 00:02:01,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:02:01,787 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2019-11-28 00:02:01,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 00:02:01,788 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2019-11-28 00:02:01,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-28 00:02:01,788 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:02:01,789 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-28 00:02:01,989 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:02:01,990 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:02:01,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:02:01,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1394778411, now seen corresponding path program 1 times [2019-11-28 00:02:01,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:02:01,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754321679] [2019-11-28 00:02:01,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:02:02,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:02:02,054 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 00:02:02,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754321679] [2019-11-28 00:02:02,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:02:02,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:02:02,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146489354] [2019-11-28 00:02:02,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:02:02,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:02:02,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:02:02,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:02:02,056 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand 5 states. [2019-11-28 00:02:02,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:02:02,177 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2019-11-28 00:02:02,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 00:02:02,178 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-11-28 00:02:02,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:02:02,179 INFO L225 Difference]: With dead ends: 73 [2019-11-28 00:02:02,179 INFO L226 Difference]: Without dead ends: 71 [2019-11-28 00:02:02,179 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-28 00:02:02,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-28 00:02:02,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 51. [2019-11-28 00:02:02,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-11-28 00:02:02,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2019-11-28 00:02:02,184 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 45 [2019-11-28 00:02:02,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:02:02,185 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2019-11-28 00:02:02,185 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:02:02,185 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2019-11-28 00:02:02,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-28 00:02:02,185 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:02:02,186 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-28 00:02:02,186 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:02:02,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:02:02,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1932282916, now seen corresponding path program 1 times [2019-11-28 00:02:02,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:02:02,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911280589] [2019-11-28 00:02:02,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:02:02,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:02:02,235 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:02:02,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911280589] [2019-11-28 00:02:02,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [786993104] [2019-11-28 00:02:02,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:02:02,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:02:02,300 INFO L255 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 00:02:02,313 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:02:02,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 00:02:02,359 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 00:02:02,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 00:02:02,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2019-11-28 00:02:02,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991261886] [2019-11-28 00:02:02,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 00:02:02,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:02:02,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 00:02:02,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 00:02:02,364 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand 4 states. [2019-11-28 00:02:02,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:02:02,404 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2019-11-28 00:02:02,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 00:02:02,405 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-11-28 00:02:02,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:02:02,405 INFO L225 Difference]: With dead ends: 56 [2019-11-28 00:02:02,405 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 00:02:02,406 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-28 00:02:02,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 00:02:02,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 00:02:02,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 00:02:02,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 00:02:02,407 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 47 [2019-11-28 00:02:02,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:02:02,407 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 00:02:02,408 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 00:02:02,410 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 00:02:02,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 00:02:02,614 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:02:02,616 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 00:02:02,915 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 97 [2019-11-28 00:02:03,044 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 29 [2019-11-28 00:02:03,431 WARN L192 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 62 [2019-11-28 00:02:03,642 WARN L192 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 36 [2019-11-28 00:02:04,047 WARN L192 SmtUtils]: Spent 404.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 68 [2019-11-28 00:02:04,052 INFO L246 CegarLoopResult]: For program point L250(line 250) no Hoare annotation was computed. [2019-11-28 00:02:04,053 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 92) no Hoare annotation was computed. [2019-11-28 00:02:04,053 INFO L246 CegarLoopResult]: For program point L184(line 184) no Hoare annotation was computed. [2019-11-28 00:02:04,053 INFO L246 CegarLoopResult]: For program point L118(lines 118 398) no Hoare annotation was computed. [2019-11-28 00:02:04,053 INFO L246 CegarLoopResult]: For program point L267(line 267) no Hoare annotation was computed. [2019-11-28 00:02:04,053 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 267) no Hoare annotation was computed. [2019-11-28 00:02:04,053 INFO L246 CegarLoopResult]: For program point L36(lines 36 430) no Hoare annotation was computed. [2019-11-28 00:02:04,053 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 00:02:04,053 INFO L246 CegarLoopResult]: For program point L152(line 152) no Hoare annotation was computed. [2019-11-28 00:02:04,053 INFO L246 CegarLoopResult]: For program point L367(lines 367 390) no Hoare annotation was computed. [2019-11-28 00:02:04,054 INFO L246 CegarLoopResult]: For program point L301(lines 301 311) no Hoare annotation was computed. [2019-11-28 00:02:04,054 INFO L246 CegarLoopResult]: For program point L219(lines 219 339) no Hoare annotation was computed. [2019-11-28 00:02:04,054 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 250) no Hoare annotation was computed. [2019-11-28 00:02:04,054 INFO L246 CegarLoopResult]: For program point L120(line 120) no Hoare annotation was computed. [2019-11-28 00:02:04,054 INFO L246 CegarLoopResult]: For program point L54(lines 54 427) no Hoare annotation was computed. [2019-11-28 00:02:04,054 INFO L246 CegarLoopResult]: For program point L236(lines 236 326) no Hoare annotation was computed. [2019-11-28 00:02:04,054 INFO L246 CegarLoopResult]: For program point L170(lines 170 352) no Hoare annotation was computed. [2019-11-28 00:02:04,054 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 172) no Hoare annotation was computed. [2019-11-28 00:02:04,054 INFO L246 CegarLoopResult]: For program point L369(line 369) no Hoare annotation was computed. [2019-11-28 00:02:04,055 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION(line 381) no Hoare annotation was computed. [2019-11-28 00:02:04,055 INFO L246 CegarLoopResult]: For program point L303(line 303) no Hoare annotation was computed. [2019-11-28 00:02:04,056 INFO L246 CegarLoopResult]: For program point L138(lines 138 357) no Hoare annotation was computed. [2019-11-28 00:02:04,056 INFO L246 CegarLoopResult]: For program point L221(line 221) no Hoare annotation was computed. [2019-11-28 00:02:04,056 INFO L246 CegarLoopResult]: For program point L56(lines 56 422) no Hoare annotation was computed. [2019-11-28 00:02:04,056 INFO L246 CegarLoopResult]: For program point L238(line 238) no Hoare annotation was computed. [2019-11-28 00:02:04,056 INFO L246 CegarLoopResult]: For program point L172(line 172) no Hoare annotation was computed. [2019-11-28 00:02:04,056 INFO L246 CegarLoopResult]: For program point L106(lines 106 400) no Hoare annotation was computed. [2019-11-28 00:02:04,056 INFO L242 CegarLoopResult]: At program point L387(lines 124 398) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~main__cp~0 1) ULTIMATE.start_main_~main__urilen~0) (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~0) (let ((.cse0 (<= 1 ULTIMATE.start_main_~main__cp~0)) (.cse1 (< 0 ULTIMATE.start_main_~main__scheme~0)) (.cse2 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~1))) (.cse3 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~3))) (or (and (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~2) .cse0 .cse1 .cse2 .cse3) (and (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~2)) .cse0 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~17)) .cse1 .cse2 .cse3 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~16))))) [2019-11-28 00:02:04,057 INFO L246 CegarLoopResult]: For program point L189(lines 189 349) no Hoare annotation was computed. [2019-11-28 00:02:04,057 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 209) no Hoare annotation was computed. [2019-11-28 00:02:04,057 INFO L246 CegarLoopResult]: For program point L90(lines 90 407) no Hoare annotation was computed. [2019-11-28 00:02:04,057 INFO L246 CegarLoopResult]: For program point L24(lines 24 432) no Hoare annotation was computed. [2019-11-28 00:02:04,057 INFO L246 CegarLoopResult]: For program point L140(line 140) no Hoare annotation was computed. [2019-11-28 00:02:04,057 INFO L242 CegarLoopResult]: At program point L322(lines 257 323) the Hoare annotation is: (let ((.cse0 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~6))) (.cse1 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~5))) (.cse2 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~10)) (.cse3 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~7))) (.cse4 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~4)) (.cse5 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~8))) (.cse6 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~2))) (.cse7 (<= 1 ULTIMATE.start_main_~main__cp~0)) (.cse8 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~11))) (.cse9 (< 0 ULTIMATE.start_main_~main__scheme~0)) (.cse10 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~1))) (.cse11 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~3)) (.cse13 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~0)) (.cse12 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~9)) (.cse14 (< (+ ULTIMATE.start_main_~main__cp~0 1) ULTIMATE.start_main_~main__urilen~0))) (or (and .cse0 .cse1 .cse2 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~12) (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~13)) (<= 1 ULTIMATE.start_main_~main__c~0) .cse3 .cse4 .cse5 .cse6 .cse7 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~14)) (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~15)) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 (<= (+ ULTIMATE.start_main_~main__c~0 2) ULTIMATE.start_main_~main__tokenlen~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse12 .cse14 (= ULTIMATE.start_main_~main__c~0 0)))) [2019-11-28 00:02:04,057 INFO L246 CegarLoopResult]: For program point L289(lines 289 313) no Hoare annotation was computed. [2019-11-28 00:02:04,057 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 00:02:04,058 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 184) no Hoare annotation was computed. [2019-11-28 00:02:04,058 INFO L246 CegarLoopResult]: For program point L157(lines 157 354) no Hoare annotation was computed. [2019-11-28 00:02:04,058 INFO L246 CegarLoopResult]: For program point L58(lines 58 417) no Hoare annotation was computed. [2019-11-28 00:02:04,059 INFO L242 CegarLoopResult]: At program point L405(lines 99 406) the Hoare annotation is: (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~0)) [2019-11-28 00:02:04,059 INFO L246 CegarLoopResult]: For program point L207(lines 207 341) no Hoare annotation was computed. [2019-11-28 00:02:04,059 INFO L246 CegarLoopResult]: For program point L108(line 108) no Hoare annotation was computed. [2019-11-28 00:02:04,059 INFO L246 CegarLoopResult]: For program point L42(lines 42 429) no Hoare annotation was computed. [2019-11-28 00:02:04,059 INFO L246 CegarLoopResult]: For program point L257(lines 257 323) no Hoare annotation was computed. [2019-11-28 00:02:04,060 INFO L246 CegarLoopResult]: For program point L92(line 92) no Hoare annotation was computed. [2019-11-28 00:02:04,060 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 108) no Hoare annotation was computed. [2019-11-28 00:02:04,060 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 279) no Hoare annotation was computed. [2019-11-28 00:02:04,060 INFO L246 CegarLoopResult]: For program point L291(line 291) no Hoare annotation was computed. [2019-11-28 00:02:04,060 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 221) no Hoare annotation was computed. [2019-11-28 00:02:04,061 INFO L246 CegarLoopResult]: For program point L60(lines 60 412) no Hoare annotation was computed. [2019-11-28 00:02:04,061 INFO L246 CegarLoopResult]: For program point L209(line 209) no Hoare annotation was computed. [2019-11-28 00:02:04,061 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 140) no Hoare annotation was computed. [2019-11-28 00:02:04,061 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 00:02:04,061 INFO L246 CegarLoopResult]: For program point L78(lines 78 409) no Hoare annotation was computed. [2019-11-28 00:02:04,061 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 303) no Hoare annotation was computed. [2019-11-28 00:02:04,062 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 120) no Hoare annotation was computed. [2019-11-28 00:02:04,062 INFO L242 CegarLoopResult]: At program point L310(lines 225 339) the Hoare annotation is: (let ((.cse2 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~10)) (.cse8 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~11))) (.cse0 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~6))) (.cse1 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~5))) (.cse3 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~7))) (.cse4 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~4)) (.cse5 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~8))) (.cse6 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~2))) (.cse7 (<= 1 ULTIMATE.start_main_~main__cp~0)) (.cse9 (< 0 ULTIMATE.start_main_~main__scheme~0)) (.cse10 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~1))) (.cse11 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~3)) (.cse12 (<= (+ ULTIMATE.start_main_~main__cp~0 1) ULTIMATE.start_main_~main__urilen~0)) (.cse13 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~9)) (.cse14 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~0)) (.cse15 (= ULTIMATE.start_main_~main__c~0 0))) (or (and .cse0 .cse1 .cse2 (<= (+ ULTIMATE.start_main_~main__c~0 2) ULTIMATE.start_main_~main__tokenlen~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~12) (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~13)) (<= 1 ULTIMATE.start_main_~main__c~0) .cse3 .cse4 .cse5 .cse6 .cse7 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~14)) (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~15)) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 (<= (+ ULTIMATE.start_main_~main__cp~0 2) ULTIMATE.start_main_~main__urilen~0) .cse9 .cse10 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~8) .cse11 .cse12 .cse13 .cse14 .cse15))) [2019-11-28 00:02:04,062 INFO L246 CegarLoopResult]: For program point L277(lines 277 315) no Hoare annotation was computed. [2019-11-28 00:02:04,063 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 291) no Hoare annotation was computed. [2019-11-28 00:02:04,063 INFO L249 CegarLoopResult]: At program point L426(lines 8 434) the Hoare annotation is: true [2019-11-28 00:02:04,063 INFO L246 CegarLoopResult]: For program point L30(lines 30 431) no Hoare annotation was computed. [2019-11-28 00:02:04,063 INFO L246 CegarLoopResult]: For program point L80(line 80) no Hoare annotation was computed. [2019-11-28 00:02:04,063 INFO L246 CegarLoopResult]: For program point L229(lines 229 333) no Hoare annotation was computed. [2019-11-28 00:02:04,063 INFO L246 CegarLoopResult]: For program point L130(lines 130 392) no Hoare annotation was computed. [2019-11-28 00:02:04,064 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 152) no Hoare annotation was computed. [2019-11-28 00:02:04,064 INFO L246 CegarLoopResult]: For program point L279(line 279) no Hoare annotation was computed. [2019-11-28 00:02:04,064 INFO L246 CegarLoopResult]: For program point L48(lines 48 428) no Hoare annotation was computed. [2019-11-28 00:02:04,064 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION(line 369) no Hoare annotation was computed. [2019-11-28 00:02:04,064 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-28 00:02:04,065 INFO L246 CegarLoopResult]: For program point L379(lines 379 388) no Hoare annotation was computed. [2019-11-28 00:02:04,065 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 80) no Hoare annotation was computed. [2019-11-28 00:02:04,065 INFO L242 CegarLoopResult]: At program point L396(lines 126 397) the Hoare annotation is: (let ((.cse0 (< ULTIMATE.start_main_~main__cp~0 ULTIMATE.start_main_~main__urilen~0)) (.cse1 (let ((.cse3 (<= 1 ULTIMATE.start_main_~main__cp~0)) (.cse4 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~0))) (.cse5 (< 0 ULTIMATE.start_main_~main__scheme~0)) (.cse6 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~3))) (.cse7 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~1)))) (or (and (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~2) .cse3 .cse4 .cse5 .cse6 .cse7) (and (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~16)) (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~2)) .cse3 .cse4 .cse5 .cse6 .cse7)))) (.cse2 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~3))) (or (and (= (+ ULTIMATE.start_main_~main__cp~0 1) ULTIMATE.start_main_~main__urilen~0) .cse0 .cse1 .cse2) (and .cse0 .cse1 .cse2 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~0)))) [2019-11-28 00:02:04,065 INFO L246 CegarLoopResult]: For program point L99(lines 99 406) no Hoare annotation was computed. [2019-11-28 00:02:04,066 INFO L246 CegarLoopResult]: For program point L66(lines 66 411) no Hoare annotation was computed. [2019-11-28 00:02:04,066 INFO L246 CegarLoopResult]: For program point L248(lines 248 324) no Hoare annotation was computed. [2019-11-28 00:02:04,066 INFO L246 CegarLoopResult]: For program point L182(lines 182 350) no Hoare annotation was computed. [2019-11-28 00:02:04,066 INFO L246 CegarLoopResult]: For program point L265(lines 265 317) no Hoare annotation was computed. [2019-11-28 00:02:04,066 INFO L246 CegarLoopResult]: For program point L199(lines 199 348) no Hoare annotation was computed. [2019-11-28 00:02:04,066 INFO L246 CegarLoopResult]: For program point L381(line 381) no Hoare annotation was computed. [2019-11-28 00:02:04,067 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 238) no Hoare annotation was computed. [2019-11-28 00:02:04,067 INFO L246 CegarLoopResult]: For program point L150(lines 150 355) no Hoare annotation was computed. [2019-11-28 00:02:04,067 INFO L246 CegarLoopResult]: For program point L18(lines 18 433) no Hoare annotation was computed. [2019-11-28 00:02:04,098 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 12:02:04 BoogieIcfgContainer [2019-11-28 00:02:04,098 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 00:02:04,099 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 00:02:04,099 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 00:02:04,099 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 00:02:04,100 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:01:56" (3/4) ... [2019-11-28 00:02:04,103 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 00:02:04,130 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-28 00:02:04,131 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 00:02:04,226 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 00:02:04,226 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 00:02:04,227 INFO L168 Benchmark]: Toolchain (without parser) took 8739.61 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 292.6 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -97.9 MB). Peak memory consumption was 194.6 MB. Max. memory is 11.5 GB. [2019-11-28 00:02:04,228 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:02:04,228 INFO L168 Benchmark]: CACSL2BoogieTranslator took 402.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -172.4 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2019-11-28 00:02:04,228 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.83 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:02:04,229 INFO L168 Benchmark]: Boogie Preprocessor took 26.58 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:02:04,229 INFO L168 Benchmark]: RCFGBuilder took 511.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.5 MB). Peak memory consumption was 33.5 MB. Max. memory is 11.5 GB. [2019-11-28 00:02:04,230 INFO L168 Benchmark]: TraceAbstraction took 7612.60 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 149.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.1 MB). Peak memory consumption was 356.9 MB. Max. memory is 11.5 GB. [2019-11-28 00:02:04,230 INFO L168 Benchmark]: Witness Printer took 127.51 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 11.5 GB. [2019-11-28 00:02:04,232 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.29 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 402.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -172.4 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 52.83 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.58 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 511.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.5 MB). Peak memory consumption was 33.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7612.60 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 149.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.1 MB). Peak memory consumption was 356.9 MB. Max. memory is 11.5 GB. * Witness Printer took 127.51 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 92]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 209]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 184]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 369]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 303]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 381]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 120]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 80]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 108]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 267]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 140]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 152]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 172]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 238]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 291]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 279]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 250]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 221]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold - InvariantResult [Line: 124]: Loop Invariant Derived loop invariant: (main__cp + 1 <= main__urilen && 1 == __VERIFIER_assert__cond) && (((((1 == __VERIFIER_assert__cond && 1 <= main__cp) && 0 < main__scheme) && !(0 == __VERIFIER_assert__cond)) && 1 == __VERIFIER_assert__cond) || ((((((!(0 == __VERIFIER_assert__cond) && 1 <= main__cp) && !(0 == __VERIFIER_assert__cond)) && 0 < main__scheme) && !(0 == __VERIFIER_assert__cond)) && 1 == __VERIFIER_assert__cond) && 1 == __VERIFIER_assert__cond)) - InvariantResult [Line: 257]: Loop Invariant Derived loop invariant: (((((((((((((((((((!(0 == __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && 1 == __VERIFIER_assert__cond) && 1 == __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && 1 <= main__c) && !(0 == __VERIFIER_assert__cond)) && 1 == __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && 1 <= main__cp) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && 0 < main__scheme) && !(0 == __VERIFIER_assert__cond)) && 1 == __VERIFIER_assert__cond) && 1 == __VERIFIER_assert__cond) && 1 == __VERIFIER_assert__cond) && main__cp + 1 < main__urilen) || ((((((((((((((((!(0 == __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && 1 == __VERIFIER_assert__cond) && main__c + 2 <= main__tokenlen) && !(0 == __VERIFIER_assert__cond)) && 1 == __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && 1 <= main__cp) && !(0 == __VERIFIER_assert__cond)) && 0 < main__scheme) && !(0 == __VERIFIER_assert__cond)) && 1 == __VERIFIER_assert__cond) && 1 == __VERIFIER_assert__cond) && 1 == __VERIFIER_assert__cond) && main__cp + 1 < main__urilen) && main__c == 0) - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: (((main__cp + 1 == main__urilen && main__cp < main__urilen) && ((((((1 == __VERIFIER_assert__cond && 1 <= main__cp) && !(0 == __VERIFIER_assert__cond)) && 0 < main__scheme) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) || ((((((!(0 == __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && 1 <= main__cp) && !(0 == __VERIFIER_assert__cond)) && 0 < main__scheme) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)))) && 1 == __VERIFIER_assert__cond) || (((main__cp < main__urilen && ((((((1 == __VERIFIER_assert__cond && 1 <= main__cp) && !(0 == __VERIFIER_assert__cond)) && 0 < main__scheme) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) || ((((((!(0 == __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && 1 <= main__cp) && !(0 == __VERIFIER_assert__cond)) && 0 < main__scheme) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)))) && 1 == __VERIFIER_assert__cond) && 1 == __VERIFIER_assert__cond) - InvariantResult [Line: 225]: Loop Invariant Derived loop invariant: (((((((((((((((((!(0 == __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && 1 == __VERIFIER_assert__cond) && main__c + 2 <= main__tokenlen) && !(0 == __VERIFIER_assert__cond)) && 1 == __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && 1 <= main__cp) && !(0 == __VERIFIER_assert__cond)) && 0 < main__scheme) && !(0 == __VERIFIER_assert__cond)) && 1 == __VERIFIER_assert__cond) && main__cp + 1 <= main__urilen) && 1 == __VERIFIER_assert__cond) && 1 == __VERIFIER_assert__cond) && main__c == 0) || (((((((((((((((((((!(0 == __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && 1 == __VERIFIER_assert__cond) && 1 == __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && 1 <= main__c) && !(0 == __VERIFIER_assert__cond)) && 1 == __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && 1 <= main__cp) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && 0 < main__scheme) && !(0 == __VERIFIER_assert__cond)) && 1 == __VERIFIER_assert__cond) && main__cp + 1 <= main__urilen) && 1 == __VERIFIER_assert__cond) && 1 == __VERIFIER_assert__cond)) || (((((((((((((((!(0 == __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && 1 == __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && 1 <= main__cp) && main__cp + 2 <= main__urilen) && 0 < main__scheme) && !(0 == __VERIFIER_assert__cond)) && 1 == __VERIFIER_assert__cond) && 1 == __VERIFIER_assert__cond) && main__cp + 1 <= main__urilen) && 1 == __VERIFIER_assert__cond) && 1 == __VERIFIER_assert__cond) && main__c == 0) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: !(0 == __VERIFIER_assert__cond) - InvariantResult [Line: 8]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 82 locations, 18 error locations. Result: SAFE, OverallTime: 6.0s, OverallIterations: 24, TraceHistogramMax: 2, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.4s, HoareTripleCheckerStatistics: 1307 SDtfs, 2367 SDslu, 1508 SDs, 0 SdLazy, 1173 SolverSat, 131 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 319 GetRequests, 179 SyntacticMatches, 15 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 24 MinimizatonAttempts, 291 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 16 NumberOfFragments, 513 HoareAnnotationTreeSize, 6 FomulaSimplifications, 56097 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 6 FomulaSimplificationsInter, 4363 FormulaSimplificationTreeSizeReductionInter, 1.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 845 NumberOfCodeBlocks, 845 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 817 ConstructedInterpolants, 0 QuantifiedInterpolants, 57314 SizeOfPredicates, 25 NumberOfNonLiveVariables, 483 ConjunctsInSsa, 55 ConjunctsInUnsatCore, 28 InterpolantComputations, 21 PerfectInterpolantSequences, 16/33 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...