./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem02_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/Problem02_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 1e89048ccdb20a97a14cb213e125edb5cbe6d123 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:53:10,868 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 20:53:10,871 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 20:53:10,884 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 20:53:10,885 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 20:53:10,887 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 20:53:10,889 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 20:53:10,895 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 20:53:10,898 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 20:53:10,902 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 20:53:10,904 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 20:53:10,909 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 20:53:10,909 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 20:53:10,911 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 20:53:10,912 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 20:53:10,913 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 20:53:10,914 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 20:53:10,916 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 20:53:10,918 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 20:53:10,920 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 20:53:10,922 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 20:53:10,924 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 20:53:10,928 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 20:53:10,929 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 20:53:10,934 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 20:53:10,934 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 20:53:10,934 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 20:53:10,935 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 20:53:10,939 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 20:53:10,941 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 20:53:10,942 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 20:53:10,944 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 20:53:10,945 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 20:53:10,945 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 20:53:10,947 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 20:53:10,950 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 20:53:10,951 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 20:53:10,951 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 20:53:10,951 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 20:53:10,952 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 20:53:10,953 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 20:53:10,955 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:53:10,972 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 20:53:10,972 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 20:53:10,973 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 20:53:10,974 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 20:53:10,974 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 20:53:10,974 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 20:53:10,975 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 20:53:10,975 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 20:53:10,975 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 20:53:10,975 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 20:53:10,976 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 20:53:10,976 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 20:53:10,976 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 20:53:10,976 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 20:53:10,976 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 20:53:10,978 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 20:53:10,978 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 20:53:10,978 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 20:53:10,978 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 20:53:10,979 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 20:53:10,979 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 20:53:10,979 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 20:53:10,979 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 20:53:10,980 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 20:53:10,980 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 20:53:10,980 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 20:53:10,980 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-19 20:53:10,981 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 20:53:10,982 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 -> 1e89048ccdb20a97a14cb213e125edb5cbe6d123 [2019-11-19 20:53:11,311 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 20:53:11,324 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 20:53:11,328 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 20:53:11,330 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 20:53:11,330 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 20:53:11,331 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem02_label39.c [2019-11-19 20:53:11,395 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2fca382fe/e5f05998a8384e018df03fd94517322c/FLAG048c3d3c5 [2019-11-19 20:53:11,985 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 20:53:11,986 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label39.c [2019-11-19 20:53:12,001 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2fca382fe/e5f05998a8384e018df03fd94517322c/FLAG048c3d3c5 [2019-11-19 20:53:12,253 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2fca382fe/e5f05998a8384e018df03fd94517322c [2019-11-19 20:53:12,257 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 20:53:12,259 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 20:53:12,260 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 20:53:12,260 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 20:53:12,264 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 20:53:12,265 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:53:12" (1/1) ... [2019-11-19 20:53:12,267 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@565eff78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:53:12, skipping insertion in model container [2019-11-19 20:53:12,268 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:53:12" (1/1) ... [2019-11-19 20:53:12,275 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 20:53:12,343 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 20:53:12,804 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 20:53:12,810 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 20:53:12,943 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 20:53:12,959 INFO L192 MainTranslator]: Completed translation [2019-11-19 20:53:12,960 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:53:12 WrapperNode [2019-11-19 20:53:12,960 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 20:53:12,961 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 20:53:12,961 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 20:53:12,961 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 20:53:12,970 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:53:12" (1/1) ... [2019-11-19 20:53:12,996 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:53:12" (1/1) ... [2019-11-19 20:53:13,060 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 20:53:13,061 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 20:53:13,061 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 20:53:13,061 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 20:53:13,072 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:53:12" (1/1) ... [2019-11-19 20:53:13,072 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:53:12" (1/1) ... [2019-11-19 20:53:13,076 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:53:12" (1/1) ... [2019-11-19 20:53:13,076 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:53:12" (1/1) ... [2019-11-19 20:53:13,112 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:53:12" (1/1) ... [2019-11-19 20:53:13,134 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:53:12" (1/1) ... [2019-11-19 20:53:13,149 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:53:12" (1/1) ... [2019-11-19 20:53:13,166 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 20:53:13,167 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 20:53:13,167 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 20:53:13,167 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 20:53:13,170 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:53:12" (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:53:13,267 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 20:53:13,268 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 20:53:14,594 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 20:53:14,595 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-19 20:53:14,596 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:53:14 BoogieIcfgContainer [2019-11-19 20:53:14,597 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 20:53:14,598 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 20:53:14,598 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 20:53:14,601 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 20:53:14,602 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 08:53:12" (1/3) ... [2019-11-19 20:53:14,603 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5888bff8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:53:14, skipping insertion in model container [2019-11-19 20:53:14,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:53:12" (2/3) ... [2019-11-19 20:53:14,603 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5888bff8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:53:14, skipping insertion in model container [2019-11-19 20:53:14,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:53:14" (3/3) ... [2019-11-19 20:53:14,605 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label39.c [2019-11-19 20:53:14,615 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 20:53:14,623 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-19 20:53:14,634 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-19 20:53:14,664 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 20:53:14,665 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 20:53:14,665 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 20:53:14,665 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 20:53:14,666 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 20:53:14,666 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 20:53:14,666 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 20:53:14,666 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 20:53:14,689 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states. [2019-11-19 20:53:14,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-19 20:53:14,701 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:53:14,702 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] [2019-11-19 20:53:14,703 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:53:14,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:53:14,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1738135197, now seen corresponding path program 1 times [2019-11-19 20:53:14,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:53:14,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813143605] [2019-11-19 20:53:14,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:53:14,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:53:15,185 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:53:15,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813143605] [2019-11-19 20:53:15,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:53:15,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 20:53:15,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317478030] [2019-11-19 20:53:15,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 20:53:15,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:53:15,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 20:53:15,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 20:53:15,215 INFO L87 Difference]: Start difference. First operand 227 states. Second operand 4 states. [2019-11-19 20:53:17,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:53:17,050 INFO L93 Difference]: Finished difference Result 775 states and 1353 transitions. [2019-11-19 20:53:17,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 20:53:17,052 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2019-11-19 20:53:17,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:53:17,072 INFO L225 Difference]: With dead ends: 775 [2019-11-19 20:53:17,073 INFO L226 Difference]: Without dead ends: 460 [2019-11-19 20:53:17,078 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:17,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2019-11-19 20:53:17,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 308. [2019-11-19 20:53:17,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2019-11-19 20:53:17,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 451 transitions. [2019-11-19 20:53:17,180 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 451 transitions. Word has length 111 [2019-11-19 20:53:17,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:53:17,181 INFO L462 AbstractCegarLoop]: Abstraction has 308 states and 451 transitions. [2019-11-19 20:53:17,181 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 20:53:17,183 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 451 transitions. [2019-11-19 20:53:17,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-11-19 20:53:17,190 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:53:17,190 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] [2019-11-19 20:53:17,190 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:53:17,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:53:17,192 INFO L82 PathProgramCache]: Analyzing trace with hash -215551336, now seen corresponding path program 1 times [2019-11-19 20:53:17,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:53:17,193 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767937011] [2019-11-19 20:53:17,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:53:17,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:53:17,472 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:53:17,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767937011] [2019-11-19 20:53:17,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:53:17,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 20:53:17,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663586390] [2019-11-19 20:53:17,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 20:53:17,476 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:53:17,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 20:53:17,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 20:53:17,477 INFO L87 Difference]: Start difference. First operand 308 states and 451 transitions. Second operand 4 states. [2019-11-19 20:53:18,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:53:18,492 INFO L93 Difference]: Finished difference Result 1180 states and 1741 transitions. [2019-11-19 20:53:18,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 20:53:18,493 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2019-11-19 20:53:18,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:53:18,500 INFO L225 Difference]: With dead ends: 1180 [2019-11-19 20:53:18,500 INFO L226 Difference]: Without dead ends: 874 [2019-11-19 20:53:18,503 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 20:53:18,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2019-11-19 20:53:18,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 870. [2019-11-19 20:53:18,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 870 states. [2019-11-19 20:53:18,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1183 transitions. [2019-11-19 20:53:18,548 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1183 transitions. Word has length 115 [2019-11-19 20:53:18,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:53:18,549 INFO L462 AbstractCegarLoop]: Abstraction has 870 states and 1183 transitions. [2019-11-19 20:53:18,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 20:53:18,550 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1183 transitions. [2019-11-19 20:53:18,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-19 20:53:18,554 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:53:18,554 INFO L410 BasicCegarLoop]: trace histogram [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, 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:18,555 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:53:18,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:53:18,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1793072302, now seen corresponding path program 1 times [2019-11-19 20:53:18,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:53:18,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090027667] [2019-11-19 20:53:18,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:53:18,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:53:18,608 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-19 20:53:18,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090027667] [2019-11-19 20:53:18,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:53:18,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 20:53:18,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415548106] [2019-11-19 20:53:18,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 20:53:18,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:53:18,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 20:53:18,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 20:53:18,612 INFO L87 Difference]: Start difference. First operand 870 states and 1183 transitions. Second operand 4 states. [2019-11-19 20:53:19,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:53:19,219 INFO L93 Difference]: Finished difference Result 2146 states and 2939 transitions. [2019-11-19 20:53:19,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 20:53:19,220 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2019-11-19 20:53:19,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:53:19,228 INFO L225 Difference]: With dead ends: 2146 [2019-11-19 20:53:19,229 INFO L226 Difference]: Without dead ends: 1278 [2019-11-19 20:53:19,231 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:19,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1278 states. [2019-11-19 20:53:19,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1278 to 578. [2019-11-19 20:53:19,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2019-11-19 20:53:19,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 776 transitions. [2019-11-19 20:53:19,266 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 776 transitions. Word has length 121 [2019-11-19 20:53:19,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:53:19,267 INFO L462 AbstractCegarLoop]: Abstraction has 578 states and 776 transitions. [2019-11-19 20:53:19,267 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 20:53:19,267 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 776 transitions. [2019-11-19 20:53:19,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-19 20:53:19,270 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:53:19,271 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-19 20:53:19,271 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:53:19,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:53:19,272 INFO L82 PathProgramCache]: Analyzing trace with hash 63576167, now seen corresponding path program 1 times [2019-11-19 20:53:19,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:53:19,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779762038] [2019-11-19 20:53:19,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:53:19,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:53:19,352 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 20:53:19,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779762038] [2019-11-19 20:53:19,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:53:19,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 20:53:19,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771245867] [2019-11-19 20:53:19,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 20:53:19,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:53:19,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 20:53:19,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 20:53:19,358 INFO L87 Difference]: Start difference. First operand 578 states and 776 transitions. Second operand 3 states. [2019-11-19 20:53:19,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:53:19,993 INFO L93 Difference]: Finished difference Result 1714 states and 2306 transitions. [2019-11-19 20:53:19,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 20:53:19,995 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-11-19 20:53:19,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:53:20,003 INFO L225 Difference]: With dead ends: 1714 [2019-11-19 20:53:20,004 INFO L226 Difference]: Without dead ends: 1138 [2019-11-19 20:53:20,007 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:20,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1138 states. [2019-11-19 20:53:20,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1138 to 1138. [2019-11-19 20:53:20,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1138 states. [2019-11-19 20:53:20,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 1138 states and 1447 transitions. [2019-11-19 20:53:20,059 INFO L78 Accepts]: Start accepts. Automaton has 1138 states and 1447 transitions. Word has length 121 [2019-11-19 20:53:20,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:53:20,059 INFO L462 AbstractCegarLoop]: Abstraction has 1138 states and 1447 transitions. [2019-11-19 20:53:20,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 20:53:20,060 INFO L276 IsEmpty]: Start isEmpty. Operand 1138 states and 1447 transitions. [2019-11-19 20:53:20,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-11-19 20:53:20,063 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:53:20,064 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20,064 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:53:20,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:53:20,065 INFO L82 PathProgramCache]: Analyzing trace with hash 675657489, now seen corresponding path program 1 times [2019-11-19 20:53:20,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:53:20,066 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595507515] [2019-11-19 20:53:20,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:53:20,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:53:20,179 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 20:53:20,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595507515] [2019-11-19 20:53:20,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:53:20,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 20:53:20,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917409293] [2019-11-19 20:53:20,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 20:53:20,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:53:20,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 20:53:20,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 20:53:20,183 INFO L87 Difference]: Start difference. First operand 1138 states and 1447 transitions. Second operand 4 states. [2019-11-19 20:53:20,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:53:20,940 INFO L93 Difference]: Finished difference Result 2415 states and 3064 transitions. [2019-11-19 20:53:20,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 20:53:20,941 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 135 [2019-11-19 20:53:20,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:53:20,948 INFO L225 Difference]: With dead ends: 2415 [2019-11-19 20:53:20,948 INFO L226 Difference]: Without dead ends: 1279 [2019-11-19 20:53:20,951 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:20,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1279 states. [2019-11-19 20:53:20,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1279 to 1279. [2019-11-19 20:53:20,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1279 states. [2019-11-19 20:53:20,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1279 states to 1279 states and 1438 transitions. [2019-11-19 20:53:20,982 INFO L78 Accepts]: Start accepts. Automaton has 1279 states and 1438 transitions. Word has length 135 [2019-11-19 20:53:20,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:53:20,982 INFO L462 AbstractCegarLoop]: Abstraction has 1279 states and 1438 transitions. [2019-11-19 20:53:20,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 20:53:20,983 INFO L276 IsEmpty]: Start isEmpty. Operand 1279 states and 1438 transitions. [2019-11-19 20:53:20,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-11-19 20:53:20,986 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:53:20,987 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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:20,987 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:53:20,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:53:20,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1227064464, now seen corresponding path program 1 times [2019-11-19 20:53:20,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:53:20,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192223555] [2019-11-19 20:53:20,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:53:21,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:53:21,046 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 20:53:21,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192223555] [2019-11-19 20:53:21,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:53:21,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 20:53:21,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124312641] [2019-11-19 20:53:21,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 20:53:21,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:53:21,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 20:53:21,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 20:53:21,050 INFO L87 Difference]: Start difference. First operand 1279 states and 1438 transitions. Second operand 3 states. [2019-11-19 20:53:21,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:53:21,537 INFO L93 Difference]: Finished difference Result 3399 states and 3829 transitions. [2019-11-19 20:53:21,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 20:53:21,538 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 144 [2019-11-19 20:53:21,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:53:21,550 INFO L225 Difference]: With dead ends: 3399 [2019-11-19 20:53:21,551 INFO L226 Difference]: Without dead ends: 1982 [2019-11-19 20:53:21,553 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 20:53:21,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1982 states. [2019-11-19 20:53:21,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1982 to 1978. [2019-11-19 20:53:21,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1978 states. [2019-11-19 20:53:21,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1978 states to 1978 states and 2183 transitions. [2019-11-19 20:53:21,618 INFO L78 Accepts]: Start accepts. Automaton has 1978 states and 2183 transitions. Word has length 144 [2019-11-19 20:53:21,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:53:21,621 INFO L462 AbstractCegarLoop]: Abstraction has 1978 states and 2183 transitions. [2019-11-19 20:53:21,621 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 20:53:21,621 INFO L276 IsEmpty]: Start isEmpty. Operand 1978 states and 2183 transitions. [2019-11-19 20:53:21,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-11-19 20:53:21,626 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:53:21,626 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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] [2019-11-19 20:53:21,627 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:53:21,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:53:21,632 INFO L82 PathProgramCache]: Analyzing trace with hash 404814437, now seen corresponding path program 1 times [2019-11-19 20:53:21,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:53:21,634 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209774497] [2019-11-19 20:53:21,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:53:21,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:53:21,747 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-19 20:53:21,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209774497] [2019-11-19 20:53:21,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:53:21,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 20:53:21,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282239576] [2019-11-19 20:53:21,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 20:53:21,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:53:21,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 20:53:21,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 20:53:21,760 INFO L87 Difference]: Start difference. First operand 1978 states and 2183 transitions. Second operand 4 states. [2019-11-19 20:53:22,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:53:22,406 INFO L93 Difference]: Finished difference Result 4234 states and 4703 transitions. [2019-11-19 20:53:22,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 20:53:22,407 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2019-11-19 20:53:22,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:53:22,416 INFO L225 Difference]: With dead ends: 4234 [2019-11-19 20:53:22,416 INFO L226 Difference]: Without dead ends: 1836 [2019-11-19 20:53:22,419 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 20:53:22,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1836 states. [2019-11-19 20:53:22,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1836 to 1836. [2019-11-19 20:53:22,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1836 states. [2019-11-19 20:53:22,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1836 states to 1836 states and 2009 transitions. [2019-11-19 20:53:22,457 INFO L78 Accepts]: Start accepts. Automaton has 1836 states and 2009 transitions. Word has length 148 [2019-11-19 20:53:22,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:53:22,458 INFO L462 AbstractCegarLoop]: Abstraction has 1836 states and 2009 transitions. [2019-11-19 20:53:22,458 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 20:53:22,458 INFO L276 IsEmpty]: Start isEmpty. Operand 1836 states and 2009 transitions. [2019-11-19 20:53:22,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-19 20:53:22,462 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:53:22,462 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22,463 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:53:22,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:53:22,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1277248510, now seen corresponding path program 1 times [2019-11-19 20:53:22,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:53:22,464 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109294973] [2019-11-19 20:53:22,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:53:22,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:53:22,542 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-19 20:53:22,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109294973] [2019-11-19 20:53:22,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:53:22,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 20:53:22,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957774291] [2019-11-19 20:53:22,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 20:53:22,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:53:22,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 20:53:22,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 20:53:22,545 INFO L87 Difference]: Start difference. First operand 1836 states and 2009 transitions. Second operand 4 states. [2019-11-19 20:53:23,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:53:23,314 INFO L93 Difference]: Finished difference Result 3672 states and 4027 transitions. [2019-11-19 20:53:23,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 20:53:23,320 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2019-11-19 20:53:23,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:53:23,326 INFO L225 Difference]: With dead ends: 3672 [2019-11-19 20:53:23,327 INFO L226 Difference]: Without dead ends: 1554 [2019-11-19 20:53:23,330 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 20:53:23,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1554 states. [2019-11-19 20:53:23,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1554 to 1554. [2019-11-19 20:53:23,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1554 states. [2019-11-19 20:53:23,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1554 states to 1554 states and 1619 transitions. [2019-11-19 20:53:23,364 INFO L78 Accepts]: Start accepts. Automaton has 1554 states and 1619 transitions. Word has length 158 [2019-11-19 20:53:23,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:53:23,364 INFO L462 AbstractCegarLoop]: Abstraction has 1554 states and 1619 transitions. [2019-11-19 20:53:23,364 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 20:53:23,365 INFO L276 IsEmpty]: Start isEmpty. Operand 1554 states and 1619 transitions. [2019-11-19 20:53:23,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-11-19 20:53:23,371 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:53:23,372 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-19 20:53:23,372 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:53:23,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:53:23,372 INFO L82 PathProgramCache]: Analyzing trace with hash -2146398300, now seen corresponding path program 1 times [2019-11-19 20:53:23,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:53:23,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467273820] [2019-11-19 20:53:23,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:53:23,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:53:23,542 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-11-19 20:53:23,543 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467273820] [2019-11-19 20:53:23,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:53:23,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 20:53:23,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86993675] [2019-11-19 20:53:23,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 20:53:23,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:53:23,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 20:53:23,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 20:53:23,546 INFO L87 Difference]: Start difference. First operand 1554 states and 1619 transitions. Second operand 4 states. [2019-11-19 20:53:24,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:53:24,065 INFO L93 Difference]: Finished difference Result 2967 states and 3094 transitions. [2019-11-19 20:53:24,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 20:53:24,066 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 241 [2019-11-19 20:53:24,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:53:24,075 INFO L225 Difference]: With dead ends: 2967 [2019-11-19 20:53:24,076 INFO L226 Difference]: Without dead ends: 1555 [2019-11-19 20:53:24,079 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:24,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1555 states. [2019-11-19 20:53:24,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1555 to 1414. [2019-11-19 20:53:24,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1414 states. [2019-11-19 20:53:24,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1414 states to 1414 states and 1464 transitions. [2019-11-19 20:53:24,121 INFO L78 Accepts]: Start accepts. Automaton has 1414 states and 1464 transitions. Word has length 241 [2019-11-19 20:53:24,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:53:24,122 INFO L462 AbstractCegarLoop]: Abstraction has 1414 states and 1464 transitions. [2019-11-19 20:53:24,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 20:53:24,123 INFO L276 IsEmpty]: Start isEmpty. Operand 1414 states and 1464 transitions. [2019-11-19 20:53:24,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-11-19 20:53:24,132 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:53:24,132 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24,133 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:53:24,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:53:24,134 INFO L82 PathProgramCache]: Analyzing trace with hash 995979598, now seen corresponding path program 1 times [2019-11-19 20:53:24,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:53:24,135 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747502114] [2019-11-19 20:53:24,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:53:24,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:53:24,788 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 174 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 20:53:24,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747502114] [2019-11-19 20:53:24,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1808691089] [2019-11-19 20:53:24,790 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:24,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:53:24,974 INFO L255 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-19 20:53:25,025 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 20:53:25,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 20:53:25,397 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 190 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 20:53:25,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 20:53:25,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 9 [2019-11-19 20:53:25,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101621376] [2019-11-19 20:53:25,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-19 20:53:25,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:53:25,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-19 20:53:25,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-11-19 20:53:25,403 INFO L87 Difference]: Start difference. First operand 1414 states and 1464 transitions. Second operand 10 states. [2019-11-19 20:53:26,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:53:26,939 INFO L93 Difference]: Finished difference Result 2571 states and 2668 transitions. [2019-11-19 20:53:26,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-19 20:53:26,939 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 246 [2019-11-19 20:53:26,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:53:26,940 INFO L225 Difference]: With dead ends: 2571 [2019-11-19 20:53:26,940 INFO L226 Difference]: Without dead ends: 0 [2019-11-19 20:53:26,943 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 243 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-11-19 20:53:26,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-19 20:53:26,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-19 20:53:26,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-19 20:53:26,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-19 20:53:26,944 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 246 [2019-11-19 20:53:26,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:53:26,945 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 20:53:26,945 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-19 20:53:26,945 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-19 20:53:26,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-19 20:53:27,146 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 20:53:27,152 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-19 20:53:27,569 WARN L191 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2019-11-19 20:53:27,833 WARN L191 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2019-11-19 20:53:27,837 INFO L444 ceAbstractionStarter]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:27,837 INFO L444 ceAbstractionStarter]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:27,838 INFO L444 ceAbstractionStarter]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:27,838 INFO L444 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2019-11-19 20:53:27,838 INFO L444 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2019-11-19 20:53:27,838 INFO L444 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2019-11-19 20:53:27,838 INFO L444 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2019-11-19 20:53:27,838 INFO L444 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2019-11-19 20:53:27,838 INFO L444 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2019-11-19 20:53:27,839 INFO L444 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2019-11-19 20:53:27,839 INFO L444 ceAbstractionStarter]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:27,839 INFO L444 ceAbstractionStarter]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:27,839 INFO L444 ceAbstractionStarter]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:27,839 INFO L444 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2019-11-19 20:53:27,839 INFO L444 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2019-11-19 20:53:27,839 INFO L444 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2019-11-19 20:53:27,839 INFO L444 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2019-11-19 20:53:27,840 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2019-11-19 20:53:27,840 INFO L444 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2019-11-19 20:53:27,841 INFO L444 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2019-11-19 20:53:27,841 INFO L444 ceAbstractionStarter]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:27,841 INFO L444 ceAbstractionStarter]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:27,841 INFO L444 ceAbstractionStarter]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:27,841 INFO L444 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2019-11-19 20:53:27,842 INFO L444 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2019-11-19 20:53:27,842 INFO L444 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2019-11-19 20:53:27,842 INFO L444 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2019-11-19 20:53:27,842 INFO L444 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2019-11-19 20:53:27,843 INFO L444 ceAbstractionStarter]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:27,843 INFO L444 ceAbstractionStarter]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:27,844 INFO L444 ceAbstractionStarter]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:27,844 INFO L444 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2019-11-19 20:53:27,844 INFO L444 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2019-11-19 20:53:27,845 INFO L444 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2019-11-19 20:53:27,845 INFO L444 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2019-11-19 20:53:27,845 INFO L444 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2019-11-19 20:53:27,845 INFO L444 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2019-11-19 20:53:27,846 INFO L444 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2019-11-19 20:53:27,846 INFO L444 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2019-11-19 20:53:27,846 INFO L444 ceAbstractionStarter]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:27,847 INFO L444 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:27,847 INFO L444 ceAbstractionStarter]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:27,847 INFO L444 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2019-11-19 20:53:27,847 INFO L444 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2019-11-19 20:53:27,848 INFO L444 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2019-11-19 20:53:27,848 INFO L444 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2019-11-19 20:53:27,848 INFO L444 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2019-11-19 20:53:27,848 INFO L444 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2019-11-19 20:53:27,849 INFO L444 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2019-11-19 20:53:27,849 INFO L444 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2019-11-19 20:53:27,849 INFO L444 ceAbstractionStarter]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:27,850 INFO L444 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:27,850 INFO L444 ceAbstractionStarter]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:27,850 INFO L444 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2019-11-19 20:53:27,851 INFO L444 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2019-11-19 20:53:27,851 INFO L444 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2019-11-19 20:53:27,851 INFO L444 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2019-11-19 20:53:27,851 INFO L444 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2019-11-19 20:53:27,851 INFO L444 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2019-11-19 20:53:27,852 INFO L444 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2019-11-19 20:53:27,852 INFO L444 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2019-11-19 20:53:27,852 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2019-11-19 20:53:27,853 INFO L444 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:27,853 INFO L444 ceAbstractionStarter]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:27,853 INFO L444 ceAbstractionStarter]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:27,853 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2019-11-19 20:53:27,854 INFO L444 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2019-11-19 20:53:27,854 INFO L444 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2019-11-19 20:53:27,854 INFO L444 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2019-11-19 20:53:27,854 INFO L444 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2019-11-19 20:53:27,855 INFO L444 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2019-11-19 20:53:27,855 INFO L444 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:27,855 INFO L444 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:27,856 INFO L444 ceAbstractionStarter]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:27,856 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2019-11-19 20:53:27,856 INFO L444 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2019-11-19 20:53:27,856 INFO L444 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2019-11-19 20:53:27,857 INFO L444 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2019-11-19 20:53:27,857 INFO L444 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2019-11-19 20:53:27,857 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-19 20:53:27,858 INFO L444 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2019-11-19 20:53:27,858 INFO L444 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2019-11-19 20:53:27,858 INFO L444 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2019-11-19 20:53:27,859 INFO L444 ceAbstractionStarter]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:27,859 INFO L444 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:27,859 INFO L444 ceAbstractionStarter]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:27,859 INFO L444 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2019-11-19 20:53:27,860 INFO L444 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2019-11-19 20:53:27,860 INFO L444 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2019-11-19 20:53:27,860 INFO L444 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2019-11-19 20:53:27,860 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2019-11-19 20:53:27,861 INFO L444 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:27,861 INFO L444 ceAbstractionStarter]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:27,861 INFO L444 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:27,862 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2019-11-19 20:53:27,862 INFO L444 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2019-11-19 20:53:27,862 INFO L444 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2019-11-19 20:53:27,862 INFO L444 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2019-11-19 20:53:27,863 INFO L444 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2019-11-19 20:53:27,863 INFO L444 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2019-11-19 20:53:27,863 INFO L444 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2019-11-19 20:53:27,864 INFO L444 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2019-11-19 20:53:27,864 INFO L444 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2019-11-19 20:53:27,864 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2019-11-19 20:53:27,864 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-19 20:53:27,865 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 505) no Hoare annotation was computed. [2019-11-19 20:53:27,865 INFO L444 ceAbstractionStarter]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2019-11-19 20:53:27,865 INFO L444 ceAbstractionStarter]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:27,866 INFO L444 ceAbstractionStarter]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:27,866 INFO L444 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2019-11-19 20:53:27,866 INFO L444 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2019-11-19 20:53:27,866 INFO L444 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2019-11-19 20:53:27,867 INFO L444 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2019-11-19 20:53:27,867 INFO L444 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2019-11-19 20:53:27,867 INFO L444 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2019-11-19 20:53:27,867 INFO L444 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2019-11-19 20:53:27,867 INFO L444 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2019-11-19 20:53:27,868 INFO L444 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2019-11-19 20:53:27,870 INFO L440 ceAbstractionStarter]: At program point L597(lines 29 598) the Hoare annotation is: (let ((.cse6 (= ~a28~0 7)) (.cse11 (<= ~a17~0 8))) (let ((.cse0 (not (= 1 ~a11~0))) (.cse5 (= ~a17~0 8)) (.cse2 (= 10 ~a28~0)) (.cse3 (= ~a21~0 1)) (.cse9 (<= ~a25~0 0)) (.cse8 (<= ~a17~0 7)) (.cse1 (and (not .cse6) .cse11)) (.cse10 (not (= ~a28~0 11))) (.cse7 (= ~a19~0 1)) (.cse4 (= ~a25~0 1))) (or (and .cse0 (<= ~a19~0 0) .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse3 .cse4 .cse0) (and .cse0 .cse5 .cse7 .cse3 .cse4) (and .cse5 .cse7 .cse6 .cse4 .cse0) (and .cse8 .cse7 .cse6 .cse4) (and .cse5 .cse6 .cse9 .cse3) (and .cse7 .cse1 .cse2) (and .cse1 .cse3 .cse9 .cse10) (and .cse8 .cse1 .cse10) (and (and (= ~a28~0 9) .cse11) .cse7 .cse4)))) [2019-11-19 20:53:27,870 INFO L444 ceAbstractionStarter]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:27,870 INFO L444 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:27,870 INFO L444 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2019-11-19 20:53:27,871 INFO L444 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2019-11-19 20:53:27,871 INFO L444 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2019-11-19 20:53:27,871 INFO L444 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2019-11-19 20:53:27,871 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2019-11-19 20:53:27,871 INFO L444 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2019-11-19 20:53:27,872 INFO L447 ceAbstractionStarter]: At program point L600(lines 600 617) the Hoare annotation is: true [2019-11-19 20:53:27,872 INFO L444 ceAbstractionStarter]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:27,872 INFO L444 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:27,872 INFO L444 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2019-11-19 20:53:27,872 INFO L444 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2019-11-19 20:53:27,873 INFO L444 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2019-11-19 20:53:27,873 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2019-11-19 20:53:27,873 INFO L444 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2019-11-19 20:53:27,873 INFO L444 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2019-11-19 20:53:27,873 INFO L444 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2019-11-19 20:53:27,874 INFO L444 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2019-11-19 20:53:27,874 INFO L444 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2019-11-19 20:53:27,874 INFO L444 ceAbstractionStarter]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:27,874 INFO L444 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:27,874 INFO L444 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2019-11-19 20:53:27,875 INFO L444 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2019-11-19 20:53:27,875 INFO L444 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2019-11-19 20:53:27,875 INFO L444 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2019-11-19 20:53:27,875 INFO L444 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2019-11-19 20:53:27,875 INFO L444 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2019-11-19 20:53:27,876 INFO L440 ceAbstractionStarter]: At program point L606-2(lines 606 616) the Hoare annotation is: (let ((.cse6 (= ~a28~0 7)) (.cse11 (<= ~a17~0 8))) (let ((.cse0 (not (= 1 ~a11~0))) (.cse5 (= ~a17~0 8)) (.cse2 (= 10 ~a28~0)) (.cse3 (= ~a21~0 1)) (.cse9 (<= ~a25~0 0)) (.cse8 (<= ~a17~0 7)) (.cse1 (and (not .cse6) .cse11)) (.cse10 (not (= ~a28~0 11))) (.cse7 (= ~a19~0 1)) (.cse4 (= ~a25~0 1))) (or (and .cse0 (<= ~a19~0 0) .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse3 .cse4 .cse0) (and .cse0 .cse5 .cse7 .cse3 .cse4) (and .cse5 .cse7 .cse6 .cse4 .cse0) (and .cse8 .cse7 .cse6 .cse4) (and .cse5 .cse6 .cse9 .cse3) (and .cse7 .cse1 .cse2) (and .cse1 .cse3 .cse9 .cse10) (and .cse8 .cse1 .cse10) (and (and (= ~a28~0 9) .cse11) .cse7 .cse4)))) [2019-11-19 20:53:27,876 INFO L444 ceAbstractionStarter]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:27,876 INFO L444 ceAbstractionStarter]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:27,877 INFO L444 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2019-11-19 20:53:27,877 INFO L444 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2019-11-19 20:53:27,877 INFO L444 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2019-11-19 20:53:27,877 INFO L444 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2019-11-19 20:53:27,877 INFO L444 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2019-11-19 20:53:27,878 INFO L444 ceAbstractionStarter]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:27,878 INFO L444 ceAbstractionStarter]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:27,878 INFO L444 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2019-11-19 20:53:27,878 INFO L444 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2019-11-19 20:53:27,879 INFO L444 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2019-11-19 20:53:27,879 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2019-11-19 20:53:27,879 INFO L444 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2019-11-19 20:53:27,879 INFO L444 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2019-11-19 20:53:27,879 INFO L444 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2019-11-19 20:53:27,880 INFO L444 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2019-11-19 20:53:27,880 INFO L444 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2019-11-19 20:53:27,880 INFO L444 ceAbstractionStarter]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:27,880 INFO L444 ceAbstractionStarter]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:27,880 INFO L444 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2019-11-19 20:53:27,881 INFO L444 ceAbstractionStarter]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:27,881 INFO L444 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2019-11-19 20:53:27,881 INFO L444 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2019-11-19 20:53:27,881 INFO L444 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2019-11-19 20:53:27,881 INFO L444 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2019-11-19 20:53:27,882 INFO L444 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2019-11-19 20:53:27,882 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-19 20:53:27,882 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2019-11-19 20:53:27,882 INFO L444 ceAbstractionStarter]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:27,882 INFO L444 ceAbstractionStarter]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:27,883 INFO L444 ceAbstractionStarter]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:27,883 INFO L444 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2019-11-19 20:53:27,883 INFO L444 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2019-11-19 20:53:27,883 INFO L444 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2019-11-19 20:53:27,883 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2019-11-19 20:53:27,884 INFO L444 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2019-11-19 20:53:27,884 INFO L444 ceAbstractionStarter]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:27,884 INFO L444 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:27,884 INFO L444 ceAbstractionStarter]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:27,884 INFO L444 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2019-11-19 20:53:27,885 INFO L444 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2019-11-19 20:53:27,885 INFO L444 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2019-11-19 20:53:27,885 INFO L444 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2019-11-19 20:53:27,885 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2019-11-19 20:53:27,886 INFO L444 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2019-11-19 20:53:27,886 INFO L444 ceAbstractionStarter]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:27,886 INFO L444 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:27,887 INFO L444 ceAbstractionStarter]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:27,887 INFO L444 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2019-11-19 20:53:27,887 INFO L444 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2019-11-19 20:53:27,887 INFO L444 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2019-11-19 20:53:27,888 INFO L444 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2019-11-19 20:53:27,888 INFO L444 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2019-11-19 20:53:27,888 INFO L444 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2019-11-19 20:53:27,889 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-19 20:53:27,889 INFO L444 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2019-11-19 20:53:27,889 INFO L444 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2019-11-19 20:53:27,889 INFO L444 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:27,890 INFO L444 ceAbstractionStarter]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:27,890 INFO L444 ceAbstractionStarter]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:27,890 INFO L444 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2019-11-19 20:53:27,890 INFO L444 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2019-11-19 20:53:27,891 INFO L444 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2019-11-19 20:53:27,891 INFO L444 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2019-11-19 20:53:27,891 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2019-11-19 20:53:27,892 INFO L444 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:27,892 INFO L444 ceAbstractionStarter]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:27,892 INFO L444 ceAbstractionStarter]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:27,893 INFO L444 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2019-11-19 20:53:27,893 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2019-11-19 20:53:27,893 INFO L444 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2019-11-19 20:53:27,893 INFO L444 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2019-11-19 20:53:27,894 INFO L444 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2019-11-19 20:53:27,894 INFO L444 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2019-11-19 20:53:27,894 INFO L444 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2019-11-19 20:53:27,894 INFO L444 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2019-11-19 20:53:27,894 INFO L444 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2019-11-19 20:53:27,895 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2019-11-19 20:53:27,956 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 08:53:27 BoogieIcfgContainer [2019-11-19 20:53:27,957 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 20:53:27,958 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 20:53:27,958 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 20:53:27,959 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 20:53:27,960 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:53:14" (3/4) ... [2019-11-19 20:53:27,965 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-19 20:53:28,010 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-19 20:53:28,012 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-19 20:53:28,271 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-19 20:53:28,272 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 20:53:28,274 INFO L168 Benchmark]: Toolchain (without parser) took 16015.21 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 428.9 MB). Free memory was 949.6 MB in the beginning and 797.1 MB in the end (delta: 152.6 MB). Peak memory consumption was 581.5 MB. Max. memory is 11.5 GB. [2019-11-19 20:53:28,274 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 20:53:28,275 INFO L168 Benchmark]: CACSL2BoogieTranslator took 700.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -147.1 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. [2019-11-19 20:53:28,275 INFO L168 Benchmark]: Boogie Procedure Inliner took 99.92 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:28,276 INFO L168 Benchmark]: Boogie Preprocessor took 105.20 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 20:53:28,276 INFO L168 Benchmark]: RCFGBuilder took 1430.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 977.7 MB in the end (delta: 112.3 MB). Peak memory consumption was 112.3 MB. Max. memory is 11.5 GB. [2019-11-19 20:53:28,278 INFO L168 Benchmark]: TraceAbstraction took 13359.81 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 300.9 MB). Free memory was 977.7 MB in the beginning and 815.9 MB in the end (delta: 161.8 MB). Peak memory consumption was 462.7 MB. Max. memory is 11.5 GB. [2019-11-19 20:53:28,278 INFO L168 Benchmark]: Witness Printer took 313.91 ms. Allocated memory is still 1.5 GB. Free memory was 815.9 MB in the beginning and 797.1 MB in the end (delta: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. [2019-11-19 20:53:28,280 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 700.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -147.1 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 99.92 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 105.20 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1430.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 977.7 MB in the end (delta: 112.3 MB). Peak memory consumption was 112.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 13359.81 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 300.9 MB). Free memory was 977.7 MB in the beginning and 815.9 MB in the end (delta: 161.8 MB). Peak memory consumption was 462.7 MB. Max. memory is 11.5 GB. * Witness Printer took 313.91 ms. Allocated memory is still 1.5 GB. Free memory was 815.9 MB in the beginning and 797.1 MB in the end (delta: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 505]: 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: 600]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: (((((((((((((!(1 == a11) && a19 <= 0) && !(a28 == 7) && a17 <= 8) && 10 == a28) && a21 == 1) && a25 == 1) || ((((a17 == 8 && a28 == 7) && a21 == 1) && a25 == 1) && !(1 == a11))) || ((((!(1 == a11) && a17 == 8) && a19 == 1) && a21 == 1) && a25 == 1)) || ((((a17 == 8 && a19 == 1) && a28 == 7) && a25 == 1) && !(1 == a11))) || (((a17 <= 7 && a19 == 1) && a28 == 7) && a25 == 1)) || (((a17 == 8 && a28 == 7) && a25 <= 0) && a21 == 1)) || ((a19 == 1 && !(a28 == 7) && a17 <= 8) && 10 == a28)) || ((((!(a28 == 7) && a17 <= 8) && a21 == 1) && a25 <= 0) && !(a28 == 11))) || ((a17 <= 7 && !(a28 == 7) && a17 <= 8) && !(a28 == 11))) || (((a28 == 9 && a17 <= 8) && a19 == 1) && a25 == 1) - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: (((((((((((((!(1 == a11) && a19 <= 0) && !(a28 == 7) && a17 <= 8) && 10 == a28) && a21 == 1) && a25 == 1) || ((((a17 == 8 && a28 == 7) && a21 == 1) && a25 == 1) && !(1 == a11))) || ((((!(1 == a11) && a17 == 8) && a19 == 1) && a21 == 1) && a25 == 1)) || ((((a17 == 8 && a19 == 1) && a28 == 7) && a25 == 1) && !(1 == a11))) || (((a17 <= 7 && a19 == 1) && a28 == 7) && a25 == 1)) || (((a17 == 8 && a28 == 7) && a25 <= 0) && a21 == 1)) || ((a19 == 1 && !(a28 == 7) && a17 <= 8) && 10 == a28)) || ((((!(a28 == 7) && a17 <= 8) && a21 == 1) && a25 <= 0) && !(a28 == 11))) || ((a17 <= 7 && !(a28 == 7) && a17 <= 8) && !(a28 == 11))) || (((a28 == 9 && a17 <= 8) && a19 == 1) && a25 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 227 locations, 1 error locations. Result: SAFE, OverallTime: 13.2s, OverallIterations: 10, TraceHistogramMax: 4, AutomataDifference: 8.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, HoareTripleCheckerStatistics: 983 SDtfs, 2605 SDslu, 251 SDs, 0 SdLazy, 6368 SolverSat, 877 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 290 GetRequests, 257 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1978occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 10 MinimizatonAttempts, 1001 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 59 NumberOfFragments, 335 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1690 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 398 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 1786 NumberOfCodeBlocks, 1786 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1775 ConstructedInterpolants, 0 QuantifiedInterpolants, 1077857 SizeOfPredicates, 7 NumberOfNonLiveVariables, 383 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 11 InterpolantComputations, 9 PerfectInterpolantSequences, 771/891 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...