./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem01_label27.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem01_label27.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e1af67db67a88433de1a31e57b46e50dcbb6e7d8 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 15:43:25,063 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 15:43:25,067 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 15:43:25,081 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 15:43:25,081 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 15:43:25,083 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 15:43:25,084 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 15:43:25,086 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 15:43:25,088 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 15:43:25,089 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 15:43:25,091 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 15:43:25,092 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 15:43:25,092 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 15:43:25,093 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 15:43:25,095 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 15:43:25,096 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 15:43:25,097 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 15:43:25,098 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 15:43:25,100 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 15:43:25,102 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 15:43:25,104 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 15:43:25,105 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 15:43:25,106 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 15:43:25,107 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 15:43:25,110 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 15:43:25,110 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 15:43:25,110 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 15:43:25,111 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 15:43:25,112 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 15:43:25,113 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 15:43:25,113 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 15:43:25,114 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 15:43:25,115 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 15:43:25,116 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 15:43:25,117 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 15:43:25,118 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 15:43:25,118 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 15:43:25,119 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 15:43:25,119 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 15:43:25,120 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 15:43:25,121 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 15:43:25,122 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 15:43:25,137 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 15:43:25,137 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 15:43:25,139 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 15:43:25,139 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 15:43:25,139 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 15:43:25,140 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 15:43:25,140 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 15:43:25,140 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 15:43:25,140 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 15:43:25,140 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 15:43:25,141 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 15:43:25,141 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 15:43:25,141 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 15:43:25,141 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 15:43:25,141 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 15:43:25,142 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 15:43:25,142 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 15:43:25,142 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 15:43:25,142 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 15:43:25,143 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 15:43:25,143 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 15:43:25,143 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 15:43:25,143 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 15:43:25,144 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 15:43:25,144 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 15:43:25,144 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 15:43:25,144 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 15:43:25,144 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 15:43:25,145 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 15:43:25,145 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e1af67db67a88433de1a31e57b46e50dcbb6e7d8 [2019-11-28 15:43:25,459 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 15:43:25,473 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 15:43:25,476 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 15:43:25,478 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 15:43:25,482 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 15:43:25,483 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem01_label27.c [2019-11-28 15:43:25,548 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a5319583/4abb9d42fc124ffca3390b4f8952db02/FLAG8df951742 [2019-11-28 15:43:26,090 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 15:43:26,091 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label27.c [2019-11-28 15:43:26,104 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a5319583/4abb9d42fc124ffca3390b4f8952db02/FLAG8df951742 [2019-11-28 15:43:26,392 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a5319583/4abb9d42fc124ffca3390b4f8952db02 [2019-11-28 15:43:26,396 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 15:43:26,398 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 15:43:26,399 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 15:43:26,399 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 15:43:26,403 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 15:43:26,404 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:43:26" (1/1) ... [2019-11-28 15:43:26,407 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43d908f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:26, skipping insertion in model container [2019-11-28 15:43:26,408 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:43:26" (1/1) ... [2019-11-28 15:43:26,416 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 15:43:26,467 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 15:43:27,070 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 15:43:27,086 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 15:43:27,239 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 15:43:27,264 INFO L208 MainTranslator]: Completed translation [2019-11-28 15:43:27,265 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:27 WrapperNode [2019-11-28 15:43:27,265 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 15:43:27,266 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 15:43:27,267 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 15:43:27,267 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 15:43:27,277 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:27" (1/1) ... [2019-11-28 15:43:27,313 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:27" (1/1) ... [2019-11-28 15:43:27,403 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 15:43:27,406 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 15:43:27,406 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 15:43:27,407 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 15:43:27,418 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:27" (1/1) ... [2019-11-28 15:43:27,419 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:27" (1/1) ... [2019-11-28 15:43:27,422 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:27" (1/1) ... [2019-11-28 15:43:27,423 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:27" (1/1) ... [2019-11-28 15:43:27,459 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:27" (1/1) ... [2019-11-28 15:43:27,481 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:27" (1/1) ... [2019-11-28 15:43:27,489 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:27" (1/1) ... [2019-11-28 15:43:27,505 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 15:43:27,506 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 15:43:27,506 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 15:43:27,506 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 15:43:27,508 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:27" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 15:43:27,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 15:43:27,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 15:43:28,880 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 15:43:28,881 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-28 15:43:28,883 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:43:28 BoogieIcfgContainer [2019-11-28 15:43:28,884 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 15:43:28,885 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 15:43:28,885 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 15:43:28,889 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 15:43:28,890 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:43:26" (1/3) ... [2019-11-28 15:43:28,891 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4411cbbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:43:28, skipping insertion in model container [2019-11-28 15:43:28,892 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:27" (2/3) ... [2019-11-28 15:43:28,892 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4411cbbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:43:28, skipping insertion in model container [2019-11-28 15:43:28,892 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:43:28" (3/3) ... [2019-11-28 15:43:28,894 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label27.c [2019-11-28 15:43:28,904 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 15:43:28,912 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 15:43:28,924 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 15:43:28,964 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 15:43:28,965 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 15:43:28,966 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 15:43:28,966 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 15:43:28,966 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 15:43:28,968 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 15:43:28,968 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 15:43:28,969 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 15:43:29,006 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-11-28 15:43:29,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-28 15:43:29,023 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:43:29,025 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:43:29,026 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:43:29,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:43:29,034 INFO L82 PathProgramCache]: Analyzing trace with hash 857291087, now seen corresponding path program 1 times [2019-11-28 15:43:29,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:43:29,047 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550186668] [2019-11-28 15:43:29,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:43:29,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:43:29,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:43:29,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550186668] [2019-11-28 15:43:29,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:43:29,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:43:29,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574878223] [2019-11-28 15:43:29,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:43:29,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:43:29,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:43:29,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:43:29,558 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 3 states. [2019-11-28 15:43:30,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:43:30,477 INFO L93 Difference]: Finished difference Result 528 states and 915 transitions. [2019-11-28 15:43:30,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:43:30,479 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2019-11-28 15:43:30,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:43:30,496 INFO L225 Difference]: With dead ends: 528 [2019-11-28 15:43:30,496 INFO L226 Difference]: Without dead ends: 266 [2019-11-28 15:43:30,502 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:43:30,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-11-28 15:43:30,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2019-11-28 15:43:30,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-11-28 15:43:30,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 380 transitions. [2019-11-28 15:43:30,567 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 380 transitions. Word has length 88 [2019-11-28 15:43:30,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:43:30,568 INFO L462 AbstractCegarLoop]: Abstraction has 266 states and 380 transitions. [2019-11-28 15:43:30,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:43:30,569 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 380 transitions. [2019-11-28 15:43:30,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-28 15:43:30,573 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:43:30,573 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:43:30,574 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:43:30,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:43:30,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1648492327, now seen corresponding path program 1 times [2019-11-28 15:43:30,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:43:30,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719730848] [2019-11-28 15:43:30,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:43:30,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:43:30,645 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:43:30,646 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719730848] [2019-11-28 15:43:30,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:43:30,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:43:30,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346544779] [2019-11-28 15:43:30,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 15:43:30,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:43:30,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 15:43:30,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:43:30,653 INFO L87 Difference]: Start difference. First operand 266 states and 380 transitions. Second operand 4 states. [2019-11-28 15:43:31,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:43:31,323 INFO L93 Difference]: Finished difference Result 792 states and 1135 transitions. [2019-11-28 15:43:31,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:43:31,323 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-11-28 15:43:31,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:43:31,328 INFO L225 Difference]: With dead ends: 792 [2019-11-28 15:43:31,328 INFO L226 Difference]: Without dead ends: 528 [2019-11-28 15:43:31,331 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:43:31,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2019-11-28 15:43:31,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528. [2019-11-28 15:43:31,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2019-11-28 15:43:31,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 721 transitions. [2019-11-28 15:43:31,371 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 721 transitions. Word has length 93 [2019-11-28 15:43:31,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:43:31,371 INFO L462 AbstractCegarLoop]: Abstraction has 528 states and 721 transitions. [2019-11-28 15:43:31,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 15:43:31,372 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 721 transitions. [2019-11-28 15:43:31,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-28 15:43:31,381 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:43:31,382 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:43:31,383 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:43:31,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:43:31,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1380296349, now seen corresponding path program 1 times [2019-11-28 15:43:31,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:43:31,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737384562] [2019-11-28 15:43:31,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:43:31,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:43:31,469 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:43:31,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737384562] [2019-11-28 15:43:31,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:43:31,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:43:31,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634912303] [2019-11-28 15:43:31,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 15:43:31,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:43:31,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 15:43:31,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:43:31,472 INFO L87 Difference]: Start difference. First operand 528 states and 721 transitions. Second operand 4 states. [2019-11-28 15:43:32,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:43:32,426 INFO L93 Difference]: Finished difference Result 2102 states and 2876 transitions. [2019-11-28 15:43:32,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 15:43:32,426 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-11-28 15:43:32,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:43:32,435 INFO L225 Difference]: With dead ends: 2102 [2019-11-28 15:43:32,435 INFO L226 Difference]: Without dead ends: 1576 [2019-11-28 15:43:32,436 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:43:32,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2019-11-28 15:43:32,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1576. [2019-11-28 15:43:32,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2019-11-28 15:43:32,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 2049 transitions. [2019-11-28 15:43:32,501 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 2049 transitions. Word has length 97 [2019-11-28 15:43:32,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:43:32,502 INFO L462 AbstractCegarLoop]: Abstraction has 1576 states and 2049 transitions. [2019-11-28 15:43:32,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 15:43:32,502 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 2049 transitions. [2019-11-28 15:43:32,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-28 15:43:32,508 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:43:32,508 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:43:32,508 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:43:32,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:43:32,509 INFO L82 PathProgramCache]: Analyzing trace with hash 406434676, now seen corresponding path program 1 times [2019-11-28 15:43:32,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:43:32,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618815331] [2019-11-28 15:43:32,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:43:32,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:43:32,562 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 15:43:32,564 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618815331] [2019-11-28 15:43:32,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:43:32,565 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:43:32,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900371490] [2019-11-28 15:43:32,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:43:32,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:43:32,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:43:32,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:43:32,568 INFO L87 Difference]: Start difference. First operand 1576 states and 2049 transitions. Second operand 3 states. [2019-11-28 15:43:33,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:43:33,142 INFO L93 Difference]: Finished difference Result 3412 states and 4461 transitions. [2019-11-28 15:43:33,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:43:33,143 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-11-28 15:43:33,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:43:33,153 INFO L225 Difference]: With dead ends: 3412 [2019-11-28 15:43:33,154 INFO L226 Difference]: Without dead ends: 1838 [2019-11-28 15:43:33,157 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:43:33,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2019-11-28 15:43:33,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1314. [2019-11-28 15:43:33,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1314 states. [2019-11-28 15:43:33,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 1702 transitions. [2019-11-28 15:43:33,209 INFO L78 Accepts]: Start accepts. Automaton has 1314 states and 1702 transitions. Word has length 100 [2019-11-28 15:43:33,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:43:33,210 INFO L462 AbstractCegarLoop]: Abstraction has 1314 states and 1702 transitions. [2019-11-28 15:43:33,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:43:33,210 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1702 transitions. [2019-11-28 15:43:33,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-28 15:43:33,214 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:43:33,214 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:43:33,214 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:43:33,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:43:33,215 INFO L82 PathProgramCache]: Analyzing trace with hash 2015967182, now seen corresponding path program 1 times [2019-11-28 15:43:33,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:43:33,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050838816] [2019-11-28 15:43:33,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:43:33,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:43:33,323 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:43:33,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050838816] [2019-11-28 15:43:33,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:43:33,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:43:33,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836402681] [2019-11-28 15:43:33,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 15:43:33,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:43:33,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 15:43:33,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:43:33,326 INFO L87 Difference]: Start difference. First operand 1314 states and 1702 transitions. Second operand 4 states. [2019-11-28 15:43:34,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:43:34,058 INFO L93 Difference]: Finished difference Result 2762 states and 3556 transitions. [2019-11-28 15:43:34,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 15:43:34,059 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-11-28 15:43:34,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:43:34,066 INFO L225 Difference]: With dead ends: 2762 [2019-11-28 15:43:34,067 INFO L226 Difference]: Without dead ends: 1450 [2019-11-28 15:43:34,070 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 15:43:34,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2019-11-28 15:43:34,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 1445. [2019-11-28 15:43:34,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2019-11-28 15:43:34,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1839 transitions. [2019-11-28 15:43:34,105 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1839 transitions. Word has length 103 [2019-11-28 15:43:34,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:43:34,105 INFO L462 AbstractCegarLoop]: Abstraction has 1445 states and 1839 transitions. [2019-11-28 15:43:34,106 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 15:43:34,106 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1839 transitions. [2019-11-28 15:43:34,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-28 15:43:34,109 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:43:34,109 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:43:34,109 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:43:34,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:43:34,110 INFO L82 PathProgramCache]: Analyzing trace with hash 2265750, now seen corresponding path program 1 times [2019-11-28 15:43:34,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:43:34,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076981605] [2019-11-28 15:43:34,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:43:34,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:43:34,196 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:43:34,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076981605] [2019-11-28 15:43:34,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:43:34,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 15:43:34,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947622620] [2019-11-28 15:43:34,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 15:43:34,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:43:34,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 15:43:34,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-28 15:43:34,200 INFO L87 Difference]: Start difference. First operand 1445 states and 1839 transitions. Second operand 5 states. [2019-11-28 15:43:35,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:43:35,198 INFO L93 Difference]: Finished difference Result 2757 states and 3539 transitions. [2019-11-28 15:43:35,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 15:43:35,199 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 107 [2019-11-28 15:43:35,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:43:35,206 INFO L225 Difference]: With dead ends: 2757 [2019-11-28 15:43:35,206 INFO L226 Difference]: Without dead ends: 1445 [2019-11-28 15:43:35,209 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-28 15:43:35,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2019-11-28 15:43:35,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1445. [2019-11-28 15:43:35,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2019-11-28 15:43:35,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1809 transitions. [2019-11-28 15:43:35,239 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1809 transitions. Word has length 107 [2019-11-28 15:43:35,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:43:35,239 INFO L462 AbstractCegarLoop]: Abstraction has 1445 states and 1809 transitions. [2019-11-28 15:43:35,239 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 15:43:35,239 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1809 transitions. [2019-11-28 15:43:35,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-11-28 15:43:35,242 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:43:35,242 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:43:35,242 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:43:35,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:43:35,243 INFO L82 PathProgramCache]: Analyzing trace with hash 68334944, now seen corresponding path program 1 times [2019-11-28 15:43:35,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:43:35,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860735279] [2019-11-28 15:43:35,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:43:35,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:43:35,299 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-28 15:43:35,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860735279] [2019-11-28 15:43:35,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:43:35,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:43:35,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909027506] [2019-11-28 15:43:35,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:43:35,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:43:35,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:43:35,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:43:35,302 INFO L87 Difference]: Start difference. First operand 1445 states and 1809 transitions. Second operand 3 states. [2019-11-28 15:43:35,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:43:35,786 INFO L93 Difference]: Finished difference Result 2757 states and 3479 transitions. [2019-11-28 15:43:35,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:43:35,787 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2019-11-28 15:43:35,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:43:35,794 INFO L225 Difference]: With dead ends: 2757 [2019-11-28 15:43:35,794 INFO L226 Difference]: Without dead ends: 1445 [2019-11-28 15:43:35,796 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:43:35,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2019-11-28 15:43:35,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1445. [2019-11-28 15:43:35,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2019-11-28 15:43:35,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1803 transitions. [2019-11-28 15:43:35,831 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1803 transitions. Word has length 108 [2019-11-28 15:43:35,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:43:35,831 INFO L462 AbstractCegarLoop]: Abstraction has 1445 states and 1803 transitions. [2019-11-28 15:43:35,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:43:35,832 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1803 transitions. [2019-11-28 15:43:35,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-11-28 15:43:35,835 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:43:35,835 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:43:35,835 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:43:35,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:43:35,836 INFO L82 PathProgramCache]: Analyzing trace with hash -69619749, now seen corresponding path program 1 times [2019-11-28 15:43:35,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:43:35,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428525765] [2019-11-28 15:43:35,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:43:35,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:43:35,893 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:43:35,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428525765] [2019-11-28 15:43:35,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:43:35,894 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:43:35,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57922734] [2019-11-28 15:43:35,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:43:35,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:43:35,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:43:35,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:43:35,896 INFO L87 Difference]: Start difference. First operand 1445 states and 1803 transitions. Second operand 3 states. [2019-11-28 15:43:36,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:43:36,484 INFO L93 Difference]: Finished difference Result 3150 states and 3946 transitions. [2019-11-28 15:43:36,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:43:36,484 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 110 [2019-11-28 15:43:36,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:43:36,492 INFO L225 Difference]: With dead ends: 3150 [2019-11-28 15:43:36,492 INFO L226 Difference]: Without dead ends: 1707 [2019-11-28 15:43:36,495 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:43:36,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2019-11-28 15:43:36,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1576. [2019-11-28 15:43:36,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2019-11-28 15:43:36,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1741 transitions. [2019-11-28 15:43:36,530 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 1741 transitions. Word has length 110 [2019-11-28 15:43:36,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:43:36,531 INFO L462 AbstractCegarLoop]: Abstraction has 1576 states and 1741 transitions. [2019-11-28 15:43:36,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:43:36,531 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1741 transitions. [2019-11-28 15:43:36,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-11-28 15:43:36,534 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:43:36,535 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:43:36,535 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:43:36,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:43:36,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1256717015, now seen corresponding path program 1 times [2019-11-28 15:43:36,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:43:36,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997779972] [2019-11-28 15:43:36,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:43:36,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:43:36,639 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:43:36,640 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997779972] [2019-11-28 15:43:36,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:43:36,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 15:43:36,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906316775] [2019-11-28 15:43:36,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 15:43:36,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:43:36,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 15:43:36,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:43:36,642 INFO L87 Difference]: Start difference. First operand 1576 states and 1741 transitions. Second operand 4 states. [2019-11-28 15:43:37,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:43:37,417 INFO L93 Difference]: Finished difference Result 3150 states and 3502 transitions. [2019-11-28 15:43:37,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 15:43:37,418 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 125 [2019-11-28 15:43:37,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:43:37,425 INFO L225 Difference]: With dead ends: 3150 [2019-11-28 15:43:37,425 INFO L226 Difference]: Without dead ends: 1707 [2019-11-28 15:43:37,427 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:43:37,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2019-11-28 15:43:37,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1445. [2019-11-28 15:43:37,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2019-11-28 15:43:37,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1545 transitions. [2019-11-28 15:43:37,453 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1545 transitions. Word has length 125 [2019-11-28 15:43:37,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:43:37,454 INFO L462 AbstractCegarLoop]: Abstraction has 1445 states and 1545 transitions. [2019-11-28 15:43:37,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 15:43:37,454 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1545 transitions. [2019-11-28 15:43:37,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-11-28 15:43:37,457 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:43:37,457 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:43:37,458 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:43:37,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:43:37,458 INFO L82 PathProgramCache]: Analyzing trace with hash 144240950, now seen corresponding path program 1 times [2019-11-28 15:43:37,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:43:37,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835761903] [2019-11-28 15:43:37,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:43:37,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:43:38,191 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:43:38,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835761903] [2019-11-28 15:43:38,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:43:38,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-28 15:43:38,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149344738] [2019-11-28 15:43:38,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-28 15:43:38,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:43:38,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-28 15:43:38,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=90, Unknown=0, NotChecked=0, Total=156 [2019-11-28 15:43:38,194 INFO L87 Difference]: Start difference. First operand 1445 states and 1545 transitions. Second operand 13 states. [2019-11-28 15:43:40,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:43:40,017 INFO L93 Difference]: Finished difference Result 3936 states and 4248 transitions. [2019-11-28 15:43:40,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-28 15:43:40,021 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 138 [2019-11-28 15:43:40,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:43:40,035 INFO L225 Difference]: With dead ends: 3936 [2019-11-28 15:43:40,036 INFO L226 Difference]: Without dead ends: 2624 [2019-11-28 15:43:40,039 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=149, Invalid=193, Unknown=0, NotChecked=0, Total=342 [2019-11-28 15:43:40,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2624 states. [2019-11-28 15:43:40,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2624 to 1771. [2019-11-28 15:43:40,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1771 states. [2019-11-28 15:43:40,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1771 states to 1771 states and 1899 transitions. [2019-11-28 15:43:40,083 INFO L78 Accepts]: Start accepts. Automaton has 1771 states and 1899 transitions. Word has length 138 [2019-11-28 15:43:40,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:43:40,086 INFO L462 AbstractCegarLoop]: Abstraction has 1771 states and 1899 transitions. [2019-11-28 15:43:40,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-28 15:43:40,086 INFO L276 IsEmpty]: Start isEmpty. Operand 1771 states and 1899 transitions. [2019-11-28 15:43:40,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-11-28 15:43:40,091 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:43:40,091 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:43:40,092 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:43:40,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:43:40,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1039496222, now seen corresponding path program 1 times [2019-11-28 15:43:40,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:43:40,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390993151] [2019-11-28 15:43:40,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:43:40,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:43:40,257 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-11-28 15:43:40,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390993151] [2019-11-28 15:43:40,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:43:40,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 15:43:40,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430657369] [2019-11-28 15:43:40,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 15:43:40,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:43:40,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 15:43:40,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:43:40,261 INFO L87 Difference]: Start difference. First operand 1771 states and 1899 transitions. Second operand 4 states. [2019-11-28 15:43:41,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:43:41,067 INFO L93 Difference]: Finished difference Result 3671 states and 3960 transitions. [2019-11-28 15:43:41,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 15:43:41,068 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 181 [2019-11-28 15:43:41,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:43:41,076 INFO L225 Difference]: With dead ends: 3671 [2019-11-28 15:43:41,076 INFO L226 Difference]: Without dead ends: 1902 [2019-11-28 15:43:41,079 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:43:41,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1902 states. [2019-11-28 15:43:41,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1902 to 1771. [2019-11-28 15:43:41,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1771 states. [2019-11-28 15:43:41,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1771 states to 1771 states and 1876 transitions. [2019-11-28 15:43:41,111 INFO L78 Accepts]: Start accepts. Automaton has 1771 states and 1876 transitions. Word has length 181 [2019-11-28 15:43:41,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:43:41,111 INFO L462 AbstractCegarLoop]: Abstraction has 1771 states and 1876 transitions. [2019-11-28 15:43:41,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 15:43:41,111 INFO L276 IsEmpty]: Start isEmpty. Operand 1771 states and 1876 transitions. [2019-11-28 15:43:41,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-11-28 15:43:41,116 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:43:41,117 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:43:41,117 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:43:41,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:43:41,117 INFO L82 PathProgramCache]: Analyzing trace with hash 293882658, now seen corresponding path program 1 times [2019-11-28 15:43:41,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:43:41,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478071076] [2019-11-28 15:43:41,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:43:41,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:43:41,277 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-11-28 15:43:41,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478071076] [2019-11-28 15:43:41,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:43:41,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 15:43:41,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637692918] [2019-11-28 15:43:41,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 15:43:41,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:43:41,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 15:43:41,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:43:41,280 INFO L87 Difference]: Start difference. First operand 1771 states and 1876 transitions. Second operand 4 states. [2019-11-28 15:43:42,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:43:42,081 INFO L93 Difference]: Finished difference Result 4652 states and 4929 transitions. [2019-11-28 15:43:42,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 15:43:42,082 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 230 [2019-11-28 15:43:42,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:43:42,095 INFO L225 Difference]: With dead ends: 4652 [2019-11-28 15:43:42,095 INFO L226 Difference]: Without dead ends: 2883 [2019-11-28 15:43:42,098 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:43:42,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2883 states. [2019-11-28 15:43:42,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2883 to 2295. [2019-11-28 15:43:42,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2295 states. [2019-11-28 15:43:42,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2295 states to 2295 states and 2406 transitions. [2019-11-28 15:43:42,153 INFO L78 Accepts]: Start accepts. Automaton has 2295 states and 2406 transitions. Word has length 230 [2019-11-28 15:43:42,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:43:42,154 INFO L462 AbstractCegarLoop]: Abstraction has 2295 states and 2406 transitions. [2019-11-28 15:43:42,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 15:43:42,154 INFO L276 IsEmpty]: Start isEmpty. Operand 2295 states and 2406 transitions. [2019-11-28 15:43:42,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-11-28 15:43:42,164 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:43:42,164 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:43:42,165 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:43:42,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:43:42,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1503326134, now seen corresponding path program 1 times [2019-11-28 15:43:42,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:43:42,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671104965] [2019-11-28 15:43:42,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:43:42,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:43:42,437 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2019-11-28 15:43:42,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671104965] [2019-11-28 15:43:42,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:43:42,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 15:43:42,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47339260] [2019-11-28 15:43:42,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 15:43:42,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:43:42,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 15:43:42,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:43:42,441 INFO L87 Difference]: Start difference. First operand 2295 states and 2406 transitions. Second operand 4 states. [2019-11-28 15:43:43,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:43:43,279 INFO L93 Difference]: Finished difference Result 5110 states and 5357 transitions. [2019-11-28 15:43:43,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 15:43:43,280 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 233 [2019-11-28 15:43:43,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:43:43,281 INFO L225 Difference]: With dead ends: 5110 [2019-11-28 15:43:43,281 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 15:43:43,285 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:43:43,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 15:43:43,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 15:43:43,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 15:43:43,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 15:43:43,286 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 233 [2019-11-28 15:43:43,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:43:43,286 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 15:43:43,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 15:43:43,286 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 15:43:43,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 15:43:43,289 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 15:43:44,019 WARN L192 SmtUtils]: Spent 574.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 52 [2019-11-28 15:43:44,616 WARN L192 SmtUtils]: Spent 593.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 52 [2019-11-28 15:43:44,623 INFO L246 CegarLoopResult]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-28 15:43:44,624 INFO L246 CegarLoopResult]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-28 15:43:44,624 INFO L246 CegarLoopResult]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,625 INFO L246 CegarLoopResult]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,625 INFO L246 CegarLoopResult]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,625 INFO L246 CegarLoopResult]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,625 INFO L246 CegarLoopResult]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,626 INFO L246 CegarLoopResult]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,626 INFO L246 CegarLoopResult]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-28 15:43:44,626 INFO L246 CegarLoopResult]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-28 15:43:44,626 INFO L246 CegarLoopResult]: For program point L566(line 566) no Hoare annotation was computed. [2019-11-28 15:43:44,627 INFO L246 CegarLoopResult]: For program point L533(line 533) no Hoare annotation was computed. [2019-11-28 15:43:44,627 INFO L246 CegarLoopResult]: For program point L500(line 500) no Hoare annotation was computed. [2019-11-28 15:43:44,627 INFO L246 CegarLoopResult]: For program point L467(line 467) no Hoare annotation was computed. [2019-11-28 15:43:44,627 INFO L246 CegarLoopResult]: For program point L434(line 434) no Hoare annotation was computed. [2019-11-28 15:43:44,627 INFO L246 CegarLoopResult]: For program point L401(line 401) no Hoare annotation was computed. [2019-11-28 15:43:44,627 INFO L246 CegarLoopResult]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-28 15:43:44,627 INFO L246 CegarLoopResult]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-28 15:43:44,627 INFO L246 CegarLoopResult]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,627 INFO L246 CegarLoopResult]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,627 INFO L246 CegarLoopResult]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,627 INFO L246 CegarLoopResult]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,628 INFO L246 CegarLoopResult]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,628 INFO L246 CegarLoopResult]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,628 INFO L246 CegarLoopResult]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-28 15:43:44,628 INFO L246 CegarLoopResult]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-28 15:43:44,628 INFO L246 CegarLoopResult]: For program point L569(line 569) no Hoare annotation was computed. [2019-11-28 15:43:44,628 INFO L246 CegarLoopResult]: For program point L536(line 536) no Hoare annotation was computed. [2019-11-28 15:43:44,628 INFO L246 CegarLoopResult]: For program point L503(line 503) no Hoare annotation was computed. [2019-11-28 15:43:44,629 INFO L246 CegarLoopResult]: For program point L470(line 470) no Hoare annotation was computed. [2019-11-28 15:43:44,629 INFO L246 CegarLoopResult]: For program point L437(line 437) no Hoare annotation was computed. [2019-11-28 15:43:44,629 INFO L246 CegarLoopResult]: For program point L404(line 404) no Hoare annotation was computed. [2019-11-28 15:43:44,629 INFO L246 CegarLoopResult]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-28 15:43:44,629 INFO L246 CegarLoopResult]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-28 15:43:44,629 INFO L246 CegarLoopResult]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-28 15:43:44,629 INFO L246 CegarLoopResult]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-28 15:43:44,630 INFO L246 CegarLoopResult]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-28 15:43:44,630 INFO L246 CegarLoopResult]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-28 15:43:44,630 INFO L246 CegarLoopResult]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2019-11-28 15:43:44,630 INFO L246 CegarLoopResult]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,630 INFO L246 CegarLoopResult]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,630 INFO L246 CegarLoopResult]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,630 INFO L246 CegarLoopResult]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,630 INFO L246 CegarLoopResult]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,630 INFO L246 CegarLoopResult]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-28 15:43:44,630 INFO L246 CegarLoopResult]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-28 15:43:44,630 INFO L246 CegarLoopResult]: For program point L572(line 572) no Hoare annotation was computed. [2019-11-28 15:43:44,631 INFO L246 CegarLoopResult]: For program point L539(line 539) no Hoare annotation was computed. [2019-11-28 15:43:44,631 INFO L246 CegarLoopResult]: For program point L506(line 506) no Hoare annotation was computed. [2019-11-28 15:43:44,631 INFO L246 CegarLoopResult]: For program point L473(line 473) no Hoare annotation was computed. [2019-11-28 15:43:44,631 INFO L246 CegarLoopResult]: For program point L440(line 440) no Hoare annotation was computed. [2019-11-28 15:43:44,631 INFO L246 CegarLoopResult]: For program point L407(line 407) no Hoare annotation was computed. [2019-11-28 15:43:44,631 INFO L246 CegarLoopResult]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-28 15:43:44,632 INFO L242 CegarLoopResult]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse4 (= ~a16~0 6)) (.cse9 (= 1 ~a7~0)) (.cse3 (= 15 ~a8~0)) (.cse6 (= ~a17~0 1)) (.cse13 (= ~a16~0 5))) (let ((.cse10 (not .cse13)) (.cse11 (<= ~a20~0 0)) (.cse8 (not .cse6)) (.cse5 (not .cse3)) (.cse15 (not (= ~a20~0 1))) (.cse1 (not .cse9)) (.cse0 (= ~a12~0 8)) (.cse14 (not .cse4)) (.cse12 (= 14 ~a8~0)) (.cse7 (= ~a16~0 4)) (.cse16 (<= ~a17~0 0)) (.cse2 (= ~a21~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse2 .cse4) (and .cse7 .cse5 .cse2 .cse8) (and .cse9 .cse5 .cse10) (and .cse2 .cse11 .cse12 .cse13) (and .cse14 .cse6 .cse2 .cse10) (and .cse6 .cse2 .cse4 .cse11) (and .cse9 .cse2 .cse11 .cse13) (and .cse15 .cse7 .cse2 .cse8) (and .cse9 .cse5 .cse6) (and .cse7 .cse0 .cse16 .cse2) (and .cse15 .cse0 .cse2 .cse3 .cse4) (and .cse1 .cse0 .cse2 .cse3 .cse13) (and .cse9 .cse14 .cse6 .cse2) (and .cse9 .cse2 .cse12) (and .cse9 .cse7 .cse16 .cse2)))) [2019-11-28 15:43:44,632 INFO L246 CegarLoopResult]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,632 INFO L246 CegarLoopResult]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,632 INFO L246 CegarLoopResult]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,632 INFO L246 CegarLoopResult]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,632 INFO L246 CegarLoopResult]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,632 INFO L246 CegarLoopResult]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-28 15:43:44,633 INFO L246 CegarLoopResult]: For program point L542(line 542) no Hoare annotation was computed. [2019-11-28 15:43:44,633 INFO L246 CegarLoopResult]: For program point L509(line 509) no Hoare annotation was computed. [2019-11-28 15:43:44,633 INFO L246 CegarLoopResult]: For program point L476(line 476) no Hoare annotation was computed. [2019-11-28 15:43:44,633 INFO L246 CegarLoopResult]: For program point L443(line 443) no Hoare annotation was computed. [2019-11-28 15:43:44,633 INFO L246 CegarLoopResult]: For program point L410(line 410) no Hoare annotation was computed. [2019-11-28 15:43:44,633 INFO L246 CegarLoopResult]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-28 15:43:44,633 INFO L246 CegarLoopResult]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-28 15:43:44,633 INFO L246 CegarLoopResult]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-28 15:43:44,633 INFO L246 CegarLoopResult]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-28 15:43:44,634 INFO L246 CegarLoopResult]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-28 15:43:44,634 INFO L246 CegarLoopResult]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-28 15:43:44,634 INFO L246 CegarLoopResult]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-28 15:43:44,634 INFO L249 CegarLoopResult]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-28 15:43:44,634 INFO L246 CegarLoopResult]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,634 INFO L246 CegarLoopResult]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,634 INFO L246 CegarLoopResult]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,634 INFO L246 CegarLoopResult]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,635 INFO L246 CegarLoopResult]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,635 INFO L246 CegarLoopResult]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-28 15:43:44,635 INFO L246 CegarLoopResult]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-28 15:43:44,635 INFO L246 CegarLoopResult]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-28 15:43:44,635 INFO L246 CegarLoopResult]: For program point L545(line 545) no Hoare annotation was computed. [2019-11-28 15:43:44,635 INFO L246 CegarLoopResult]: For program point L512(line 512) no Hoare annotation was computed. [2019-11-28 15:43:44,635 INFO L246 CegarLoopResult]: For program point L479(line 479) no Hoare annotation was computed. [2019-11-28 15:43:44,635 INFO L246 CegarLoopResult]: For program point L446(line 446) no Hoare annotation was computed. [2019-11-28 15:43:44,635 INFO L246 CegarLoopResult]: For program point L413(line 413) no Hoare annotation was computed. [2019-11-28 15:43:44,636 INFO L246 CegarLoopResult]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-28 15:43:44,636 INFO L246 CegarLoopResult]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,636 INFO L246 CegarLoopResult]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,636 INFO L246 CegarLoopResult]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,636 INFO L246 CegarLoopResult]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,636 INFO L246 CegarLoopResult]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-28 15:43:44,636 INFO L246 CegarLoopResult]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,636 INFO L246 CegarLoopResult]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-28 15:43:44,636 INFO L246 CegarLoopResult]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-28 15:43:44,636 INFO L246 CegarLoopResult]: For program point L548(line 548) no Hoare annotation was computed. [2019-11-28 15:43:44,636 INFO L246 CegarLoopResult]: For program point L515(line 515) no Hoare annotation was computed. [2019-11-28 15:43:44,637 INFO L246 CegarLoopResult]: For program point L482(line 482) no Hoare annotation was computed. [2019-11-28 15:43:44,637 INFO L246 CegarLoopResult]: For program point L449(line 449) no Hoare annotation was computed. [2019-11-28 15:43:44,637 INFO L246 CegarLoopResult]: For program point L416(line 416) no Hoare annotation was computed. [2019-11-28 15:43:44,637 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 15:43:44,637 INFO L246 CegarLoopResult]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-28 15:43:44,637 INFO L246 CegarLoopResult]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-28 15:43:44,637 INFO L246 CegarLoopResult]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-28 15:43:44,637 INFO L246 CegarLoopResult]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-28 15:43:44,637 INFO L246 CegarLoopResult]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-28 15:43:44,637 INFO L246 CegarLoopResult]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-28 15:43:44,637 INFO L246 CegarLoopResult]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,638 INFO L242 CegarLoopResult]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse4 (= ~a16~0 6)) (.cse9 (= 1 ~a7~0)) (.cse3 (= 15 ~a8~0)) (.cse6 (= ~a17~0 1)) (.cse13 (= ~a16~0 5))) (let ((.cse10 (not .cse13)) (.cse11 (<= ~a20~0 0)) (.cse8 (not .cse6)) (.cse5 (not .cse3)) (.cse15 (not (= ~a20~0 1))) (.cse1 (not .cse9)) (.cse0 (= ~a12~0 8)) (.cse14 (not .cse4)) (.cse12 (= 14 ~a8~0)) (.cse7 (= ~a16~0 4)) (.cse16 (<= ~a17~0 0)) (.cse2 (= ~a21~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse2 .cse4) (and .cse7 .cse5 .cse2 .cse8) (and .cse9 .cse5 .cse10) (and .cse2 .cse11 .cse12 .cse13) (and .cse14 .cse6 .cse2 .cse10) (and .cse6 .cse2 .cse4 .cse11) (and .cse9 .cse2 .cse11 .cse13) (and .cse15 .cse7 .cse2 .cse8) (and .cse9 .cse5 .cse6) (and .cse7 .cse0 .cse16 .cse2) (and .cse15 .cse0 .cse2 .cse3 .cse4) (and .cse1 .cse0 .cse2 .cse3 .cse13) (and .cse9 .cse14 .cse6 .cse2) (and .cse9 .cse2 .cse12) (and .cse9 .cse7 .cse16 .cse2)))) [2019-11-28 15:43:44,638 INFO L246 CegarLoopResult]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,638 INFO L246 CegarLoopResult]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,638 INFO L246 CegarLoopResult]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,638 INFO L246 CegarLoopResult]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,638 INFO L246 CegarLoopResult]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-28 15:43:44,638 INFO L246 CegarLoopResult]: For program point L551(line 551) no Hoare annotation was computed. [2019-11-28 15:43:44,639 INFO L246 CegarLoopResult]: For program point L518(line 518) no Hoare annotation was computed. [2019-11-28 15:43:44,639 INFO L246 CegarLoopResult]: For program point L485(line 485) no Hoare annotation was computed. [2019-11-28 15:43:44,639 INFO L246 CegarLoopResult]: For program point L452(line 452) no Hoare annotation was computed. [2019-11-28 15:43:44,639 INFO L246 CegarLoopResult]: For program point L419(line 419) no Hoare annotation was computed. [2019-11-28 15:43:44,639 INFO L246 CegarLoopResult]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-28 15:43:44,639 INFO L246 CegarLoopResult]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-28 15:43:44,639 INFO L246 CegarLoopResult]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,639 INFO L246 CegarLoopResult]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,639 INFO L246 CegarLoopResult]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,640 INFO L246 CegarLoopResult]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,640 INFO L246 CegarLoopResult]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,640 INFO L246 CegarLoopResult]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-28 15:43:44,640 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 15:43:44,640 INFO L246 CegarLoopResult]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-28 15:43:44,640 INFO L246 CegarLoopResult]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-28 15:43:44,640 INFO L246 CegarLoopResult]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-28 15:43:44,640 INFO L246 CegarLoopResult]: For program point L554(line 554) no Hoare annotation was computed. [2019-11-28 15:43:44,640 INFO L246 CegarLoopResult]: For program point L521(line 521) no Hoare annotation was computed. [2019-11-28 15:43:44,641 INFO L246 CegarLoopResult]: For program point L488(line 488) no Hoare annotation was computed. [2019-11-28 15:43:44,641 INFO L246 CegarLoopResult]: For program point L455(line 455) no Hoare annotation was computed. [2019-11-28 15:43:44,641 INFO L246 CegarLoopResult]: For program point L422(line 422) no Hoare annotation was computed. [2019-11-28 15:43:44,641 INFO L246 CegarLoopResult]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-28 15:43:44,641 INFO L246 CegarLoopResult]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-28 15:43:44,641 INFO L246 CegarLoopResult]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-28 15:43:44,641 INFO L246 CegarLoopResult]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,641 INFO L246 CegarLoopResult]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,641 INFO L246 CegarLoopResult]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,642 INFO L246 CegarLoopResult]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,642 INFO L246 CegarLoopResult]: For program point L391(lines 391 393) no Hoare annotation was computed. [2019-11-28 15:43:44,642 INFO L246 CegarLoopResult]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,642 INFO L246 CegarLoopResult]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,642 INFO L246 CegarLoopResult]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-28 15:43:44,642 INFO L246 CegarLoopResult]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-28 15:43:44,642 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 15:43:44,642 INFO L246 CegarLoopResult]: For program point L557(line 557) no Hoare annotation was computed. [2019-11-28 15:43:44,642 INFO L246 CegarLoopResult]: For program point L524(line 524) no Hoare annotation was computed. [2019-11-28 15:43:44,642 INFO L246 CegarLoopResult]: For program point L491(line 491) no Hoare annotation was computed. [2019-11-28 15:43:44,643 INFO L246 CegarLoopResult]: For program point L458(line 458) no Hoare annotation was computed. [2019-11-28 15:43:44,643 INFO L246 CegarLoopResult]: For program point L425(line 425) no Hoare annotation was computed. [2019-11-28 15:43:44,643 INFO L246 CegarLoopResult]: For program point L392(line 392) no Hoare annotation was computed. [2019-11-28 15:43:44,643 INFO L246 CegarLoopResult]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-28 15:43:44,643 INFO L246 CegarLoopResult]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-28 15:43:44,643 INFO L246 CegarLoopResult]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-28 15:43:44,643 INFO L246 CegarLoopResult]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-28 15:43:44,643 INFO L246 CegarLoopResult]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,643 INFO L246 CegarLoopResult]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,644 INFO L246 CegarLoopResult]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,644 INFO L246 CegarLoopResult]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,644 INFO L246 CegarLoopResult]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,644 INFO L246 CegarLoopResult]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-28 15:43:44,644 INFO L246 CegarLoopResult]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,644 INFO L246 CegarLoopResult]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-28 15:43:44,644 INFO L246 CegarLoopResult]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-28 15:43:44,644 INFO L246 CegarLoopResult]: For program point L560(line 560) no Hoare annotation was computed. [2019-11-28 15:43:44,644 INFO L246 CegarLoopResult]: For program point L527(line 527) no Hoare annotation was computed. [2019-11-28 15:43:44,644 INFO L246 CegarLoopResult]: For program point L494(line 494) no Hoare annotation was computed. [2019-11-28 15:43:44,645 INFO L246 CegarLoopResult]: For program point L461(line 461) no Hoare annotation was computed. [2019-11-28 15:43:44,645 INFO L246 CegarLoopResult]: For program point L428(line 428) no Hoare annotation was computed. [2019-11-28 15:43:44,645 INFO L246 CegarLoopResult]: For program point L395(line 395) no Hoare annotation was computed. [2019-11-28 15:43:44,645 INFO L246 CegarLoopResult]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-28 15:43:44,645 INFO L246 CegarLoopResult]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-28 15:43:44,645 INFO L246 CegarLoopResult]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-28 15:43:44,645 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-28 15:43:44,645 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 440) no Hoare annotation was computed. [2019-11-28 15:43:44,646 INFO L246 CegarLoopResult]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-28 15:43:44,646 INFO L246 CegarLoopResult]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-28 15:43:44,646 INFO L246 CegarLoopResult]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-28 15:43:44,646 INFO L246 CegarLoopResult]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,646 INFO L246 CegarLoopResult]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,646 INFO L246 CegarLoopResult]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,646 INFO L246 CegarLoopResult]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,646 INFO L246 CegarLoopResult]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,646 INFO L246 CegarLoopResult]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,647 INFO L246 CegarLoopResult]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-28 15:43:44,647 INFO L246 CegarLoopResult]: For program point L563(line 563) no Hoare annotation was computed. [2019-11-28 15:43:44,647 INFO L246 CegarLoopResult]: For program point L530(line 530) no Hoare annotation was computed. [2019-11-28 15:43:44,647 INFO L246 CegarLoopResult]: For program point L497(line 497) no Hoare annotation was computed. [2019-11-28 15:43:44,647 INFO L246 CegarLoopResult]: For program point L464(line 464) no Hoare annotation was computed. [2019-11-28 15:43:44,647 INFO L246 CegarLoopResult]: For program point L431(line 431) no Hoare annotation was computed. [2019-11-28 15:43:44,647 INFO L246 CegarLoopResult]: For program point L398(line 398) no Hoare annotation was computed. [2019-11-28 15:43:44,647 INFO L246 CegarLoopResult]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-28 15:43:44,647 INFO L246 CegarLoopResult]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-28 15:43:44,647 INFO L246 CegarLoopResult]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-28 15:43:44,677 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 03:43:44 BoogieIcfgContainer [2019-11-28 15:43:44,677 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 15:43:44,678 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 15:43:44,678 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 15:43:44,678 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 15:43:44,679 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:43:28" (3/4) ... [2019-11-28 15:43:44,682 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 15:43:44,709 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-28 15:43:44,711 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 15:43:44,888 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 15:43:44,889 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 15:43:44,890 INFO L168 Benchmark]: Toolchain (without parser) took 18493.05 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 418.9 MB). Free memory was 951.0 MB in the beginning and 865.1 MB in the end (delta: 85.8 MB). Peak memory consumption was 504.7 MB. Max. memory is 11.5 GB. [2019-11-28 15:43:44,890 INFO L168 Benchmark]: CDTParser took 0.37 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 15:43:44,891 INFO L168 Benchmark]: CACSL2BoogieTranslator took 866.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -154.9 MB). Peak memory consumption was 21.3 MB. Max. memory is 11.5 GB. [2019-11-28 15:43:44,891 INFO L168 Benchmark]: Boogie Procedure Inliner took 139.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 15:43:44,892 INFO L168 Benchmark]: Boogie Preprocessor took 98.89 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 15:43:44,892 INFO L168 Benchmark]: RCFGBuilder took 1378.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 988.7 MB in the end (delta: 110.5 MB). Peak memory consumption was 110.5 MB. Max. memory is 11.5 GB. [2019-11-28 15:43:44,892 INFO L168 Benchmark]: TraceAbstraction took 15792.69 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 280.5 MB). Free memory was 988.7 MB in the beginning and 877.0 MB in the end (delta: 111.8 MB). Peak memory consumption was 392.3 MB. Max. memory is 11.5 GB. [2019-11-28 15:43:44,893 INFO L168 Benchmark]: Witness Printer took 210.68 ms. Allocated memory is still 1.4 GB. Free memory was 877.0 MB in the beginning and 865.1 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. [2019-11-28 15:43:44,895 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.37 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 866.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -154.9 MB). Peak memory consumption was 21.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 139.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 98.89 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1378.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 988.7 MB in the end (delta: 110.5 MB). Peak memory consumption was 110.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 15792.69 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 280.5 MB). Free memory was 988.7 MB in the beginning and 877.0 MB in the end (delta: 111.8 MB). Peak memory consumption was 392.3 MB. Max. memory is 11.5 GB. * Witness Printer took 210.68 ms. Allocated memory is still 1.4 GB. Free memory was 877.0 MB in the beginning and 865.1 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 440]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((((((((((((((((((a12 == 8 && !(1 == a7)) && a21 == 1) && 15 == a8) && a16 == 6) || (((!(15 == a8) && a17 == 1) && a21 == 1) && a16 == 6)) || (((a16 == 4 && !(15 == a8)) && a21 == 1) && !(a17 == 1))) || ((1 == a7 && !(15 == a8)) && !(a16 == 5))) || (((a21 == 1 && a20 <= 0) && 14 == a8) && a16 == 5)) || (((!(a16 == 6) && a17 == 1) && a21 == 1) && !(a16 == 5))) || (((a17 == 1 && a21 == 1) && a16 == 6) && a20 <= 0)) || (((1 == a7 && a21 == 1) && a20 <= 0) && a16 == 5)) || (((!(a20 == 1) && a16 == 4) && a21 == 1) && !(a17 == 1))) || ((1 == a7 && !(15 == a8)) && a17 == 1)) || (((a16 == 4 && a12 == 8) && a17 <= 0) && a21 == 1)) || ((((!(a20 == 1) && a12 == 8) && a21 == 1) && 15 == a8) && a16 == 6)) || ((((!(1 == a7) && a12 == 8) && a21 == 1) && 15 == a8) && a16 == 5)) || (((1 == a7 && !(a16 == 6)) && a17 == 1) && a21 == 1)) || ((1 == a7 && a21 == 1) && 14 == a8)) || (((1 == a7 && a16 == 4) && a17 <= 0) && a21 == 1) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((((((((((((((((a12 == 8 && !(1 == a7)) && a21 == 1) && 15 == a8) && a16 == 6) || (((!(15 == a8) && a17 == 1) && a21 == 1) && a16 == 6)) || (((a16 == 4 && !(15 == a8)) && a21 == 1) && !(a17 == 1))) || ((1 == a7 && !(15 == a8)) && !(a16 == 5))) || (((a21 == 1 && a20 <= 0) && 14 == a8) && a16 == 5)) || (((!(a16 == 6) && a17 == 1) && a21 == 1) && !(a16 == 5))) || (((a17 == 1 && a21 == 1) && a16 == 6) && a20 <= 0)) || (((1 == a7 && a21 == 1) && a20 <= 0) && a16 == 5)) || (((!(a20 == 1) && a16 == 4) && a21 == 1) && !(a17 == 1))) || ((1 == a7 && !(15 == a8)) && a17 == 1)) || (((a16 == 4 && a12 == 8) && a17 <= 0) && a21 == 1)) || ((((!(a20 == 1) && a12 == 8) && a21 == 1) && 15 == a8) && a16 == 6)) || ((((!(1 == a7) && a12 == 8) && a21 == 1) && 15 == a8) && a16 == 5)) || (((1 == a7 && !(a16 == 6)) && a17 == 1) && a21 == 1)) || ((1 == a7 && a21 == 1) && 14 == a8)) || (((1 == a7 && a16 == 4) && a17 <= 0) && a21 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. Result: SAFE, OverallTime: 14.3s, OverallIterations: 13, TraceHistogramMax: 6, AutomataDifference: 11.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.3s, HoareTripleCheckerStatistics: 1188 SDtfs, 3694 SDslu, 158 SDs, 0 SdLazy, 7286 SolverSat, 949 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 23 SyntacticMatches, 5 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2295occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 13 MinimizatonAttempts, 2494 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 57 NumberOfFragments, 447 HoareAnnotationTreeSize, 3 FomulaSimplifications, 4667 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 1518 FormulaSimplificationTreeSizeReductionInter, 1.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 1713 NumberOfCodeBlocks, 1713 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1700 ConstructedInterpolants, 0 QuantifiedInterpolants, 913999 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 945/945 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...