./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 9a8b2e8d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e45e933f699aab7bcc9592c7af081e2fbc1238f5 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-9a8b2e8 [2020-10-20 00:59:56,154 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 00:59:56,156 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 00:59:56,181 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 00:59:56,181 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 00:59:56,182 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 00:59:56,184 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 00:59:56,186 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 00:59:56,188 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 00:59:56,189 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 00:59:56,190 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 00:59:56,191 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 00:59:56,191 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 00:59:56,192 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 00:59:56,193 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 00:59:56,195 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 00:59:56,196 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 00:59:56,197 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 00:59:56,199 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 00:59:56,201 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 00:59:56,202 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 00:59:56,204 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 00:59:56,205 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 00:59:56,206 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 00:59:56,209 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 00:59:56,209 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 00:59:56,209 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 00:59:56,210 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 00:59:56,211 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 00:59:56,212 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 00:59:56,212 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 00:59:56,213 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 00:59:56,214 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 00:59:56,215 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 00:59:56,216 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 00:59:56,216 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 00:59:56,217 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 00:59:56,217 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 00:59:56,218 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 00:59:56,219 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 00:59:56,219 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 00:59:56,220 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-20 00:59:56,260 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 00:59:56,260 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 00:59:56,262 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 00:59:56,262 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 00:59:56,262 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 00:59:56,262 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 00:59:56,262 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 00:59:56,262 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 00:59:56,263 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 00:59:56,263 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 00:59:56,263 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-20 00:59:56,263 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-20 00:59:56,263 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-20 00:59:56,263 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 00:59:56,264 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 00:59:56,264 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 00:59:56,267 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-20 00:59:56,267 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 00:59:56,268 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 00:59:56,268 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-20 00:59:56,268 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-20 00:59:56,268 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-20 00:59:56,268 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 00:59:56,268 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-20 00:59:56,269 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-20 00:59:56,269 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 00:59:56,269 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-20 00:59:56,269 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-20 00:59:56,269 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 00:59:56,270 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(reach_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 -> e45e933f699aab7bcc9592c7af081e2fbc1238f5 [2020-10-20 00:59:56,464 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 00:59:56,476 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 00:59:56,480 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 00:59:56,481 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 00:59:56,482 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 00:59:56,483 INFO L432 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 [2020-10-20 00:59:56,546 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3e10fd84/8a191c753cb54d47982ebdf2d2112bc9/FLAGe1784f413 [2020-10-20 00:59:57,159 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 00:59:57,160 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c [2020-10-20 00:59:57,169 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3e10fd84/8a191c753cb54d47982ebdf2d2112bc9/FLAGe1784f413 [2020-10-20 00:59:57,540 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3e10fd84/8a191c753cb54d47982ebdf2d2112bc9 [2020-10-20 00:59:57,543 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 00:59:57,550 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 00:59:57,552 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 00:59:57,552 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 00:59:57,557 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 00:59:57,558 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 12:59:57" (1/1) ... [2020-10-20 00:59:57,563 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2195f6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:59:57, skipping insertion in model container [2020-10-20 00:59:57,563 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 12:59:57" (1/1) ... [2020-10-20 00:59:57,572 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 00:59:57,631 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 00:59:57,861 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 00:59:57,872 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 00:59:57,930 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 00:59:57,948 INFO L208 MainTranslator]: Completed translation [2020-10-20 00:59:57,949 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:59:57 WrapperNode [2020-10-20 00:59:57,949 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 00:59:57,950 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 00:59:57,950 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 00:59:57,950 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 00:59:57,960 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:59:57" (1/1) ... [2020-10-20 00:59:57,970 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:59:57" (1/1) ... [2020-10-20 00:59:58,008 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 00:59:58,009 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 00:59:58,009 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 00:59:58,009 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 00:59:58,019 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:59:57" (1/1) ... [2020-10-20 00:59:58,020 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:59:57" (1/1) ... [2020-10-20 00:59:58,023 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:59:57" (1/1) ... [2020-10-20 00:59:58,023 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:59:57" (1/1) ... [2020-10-20 00:59:58,030 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:59:57" (1/1) ... [2020-10-20 00:59:58,034 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:59:57" (1/1) ... [2020-10-20 00:59:58,036 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:59:57" (1/1) ... [2020-10-20 00:59:58,040 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 00:59:58,041 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 00:59:58,041 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 00:59:58,041 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 00:59:58,042 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:59:57" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-20 00:59:58,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-20 00:59:58,103 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 00:59:58,103 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 00:59:58,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 00:59:58,612 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 00:59:58,612 INFO L298 CfgBuilder]: Removed 40 assume(true) statements. [2020-10-20 00:59:58,630 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 12:59:58 BoogieIcfgContainer [2020-10-20 00:59:58,633 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 00:59:58,636 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-20 00:59:58,637 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-20 00:59:58,644 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-20 00:59:58,646 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.10 12:59:57" (1/3) ... [2020-10-20 00:59:58,647 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@609d7a17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 12:59:58, skipping insertion in model container [2020-10-20 00:59:58,648 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:59:57" (2/3) ... [2020-10-20 00:59:58,648 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@609d7a17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 12:59:58, skipping insertion in model container [2020-10-20 00:59:58,648 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 12:59:58" (3/3) ... [2020-10-20 00:59:58,651 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i.v+cfa-reducer.c [2020-10-20 00:59:58,663 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-20 00:59:58,669 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 18 error locations. [2020-10-20 00:59:58,681 INFO L253 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2020-10-20 00:59:58,705 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-20 00:59:58,705 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-20 00:59:58,705 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-20 00:59:58,705 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 00:59:58,706 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 00:59:58,706 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-20 00:59:58,706 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 00:59:58,706 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-20 00:59:58,729 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states. [2020-10-20 00:59:58,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-20 00:59:58,734 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:59:58,735 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:59:58,736 INFO L429 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]=== [2020-10-20 00:59:58,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:59:58,744 INFO L82 PathProgramCache]: Analyzing trace with hash -2034435078, now seen corresponding path program 1 times [2020-10-20 00:59:58,754 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:59:58,755 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985446088] [2020-10-20 00:59:58,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:59:58,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:59:58,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:59:58,961 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985446088] [2020-10-20 00:59:58,962 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:59:58,962 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 00:59:58,964 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255308298] [2020-10-20 00:59:58,969 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 00:59:58,970 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:59:58,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 00:59:58,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 00:59:58,987 INFO L87 Difference]: Start difference. First operand 100 states. Second operand 3 states. [2020-10-20 00:59:59,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:59:59,031 INFO L93 Difference]: Finished difference Result 106 states and 141 transitions. [2020-10-20 00:59:59,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 00:59:59,045 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2020-10-20 00:59:59,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:59:59,057 INFO L225 Difference]: With dead ends: 106 [2020-10-20 00:59:59,057 INFO L226 Difference]: Without dead ends: 76 [2020-10-20 00:59:59,066 INFO L677 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 [2020-10-20 00:59:59,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-10-20 00:59:59,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2020-10-20 00:59:59,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-10-20 00:59:59,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2020-10-20 00:59:59,114 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 15 [2020-10-20 00:59:59,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:59:59,115 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2020-10-20 00:59:59,115 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 00:59:59,115 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2020-10-20 00:59:59,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-20 00:59:59,116 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:59:59,116 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:59:59,116 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-20 00:59:59,117 INFO L429 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]=== [2020-10-20 00:59:59,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:59:59,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1357028100, now seen corresponding path program 1 times [2020-10-20 00:59:59,118 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:59:59,118 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340787407] [2020-10-20 00:59:59,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:59:59,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:59:59,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:59:59,230 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340787407] [2020-10-20 00:59:59,230 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:59:59,230 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-20 00:59:59,231 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641050915] [2020-10-20 00:59:59,232 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 00:59:59,233 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:59:59,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 00:59:59,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-20 00:59:59,234 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand 6 states. [2020-10-20 00:59:59,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:59:59,341 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2020-10-20 00:59:59,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 00:59:59,341 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-10-20 00:59:59,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:59:59,343 INFO L225 Difference]: With dead ends: 76 [2020-10-20 00:59:59,343 INFO L226 Difference]: Without dead ends: 74 [2020-10-20 00:59:59,344 INFO L677 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 [2020-10-20 00:59:59,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-10-20 00:59:59,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2020-10-20 00:59:59,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-10-20 00:59:59,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2020-10-20 00:59:59,370 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 16 [2020-10-20 00:59:59,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:59:59,371 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2020-10-20 00:59:59,371 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 00:59:59,371 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2020-10-20 00:59:59,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-20 00:59:59,373 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:59:59,373 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:59:59,374 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-20 00:59:59,376 INFO L429 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]=== [2020-10-20 00:59:59,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:59:59,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1565865049, now seen corresponding path program 1 times [2020-10-20 00:59:59,380 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:59:59,380 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127916351] [2020-10-20 00:59:59,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:59:59,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:59:59,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:59:59,502 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127916351] [2020-10-20 00:59:59,502 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:59:59,503 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 00:59:59,503 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033738905] [2020-10-20 00:59:59,504 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 00:59:59,504 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:59:59,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 00:59:59,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 00:59:59,505 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand 4 states. [2020-10-20 00:59:59,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:59:59,596 INFO L93 Difference]: Finished difference Result 97 states and 102 transitions. [2020-10-20 00:59:59,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 00:59:59,597 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2020-10-20 00:59:59,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:59:59,598 INFO L225 Difference]: With dead ends: 97 [2020-10-20 00:59:59,598 INFO L226 Difference]: Without dead ends: 95 [2020-10-20 00:59:59,599 INFO L677 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 [2020-10-20 00:59:59,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2020-10-20 00:59:59,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 72. [2020-10-20 00:59:59,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-10-20 00:59:59,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 75 transitions. [2020-10-20 00:59:59,609 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 75 transitions. Word has length 18 [2020-10-20 00:59:59,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:59:59,610 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 75 transitions. [2020-10-20 00:59:59,610 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 00:59:59,610 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2020-10-20 00:59:59,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-20 00:59:59,611 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:59:59,611 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:59:59,611 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-20 00:59:59,612 INFO L429 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]=== [2020-10-20 00:59:59,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:59:59,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1297170164, now seen corresponding path program 1 times [2020-10-20 00:59:59,613 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:59:59,613 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105456910] [2020-10-20 00:59:59,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:59:59,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:59:59,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:59:59,715 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105456910] [2020-10-20 00:59:59,716 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:59:59,725 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 00:59:59,725 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392349479] [2020-10-20 00:59:59,726 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 00:59:59,726 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:59:59,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 00:59:59,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 00:59:59,727 INFO L87 Difference]: Start difference. First operand 72 states and 75 transitions. Second operand 5 states. [2020-10-20 00:59:59,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:59:59,804 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2020-10-20 00:59:59,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 00:59:59,804 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-10-20 00:59:59,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:59:59,805 INFO L225 Difference]: With dead ends: 72 [2020-10-20 00:59:59,805 INFO L226 Difference]: Without dead ends: 70 [2020-10-20 00:59:59,806 INFO L677 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 [2020-10-20 00:59:59,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-10-20 00:59:59,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2020-10-20 00:59:59,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-10-20 00:59:59,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2020-10-20 00:59:59,813 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 19 [2020-10-20 00:59:59,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:59:59,814 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2020-10-20 00:59:59,814 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 00:59:59,814 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2020-10-20 00:59:59,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-20 00:59:59,815 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:59:59,815 INFO L422 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] [2020-10-20 00:59:59,815 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-20 00:59:59,815 INFO L429 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]=== [2020-10-20 00:59:59,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:59:59,816 INFO L82 PathProgramCache]: Analyzing trace with hash 2130405385, now seen corresponding path program 1 times [2020-10-20 00:59:59,816 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:59:59,816 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522797779] [2020-10-20 00:59:59,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:59:59,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:59:59,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:59:59,918 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522797779] [2020-10-20 00:59:59,918 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:59:59,919 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 00:59:59,919 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072750010] [2020-10-20 00:59:59,919 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 00:59:59,920 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:59:59,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 00:59:59,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 00:59:59,920 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand 5 states. [2020-10-20 01:00:00,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:00:00,084 INFO L93 Difference]: Finished difference Result 106 states and 112 transitions. [2020-10-20 01:00:00,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 01:00:00,085 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2020-10-20 01:00:00,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:00:00,086 INFO L225 Difference]: With dead ends: 106 [2020-10-20 01:00:00,086 INFO L226 Difference]: Without dead ends: 104 [2020-10-20 01:00:00,087 INFO L677 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 [2020-10-20 01:00:00,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2020-10-20 01:00:00,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 74. [2020-10-20 01:00:00,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-10-20 01:00:00,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2020-10-20 01:00:00,096 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 22 [2020-10-20 01:00:00,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:00:00,096 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2020-10-20 01:00:00,097 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 01:00:00,097 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2020-10-20 01:00:00,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-20 01:00:00,098 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:00:00,098 INFO L422 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] [2020-10-20 01:00:00,098 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-20 01:00:00,098 INFO L429 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]=== [2020-10-20 01:00:00,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:00:00,099 INFO L82 PathProgramCache]: Analyzing trace with hash 2125427304, now seen corresponding path program 1 times [2020-10-20 01:00:00,099 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:00:00,099 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165808164] [2020-10-20 01:00:00,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:00:00,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:00:00,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:00:00,163 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165808164] [2020-10-20 01:00:00,163 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:00:00,163 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 01:00:00,164 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577237309] [2020-10-20 01:00:00,164 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 01:00:00,164 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:00:00,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 01:00:00,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:00:00,165 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand 5 states. [2020-10-20 01:00:00,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:00:00,360 INFO L93 Difference]: Finished difference Result 133 states and 139 transitions. [2020-10-20 01:00:00,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 01:00:00,361 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2020-10-20 01:00:00,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:00:00,362 INFO L225 Difference]: With dead ends: 133 [2020-10-20 01:00:00,362 INFO L226 Difference]: Without dead ends: 131 [2020-10-20 01:00:00,363 INFO L677 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 [2020-10-20 01:00:00,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2020-10-20 01:00:00,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 75. [2020-10-20 01:00:00,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-10-20 01:00:00,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2020-10-20 01:00:00,370 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 22 [2020-10-20 01:00:00,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:00:00,371 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2020-10-20 01:00:00,371 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 01:00:00,371 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2020-10-20 01:00:00,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-20 01:00:00,372 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:00:00,372 INFO L422 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] [2020-10-20 01:00:00,372 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-20 01:00:00,372 INFO L429 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]=== [2020-10-20 01:00:00,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:00:00,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1618063621, now seen corresponding path program 1 times [2020-10-20 01:00:00,373 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:00:00,373 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554189394] [2020-10-20 01:00:00,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:00:00,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:00:00,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:00:00,429 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554189394] [2020-10-20 01:00:00,430 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:00:00,430 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 01:00:00,430 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117706708] [2020-10-20 01:00:00,431 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 01:00:00,431 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:00:00,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 01:00:00,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:00:00,432 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand 5 states. [2020-10-20 01:00:00,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:00:00,529 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2020-10-20 01:00:00,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 01:00:00,530 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2020-10-20 01:00:00,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:00:00,531 INFO L225 Difference]: With dead ends: 75 [2020-10-20 01:00:00,531 INFO L226 Difference]: Without dead ends: 73 [2020-10-20 01:00:00,532 INFO L677 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 [2020-10-20 01:00:00,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-10-20 01:00:00,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2020-10-20 01:00:00,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-10-20 01:00:00,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2020-10-20 01:00:00,538 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 23 [2020-10-20 01:00:00,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:00:00,539 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2020-10-20 01:00:00,539 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 01:00:00,539 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2020-10-20 01:00:00,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-20 01:00:00,540 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:00:00,540 INFO L422 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] [2020-10-20 01:00:00,540 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-20 01:00:00,540 INFO L429 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]=== [2020-10-20 01:00:00,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:00:00,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1463743257, now seen corresponding path program 1 times [2020-10-20 01:00:00,541 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:00:00,541 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866096041] [2020-10-20 01:00:00,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:00:00,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:00:00,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:00:00,601 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866096041] [2020-10-20 01:00:00,601 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:00:00,601 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 01:00:00,601 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283830060] [2020-10-20 01:00:00,602 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 01:00:00,602 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:00:00,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 01:00:00,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:00:00,602 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand 5 states. [2020-10-20 01:00:00,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:00:00,753 INFO L93 Difference]: Finished difference Result 113 states and 119 transitions. [2020-10-20 01:00:00,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 01:00:00,754 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2020-10-20 01:00:00,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:00:00,756 INFO L225 Difference]: With dead ends: 113 [2020-10-20 01:00:00,756 INFO L226 Difference]: Without dead ends: 111 [2020-10-20 01:00:00,757 INFO L677 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 [2020-10-20 01:00:00,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2020-10-20 01:00:00,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 71. [2020-10-20 01:00:00,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-10-20 01:00:00,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 76 transitions. [2020-10-20 01:00:00,774 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 76 transitions. Word has length 23 [2020-10-20 01:00:00,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:00:00,774 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 76 transitions. [2020-10-20 01:00:00,774 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 01:00:00,775 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2020-10-20 01:00:00,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-20 01:00:00,776 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:00:00,777 INFO L422 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] [2020-10-20 01:00:00,777 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-20 01:00:00,777 INFO L429 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]=== [2020-10-20 01:00:00,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:00:00,778 INFO L82 PathProgramCache]: Analyzing trace with hash 181172972, now seen corresponding path program 1 times [2020-10-20 01:00:00,778 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:00:00,779 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955858186] [2020-10-20 01:00:00,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:00:00,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:00:00,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:00:00,854 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955858186] [2020-10-20 01:00:00,854 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:00:00,854 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:00:00,854 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028090973] [2020-10-20 01:00:00,856 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:00:00,856 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:00:00,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:00:00,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:00:00,857 INFO L87 Difference]: Start difference. First operand 71 states and 76 transitions. Second operand 3 states. [2020-10-20 01:00:00,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:00:00,911 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2020-10-20 01:00:00,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:00:00,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-10-20 01:00:00,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:00:00,913 INFO L225 Difference]: With dead ends: 111 [2020-10-20 01:00:00,913 INFO L226 Difference]: Without dead ends: 71 [2020-10-20 01:00:00,914 INFO L677 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 [2020-10-20 01:00:00,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-10-20 01:00:00,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2020-10-20 01:00:00,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-10-20 01:00:00,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2020-10-20 01:00:00,928 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 25 [2020-10-20 01:00:00,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:00:00,928 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2020-10-20 01:00:00,929 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:00:00,929 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2020-10-20 01:00:00,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-20 01:00:00,932 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:00:00,932 INFO L422 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] [2020-10-20 01:00:00,932 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-20 01:00:00,932 INFO L429 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]=== [2020-10-20 01:00:00,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:00:00,933 INFO L82 PathProgramCache]: Analyzing trace with hash 164535203, now seen corresponding path program 1 times [2020-10-20 01:00:00,934 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:00:00,934 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364713871] [2020-10-20 01:00:00,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:00:00,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:00:01,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:00:01,034 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364713871] [2020-10-20 01:00:01,034 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:00:01,034 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 01:00:01,035 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859612804] [2020-10-20 01:00:01,035 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 01:00:01,035 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:00:01,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 01:00:01,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:00:01,037 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand 5 states. [2020-10-20 01:00:01,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:00:01,107 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2020-10-20 01:00:01,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 01:00:01,109 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2020-10-20 01:00:01,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:00:01,109 INFO L225 Difference]: With dead ends: 72 [2020-10-20 01:00:01,110 INFO L226 Difference]: Without dead ends: 70 [2020-10-20 01:00:01,110 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-20 01:00:01,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-10-20 01:00:01,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2020-10-20 01:00:01,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-10-20 01:00:01,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2020-10-20 01:00:01,116 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 26 [2020-10-20 01:00:01,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:00:01,116 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2020-10-20 01:00:01,116 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 01:00:01,117 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2020-10-20 01:00:01,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-20 01:00:01,117 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:00:01,118 INFO L422 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] [2020-10-20 01:00:01,118 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-20 01:00:01,118 INFO L429 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]=== [2020-10-20 01:00:01,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:00:01,119 INFO L82 PathProgramCache]: Analyzing trace with hash -426717015, now seen corresponding path program 1 times [2020-10-20 01:00:01,119 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:00:01,120 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679857040] [2020-10-20 01:00:01,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:00:01,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:00:01,175 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-20 01:00:01,175 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679857040] [2020-10-20 01:00:01,176 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1313974833] [2020-10-20 01:00:01,176 INFO L95 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 [2020-10-20 01:00:01,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:00:01,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-20 01:00:01,260 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 01:00:01,339 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 01:00:01,364 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-20 01:00:01,364 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 01:00:01,365 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-10-20 01:00:01,365 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073170068] [2020-10-20 01:00:01,366 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 01:00:01,366 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:00:01,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 01:00:01,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-20 01:00:01,366 INFO L87 Difference]: Start difference. First operand 69 states and 72 transitions. Second operand 6 states. [2020-10-20 01:00:01,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:00:01,472 INFO L93 Difference]: Finished difference Result 107 states and 111 transitions. [2020-10-20 01:00:01,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 01:00:01,473 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-10-20 01:00:01,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:00:01,474 INFO L225 Difference]: With dead ends: 107 [2020-10-20 01:00:01,474 INFO L226 Difference]: Without dead ends: 105 [2020-10-20 01:00:01,475 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 23 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-10-20 01:00:01,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2020-10-20 01:00:01,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 66. [2020-10-20 01:00:01,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-10-20 01:00:01,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2020-10-20 01:00:01,482 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 26 [2020-10-20 01:00:01,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:00:01,482 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2020-10-20 01:00:01,483 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 01:00:01,483 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2020-10-20 01:00:01,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-20 01:00:01,484 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:00:01,484 INFO L422 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] [2020-10-20 01:00:01,697 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2020-10-20 01:00:01,698 INFO L429 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]=== [2020-10-20 01:00:01,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:00:01,699 INFO L82 PathProgramCache]: Analyzing trace with hash 805630148, now seen corresponding path program 1 times [2020-10-20 01:00:01,700 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:00:01,700 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242318941] [2020-10-20 01:00:01,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:00:01,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:00:01,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:00:01,751 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242318941] [2020-10-20 01:00:01,751 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:00:01,751 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 01:00:01,751 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397238550] [2020-10-20 01:00:01,752 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 01:00:01,752 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:00:01,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 01:00:01,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:00:01,753 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand 5 states. [2020-10-20 01:00:01,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:00:01,838 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2020-10-20 01:00:01,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 01:00:01,839 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2020-10-20 01:00:01,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:00:01,840 INFO L225 Difference]: With dead ends: 66 [2020-10-20 01:00:01,840 INFO L226 Difference]: Without dead ends: 64 [2020-10-20 01:00:01,840 INFO L677 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 [2020-10-20 01:00:01,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-10-20 01:00:01,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2020-10-20 01:00:01,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-10-20 01:00:01,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 67 transitions. [2020-10-20 01:00:01,845 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 67 transitions. Word has length 27 [2020-10-20 01:00:01,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:00:01,845 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 67 transitions. [2020-10-20 01:00:01,845 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 01:00:01,846 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2020-10-20 01:00:01,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-20 01:00:01,846 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:00:01,847 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:00:01,847 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-20 01:00:01,847 INFO L429 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]=== [2020-10-20 01:00:01,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:00:01,847 INFO L82 PathProgramCache]: Analyzing trace with hash -347913071, now seen corresponding path program 1 times [2020-10-20 01:00:01,848 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:00:01,848 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547059445] [2020-10-20 01:00:01,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:00:01,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:00:01,928 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-20 01:00:01,928 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547059445] [2020-10-20 01:00:01,929 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [965702709] [2020-10-20 01:00:01,929 INFO L95 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 [2020-10-20 01:00:01,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:00:01,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-20 01:00:01,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 01:00:02,038 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 01:00:02,055 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-20 01:00:02,055 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 01:00:02,055 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-10-20 01:00:02,056 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007530786] [2020-10-20 01:00:02,056 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 01:00:02,056 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:00:02,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 01:00:02,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-20 01:00:02,057 INFO L87 Difference]: Start difference. First operand 64 states and 67 transitions. Second operand 6 states. [2020-10-20 01:00:02,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:00:02,139 INFO L93 Difference]: Finished difference Result 65 states and 68 transitions. [2020-10-20 01:00:02,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 01:00:02,140 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-10-20 01:00:02,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:00:02,141 INFO L225 Difference]: With dead ends: 65 [2020-10-20 01:00:02,141 INFO L226 Difference]: Without dead ends: 63 [2020-10-20 01:00:02,142 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-10-20 01:00:02,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-10-20 01:00:02,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 58. [2020-10-20 01:00:02,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-10-20 01:00:02,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2020-10-20 01:00:02,146 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 27 [2020-10-20 01:00:02,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:00:02,146 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2020-10-20 01:00:02,146 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 01:00:02,146 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2020-10-20 01:00:02,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-10-20 01:00:02,147 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:00:02,147 INFO L422 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] [2020-10-20 01:00:02,357 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2020-10-20 01:00:02,358 INFO L429 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]=== [2020-10-20 01:00:02,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:00:02,359 INFO L82 PathProgramCache]: Analyzing trace with hash 256477103, now seen corresponding path program 1 times [2020-10-20 01:00:02,359 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:00:02,359 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814749490] [2020-10-20 01:00:02,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:00:02,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:00:02,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:00:02,419 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814749490] [2020-10-20 01:00:02,419 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:00:02,420 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 01:00:02,420 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828286104] [2020-10-20 01:00:02,420 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 01:00:02,420 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:00:02,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 01:00:02,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:00:02,421 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 5 states. [2020-10-20 01:00:02,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:00:02,484 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2020-10-20 01:00:02,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 01:00:02,484 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2020-10-20 01:00:02,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:00:02,485 INFO L225 Difference]: With dead ends: 59 [2020-10-20 01:00:02,485 INFO L226 Difference]: Without dead ends: 57 [2020-10-20 01:00:02,486 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-20 01:00:02,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-10-20 01:00:02,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2020-10-20 01:00:02,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-10-20 01:00:02,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2020-10-20 01:00:02,490 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 30 [2020-10-20 01:00:02,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:00:02,490 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2020-10-20 01:00:02,490 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 01:00:02,490 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2020-10-20 01:00:02,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-10-20 01:00:02,491 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:00:02,491 INFO L422 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] [2020-10-20 01:00:02,491 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-20 01:00:02,492 INFO L429 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]=== [2020-10-20 01:00:02,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:00:02,492 INFO L82 PathProgramCache]: Analyzing trace with hash -639138222, now seen corresponding path program 1 times [2020-10-20 01:00:02,492 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:00:02,492 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887269461] [2020-10-20 01:00:02,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:00:02,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:00:02,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:00:02,540 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887269461] [2020-10-20 01:00:02,540 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:00:02,540 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-20 01:00:02,541 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812405342] [2020-10-20 01:00:02,541 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 01:00:02,541 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:00:02,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 01:00:02,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-20 01:00:02,542 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 6 states. [2020-10-20 01:00:02,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:00:02,645 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2020-10-20 01:00:02,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 01:00:02,646 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2020-10-20 01:00:02,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:00:02,647 INFO L225 Difference]: With dead ends: 67 [2020-10-20 01:00:02,647 INFO L226 Difference]: Without dead ends: 65 [2020-10-20 01:00:02,647 INFO L677 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 [2020-10-20 01:00:02,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-10-20 01:00:02,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 54. [2020-10-20 01:00:02,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-10-20 01:00:02,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2020-10-20 01:00:02,651 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 31 [2020-10-20 01:00:02,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:00:02,651 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2020-10-20 01:00:02,651 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 01:00:02,651 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2020-10-20 01:00:02,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-10-20 01:00:02,652 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:00:02,652 INFO L422 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] [2020-10-20 01:00:02,652 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-20 01:00:02,653 INFO L429 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]=== [2020-10-20 01:00:02,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:00:02,653 INFO L82 PathProgramCache]: Analyzing trace with hash -970765317, now seen corresponding path program 1 times [2020-10-20 01:00:02,653 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:00:02,653 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047711614] [2020-10-20 01:00:02,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:00:02,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:00:02,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:00:02,698 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047711614] [2020-10-20 01:00:02,698 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:00:02,699 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 01:00:02,699 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821291448] [2020-10-20 01:00:02,699 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 01:00:02,699 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:00:02,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 01:00:02,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:00:02,700 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand 5 states. [2020-10-20 01:00:02,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:00:02,825 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2020-10-20 01:00:02,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 01:00:02,826 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2020-10-20 01:00:02,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:00:02,826 INFO L225 Difference]: With dead ends: 87 [2020-10-20 01:00:02,827 INFO L226 Difference]: Without dead ends: 85 [2020-10-20 01:00:02,827 INFO L677 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 [2020-10-20 01:00:02,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2020-10-20 01:00:02,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 57. [2020-10-20 01:00:02,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-10-20 01:00:02,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2020-10-20 01:00:02,831 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 34 [2020-10-20 01:00:02,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:00:02,831 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2020-10-20 01:00:02,831 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 01:00:02,831 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2020-10-20 01:00:02,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-10-20 01:00:02,832 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:00:02,832 INFO L422 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] [2020-10-20 01:00:02,832 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-20 01:00:02,832 INFO L429 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]=== [2020-10-20 01:00:02,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:00:02,832 INFO L82 PathProgramCache]: Analyzing trace with hash -28947553, now seen corresponding path program 1 times [2020-10-20 01:00:02,833 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:00:02,833 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811876127] [2020-10-20 01:00:02,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:00:02,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:00:02,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:00:02,880 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811876127] [2020-10-20 01:00:02,880 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:00:02,880 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 01:00:02,880 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999663540] [2020-10-20 01:00:02,881 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 01:00:02,881 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:00:02,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 01:00:02,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:00:02,882 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand 5 states. [2020-10-20 01:00:02,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:00:02,960 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2020-10-20 01:00:02,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 01:00:02,961 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2020-10-20 01:00:02,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:00:02,962 INFO L225 Difference]: With dead ends: 57 [2020-10-20 01:00:02,962 INFO L226 Difference]: Without dead ends: 55 [2020-10-20 01:00:02,962 INFO L677 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 [2020-10-20 01:00:02,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-10-20 01:00:02,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2020-10-20 01:00:02,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-10-20 01:00:02,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2020-10-20 01:00:02,966 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 35 [2020-10-20 01:00:02,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:00:02,967 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2020-10-20 01:00:02,967 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 01:00:02,967 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2020-10-20 01:00:02,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-10-20 01:00:02,967 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:00:02,968 INFO L422 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] [2020-10-20 01:00:02,968 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-20 01:00:02,968 INFO L429 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]=== [2020-10-20 01:00:02,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:00:02,968 INFO L82 PathProgramCache]: Analyzing trace with hash -2048601854, now seen corresponding path program 1 times [2020-10-20 01:00:02,969 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:00:02,969 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802393233] [2020-10-20 01:00:02,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:00:02,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:00:03,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:00:03,002 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802393233] [2020-10-20 01:00:03,002 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:00:03,002 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 01:00:03,002 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552052229] [2020-10-20 01:00:03,003 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 01:00:03,003 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:00:03,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 01:00:03,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 01:00:03,003 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand 4 states. [2020-10-20 01:00:03,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:00:03,030 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2020-10-20 01:00:03,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 01:00:03,030 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2020-10-20 01:00:03,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:00:03,031 INFO L225 Difference]: With dead ends: 66 [2020-10-20 01:00:03,031 INFO L226 Difference]: Without dead ends: 64 [2020-10-20 01:00:03,031 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:00:03,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-10-20 01:00:03,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 53. [2020-10-20 01:00:03,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-10-20 01:00:03,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2020-10-20 01:00:03,036 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 37 [2020-10-20 01:00:03,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:00:03,036 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2020-10-20 01:00:03,036 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 01:00:03,036 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2020-10-20 01:00:03,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-10-20 01:00:03,037 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:00:03,037 INFO L422 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] [2020-10-20 01:00:03,037 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-20 01:00:03,048 INFO L429 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]=== [2020-10-20 01:00:03,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:00:03,049 INFO L82 PathProgramCache]: Analyzing trace with hash 917858189, now seen corresponding path program 1 times [2020-10-20 01:00:03,049 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:00:03,049 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508972814] [2020-10-20 01:00:03,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:00:03,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:00:03,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:00:03,101 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508972814] [2020-10-20 01:00:03,101 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:00:03,102 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 01:00:03,102 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276001072] [2020-10-20 01:00:03,102 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 01:00:03,102 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:00:03,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 01:00:03,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:00:03,103 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 5 states. [2020-10-20 01:00:03,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:00:03,139 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2020-10-20 01:00:03,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 01:00:03,140 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2020-10-20 01:00:03,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:00:03,140 INFO L225 Difference]: With dead ends: 62 [2020-10-20 01:00:03,141 INFO L226 Difference]: Without dead ends: 60 [2020-10-20 01:00:03,141 INFO L677 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 [2020-10-20 01:00:03,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-10-20 01:00:03,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 51. [2020-10-20 01:00:03,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-10-20 01:00:03,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2020-10-20 01:00:03,146 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 38 [2020-10-20 01:00:03,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:00:03,147 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2020-10-20 01:00:03,147 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 01:00:03,147 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2020-10-20 01:00:03,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-10-20 01:00:03,148 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:00:03,148 INFO L422 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] [2020-10-20 01:00:03,148 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-20 01:00:03,148 INFO L429 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]=== [2020-10-20 01:00:03,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:00:03,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1611160981, now seen corresponding path program 1 times [2020-10-20 01:00:03,149 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:00:03,149 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513780321] [2020-10-20 01:00:03,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:00:03,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:00:03,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:00:03,210 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513780321] [2020-10-20 01:00:03,210 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:00:03,210 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 01:00:03,211 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044742435] [2020-10-20 01:00:03,211 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 01:00:03,211 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:00:03,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 01:00:03,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:00:03,212 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand 5 states. [2020-10-20 01:00:03,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:00:03,346 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2020-10-20 01:00:03,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 01:00:03,346 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2020-10-20 01:00:03,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:00:03,347 INFO L225 Difference]: With dead ends: 84 [2020-10-20 01:00:03,347 INFO L226 Difference]: Without dead ends: 82 [2020-10-20 01:00:03,348 INFO L677 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 [2020-10-20 01:00:03,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2020-10-20 01:00:03,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 56. [2020-10-20 01:00:03,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-10-20 01:00:03,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2020-10-20 01:00:03,353 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 39 [2020-10-20 01:00:03,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:00:03,354 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2020-10-20 01:00:03,354 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 01:00:03,354 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2020-10-20 01:00:03,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-10-20 01:00:03,354 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:00:03,355 INFO L422 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] [2020-10-20 01:00:03,355 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-20 01:00:03,355 INFO L429 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]=== [2020-10-20 01:00:03,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:00:03,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1593623382, now seen corresponding path program 1 times [2020-10-20 01:00:03,356 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:00:03,356 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026766141] [2020-10-20 01:00:03,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:00:03,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:00:03,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:00:03,403 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026766141] [2020-10-20 01:00:03,403 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:00:03,403 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 01:00:03,404 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473613946] [2020-10-20 01:00:03,404 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 01:00:03,404 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:00:03,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 01:00:03,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:00:03,405 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand 5 states. [2020-10-20 01:00:03,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:00:03,499 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2020-10-20 01:00:03,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 01:00:03,500 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2020-10-20 01:00:03,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:00:03,500 INFO L225 Difference]: With dead ends: 69 [2020-10-20 01:00:03,501 INFO L226 Difference]: Without dead ends: 67 [2020-10-20 01:00:03,501 INFO L677 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 [2020-10-20 01:00:03,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-10-20 01:00:03,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 54. [2020-10-20 01:00:03,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-10-20 01:00:03,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2020-10-20 01:00:03,507 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 40 [2020-10-20 01:00:03,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:00:03,507 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2020-10-20 01:00:03,507 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 01:00:03,507 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2020-10-20 01:00:03,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-10-20 01:00:03,508 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:00:03,508 INFO L422 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] [2020-10-20 01:00:03,509 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-20 01:00:03,509 INFO L429 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]=== [2020-10-20 01:00:03,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:00:03,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1530694651, now seen corresponding path program 1 times [2020-10-20 01:00:03,510 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:00:03,510 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493695996] [2020-10-20 01:00:03,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:00:03,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:00:03,570 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:00:03,570 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493695996] [2020-10-20 01:00:03,570 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266105938] [2020-10-20 01:00:03,570 INFO L95 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 [2020-10-20 01:00:03,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:00:03,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-20 01:00:03,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 01:00:03,686 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 01:00:03,700 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:00:03,701 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 01:00:03,701 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-10-20 01:00:03,701 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307241293] [2020-10-20 01:00:03,702 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 01:00:03,702 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:00:03,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 01:00:03,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-20 01:00:03,703 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand 6 states. [2020-10-20 01:00:03,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:00:03,765 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2020-10-20 01:00:03,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 01:00:03,766 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2020-10-20 01:00:03,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:00:03,767 INFO L225 Difference]: With dead ends: 54 [2020-10-20 01:00:03,767 INFO L226 Difference]: Without dead ends: 52 [2020-10-20 01:00:03,767 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 36 SyntacticMatches, 6 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-10-20 01:00:03,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-10-20 01:00:03,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2020-10-20 01:00:03,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-10-20 01:00:03,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2020-10-20 01:00:03,772 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 40 [2020-10-20 01:00:03,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:00:03,773 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2020-10-20 01:00:03,773 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 01:00:03,773 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2020-10-20 01:00:03,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-10-20 01:00:03,773 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:00:03,774 INFO L422 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] [2020-10-20 01:00:03,984 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2020-10-20 01:00:03,985 INFO L429 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]=== [2020-10-20 01:00:03,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:00:03,986 INFO L82 PathProgramCache]: Analyzing trace with hash 943780001, now seen corresponding path program 1 times [2020-10-20 01:00:03,986 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:00:03,986 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710615157] [2020-10-20 01:00:03,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:00:03,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:00:04,032 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-20 01:00:04,032 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710615157] [2020-10-20 01:00:04,032 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:00:04,032 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 01:00:04,033 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523868648] [2020-10-20 01:00:04,033 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 01:00:04,033 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:00:04,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 01:00:04,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:00:04,034 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 5 states. [2020-10-20 01:00:04,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:00:04,166 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2020-10-20 01:00:04,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 01:00:04,166 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2020-10-20 01:00:04,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:00:04,167 INFO L225 Difference]: With dead ends: 71 [2020-10-20 01:00:04,167 INFO L226 Difference]: Without dead ends: 0 [2020-10-20 01:00:04,167 INFO L677 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 [2020-10-20 01:00:04,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-20 01:00:04,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-20 01:00:04,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-20 01:00:04,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-20 01:00:04,168 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2020-10-20 01:00:04,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:00:04,168 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 01:00:04,169 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 01:00:04,169 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-20 01:00:04,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-20 01:00:04,169 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-10-20 01:00:04,171 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-10-20 01:00:04,533 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 29 [2020-10-20 01:00:04,907 WARN L193 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 61 [2020-10-20 01:00:05,362 WARN L193 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 69 [2020-10-20 01:00:05,369 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-10-20 01:00:05,370 INFO L274 CegarLoopResult]: For program point L234(lines 234 338) no Hoare annotation was computed. [2020-10-20 01:00:05,370 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-10-20 01:00:05,370 INFO L274 CegarLoopResult]: For program point L135(lines 135 397) no Hoare annotation was computed. [2020-10-20 01:00:05,370 INFO L274 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-10-20 01:00:05,370 INFO L274 CegarLoopResult]: For program point L53(lines 53 433) no Hoare annotation was computed. [2020-10-20 01:00:05,370 INFO L274 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-10-20 01:00:05,370 INFO L274 CegarLoopResult]: For program point L4-1(line 4) no Hoare annotation was computed. [2020-10-20 01:00:05,370 INFO L274 CegarLoopResult]: For program point L4-2(line 4) no Hoare annotation was computed. [2020-10-20 01:00:05,371 INFO L274 CegarLoopResult]: For program point L4-3(line 4) no Hoare annotation was computed. [2020-10-20 01:00:05,371 INFO L274 CegarLoopResult]: For program point L4-4(line 4) no Hoare annotation was computed. [2020-10-20 01:00:05,371 INFO L274 CegarLoopResult]: For program point L384(lines 384 393) no Hoare annotation was computed. [2020-10-20 01:00:05,371 INFO L274 CegarLoopResult]: For program point L4-5(line 4) no Hoare annotation was computed. [2020-10-20 01:00:05,371 INFO L274 CegarLoopResult]: For program point L4-6(line 4) no Hoare annotation was computed. [2020-10-20 01:00:05,371 INFO L274 CegarLoopResult]: For program point L4-7(line 4) no Hoare annotation was computed. [2020-10-20 01:00:05,372 INFO L274 CegarLoopResult]: For program point L4-8(line 4) no Hoare annotation was computed. [2020-10-20 01:00:05,372 INFO L274 CegarLoopResult]: For program point L4-9(line 4) no Hoare annotation was computed. [2020-10-20 01:00:05,372 INFO L274 CegarLoopResult]: For program point L4-10(line 4) no Hoare annotation was computed. [2020-10-20 01:00:05,373 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-10-20 01:00:05,373 INFO L274 CegarLoopResult]: For program point L4-11(line 4) no Hoare annotation was computed. [2020-10-20 01:00:05,374 INFO L274 CegarLoopResult]: For program point L4-12(line 4) no Hoare annotation was computed. [2020-10-20 01:00:05,374 INFO L274 CegarLoopResult]: For program point L4-13(line 4) no Hoare annotation was computed. [2020-10-20 01:00:05,374 INFO L274 CegarLoopResult]: For program point L4-14(line 4) no Hoare annotation was computed. [2020-10-20 01:00:05,375 INFO L274 CegarLoopResult]: For program point L4-15(line 4) no Hoare annotation was computed. [2020-10-20 01:00:05,375 INFO L274 CegarLoopResult]: For program point L4-16(line 4) no Hoare annotation was computed. [2020-10-20 01:00:05,375 INFO L274 CegarLoopResult]: For program point L4-17(line 4) no Hoare annotation was computed. [2020-10-20 01:00:05,375 INFO L274 CegarLoopResult]: For program point L4-18(line 4) no Hoare annotation was computed. [2020-10-20 01:00:05,376 INFO L274 CegarLoopResult]: For program point L4-19(line 4) no Hoare annotation was computed. [2020-10-20 01:00:05,376 INFO L270 CegarLoopResult]: At program point L401(lines 131 402) the Hoare annotation is: (and (= ULTIMATE.start_main_~__VERIFIER_assert__cond~3 1) (let ((.cse0 (<= 1 ULTIMATE.start_main_~main__cp~0)) (.cse1 (< 0 ULTIMATE.start_main_~main__scheme~0)) (.cse2 (< ULTIMATE.start_main_~main__cp~0 ULTIMATE.start_main_~main__urilen~0)) (.cse3 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~0 0))) (.cse4 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~3 0))) (.cse5 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~2 0))) (.cse6 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~1 0)))) (or (and .cse0 (= ULTIMATE.start_main_~__VERIFIER_assert__cond~2 1) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~16 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6)))) [2020-10-20 01:00:05,377 INFO L274 CegarLoopResult]: For program point L4-20(line 4) no Hoare annotation was computed. [2020-10-20 01:00:05,377 INFO L274 CegarLoopResult]: For program point L4-21(line 4) no Hoare annotation was computed. [2020-10-20 01:00:05,377 INFO L274 CegarLoopResult]: For program point L4-22(line 4) no Hoare annotation was computed. [2020-10-20 01:00:05,378 INFO L274 CegarLoopResult]: For program point L4-23(line 4) no Hoare annotation was computed. [2020-10-20 01:00:05,378 INFO L274 CegarLoopResult]: For program point L4-24(line 4) no Hoare annotation was computed. [2020-10-20 01:00:05,378 INFO L274 CegarLoopResult]: For program point L4-25(line 4) no Hoare annotation was computed. [2020-10-20 01:00:05,378 INFO L274 CegarLoopResult]: For program point L4-26(line 4) no Hoare annotation was computed. [2020-10-20 01:00:05,379 INFO L274 CegarLoopResult]: For program point L4-27(line 4) no Hoare annotation was computed. [2020-10-20 01:00:05,379 INFO L274 CegarLoopResult]: For program point L104(lines 104 411) no Hoare annotation was computed. [2020-10-20 01:00:05,379 INFO L274 CegarLoopResult]: For program point L4-28(line 4) no Hoare annotation was computed. [2020-10-20 01:00:05,379 INFO L274 CegarLoopResult]: For program point L71(lines 71 416) no Hoare annotation was computed. [2020-10-20 01:00:05,380 INFO L274 CegarLoopResult]: For program point L4-29(line 4) no Hoare annotation was computed. [2020-10-20 01:00:05,380 INFO L274 CegarLoopResult]: For program point L4-30(line 4) no Hoare annotation was computed. [2020-10-20 01:00:05,380 INFO L274 CegarLoopResult]: For program point L4-31(line 4) no Hoare annotation was computed. [2020-10-20 01:00:05,380 INFO L274 CegarLoopResult]: For program point L4-32(line 4) no Hoare annotation was computed. [2020-10-20 01:00:05,381 INFO L274 CegarLoopResult]: For program point L4-33(line 4) no Hoare annotation was computed. [2020-10-20 01:00:05,381 INFO L274 CegarLoopResult]: For program point L4-34(line 4) no Hoare annotation was computed. [2020-10-20 01:00:05,381 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-10-20 01:00:05,382 INFO L274 CegarLoopResult]: For program point L4-35(line 4) no Hoare annotation was computed. [2020-10-20 01:00:05,382 INFO L274 CegarLoopResult]: For program point L253(lines 253 329) no Hoare annotation was computed. [2020-10-20 01:00:05,382 INFO L274 CegarLoopResult]: For program point L187(lines 187 355) no Hoare annotation was computed. [2020-10-20 01:00:05,382 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-10-20 01:00:05,383 INFO L274 CegarLoopResult]: For program point L270(lines 270 322) no Hoare annotation was computed. [2020-10-20 01:00:05,383 INFO L274 CegarLoopResult]: For program point L204(lines 204 353) no Hoare annotation was computed. [2020-10-20 01:00:05,383 INFO L274 CegarLoopResult]: For program point L155(lines 155 360) no Hoare annotation was computed. [2020-10-20 01:00:05,383 INFO L274 CegarLoopResult]: For program point L23(lines 23 438) no Hoare annotation was computed. [2020-10-20 01:00:05,384 INFO L274 CegarLoopResult]: For program point L123(lines 123 403) no Hoare annotation was computed. [2020-10-20 01:00:05,384 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-10-20 01:00:05,384 INFO L274 CegarLoopResult]: For program point L41(lines 41 435) no Hoare annotation was computed. [2020-10-20 01:00:05,384 INFO L274 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-10-20 01:00:05,385 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-10-20 01:00:05,385 INFO L274 CegarLoopResult]: For program point L372(lines 372 395) no Hoare annotation was computed. [2020-10-20 01:00:05,385 INFO L274 CegarLoopResult]: For program point L306(lines 306 316) no Hoare annotation was computed. [2020-10-20 01:00:05,385 INFO L274 CegarLoopResult]: For program point L224(lines 224 344) no Hoare annotation was computed. [2020-10-20 01:00:05,386 INFO L274 CegarLoopResult]: For program point L59(lines 59 432) no Hoare annotation was computed. [2020-10-20 01:00:05,386 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-10-20 01:00:05,386 INFO L274 CegarLoopResult]: For program point L241(lines 241 331) no Hoare annotation was computed. [2020-10-20 01:00:05,386 INFO L274 CegarLoopResult]: For program point L175(lines 175 357) no Hoare annotation was computed. [2020-10-20 01:00:05,387 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-10-20 01:00:05,387 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-10-20 01:00:05,387 INFO L274 CegarLoopResult]: For program point L143(lines 143 362) no Hoare annotation was computed. [2020-10-20 01:00:05,387 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-10-20 01:00:05,387 INFO L274 CegarLoopResult]: For program point L61(lines 61 427) no Hoare annotation was computed. [2020-10-20 01:00:05,388 INFO L274 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-10-20 01:00:05,388 INFO L274 CegarLoopResult]: For program point L111(lines 111 405) no Hoare annotation was computed. [2020-10-20 01:00:05,388 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-10-20 01:00:05,388 INFO L270 CegarLoopResult]: At program point L392(lines 129 403) the Hoare annotation is: (and (let ((.cse0 (<= 1 ULTIMATE.start_main_~main__cp~0)) (.cse1 (< 0 ULTIMATE.start_main_~main__scheme~0)) (.cse2 (= ULTIMATE.start_main_~__VERIFIER_assert__cond~3 1)) (.cse3 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~0 0))) (.cse4 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~1 0)))) (or (and .cse0 .cse1 .cse2 .cse3 (<= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~16) (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~2 0)) .cse4 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~17 0))) (and .cse0 (= ULTIMATE.start_main_~__VERIFIER_assert__cond~2 1) .cse1 .cse2 .cse3 .cse4))) (< ULTIMATE.start_main_~main__cp~0 ULTIMATE.start_main_~main__urilen~0)) [2020-10-20 01:00:05,389 INFO L274 CegarLoopResult]: For program point L194(lines 194 354) no Hoare annotation was computed. [2020-10-20 01:00:05,389 INFO L274 CegarLoopResult]: For program point L95(lines 95 412) no Hoare annotation was computed. [2020-10-20 01:00:05,389 INFO L274 CegarLoopResult]: For program point L29(lines 29 437) no Hoare annotation was computed. [2020-10-20 01:00:05,389 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-10-20 01:00:05,390 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-10-20 01:00:05,390 INFO L270 CegarLoopResult]: At program point L327(lines 262 328) the Hoare annotation is: (and (let ((.cse0 (let ((.cse1 (<= 1 ULTIMATE.start_main_~main__cp~0)) (.cse2 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~7 0))) (.cse3 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~6 0))) (.cse4 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~11 0))) (.cse5 (< 0 ULTIMATE.start_main_~main__scheme~0)) (.cse6 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~5 0))) (.cse7 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~2 0))) (.cse8 (<= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~4)) (.cse9 (= ULTIMATE.start_main_~__VERIFIER_assert__cond~9 1)) (.cse10 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~8 0))) (.cse11 (= ULTIMATE.start_main_~__VERIFIER_assert__cond~3 1)) (.cse12 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~0 0))) (.cse13 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~1 0)))) (or (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= (+ ULTIMATE.start_main_~main__c~0 2) ULTIMATE.start_main_~main__tokenlen~0) .cse11 .cse12 .cse13) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~12 0)) .cse11 .cse12 .cse13))))) (or (and (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~13 0)) .cse0 (<= 1 ULTIMATE.start_main_~main__c~0)) (and .cse0 (= ULTIMATE.start_main_~main__c~0 0)))) (< (+ ULTIMATE.start_main_~main__cp~0 1) ULTIMATE.start_main_~main__urilen~0) (= ULTIMATE.start_main_~__VERIFIER_assert__cond~10 1)) [2020-10-20 01:00:05,391 INFO L274 CegarLoopResult]: For program point L294(lines 294 318) no Hoare annotation was computed. [2020-10-20 01:00:05,391 INFO L274 CegarLoopResult]: For program point L162(lines 162 359) no Hoare annotation was computed. [2020-10-20 01:00:05,391 INFO L274 CegarLoopResult]: For program point L63(lines 63 422) no Hoare annotation was computed. [2020-10-20 01:00:05,391 INFO L270 CegarLoopResult]: At program point L410(lines 104 411) the Hoare annotation is: (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~0 0)) [2020-10-20 01:00:05,392 INFO L274 CegarLoopResult]: For program point L212(lines 212 346) no Hoare annotation was computed. [2020-10-20 01:00:05,392 INFO L274 CegarLoopResult]: For program point L47(lines 47 434) no Hoare annotation was computed. [2020-10-20 01:00:05,392 INFO L274 CegarLoopResult]: For program point L262(lines 262 328) no Hoare annotation was computed. [2020-10-20 01:00:05,393 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-10-20 01:00:05,393 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-10-20 01:00:05,393 INFO L274 CegarLoopResult]: For program point L65(lines 65 417) no Hoare annotation was computed. [2020-10-20 01:00:05,393 INFO L274 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-10-20 01:00:05,394 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-10-20 01:00:05,394 INFO L274 CegarLoopResult]: For program point L83(lines 83 414) no Hoare annotation was computed. [2020-10-20 01:00:05,395 INFO L270 CegarLoopResult]: At program point L315(lines 230 344) the Hoare annotation is: (let ((.cse3 (<= 1 ULTIMATE.start_main_~main__cp~0)) (.cse4 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~7 0))) (.cse5 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~6 0))) (.cse6 (< 0 ULTIMATE.start_main_~main__scheme~0)) (.cse8 (< ULTIMATE.start_main_~main__cp~0 ULTIMATE.start_main_~main__urilen~0)) (.cse9 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~5 0))) (.cse10 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~2 0))) (.cse11 (<= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~4)) (.cse0 (= ULTIMATE.start_main_~__VERIFIER_assert__cond~9 1)) (.cse13 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~8 0))) (.cse14 (= ULTIMATE.start_main_~__VERIFIER_assert__cond~3 1)) (.cse15 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~0 0))) (.cse16 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~1 0))) (.cse2 (= ULTIMATE.start_main_~main__c~0 0))) (or (and (<= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~10) .cse0 (let ((.cse1 (let ((.cse7 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~11 0))) (.cse12 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~10 0)))) (or (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (<= (+ ULTIMATE.start_main_~main__c~0 2) ULTIMATE.start_main_~main__tokenlen~0) .cse14 .cse15 .cse16) (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~12 0)) .cse14 .cse15 .cse16))))) (or (and .cse1 .cse2) (and (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~13 0)) (<= 1 ULTIMATE.start_main_~main__c~0) .cse1)))) (and .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse0 (= ULTIMATE.start_main_~__VERIFIER_assert__cond~8 1) .cse13 .cse14 .cse15 .cse16 (< (+ ULTIMATE.start_main_~main__cp~0 1) ULTIMATE.start_main_~main__urilen~0) .cse2))) [2020-10-20 01:00:05,395 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-10-20 01:00:05,395 INFO L274 CegarLoopResult]: For program point L282(lines 282 320) no Hoare annotation was computed. [2020-10-20 01:00:05,395 INFO L277 CegarLoopResult]: At program point L431(lines 13 439) the Hoare annotation is: true [2020-10-20 01:00:05,396 INFO L274 CegarLoopResult]: For program point L35(lines 35 436) no Hoare annotation was computed. [2020-10-20 01:00:05,434 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.10 01:00:05 BoogieIcfgContainer [2020-10-20 01:00:05,434 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-20 01:00:05,435 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 01:00:05,435 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 01:00:05,435 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 01:00:05,436 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 12:59:58" (3/4) ... [2020-10-20 01:00:05,441 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-10-20 01:00:05,460 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2020-10-20 01:00:05,461 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2020-10-20 01:00:05,461 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-10-20 01:00:05,462 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-10-20 01:00:05,575 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-20 01:00:05,575 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 01:00:05,578 INFO L168 Benchmark]: Toolchain (without parser) took 8031.97 ms. Allocated memory was 44.0 MB in the beginning and 83.9 MB in the end (delta: 39.8 MB). Free memory was 24.7 MB in the beginning and 13.3 MB in the end (delta: 11.4 MB). Peak memory consumption was 51.2 MB. Max. memory is 14.3 GB. [2020-10-20 01:00:05,579 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 32.5 MB. Free memory was 11.7 MB in the beginning and 11.6 MB in the end (delta: 48.3 kB). Peak memory consumption was 48.3 kB. Max. memory is 14.3 GB. [2020-10-20 01:00:05,581 INFO L168 Benchmark]: CACSL2BoogieTranslator took 397.92 ms. Allocated memory was 44.0 MB in the beginning and 44.6 MB in the end (delta: 524.3 kB). Free memory was 23.9 MB in the beginning and 23.8 MB in the end (delta: 104.3 kB). Peak memory consumption was 14.1 MB. Max. memory is 14.3 GB. [2020-10-20 01:00:05,582 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.48 ms. Allocated memory is still 44.6 MB. Free memory was 23.8 MB in the beginning and 21.4 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 14.3 GB. [2020-10-20 01:00:05,583 INFO L168 Benchmark]: Boogie Preprocessor took 31.55 ms. Allocated memory is still 44.6 MB. Free memory was 21.4 MB in the beginning and 19.7 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 14.3 GB. [2020-10-20 01:00:05,584 INFO L168 Benchmark]: RCFGBuilder took 592.74 ms. Allocated memory was 44.6 MB in the beginning and 47.2 MB in the end (delta: 2.6 MB). Free memory was 19.5 MB in the beginning and 29.7 MB in the end (delta: -10.2 MB). Peak memory consumption was 12.4 MB. Max. memory is 14.3 GB. [2020-10-20 01:00:05,586 INFO L168 Benchmark]: TraceAbstraction took 6797.87 ms. Allocated memory was 47.2 MB in the beginning and 83.9 MB in the end (delta: 36.7 MB). Free memory was 29.4 MB in the beginning and 23.6 MB in the end (delta: 5.8 MB). Peak memory consumption was 56.6 MB. Max. memory is 14.3 GB. [2020-10-20 01:00:05,587 INFO L168 Benchmark]: Witness Printer took 140.52 ms. Allocated memory is still 83.9 MB. Free memory was 23.6 MB in the beginning and 14.5 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 14.3 GB. [2020-10-20 01:00:05,592 INFO L339 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 32.5 MB. Free memory was 11.7 MB in the beginning and 11.6 MB in the end (delta: 48.3 kB). Peak memory consumption was 48.3 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 397.92 ms. Allocated memory was 44.0 MB in the beginning and 44.6 MB in the end (delta: 524.3 kB). Free memory was 23.9 MB in the beginning and 23.8 MB in the end (delta: 104.3 kB). Peak memory consumption was 14.1 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 58.48 ms. Allocated memory is still 44.6 MB. Free memory was 23.8 MB in the beginning and 21.4 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 31.55 ms. Allocated memory is still 44.6 MB. Free memory was 21.4 MB in the beginning and 19.7 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 14.3 GB. * RCFGBuilder took 592.74 ms. Allocated memory was 44.6 MB in the beginning and 47.2 MB in the end (delta: 2.6 MB). Free memory was 19.5 MB in the beginning and 29.7 MB in the end (delta: -10.2 MB). Peak memory consumption was 12.4 MB. Max. memory is 14.3 GB. * TraceAbstraction took 6797.87 ms. Allocated memory was 47.2 MB in the beginning and 83.9 MB in the end (delta: 36.7 MB). Free memory was 29.4 MB in the beginning and 23.6 MB in the end (delta: 5.8 MB). Peak memory consumption was 56.6 MB. Max. memory is 14.3 GB. * Witness Printer took 140.52 ms. Allocated memory is still 83.9 MB. Free memory was 23.6 MB in the beginning and 14.5 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 14.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4]: 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: 129]: Loop Invariant Derived loop invariant: ((((((((1 <= main__cp && 0 < main__scheme) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && 1 <= __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) || (((((1 <= main__cp && __VERIFIER_assert__cond == 1) && 0 < main__scheme) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0))) && main__cp < main__urilen - InvariantResult [Line: 262]: Loop Invariant Derived loop invariant: ((((!(__VERIFIER_assert__cond == 0) && ((((((((((((((1 <= main__cp && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= __VERIFIER_assert__cond) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && main__c + 2 <= main__tokenlen) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) || (((((((((((((1 <= main__cp && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= __VERIFIER_assert__cond) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)))) && 1 <= main__c) || (((((((((((((((1 <= main__cp && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= __VERIFIER_assert__cond) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && main__c + 2 <= main__tokenlen) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) || (((((((((((((1 <= main__cp && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= __VERIFIER_assert__cond) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0))) && main__c == 0)) && main__cp + 1 < main__urilen) && __VERIFIER_assert__cond == 1 - InvariantResult [Line: 131]: Loop Invariant Derived loop invariant: __VERIFIER_assert__cond == 1 && ((((((((1 <= main__cp && __VERIFIER_assert__cond == 1) && 0 < main__scheme) && main__cp < main__urilen) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) || (((((((1 <= main__cp && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && main__cp < main__urilen) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0))) - InvariantResult [Line: 230]: Loop Invariant Derived loop invariant: ((1 <= __VERIFIER_assert__cond && __VERIFIER_assert__cond == 1) && (((((((((((((((((1 <= main__cp && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && main__cp < main__urilen) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__c + 2 <= main__tokenlen) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) || ((((((((((((((1 <= main__cp && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && main__cp < main__urilen) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0))) && main__c == 0) || ((!(__VERIFIER_assert__cond == 0) && 1 <= main__c) && (((((((((((((((1 <= main__cp && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && main__cp < main__urilen) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__c + 2 <= main__tokenlen) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) || ((((((((((((((1 <= main__cp && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && main__cp < main__urilen) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)))))) || (((((((((((((((1 <= main__cp && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && main__cp < main__urilen) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= __VERIFIER_assert__cond) && __VERIFIER_assert__cond == 1) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__cp + 1 < main__urilen) && main__c == 0) - InvariantResult [Line: 104]: Loop Invariant Derived loop invariant: !(__VERIFIER_assert__cond == 0) - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 100 locations, 18 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 5.4s, OverallIterations: 23, TraceHistogramMax: 2, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1241 SDtfs, 2193 SDslu, 1427 SDs, 0 SdLazy, 1148 SolverSat, 116 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 252 GetRequests, 126 SyntacticMatches, 15 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=100occurred 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, 23 MinimizatonAttempts, 293 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 15 NumberOfFragments, 665 HoareAnnotationTreeSize, 6 FomulaSimplifications, 378292 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 6 FomulaSimplificationsInter, 9983 FormulaSimplificationTreeSizeReductionInter, 0.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 751 NumberOfCodeBlocks, 751 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 725 ConstructedInterpolants, 0 QuantifiedInterpolants, 46335 SizeOfPredicates, 15 NumberOfNonLiveVariables, 398 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 26 InterpolantComputations, 20 PerfectInterpolantSequences, 9/21 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...