./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem01_label39.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 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_label39.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 1c284ff92946706c13208d48054fb31055fe2d01 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-19 20:52:52,928 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 20:52:52,931 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 20:52:52,950 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 20:52:52,950 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 20:52:52,953 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 20:52:52,955 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 20:52:52,968 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 20:52:52,971 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 20:52:52,974 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 20:52:52,975 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 20:52:52,978 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 20:52:52,978 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 20:52:52,982 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 20:52:52,985 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 20:52:52,987 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 20:52:52,991 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 20:52:52,993 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 20:52:52,996 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 20:52:53,000 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 20:52:53,002 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 20:52:53,003 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 20:52:53,004 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 20:52:53,005 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 20:52:53,008 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 20:52:53,008 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 20:52:53,009 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 20:52:53,010 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 20:52:53,010 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 20:52:53,013 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 20:52:53,013 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 20:52:53,014 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 20:52:53,015 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 20:52:53,016 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 20:52:53,017 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 20:52:53,018 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 20:52:53,018 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 20:52:53,019 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 20:52:53,019 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 20:52:53,020 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 20:52:53,022 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 20:52:53,022 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-19 20:52:53,038 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 20:52:53,038 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 20:52:53,040 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 20:52:53,040 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 20:52:53,040 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 20:52:53,041 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 20:52:53,041 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 20:52:53,041 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 20:52:53,042 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 20:52:53,042 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 20:52:53,042 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 20:52:53,043 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 20:52:53,043 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 20:52:53,043 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 20:52:53,043 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 20:52:53,044 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 20:52:53,044 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 20:52:53,044 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 20:52:53,045 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 20:52:53,045 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 20:52:53,045 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 20:52:53,046 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 20:52:53,046 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 20:52:53,046 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 20:52:53,047 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 20:52:53,047 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 20:52:53,047 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-19 20:52:53,048 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 20:52:53,048 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 -> 1c284ff92946706c13208d48054fb31055fe2d01 [2019-11-19 20:52:53,347 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 20:52:53,368 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 20:52:53,372 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 20:52:53,374 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 20:52:53,374 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 20:52:53,375 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem01_label39.c [2019-11-19 20:52:53,447 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/805192686/b0762482c2374a81a5aab9f5b8fcbd47/FLAG95a8c0b6b [2019-11-19 20:52:54,054 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 20:52:54,055 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label39.c [2019-11-19 20:52:54,070 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/805192686/b0762482c2374a81a5aab9f5b8fcbd47/FLAG95a8c0b6b [2019-11-19 20:52:54,344 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/805192686/b0762482c2374a81a5aab9f5b8fcbd47 [2019-11-19 20:52:54,348 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 20:52:54,350 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 20:52:54,351 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 20:52:54,352 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 20:52:54,355 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 20:52:54,356 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:52:54" (1/1) ... [2019-11-19 20:52:54,359 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f9f6a7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:52:54, skipping insertion in model container [2019-11-19 20:52:54,359 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:52:54" (1/1) ... [2019-11-19 20:52:54,367 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 20:52:54,432 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 20:52:54,893 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 20:52:54,899 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 20:52:55,048 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 20:52:55,070 INFO L192 MainTranslator]: Completed translation [2019-11-19 20:52:55,071 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:52:55 WrapperNode [2019-11-19 20:52:55,072 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 20:52:55,073 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 20:52:55,074 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 20:52:55,074 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 20:52:55,083 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:52:55" (1/1) ... [2019-11-19 20:52:55,101 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:52:55" (1/1) ... [2019-11-19 20:52:55,159 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 20:52:55,160 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 20:52:55,160 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 20:52:55,160 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 20:52:55,170 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:52:55" (1/1) ... [2019-11-19 20:52:55,170 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:52:55" (1/1) ... [2019-11-19 20:52:55,175 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:52:55" (1/1) ... [2019-11-19 20:52:55,175 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:52:55" (1/1) ... [2019-11-19 20:52:55,201 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:52:55" (1/1) ... [2019-11-19 20:52:55,223 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:52:55" (1/1) ... [2019-11-19 20:52:55,238 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:52:55" (1/1) ... [2019-11-19 20:52:55,257 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 20:52:55,258 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 20:52:55,258 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 20:52:55,258 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 20:52:55,259 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:52:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 20:52:55,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 20:52:55,342 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 20:52:56,602 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 20:52:56,602 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-19 20:52:56,605 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:52:56 BoogieIcfgContainer [2019-11-19 20:52:56,605 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 20:52:56,607 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 20:52:56,607 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 20:52:56,610 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 20:52:56,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 08:52:54" (1/3) ... [2019-11-19 20:52:56,613 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24f1762b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:52:56, skipping insertion in model container [2019-11-19 20:52:56,613 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:52:55" (2/3) ... [2019-11-19 20:52:56,614 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24f1762b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:52:56, skipping insertion in model container [2019-11-19 20:52:56,614 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:52:56" (3/3) ... [2019-11-19 20:52:56,616 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label39.c [2019-11-19 20:52:56,627 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 20:52:56,637 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-19 20:52:56,650 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-19 20:52:56,680 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 20:52:56,680 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 20:52:56,680 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 20:52:56,681 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 20:52:56,681 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 20:52:56,681 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 20:52:56,681 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 20:52:56,682 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 20:52:56,706 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-11-19 20:52:56,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-11-19 20:52:56,722 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:52:56,724 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 20:52:56,725 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:52:56,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:52:56,733 INFO L82 PathProgramCache]: Analyzing trace with hash 2011925823, now seen corresponding path program 1 times [2019-11-19 20:52:56,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:52:56,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302140104] [2019-11-19 20:52:56,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:52:56,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:52:58,062 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-19 20:52:58,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302140104] [2019-11-19 20:52:58,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:52:58,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-19 20:52:58,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722532316] [2019-11-19 20:52:58,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-19 20:52:58,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:52:58,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-19 20:52:58,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-11-19 20:52:58,092 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 10 states. [2019-11-19 20:52:59,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:52:59,521 INFO L93 Difference]: Finished difference Result 493 states and 846 transitions. [2019-11-19 20:52:59,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-19 20:52:59,523 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 132 [2019-11-19 20:52:59,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:52:59,541 INFO L225 Difference]: With dead ends: 493 [2019-11-19 20:52:59,542 INFO L226 Difference]: Without dead ends: 193 [2019-11-19 20:52:59,548 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2019-11-19 20:52:59,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-11-19 20:52:59,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2019-11-19 20:52:59,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-11-19 20:52:59,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 264 transitions. [2019-11-19 20:52:59,645 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 264 transitions. Word has length 132 [2019-11-19 20:52:59,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:52:59,646 INFO L462 AbstractCegarLoop]: Abstraction has 193 states and 264 transitions. [2019-11-19 20:52:59,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-19 20:52:59,647 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 264 transitions. [2019-11-19 20:52:59,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-11-19 20:52:59,660 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:52:59,662 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 20:52:59,663 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:52:59,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:52:59,663 INFO L82 PathProgramCache]: Analyzing trace with hash 2043578231, now seen corresponding path program 1 times [2019-11-19 20:52:59,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:52:59,664 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384237588] [2019-11-19 20:52:59,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:52:59,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:52:59,906 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 20:52:59,908 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384237588] [2019-11-19 20:52:59,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:52:59,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 20:52:59,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411623465] [2019-11-19 20:52:59,912 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 20:52:59,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:52:59,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 20:52:59,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 20:52:59,914 INFO L87 Difference]: Start difference. First operand 193 states and 264 transitions. Second operand 4 states. [2019-11-19 20:53:00,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:53:00,792 INFO L93 Difference]: Finished difference Result 588 states and 859 transitions. [2019-11-19 20:53:00,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 20:53:00,793 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2019-11-19 20:53:00,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:53:00,798 INFO L225 Difference]: With dead ends: 588 [2019-11-19 20:53:00,799 INFO L226 Difference]: Without dead ends: 455 [2019-11-19 20:53:00,801 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-19 20:53:00,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2019-11-19 20:53:00,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 324. [2019-11-19 20:53:00,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2019-11-19 20:53:00,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 437 transitions. [2019-11-19 20:53:00,824 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 437 transitions. Word has length 136 [2019-11-19 20:53:00,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:53:00,825 INFO L462 AbstractCegarLoop]: Abstraction has 324 states and 437 transitions. [2019-11-19 20:53:00,825 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 20:53:00,826 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 437 transitions. [2019-11-19 20:53:00,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-11-19 20:53:00,828 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:53:00,828 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 20:53:00,828 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:53:00,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:53:00,829 INFO L82 PathProgramCache]: Analyzing trace with hash -881669038, now seen corresponding path program 1 times [2019-11-19 20:53:00,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:53:00,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967630929] [2019-11-19 20:53:00,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:53:00,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:53:01,217 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 20:53:01,217 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967630929] [2019-11-19 20:53:01,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:53:01,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 20:53:01,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825140388] [2019-11-19 20:53:01,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 20:53:01,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:53:01,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 20:53:01,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 20:53:01,224 INFO L87 Difference]: Start difference. First operand 324 states and 437 transitions. Second operand 4 states. [2019-11-19 20:53:02,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:53:02,062 INFO L93 Difference]: Finished difference Result 814 states and 1168 transitions. [2019-11-19 20:53:02,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 20:53:02,063 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2019-11-19 20:53:02,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:53:02,066 INFO L225 Difference]: With dead ends: 814 [2019-11-19 20:53:02,067 INFO L226 Difference]: Without dead ends: 455 [2019-11-19 20:53:02,069 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-19 20:53:02,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2019-11-19 20:53:02,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 455. [2019-11-19 20:53:02,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2019-11-19 20:53:02,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 536 transitions. [2019-11-19 20:53:02,095 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 536 transitions. Word has length 139 [2019-11-19 20:53:02,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:53:02,095 INFO L462 AbstractCegarLoop]: Abstraction has 455 states and 536 transitions. [2019-11-19 20:53:02,096 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 20:53:02,096 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 536 transitions. [2019-11-19 20:53:02,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-11-19 20:53:02,102 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:53:02,103 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 20:53:02,103 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:53:02,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:53:02,104 INFO L82 PathProgramCache]: Analyzing trace with hash 259765648, now seen corresponding path program 1 times [2019-11-19 20:53:02,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:53:02,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207323739] [2019-11-19 20:53:02,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:53:02,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:53:02,169 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-19 20:53:02,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207323739] [2019-11-19 20:53:02,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:53:02,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 20:53:02,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184097909] [2019-11-19 20:53:02,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 20:53:02,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:53:02,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 20:53:02,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 20:53:02,173 INFO L87 Difference]: Start difference. First operand 455 states and 536 transitions. Second operand 3 states. [2019-11-19 20:53:02,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:53:02,647 INFO L93 Difference]: Finished difference Result 981 states and 1171 transitions. [2019-11-19 20:53:02,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 20:53:02,647 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 147 [2019-11-19 20:53:02,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:53:02,652 INFO L225 Difference]: With dead ends: 981 [2019-11-19 20:53:02,652 INFO L226 Difference]: Without dead ends: 586 [2019-11-19 20:53:02,653 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-19 20:53:02,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2019-11-19 20:53:02,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 586. [2019-11-19 20:53:02,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 586 states. [2019-11-19 20:53:02,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 676 transitions. [2019-11-19 20:53:02,670 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 676 transitions. Word has length 147 [2019-11-19 20:53:02,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:53:02,670 INFO L462 AbstractCegarLoop]: Abstraction has 586 states and 676 transitions. [2019-11-19 20:53:02,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 20:53:02,670 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 676 transitions. [2019-11-19 20:53:02,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-11-19 20:53:02,673 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:53:02,673 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 20:53:02,674 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:53:02,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:53:02,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1638488070, now seen corresponding path program 1 times [2019-11-19 20:53:02,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:53:02,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912283737] [2019-11-19 20:53:02,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:53:02,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:53:02,757 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-19 20:53:02,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912283737] [2019-11-19 20:53:02,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:53:02,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 20:53:02,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541299532] [2019-11-19 20:53:02,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 20:53:02,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:53:02,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 20:53:02,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-19 20:53:02,761 INFO L87 Difference]: Start difference. First operand 586 states and 676 transitions. Second operand 5 states. [2019-11-19 20:53:03,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:53:03,822 INFO L93 Difference]: Finished difference Result 1898 states and 2221 transitions. [2019-11-19 20:53:03,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 20:53:03,823 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 151 [2019-11-19 20:53:03,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:53:03,830 INFO L225 Difference]: With dead ends: 1898 [2019-11-19 20:53:03,831 INFO L226 Difference]: Without dead ends: 1372 [2019-11-19 20:53:03,833 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-19 20:53:03,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2019-11-19 20:53:03,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 1241. [2019-11-19 20:53:03,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1241 states. [2019-11-19 20:53:03,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1241 states to 1241 states and 1410 transitions. [2019-11-19 20:53:03,938 INFO L78 Accepts]: Start accepts. Automaton has 1241 states and 1410 transitions. Word has length 151 [2019-11-19 20:53:03,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:53:03,938 INFO L462 AbstractCegarLoop]: Abstraction has 1241 states and 1410 transitions. [2019-11-19 20:53:03,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 20:53:03,939 INFO L276 IsEmpty]: Start isEmpty. Operand 1241 states and 1410 transitions. [2019-11-19 20:53:03,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-11-19 20:53:03,944 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:53:03,944 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 20:53:03,944 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:53:03,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:53:03,945 INFO L82 PathProgramCache]: Analyzing trace with hash -356244793, now seen corresponding path program 1 times [2019-11-19 20:53:03,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:53:03,946 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267803223] [2019-11-19 20:53:03,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:53:03,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:53:04,755 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-19 20:53:04,756 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267803223] [2019-11-19 20:53:04,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:53:04,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-19 20:53:04,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553937474] [2019-11-19 20:53:04,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-19 20:53:04,758 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:53:04,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-19 20:53:04,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2019-11-19 20:53:04,759 INFO L87 Difference]: Start difference. First operand 1241 states and 1410 transitions. Second operand 12 states. [2019-11-19 20:53:06,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:53:06,662 INFO L93 Difference]: Finished difference Result 2794 states and 3292 transitions. [2019-11-19 20:53:06,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-19 20:53:06,663 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 169 [2019-11-19 20:53:06,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:53:06,669 INFO L225 Difference]: With dead ends: 2794 [2019-11-19 20:53:06,669 INFO L226 Difference]: Without dead ends: 1579 [2019-11-19 20:53:06,671 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=115, Invalid=157, Unknown=0, NotChecked=0, Total=272 [2019-11-19 20:53:06,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1579 states. [2019-11-19 20:53:06,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1579 to 1538. [2019-11-19 20:53:06,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1538 states. [2019-11-19 20:53:06,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1538 states to 1538 states and 1741 transitions. [2019-11-19 20:53:06,711 INFO L78 Accepts]: Start accepts. Automaton has 1538 states and 1741 transitions. Word has length 169 [2019-11-19 20:53:06,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:53:06,712 INFO L462 AbstractCegarLoop]: Abstraction has 1538 states and 1741 transitions. [2019-11-19 20:53:06,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-19 20:53:06,713 INFO L276 IsEmpty]: Start isEmpty. Operand 1538 states and 1741 transitions. [2019-11-19 20:53:06,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-11-19 20:53:06,718 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:53:06,718 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 20:53:06,718 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:53:06,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:53:06,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1261625852, now seen corresponding path program 1 times [2019-11-19 20:53:06,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:53:06,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433851754] [2019-11-19 20:53:06,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:53:06,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:53:06,957 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 65 proven. 11 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-19 20:53:06,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433851754] [2019-11-19 20:53:06,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1396275448] [2019-11-19 20:53:06,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 20:53:07,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:53:07,062 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 20:53:07,084 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 20:53:07,172 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-19 20:53:07,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 20:53:07,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2019-11-19 20:53:07,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024165457] [2019-11-19 20:53:07,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 20:53:07,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:53:07,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 20:53:07,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-19 20:53:07,177 INFO L87 Difference]: Start difference. First operand 1538 states and 1741 transitions. Second operand 3 states. [2019-11-19 20:53:07,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:53:07,642 INFO L93 Difference]: Finished difference Result 3540 states and 4056 transitions. [2019-11-19 20:53:07,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 20:53:07,642 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 195 [2019-11-19 20:53:07,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:53:07,655 INFO L225 Difference]: With dead ends: 3540 [2019-11-19 20:53:07,656 INFO L226 Difference]: Without dead ends: 2062 [2019-11-19 20:53:07,659 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 194 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-19 20:53:07,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2062 states. [2019-11-19 20:53:07,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2062 to 1931. [2019-11-19 20:53:07,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1931 states. [2019-11-19 20:53:07,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1931 states to 1931 states and 2200 transitions. [2019-11-19 20:53:07,724 INFO L78 Accepts]: Start accepts. Automaton has 1931 states and 2200 transitions. Word has length 195 [2019-11-19 20:53:07,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:53:07,725 INFO L462 AbstractCegarLoop]: Abstraction has 1931 states and 2200 transitions. [2019-11-19 20:53:07,725 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 20:53:07,725 INFO L276 IsEmpty]: Start isEmpty. Operand 1931 states and 2200 transitions. [2019-11-19 20:53:07,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-11-19 20:53:07,736 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:53:07,736 INFO L410 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1] [2019-11-19 20:53:07,951 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 20:53:07,951 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:53:07,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:53:07,952 INFO L82 PathProgramCache]: Analyzing trace with hash -249611358, now seen corresponding path program 1 times [2019-11-19 20:53:07,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:53:07,953 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008773619] [2019-11-19 20:53:07,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:53:07,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:53:08,539 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 111 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 20:53:08,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008773619] [2019-11-19 20:53:08,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [396619453] [2019-11-19 20:53:08,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 20:53:08,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:53:08,659 INFO L255 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 20:53:08,676 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 20:53:08,778 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-11-19 20:53:08,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 20:53:08,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2019-11-19 20:53:08,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775973320] [2019-11-19 20:53:08,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 20:53:08,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:53:08,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 20:53:08,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-11-19 20:53:08,786 INFO L87 Difference]: Start difference. First operand 1931 states and 2200 transitions. Second operand 3 states. [2019-11-19 20:53:09,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:53:09,350 INFO L93 Difference]: Finished difference Result 4324 states and 4928 transitions. [2019-11-19 20:53:09,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 20:53:09,350 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 231 [2019-11-19 20:53:09,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:53:09,351 INFO L225 Difference]: With dead ends: 4324 [2019-11-19 20:53:09,351 INFO L226 Difference]: Without dead ends: 0 [2019-11-19 20:53:09,356 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-11-19 20:53:09,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-19 20:53:09,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-19 20:53:09,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-19 20:53:09,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-19 20:53:09,358 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 231 [2019-11-19 20:53:09,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:53:09,358 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 20:53:09,359 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 20:53:09,359 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-19 20:53:09,359 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-19 20:53:09,563 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 20:53:09,568 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-19 20:53:09,730 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-19 20:53:09,730 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-19 20:53:09,730 INFO L444 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:09,730 INFO L444 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:09,731 INFO L444 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:09,731 INFO L444 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:09,731 INFO L444 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:09,731 INFO L444 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:09,731 INFO L444 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-19 20:53:09,731 INFO L444 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-19 20:53:09,731 INFO L444 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2019-11-19 20:53:09,732 INFO L444 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2019-11-19 20:53:09,732 INFO L444 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2019-11-19 20:53:09,732 INFO L444 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2019-11-19 20:53:09,732 INFO L444 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2019-11-19 20:53:09,732 INFO L444 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2019-11-19 20:53:09,732 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-19 20:53:09,733 INFO L444 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-19 20:53:09,733 INFO L444 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:09,733 INFO L444 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:09,733 INFO L444 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:09,733 INFO L444 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:09,733 INFO L444 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:09,733 INFO L444 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:09,733 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-19 20:53:09,734 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-19 20:53:09,734 INFO L444 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2019-11-19 20:53:09,734 INFO L444 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2019-11-19 20:53:09,734 INFO L444 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2019-11-19 20:53:09,734 INFO L444 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2019-11-19 20:53:09,734 INFO L444 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2019-11-19 20:53:09,734 INFO L444 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2019-11-19 20:53:09,734 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-19 20:53:09,734 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-19 20:53:09,734 INFO L444 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-19 20:53:09,735 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-19 20:53:09,737 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-19 20:53:09,737 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-19 20:53:09,737 INFO L444 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2019-11-19 20:53:09,737 INFO L444 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:09,737 INFO L444 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:09,737 INFO L444 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:09,738 INFO L444 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:09,738 INFO L444 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:09,738 INFO L444 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-19 20:53:09,738 INFO L444 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-19 20:53:09,738 INFO L444 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2019-11-19 20:53:09,738 INFO L444 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2019-11-19 20:53:09,738 INFO L444 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2019-11-19 20:53:09,738 INFO L444 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2019-11-19 20:53:09,738 INFO L444 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2019-11-19 20:53:09,738 INFO L444 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2019-11-19 20:53:09,738 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-19 20:53:09,739 INFO L440 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse2 (= ~a12~0 8)) (.cse1 (= ~a21~0 1)) (.cse0 (= ~a20~0 1))) (or (and (not .cse0) (<= 14 ~a8~0)) (and (or (= ~a7~0 1) (and .cse1 (= 15 ~a8~0))) .cse2 .cse0) (and (= ~a17~0 1) .cse2 .cse1 .cse0) (<= ~a16~0 4))) [2019-11-19 20:53:09,739 INFO L444 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:09,740 INFO L444 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:09,740 INFO L444 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:09,740 INFO L444 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:09,740 INFO L444 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:09,740 INFO L444 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-19 20:53:09,740 INFO L444 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2019-11-19 20:53:09,741 INFO L444 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2019-11-19 20:53:09,741 INFO L444 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2019-11-19 20:53:09,741 INFO L444 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2019-11-19 20:53:09,741 INFO L444 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2019-11-19 20:53:09,741 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-19 20:53:09,742 INFO L444 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-19 20:53:09,742 INFO L444 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-19 20:53:09,742 INFO L444 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-19 20:53:09,742 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-19 20:53:09,742 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-19 20:53:09,742 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-19 20:53:09,743 INFO L447 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-19 20:53:09,743 INFO L444 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:09,743 INFO L444 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:09,743 INFO L444 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:09,743 INFO L444 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:09,744 INFO L444 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:09,744 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-19 20:53:09,744 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-19 20:53:09,744 INFO L444 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-19 20:53:09,744 INFO L444 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2019-11-19 20:53:09,744 INFO L444 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2019-11-19 20:53:09,745 INFO L444 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2019-11-19 20:53:09,745 INFO L444 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2019-11-19 20:53:09,745 INFO L444 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2019-11-19 20:53:09,745 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-19 20:53:09,745 INFO L444 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:09,745 INFO L444 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:09,746 INFO L444 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:09,746 INFO L444 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:09,746 INFO L444 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-19 20:53:09,746 INFO L444 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:09,746 INFO L444 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-19 20:53:09,746 INFO L444 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-19 20:53:09,747 INFO L444 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2019-11-19 20:53:09,747 INFO L444 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2019-11-19 20:53:09,747 INFO L444 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2019-11-19 20:53:09,747 INFO L444 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2019-11-19 20:53:09,747 INFO L444 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2019-11-19 20:53:09,747 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-19 20:53:09,748 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-19 20:53:09,748 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-19 20:53:09,748 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-19 20:53:09,748 INFO L444 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-19 20:53:09,748 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-19 20:53:09,749 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-19 20:53:09,749 INFO L444 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:09,749 INFO L440 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse2 (= ~a12~0 8)) (.cse1 (= ~a21~0 1)) (.cse0 (= ~a20~0 1))) (or (and (not .cse0) (<= 14 ~a8~0)) (and (or (= ~a7~0 1) (and .cse1 (= 15 ~a8~0))) .cse2 .cse0) (and (= ~a17~0 1) .cse2 .cse1 .cse0) (<= ~a16~0 4))) [2019-11-19 20:53:09,749 INFO L444 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:09,749 INFO L444 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:09,750 INFO L444 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:09,750 INFO L444 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:09,750 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-19 20:53:09,750 INFO L444 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2019-11-19 20:53:09,750 INFO L444 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2019-11-19 20:53:09,751 INFO L444 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2019-11-19 20:53:09,751 INFO L444 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2019-11-19 20:53:09,751 INFO L444 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2019-11-19 20:53:09,751 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-19 20:53:09,751 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-19 20:53:09,752 INFO L444 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:09,752 INFO L444 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:09,752 INFO L444 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:09,752 INFO L444 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:09,752 INFO L444 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:09,752 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-19 20:53:09,753 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-19 20:53:09,753 INFO L444 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-19 20:53:09,753 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-19 20:53:09,753 INFO L444 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-19 20:53:09,753 INFO L444 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2019-11-19 20:53:09,753 INFO L444 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2019-11-19 20:53:09,754 INFO L444 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2019-11-19 20:53:09,754 INFO L444 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2019-11-19 20:53:09,754 INFO L444 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2019-11-19 20:53:09,754 INFO L444 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-19 20:53:09,754 INFO L444 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-19 20:53:09,754 INFO L444 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-19 20:53:09,755 INFO L444 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:09,755 INFO L444 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:09,755 INFO L444 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:09,755 INFO L444 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:09,755 INFO L444 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2019-11-19 20:53:09,755 INFO L444 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:09,756 INFO L444 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:09,756 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-19 20:53:09,756 INFO L444 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-19 20:53:09,756 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-19 20:53:09,756 INFO L444 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2019-11-19 20:53:09,756 INFO L444 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2019-11-19 20:53:09,756 INFO L444 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2019-11-19 20:53:09,757 INFO L444 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2019-11-19 20:53:09,757 INFO L444 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2019-11-19 20:53:09,757 INFO L444 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2019-11-19 20:53:09,757 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-19 20:53:09,757 INFO L444 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-19 20:53:09,757 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-19 20:53:09,758 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-19 20:53:09,758 INFO L444 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:09,758 INFO L444 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:09,758 INFO L444 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:09,758 INFO L444 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:09,758 INFO L444 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:09,759 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-19 20:53:09,759 INFO L444 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:09,759 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-19 20:53:09,759 INFO L444 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-19 20:53:09,759 INFO L444 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2019-11-19 20:53:09,759 INFO L444 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2019-11-19 20:53:09,760 INFO L444 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2019-11-19 20:53:09,760 INFO L444 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2019-11-19 20:53:09,760 INFO L444 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2019-11-19 20:53:09,760 INFO L444 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2019-11-19 20:53:09,760 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-19 20:53:09,760 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-19 20:53:09,761 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-19 20:53:09,761 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-19 20:53:09,761 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 572) no Hoare annotation was computed. [2019-11-19 20:53:09,761 INFO L444 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-19 20:53:09,761 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-19 20:53:09,761 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-19 20:53:09,762 INFO L444 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:09,762 INFO L444 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:09,762 INFO L444 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:09,762 INFO L444 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:09,762 INFO L444 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:09,762 INFO L444 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 20:53:09,763 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-19 20:53:09,763 INFO L444 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2019-11-19 20:53:09,763 INFO L444 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2019-11-19 20:53:09,763 INFO L444 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2019-11-19 20:53:09,763 INFO L444 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2019-11-19 20:53:09,763 INFO L444 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2019-11-19 20:53:09,764 INFO L444 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2019-11-19 20:53:09,764 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-19 20:53:09,764 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-19 20:53:09,764 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-19 20:53:09,784 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 08:53:09 BoogieIcfgContainer [2019-11-19 20:53:09,784 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 20:53:09,785 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 20:53:09,785 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 20:53:09,785 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 20:53:09,786 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:52:56" (3/4) ... [2019-11-19 20:53:09,790 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-19 20:53:09,830 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-19 20:53:09,832 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-19 20:53:10,050 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-19 20:53:10,050 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 20:53:10,053 INFO L168 Benchmark]: Toolchain (without parser) took 15702.41 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 464.5 MB). Free memory was 960.4 MB in the beginning and 1.4 GB in the end (delta: -404.9 MB). Peak memory consumption was 59.6 MB. Max. memory is 11.5 GB. [2019-11-19 20:53:10,054 INFO L168 Benchmark]: CDTParser took 0.27 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-19 20:53:10,054 INFO L168 Benchmark]: CACSL2BoogieTranslator took 721.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -173.1 MB). Peak memory consumption was 28.2 MB. Max. memory is 11.5 GB. [2019-11-19 20:53:10,054 INFO L168 Benchmark]: Boogie Procedure Inliner took 86.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-19 20:53:10,055 INFO L168 Benchmark]: Boogie Preprocessor took 97.35 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-19 20:53:10,055 INFO L168 Benchmark]: RCFGBuilder took 1347.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 112.0 MB). Peak memory consumption was 112.0 MB. Max. memory is 11.5 GB. [2019-11-19 20:53:10,056 INFO L168 Benchmark]: TraceAbstraction took 13177.52 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 316.1 MB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -387.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 20:53:10,058 INFO L168 Benchmark]: Witness Printer took 265.68 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 24.9 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2019-11-19 20:53:10,061 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 721.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -173.1 MB). Peak memory consumption was 28.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 86.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 97.35 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1347.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 112.0 MB). Peak memory consumption was 112.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 13177.52 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 316.1 MB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -387.3 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 265.68 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 24.9 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 572]: 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: (((!(a20 == 1) && 14 <= a8) || (((a7 == 1 || (a21 == 1 && 15 == a8)) && a12 == 8) && a20 == 1)) || (((a17 == 1 && a12 == 8) && a21 == 1) && a20 == 1)) || a16 <= 4 - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (((!(a20 == 1) && 14 <= a8) || (((a7 == 1 || (a21 == 1 && 15 == a8)) && a12 == 8) && a20 == 1)) || (((a17 == 1 && a12 == 8) && a21 == 1) && a20 == 1)) || a16 <= 4 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. Result: SAFE, OverallTime: 13.0s, OverallIterations: 8, TraceHistogramMax: 4, AutomataDifference: 7.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, HoareTripleCheckerStatistics: 802 SDtfs, 1765 SDslu, 122 SDs, 0 SdLazy, 4777 SolverSat, 681 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 497 GetRequests, 440 SyntacticMatches, 6 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1931occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 434 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 46 NumberOfFragments, 87 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1075 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 40 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 1726 NumberOfCodeBlocks, 1726 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1716 ConstructedInterpolants, 0 QuantifiedInterpolants, 2026735 SizeOfPredicates, 2 NumberOfNonLiveVariables, 710 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 10 InterpolantComputations, 8 PerfectInterpolantSequences, 495/545 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...