./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_710dd4bd-ed9b-4ce7-a1b7-a34b1b022009/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_710dd4bd-ed9b-4ce7-a1b7-a34b1b022009/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_710dd4bd-ed9b-4ce7-a1b7-a34b1b022009/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_710dd4bd-ed9b-4ce7-a1b7-a34b1b022009/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c -s /tmp/vcloud-vcloud-master/worker/run_dir_710dd4bd-ed9b-4ce7-a1b7-a34b1b022009/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_710dd4bd-ed9b-4ce7-a1b7-a34b1b022009/bin/uautomizer --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 75f71671f83387eb35a445031d63abe79f5c0c7c ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:36:27,967 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:36:27,968 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:36:27,977 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:36:27,978 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:36:27,979 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:36:27,980 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:36:27,982 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:36:27,984 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:36:27,984 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:36:27,985 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:36:27,986 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:36:27,987 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:36:27,988 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:36:27,988 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:36:27,990 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:36:27,990 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:36:27,991 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:36:27,993 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:36:27,995 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:36:27,997 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:36:27,998 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:36:27,999 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:36:28,000 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:36:28,003 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:36:28,003 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:36:28,003 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:36:28,004 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:36:28,005 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:36:28,006 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:36:28,006 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:36:28,007 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:36:28,008 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:36:28,013 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:36:28,014 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:36:28,014 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:36:28,015 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:36:28,015 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:36:28,015 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:36:28,016 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:36:28,017 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:36:28,018 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_710dd4bd-ed9b-4ce7-a1b7-a34b1b022009/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-16 00:36:28,032 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:36:28,033 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:36:28,034 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:36:28,034 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:36:28,035 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:36:28,035 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:36:28,035 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:36:28,035 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:36:28,036 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:36:28,036 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:36:28,036 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-16 00:36:28,036 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:36:28,037 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-16 00:36:28,037 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:36:28,037 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:36:28,037 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:36:28,037 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-16 00:36:28,038 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:36:28,038 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:36:28,038 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:36:28,038 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:36:28,039 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:36:28,039 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:36:28,039 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:36:28,039 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-16 00:36:28,040 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:36:28,040 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-16 00:36:28,040 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-16 00:36:28,040 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_710dd4bd-ed9b-4ce7-a1b7-a34b1b022009/bin/uautomizer 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 -> 75f71671f83387eb35a445031d63abe79f5c0c7c [2019-11-16 00:36:28,067 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:36:28,077 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:36:28,083 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:36:28,085 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:36:28,085 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:36:28,086 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_710dd4bd-ed9b-4ce7-a1b7-a34b1b022009/bin/uautomizer/../../sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c [2019-11-16 00:36:28,146 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_710dd4bd-ed9b-4ce7-a1b7-a34b1b022009/bin/uautomizer/data/e3b71d982/25852ae7f3d34a509acd2555537a9978/FLAG03d56df85 [2019-11-16 00:36:28,553 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:36:28,558 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_710dd4bd-ed9b-4ce7-a1b7-a34b1b022009/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c [2019-11-16 00:36:28,569 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_710dd4bd-ed9b-4ce7-a1b7-a34b1b022009/bin/uautomizer/data/e3b71d982/25852ae7f3d34a509acd2555537a9978/FLAG03d56df85 [2019-11-16 00:36:28,947 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_710dd4bd-ed9b-4ce7-a1b7-a34b1b022009/bin/uautomizer/data/e3b71d982/25852ae7f3d34a509acd2555537a9978 [2019-11-16 00:36:28,950 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:36:28,951 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:36:28,951 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:36:28,952 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:36:28,955 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:36:28,955 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:36:28" (1/1) ... [2019-11-16 00:36:28,957 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23d12a8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:36:28, skipping insertion in model container [2019-11-16 00:36:28,958 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:36:28" (1/1) ... [2019-11-16 00:36:28,964 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:36:29,013 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:36:29,247 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:36:29,251 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:36:29,286 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:36:29,302 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:36:29,303 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:36:29 WrapperNode [2019-11-16 00:36:29,303 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:36:29,303 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:36:29,303 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:36:29,303 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:36:29,310 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:36:29" (1/1) ... [2019-11-16 00:36:29,321 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:36:29" (1/1) ... [2019-11-16 00:36:29,343 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:36:29,344 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:36:29,344 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:36:29,344 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:36:29,351 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:36:29" (1/1) ... [2019-11-16 00:36:29,351 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:36:29" (1/1) ... [2019-11-16 00:36:29,353 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:36:29" (1/1) ... [2019-11-16 00:36:29,353 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:36:29" (1/1) ... [2019-11-16 00:36:29,357 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:36:29" (1/1) ... [2019-11-16 00:36:29,360 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:36:29" (1/1) ... [2019-11-16 00:36:29,362 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:36:29" (1/1) ... [2019-11-16 00:36:29,369 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:36:29,369 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:36:29,370 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:36:29,370 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:36:29,385 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:36:29" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_710dd4bd-ed9b-4ce7-a1b7-a34b1b022009/bin/uautomizer/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-16 00:36:29,437 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:36:29,437 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:36:29,803 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:36:29,803 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-16 00:36:29,804 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:36:29 BoogieIcfgContainer [2019-11-16 00:36:29,804 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:36:29,805 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:36:29,806 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:36:29,808 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:36:29,809 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:36:28" (1/3) ... [2019-11-16 00:36:29,809 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40b04bd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:36:29, skipping insertion in model container [2019-11-16 00:36:29,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:36:29" (2/3) ... [2019-11-16 00:36:29,810 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40b04bd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:36:29, skipping insertion in model container [2019-11-16 00:36:29,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:36:29" (3/3) ... [2019-11-16 00:36:29,812 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.v+lhb-reducer.c [2019-11-16 00:36:29,820 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:36:29,826 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 18 error locations. [2019-11-16 00:36:29,834 INFO L249 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2019-11-16 00:36:29,853 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:36:29,853 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-16 00:36:29,853 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:36:29,854 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:36:29,854 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:36:29,854 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:36:29,854 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:36:29,854 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:36:29,868 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states. [2019-11-16 00:36:29,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-16 00:36:29,873 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:36:29,874 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:36:29,876 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:36:29,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:36:29,881 INFO L82 PathProgramCache]: Analyzing trace with hash 123910062, now seen corresponding path program 1 times [2019-11-16 00:36:29,889 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:36:29,889 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033950366] [2019-11-16 00:36:29,889 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:29,889 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:29,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:36:29,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:36:30,070 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-16 00:36:30,071 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033950366] [2019-11-16 00:36:30,072 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:36:30,072 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:36:30,073 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358935938] [2019-11-16 00:36:30,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:36:30,077 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:36:30,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:36:30,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:36:30,097 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 4 states. [2019-11-16 00:36:30,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:36:30,272 INFO L93 Difference]: Finished difference Result 128 states and 168 transitions. [2019-11-16 00:36:30,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:36:30,273 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-11-16 00:36:30,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:36:30,284 INFO L225 Difference]: With dead ends: 128 [2019-11-16 00:36:30,284 INFO L226 Difference]: Without dead ends: 107 [2019-11-16 00:36:30,287 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:36:30,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-16 00:36:30,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 69. [2019-11-16 00:36:30,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-11-16 00:36:30,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2019-11-16 00:36:30,334 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 8 [2019-11-16 00:36:30,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:36:30,334 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2019-11-16 00:36:30,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:36:30,334 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2019-11-16 00:36:30,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-16 00:36:30,335 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:36:30,335 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:36:30,336 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:36:30,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:36:30,336 INFO L82 PathProgramCache]: Analyzing trace with hash 120339118, now seen corresponding path program 1 times [2019-11-16 00:36:30,336 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:36:30,337 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228474423] [2019-11-16 00:36:30,337 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:30,337 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:30,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:36:30,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:36:30,374 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-16 00:36:30,374 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228474423] [2019-11-16 00:36:30,374 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:36:30,375 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:36:30,375 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033354451] [2019-11-16 00:36:30,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:36:30,376 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:36:30,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:36:30,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:36:30,377 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 4 states. [2019-11-16 00:36:30,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:36:30,457 INFO L93 Difference]: Finished difference Result 107 states and 113 transitions. [2019-11-16 00:36:30,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:36:30,458 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-11-16 00:36:30,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:36:30,459 INFO L225 Difference]: With dead ends: 107 [2019-11-16 00:36:30,459 INFO L226 Difference]: Without dead ends: 105 [2019-11-16 00:36:30,460 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:36:30,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-11-16 00:36:30,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 67. [2019-11-16 00:36:30,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-11-16 00:36:30,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2019-11-16 00:36:30,468 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 8 [2019-11-16 00:36:30,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:36:30,471 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2019-11-16 00:36:30,471 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:36:30,471 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2019-11-16 00:36:30,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-16 00:36:30,472 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:36:30,472 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:36:30,474 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:36:30,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:36:30,474 INFO L82 PathProgramCache]: Analyzing trace with hash 2031737892, now seen corresponding path program 1 times [2019-11-16 00:36:30,474 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:36:30,475 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167442333] [2019-11-16 00:36:30,475 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:30,476 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:30,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:36:30,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:36:30,593 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-16 00:36:30,594 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167442333] [2019-11-16 00:36:30,594 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:36:30,594 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:36:30,594 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17618978] [2019-11-16 00:36:30,595 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:36:30,595 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:36:30,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:36:30,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:36:30,595 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 5 states. [2019-11-16 00:36:30,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:36:30,676 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2019-11-16 00:36:30,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:36:30,676 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-11-16 00:36:30,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:36:30,677 INFO L225 Difference]: With dead ends: 67 [2019-11-16 00:36:30,678 INFO L226 Difference]: Without dead ends: 65 [2019-11-16 00:36:30,678 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:36:30,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-11-16 00:36:30,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-11-16 00:36:30,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-16 00:36:30,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2019-11-16 00:36:30,685 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 11 [2019-11-16 00:36:30,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:36:30,685 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2019-11-16 00:36:30,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:36:30,685 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2019-11-16 00:36:30,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-16 00:36:30,686 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:36:30,686 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:36:30,686 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:36:30,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:36:30,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1271153903, now seen corresponding path program 1 times [2019-11-16 00:36:30,687 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:36:30,687 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830758089] [2019-11-16 00:36:30,687 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:30,688 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:30,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:36:30,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:36:30,739 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-16 00:36:30,739 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830758089] [2019-11-16 00:36:30,739 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:36:30,739 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:36:30,740 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304913436] [2019-11-16 00:36:30,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:36:30,740 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:36:30,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:36:30,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:36:30,741 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 5 states. [2019-11-16 00:36:30,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:36:30,832 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2019-11-16 00:36:30,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:36:30,832 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-11-16 00:36:30,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:36:30,833 INFO L225 Difference]: With dead ends: 67 [2019-11-16 00:36:30,833 INFO L226 Difference]: Without dead ends: 65 [2019-11-16 00:36:30,834 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:36:30,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-11-16 00:36:30,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2019-11-16 00:36:30,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-16 00:36:30,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2019-11-16 00:36:30,840 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 11 [2019-11-16 00:36:30,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:36:30,840 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2019-11-16 00:36:30,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:36:30,841 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2019-11-16 00:36:30,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-16 00:36:30,842 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:36:30,842 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:36:30,842 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:36:30,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:36:30,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1440630601, now seen corresponding path program 1 times [2019-11-16 00:36:30,843 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:36:30,843 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551875652] [2019-11-16 00:36:30,843 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:30,844 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:30,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:36:30,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:36:30,899 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-16 00:36:30,899 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551875652] [2019-11-16 00:36:30,900 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:36:30,900 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:36:30,900 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243252236] [2019-11-16 00:36:30,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:36:30,900 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:36:30,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:36:30,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:36:30,901 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 4 states. [2019-11-16 00:36:30,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:36:30,980 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2019-11-16 00:36:30,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:36:30,981 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-16 00:36:30,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:36:30,982 INFO L225 Difference]: With dead ends: 65 [2019-11-16 00:36:30,982 INFO L226 Difference]: Without dead ends: 61 [2019-11-16 00:36:30,982 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:36:30,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-11-16 00:36:30,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2019-11-16 00:36:30,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-11-16 00:36:30,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2019-11-16 00:36:30,987 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 12 [2019-11-16 00:36:30,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:36:30,988 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2019-11-16 00:36:30,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:36:30,988 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2019-11-16 00:36:30,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-16 00:36:30,993 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:36:30,993 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:36:30,993 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:36:30,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:36:30,994 INFO L82 PathProgramCache]: Analyzing trace with hash -1440142029, now seen corresponding path program 1 times [2019-11-16 00:36:30,994 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:36:30,994 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733436442] [2019-11-16 00:36:30,994 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:30,994 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:30,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:36:31,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:36:31,072 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-16 00:36:31,072 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733436442] [2019-11-16 00:36:31,072 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:36:31,073 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:36:31,073 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124185442] [2019-11-16 00:36:31,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:36:31,073 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:36:31,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:36:31,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:36:31,074 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 5 states. [2019-11-16 00:36:31,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:36:31,158 INFO L93 Difference]: Finished difference Result 94 states and 100 transitions. [2019-11-16 00:36:31,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:36:31,159 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-11-16 00:36:31,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:36:31,160 INFO L225 Difference]: With dead ends: 94 [2019-11-16 00:36:31,160 INFO L226 Difference]: Without dead ends: 92 [2019-11-16 00:36:31,160 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:36:31,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-11-16 00:36:31,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 57. [2019-11-16 00:36:31,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-11-16 00:36:31,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2019-11-16 00:36:31,166 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 12 [2019-11-16 00:36:31,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:36:31,166 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2019-11-16 00:36:31,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:36:31,166 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2019-11-16 00:36:31,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-16 00:36:31,167 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:36:31,167 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:36:31,167 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:36:31,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:36:31,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1440126141, now seen corresponding path program 1 times [2019-11-16 00:36:31,168 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:36:31,168 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854875113] [2019-11-16 00:36:31,168 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:31,169 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:31,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:36:31,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:36:31,221 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-16 00:36:31,221 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854875113] [2019-11-16 00:36:31,221 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:36:31,222 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:36:31,222 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006888587] [2019-11-16 00:36:31,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:36:31,222 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:36:31,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:36:31,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:36:31,223 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand 5 states. [2019-11-16 00:36:31,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:36:31,331 INFO L93 Difference]: Finished difference Result 99 states and 106 transitions. [2019-11-16 00:36:31,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:36:31,332 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-11-16 00:36:31,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:36:31,333 INFO L225 Difference]: With dead ends: 99 [2019-11-16 00:36:31,333 INFO L226 Difference]: Without dead ends: 97 [2019-11-16 00:36:31,334 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:36:31,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-11-16 00:36:31,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 55. [2019-11-16 00:36:31,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-11-16 00:36:31,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2019-11-16 00:36:31,340 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 12 [2019-11-16 00:36:31,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:36:31,340 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2019-11-16 00:36:31,340 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:36:31,340 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2019-11-16 00:36:31,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-16 00:36:31,341 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:36:31,341 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:36:31,342 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:36:31,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:36:31,342 INFO L82 PathProgramCache]: Analyzing trace with hash -751061257, now seen corresponding path program 1 times [2019-11-16 00:36:31,342 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:36:31,343 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615118586] [2019-11-16 00:36:31,343 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:31,343 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:31,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:36:31,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:36:31,383 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-16 00:36:31,383 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615118586] [2019-11-16 00:36:31,383 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:36:31,384 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:36:31,384 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239921553] [2019-11-16 00:36:31,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:36:31,384 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:36:31,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:36:31,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:36:31,385 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 4 states. [2019-11-16 00:36:31,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:36:31,453 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2019-11-16 00:36:31,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:36:31,454 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-16 00:36:31,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:36:31,454 INFO L225 Difference]: With dead ends: 57 [2019-11-16 00:36:31,454 INFO L226 Difference]: Without dead ends: 53 [2019-11-16 00:36:31,455 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:36:31,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-16 00:36:31,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2019-11-16 00:36:31,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-11-16 00:36:31,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2019-11-16 00:36:31,459 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 12 [2019-11-16 00:36:31,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:36:31,460 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2019-11-16 00:36:31,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:36:31,460 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2019-11-16 00:36:31,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-16 00:36:31,461 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:36:31,461 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:36:31,461 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:36:31,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:36:31,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1694725733, now seen corresponding path program 1 times [2019-11-16 00:36:31,462 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:36:31,462 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58926251] [2019-11-16 00:36:31,462 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:31,462 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:31,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:36:31,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:36:31,559 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-16 00:36:31,560 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58926251] [2019-11-16 00:36:31,560 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:36:31,560 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:36:31,560 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493848062] [2019-11-16 00:36:31,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:36:31,561 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:36:31,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:36:31,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:36:31,562 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 5 states. [2019-11-16 00:36:31,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:36:31,670 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2019-11-16 00:36:31,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:36:31,670 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-11-16 00:36:31,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:36:31,671 INFO L225 Difference]: With dead ends: 82 [2019-11-16 00:36:31,671 INFO L226 Difference]: Without dead ends: 80 [2019-11-16 00:36:31,672 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:36:31,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-11-16 00:36:31,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 49. [2019-11-16 00:36:31,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-16 00:36:31,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2019-11-16 00:36:31,677 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 13 [2019-11-16 00:36:31,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:36:31,677 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2019-11-16 00:36:31,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:36:31,677 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2019-11-16 00:36:31,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-16 00:36:31,678 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:36:31,678 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:36:31,679 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:36:31,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:36:31,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1694233189, now seen corresponding path program 1 times [2019-11-16 00:36:31,679 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:36:31,679 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223683639] [2019-11-16 00:36:31,679 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:31,680 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:31,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:36:31,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:36:31,761 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-16 00:36:31,761 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223683639] [2019-11-16 00:36:31,762 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:36:31,762 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:36:31,762 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501977827] [2019-11-16 00:36:31,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:36:31,762 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:36:31,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:36:31,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:36:31,763 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 5 states. [2019-11-16 00:36:31,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:36:31,893 INFO L93 Difference]: Finished difference Result 86 states and 93 transitions. [2019-11-16 00:36:31,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:36:31,895 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-11-16 00:36:31,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:36:31,895 INFO L225 Difference]: With dead ends: 86 [2019-11-16 00:36:31,896 INFO L226 Difference]: Without dead ends: 84 [2019-11-16 00:36:31,896 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:36:31,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-11-16 00:36:31,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 47. [2019-11-16 00:36:31,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-16 00:36:31,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2019-11-16 00:36:31,900 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 13 [2019-11-16 00:36:31,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:36:31,904 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2019-11-16 00:36:31,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:36:31,904 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2019-11-16 00:36:31,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-16 00:36:31,906 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:36:31,907 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:36:31,907 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:36:31,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:36:31,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1791008026, now seen corresponding path program 1 times [2019-11-16 00:36:31,910 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:36:31,910 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788622284] [2019-11-16 00:36:31,910 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:31,910 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:31,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:36:31,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:36:31,964 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-16 00:36:31,964 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788622284] [2019-11-16 00:36:31,965 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:36:31,965 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:36:31,965 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605317998] [2019-11-16 00:36:31,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:36:31,965 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:36:31,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:36:31,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:36:31,966 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 5 states. [2019-11-16 00:36:32,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:36:32,048 INFO L93 Difference]: Finished difference Result 66 states and 72 transitions. [2019-11-16 00:36:32,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:36:32,048 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-11-16 00:36:32,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:36:32,049 INFO L225 Difference]: With dead ends: 66 [2019-11-16 00:36:32,049 INFO L226 Difference]: Without dead ends: 64 [2019-11-16 00:36:32,050 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:36:32,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-16 00:36:32,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 45. [2019-11-16 00:36:32,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-16 00:36:32,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2019-11-16 00:36:32,054 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 13 [2019-11-16 00:36:32,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:36:32,054 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2019-11-16 00:36:32,054 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:36:32,054 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2019-11-16 00:36:32,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-16 00:36:32,055 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:36:32,055 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:36:32,055 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:36:32,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:36:32,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1789284122, now seen corresponding path program 1 times [2019-11-16 00:36:32,056 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:36:32,056 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086623886] [2019-11-16 00:36:32,060 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:32,060 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:32,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:36:32,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:36:32,141 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-16 00:36:32,142 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086623886] [2019-11-16 00:36:32,142 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:36:32,142 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:36:32,142 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953974397] [2019-11-16 00:36:32,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:36:32,143 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:36:32,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:36:32,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:36:32,143 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 6 states. [2019-11-16 00:36:32,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:36:32,213 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2019-11-16 00:36:32,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:36:32,214 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-11-16 00:36:32,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:36:32,214 INFO L225 Difference]: With dead ends: 47 [2019-11-16 00:36:32,215 INFO L226 Difference]: Without dead ends: 45 [2019-11-16 00:36:32,215 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:36:32,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-11-16 00:36:32,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2019-11-16 00:36:32,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-16 00:36:32,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2019-11-16 00:36:32,218 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 13 [2019-11-16 00:36:32,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:36:32,218 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2019-11-16 00:36:32,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:36:32,218 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2019-11-16 00:36:32,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-16 00:36:32,219 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:36:32,219 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:36:32,219 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:36:32,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:36:32,220 INFO L82 PathProgramCache]: Analyzing trace with hash 313330138, now seen corresponding path program 1 times [2019-11-16 00:36:32,220 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:36:32,220 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811235482] [2019-11-16 00:36:32,220 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:32,220 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:32,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:36:32,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:36:32,285 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-16 00:36:32,285 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811235482] [2019-11-16 00:36:32,285 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:36:32,285 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:36:32,285 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84764330] [2019-11-16 00:36:32,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:36:32,286 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:36:32,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:36:32,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:36:32,286 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 5 states. [2019-11-16 00:36:32,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:36:32,380 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2019-11-16 00:36:32,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:36:32,380 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-11-16 00:36:32,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:36:32,381 INFO L225 Difference]: With dead ends: 59 [2019-11-16 00:36:32,381 INFO L226 Difference]: Without dead ends: 57 [2019-11-16 00:36:32,381 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:36:32,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-16 00:36:32,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 41. [2019-11-16 00:36:32,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-16 00:36:32,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2019-11-16 00:36:32,384 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 14 [2019-11-16 00:36:32,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:36:32,384 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2019-11-16 00:36:32,384 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:36:32,384 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2019-11-16 00:36:32,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-16 00:36:32,385 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:36:32,385 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:36:32,386 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:36:32,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:36:32,386 INFO L82 PathProgramCache]: Analyzing trace with hash 314877283, now seen corresponding path program 1 times [2019-11-16 00:36:32,386 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:36:32,386 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737276846] [2019-11-16 00:36:32,386 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:32,386 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:32,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:36:32,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:36:32,438 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-16 00:36:32,438 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737276846] [2019-11-16 00:36:32,439 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:36:32,439 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:36:32,439 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438209563] [2019-11-16 00:36:32,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:36:32,439 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:36:32,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:36:32,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:36:32,439 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 6 states. [2019-11-16 00:36:32,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:36:32,515 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2019-11-16 00:36:32,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:36:32,516 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-11-16 00:36:32,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:36:32,517 INFO L225 Difference]: With dead ends: 61 [2019-11-16 00:36:32,517 INFO L226 Difference]: Without dead ends: 59 [2019-11-16 00:36:32,517 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:36:32,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-16 00:36:32,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 39. [2019-11-16 00:36:32,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-16 00:36:32,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-11-16 00:36:32,520 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 14 [2019-11-16 00:36:32,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:36:32,520 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-11-16 00:36:32,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:36:32,521 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-11-16 00:36:32,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-16 00:36:32,521 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:36:32,521 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:36:32,522 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:36:32,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:36:32,522 INFO L82 PathProgramCache]: Analyzing trace with hash 366771218, now seen corresponding path program 1 times [2019-11-16 00:36:32,522 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:36:32,522 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904806390] [2019-11-16 00:36:32,523 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:32,523 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:32,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:36:32,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:36:32,571 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-16 00:36:32,571 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904806390] [2019-11-16 00:36:32,571 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:36:32,571 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:36:32,572 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217259967] [2019-11-16 00:36:32,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:36:32,572 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:36:32,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:36:32,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:36:32,573 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 5 states. [2019-11-16 00:36:32,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:36:32,638 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2019-11-16 00:36:32,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:36:32,638 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-11-16 00:36:32,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:36:32,639 INFO L225 Difference]: With dead ends: 39 [2019-11-16 00:36:32,639 INFO L226 Difference]: Without dead ends: 35 [2019-11-16 00:36:32,639 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:36:32,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-11-16 00:36:32,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-11-16 00:36:32,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-16 00:36:32,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2019-11-16 00:36:32,642 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 14 [2019-11-16 00:36:32,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:36:32,642 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2019-11-16 00:36:32,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:36:32,643 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2019-11-16 00:36:32,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-16 00:36:32,643 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:36:32,643 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:36:32,644 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:36:32,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:36:32,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1171265312, now seen corresponding path program 1 times [2019-11-16 00:36:32,644 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:36:32,644 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76365877] [2019-11-16 00:36:32,644 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:32,644 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:32,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:36:32,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:36:32,715 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-16 00:36:32,716 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76365877] [2019-11-16 00:36:32,716 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:36:32,716 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:36:32,716 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034225120] [2019-11-16 00:36:32,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:36:32,717 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:36:32,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:36:32,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:36:32,717 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 5 states. [2019-11-16 00:36:32,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:36:32,806 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2019-11-16 00:36:32,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:36:32,807 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-11-16 00:36:32,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:36:32,807 INFO L225 Difference]: With dead ends: 50 [2019-11-16 00:36:32,807 INFO L226 Difference]: Without dead ends: 48 [2019-11-16 00:36:32,808 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:36:32,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-11-16 00:36:32,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 33. [2019-11-16 00:36:32,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-16 00:36:32,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-11-16 00:36:32,811 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 15 [2019-11-16 00:36:32,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:36:32,811 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-11-16 00:36:32,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:36:32,811 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-11-16 00:36:32,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-16 00:36:32,812 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:36:32,812 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:36:32,812 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:36:32,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:36:32,814 INFO L82 PathProgramCache]: Analyzing trace with hash 462679229, now seen corresponding path program 1 times [2019-11-16 00:36:32,815 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:36:32,815 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917615224] [2019-11-16 00:36:32,815 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:32,815 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:32,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:36:32,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:36:32,859 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-16 00:36:32,859 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917615224] [2019-11-16 00:36:32,860 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:36:32,860 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:36:32,860 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702206518] [2019-11-16 00:36:32,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:36:32,860 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:36:32,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:36:32,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:36:32,861 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 6 states. [2019-11-16 00:36:32,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:36:32,954 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2019-11-16 00:36:32,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:36:32,955 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-11-16 00:36:32,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:36:32,958 INFO L225 Difference]: With dead ends: 52 [2019-11-16 00:36:32,958 INFO L226 Difference]: Without dead ends: 50 [2019-11-16 00:36:32,958 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:36:32,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-11-16 00:36:32,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 31. [2019-11-16 00:36:32,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-16 00:36:32,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2019-11-16 00:36:32,962 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 16 [2019-11-16 00:36:32,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:36:32,962 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-11-16 00:36:32,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:36:32,962 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2019-11-16 00:36:32,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-16 00:36:32,963 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:36:32,963 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:36:32,963 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:36:32,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:36:32,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1458158324, now seen corresponding path program 1 times [2019-11-16 00:36:32,963 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:36:32,964 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923379517] [2019-11-16 00:36:32,964 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:32,964 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:32,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:36:32,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:36:32,996 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-16 00:36:32,996 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923379517] [2019-11-16 00:36:32,996 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:36:32,996 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:36:32,996 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493803287] [2019-11-16 00:36:32,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:36:32,997 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:36:32,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:36:32,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:36:32,997 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 4 states. [2019-11-16 00:36:33,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:36:33,046 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2019-11-16 00:36:33,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:36:33,047 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-11-16 00:36:33,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:36:33,047 INFO L225 Difference]: With dead ends: 33 [2019-11-16 00:36:33,047 INFO L226 Difference]: Without dead ends: 0 [2019-11-16 00:36:33,048 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:36:33,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-16 00:36:33,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-16 00:36:33,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-16 00:36:33,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-16 00:36:33,048 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2019-11-16 00:36:33,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:36:33,048 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:36:33,048 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:36:33,049 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-16 00:36:33,049 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-16 00:36:33,054 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-16 00:36:33,387 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 273) no Hoare annotation was computed. [2019-11-16 00:36:33,387 INFO L443 ceAbstractionStarter]: For program point L27(lines 27 390) no Hoare annotation was computed. [2019-11-16 00:36:33,388 INFO L443 ceAbstractionStarter]: For program point L283(lines 283 385) no Hoare annotation was computed. [2019-11-16 00:36:33,388 INFO L443 ceAbstractionStarter]: For program point L217(lines 217 239) no Hoare annotation was computed. [2019-11-16 00:36:33,388 INFO L443 ceAbstractionStarter]: For program point L19(lines 19 391) no Hoare annotation was computed. [2019-11-16 00:36:33,388 INFO L443 ceAbstractionStarter]: For program point L77(lines 77 87) no Hoare annotation was computed. [2019-11-16 00:36:33,388 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 109) no Hoare annotation was computed. [2019-11-16 00:36:33,388 INFO L443 ceAbstractionStarter]: For program point L135(lines 135 157) no Hoare annotation was computed. [2019-11-16 00:36:33,388 INFO L443 ceAbstractionStarter]: For program point L292(line 292) no Hoare annotation was computed. [2019-11-16 00:36:33,388 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 328) no Hoare annotation was computed. [2019-11-16 00:36:33,388 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-16 00:36:33,388 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-16 00:36:33,388 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 196) no Hoare annotation was computed. [2019-11-16 00:36:33,389 INFO L446 ceAbstractionStarter]: At program point L309(lines 27 390) the Hoare annotation is: true [2019-11-16 00:36:33,389 INFO L443 ceAbstractionStarter]: For program point L210(lines 210 245) no Hoare annotation was computed. [2019-11-16 00:36:33,389 INFO L443 ceAbstractionStarter]: For program point L45(lines 45 248) no Hoare annotation was computed. [2019-11-16 00:36:33,389 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 149) no Hoare annotation was computed. [2019-11-16 00:36:33,389 INFO L443 ceAbstractionStarter]: For program point L169(lines 169 193) no Hoare annotation was computed. [2019-11-16 00:36:33,389 INFO L443 ceAbstractionStarter]: For program point L359(lines 359 382) no Hoare annotation was computed. [2019-11-16 00:36:33,389 INFO L443 ceAbstractionStarter]: For program point L326(lines 326 349) no Hoare annotation was computed. [2019-11-16 00:36:33,389 INFO L443 ceAbstractionStarter]: For program point L260(lines 260 388) no Hoare annotation was computed. [2019-11-16 00:36:33,389 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 304) no Hoare annotation was computed. [2019-11-16 00:36:33,389 INFO L443 ceAbstractionStarter]: For program point L128(lines 128 195) no Hoare annotation was computed. [2019-11-16 00:36:33,389 INFO L443 ceAbstractionStarter]: For program point L219(line 219) no Hoare annotation was computed. [2019-11-16 00:36:33,390 INFO L439 ceAbstractionStarter]: At program point L244(lines 96 246) the Hoare annotation is: (and (<= 1 ULTIMATE.start_main_~main__t~0) (<= (+ ULTIMATE.start_main_~main__t~0 1) ULTIMATE.start_main_~main__tagbuf_len~0)) [2019-11-16 00:36:33,390 INFO L443 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-11-16 00:36:33,390 INFO L443 ceAbstractionStarter]: For program point L302(lines 302 310) no Hoare annotation was computed. [2019-11-16 00:36:33,390 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 137) no Hoare annotation was computed. [2019-11-16 00:36:33,390 INFO L443 ceAbstractionStarter]: For program point L137(line 137) no Hoare annotation was computed. [2019-11-16 00:36:33,390 INFO L443 ceAbstractionStarter]: For program point L96(lines 96 246) no Hoare annotation was computed. [2019-11-16 00:36:33,390 INFO L443 ceAbstractionStarter]: For program point L319(lines 319 384) no Hoare annotation was computed. [2019-11-16 00:36:33,390 INFO L443 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-11-16 00:36:33,390 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 183) no Hoare annotation was computed. [2019-11-16 00:36:33,390 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION(line 361) no Hoare annotation was computed. [2019-11-16 00:36:33,390 INFO L443 ceAbstractionStarter]: For program point L47(line 47) no Hoare annotation was computed. [2019-11-16 00:36:33,391 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 47) no Hoare annotation was computed. [2019-11-16 00:36:33,391 INFO L443 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2019-11-16 00:36:33,391 INFO L443 ceAbstractionStarter]: For program point L361(line 361) no Hoare annotation was computed. [2019-11-16 00:36:33,391 INFO L443 ceAbstractionStarter]: For program point L328(line 328) no Hoare annotation was computed. [2019-11-16 00:36:33,391 INFO L443 ceAbstractionStarter]: For program point L229(lines 229 237) no Hoare annotation was computed. [2019-11-16 00:36:33,391 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 171) no Hoare annotation was computed. [2019-11-16 00:36:33,391 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 340) no Hoare annotation was computed. [2019-11-16 00:36:33,391 INFO L443 ceAbstractionStarter]: For program point L147(lines 147 155) no Hoare annotation was computed. [2019-11-16 00:36:33,391 INFO L443 ceAbstractionStarter]: For program point L304(line 304) no Hoare annotation was computed. [2019-11-16 00:36:33,391 INFO L443 ceAbstractionStarter]: For program point L15(lines 15 396) no Hoare annotation was computed. [2019-11-16 00:36:33,391 INFO L443 ceAbstractionStarter]: For program point L271(lines 271 386) no Hoare annotation was computed. [2019-11-16 00:36:33,391 INFO L446 ceAbstractionStarter]: At program point L395(lines 10 397) the Hoare annotation is: true [2019-11-16 00:36:33,392 INFO L443 ceAbstractionStarter]: For program point L65(lines 65 89) no Hoare annotation was computed. [2019-11-16 00:36:33,392 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-16 00:36:33,392 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 231) no Hoare annotation was computed. [2019-11-16 00:36:33,392 INFO L439 ceAbstractionStarter]: At program point L379(lines 277 386) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~main__t~0 1) ULTIMATE.start_main_~main__tagbuf_len~0) (<= 0 ULTIMATE.start_main_~main__t~0) (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~13))) [2019-11-16 00:36:33,392 INFO L439 ceAbstractionStarter]: At program point L346(lines 27 390) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~main__t~0 1) ULTIMATE.start_main_~main__tagbuf_len~0) (<= 0 ULTIMATE.start_main_~main__t~0)) [2019-11-16 00:36:33,392 INFO L443 ceAbstractionStarter]: For program point L181(lines 181 191) no Hoare annotation was computed. [2019-11-16 00:36:33,392 INFO L443 ceAbstractionStarter]: For program point L371(lines 371 380) no Hoare annotation was computed. [2019-11-16 00:36:33,392 INFO L443 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2019-11-16 00:36:33,395 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 79) no Hoare annotation was computed. [2019-11-16 00:36:33,395 INFO L443 ceAbstractionStarter]: For program point L107(lines 107 198) no Hoare annotation was computed. [2019-11-16 00:36:33,396 INFO L443 ceAbstractionStarter]: For program point L231(line 231) no Hoare annotation was computed. [2019-11-16 00:36:33,396 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-16 00:36:33,396 INFO L439 ceAbstractionStarter]: At program point L190(lines 51 248) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0) (<= 1 ULTIMATE.start_main_~main__t~0)) [2019-11-16 00:36:33,396 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 219) no Hoare annotation was computed. [2019-11-16 00:36:33,396 INFO L443 ceAbstractionStarter]: For program point L149(line 149) no Hoare annotation was computed. [2019-11-16 00:36:33,396 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION(line 373) no Hoare annotation was computed. [2019-11-16 00:36:33,397 INFO L443 ceAbstractionStarter]: For program point L273(line 273) no Hoare annotation was computed. [2019-11-16 00:36:33,397 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 67) no Hoare annotation was computed. [2019-11-16 00:36:33,397 INFO L443 ceAbstractionStarter]: For program point L100(lines 100 204) no Hoare annotation was computed. [2019-11-16 00:36:33,397 INFO L443 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-11-16 00:36:33,397 INFO L443 ceAbstractionStarter]: For program point L34(lines 34 250) no Hoare annotation was computed. [2019-11-16 00:36:33,397 INFO L443 ceAbstractionStarter]: For program point L290(lines 290 312) no Hoare annotation was computed. [2019-11-16 00:36:33,397 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 292) no Hoare annotation was computed. [2019-11-16 00:36:33,398 INFO L443 ceAbstractionStarter]: For program point L183(line 183) no Hoare annotation was computed. [2019-11-16 00:36:33,398 INFO L443 ceAbstractionStarter]: For program point L373(line 373) no Hoare annotation was computed. [2019-11-16 00:36:33,398 INFO L443 ceAbstractionStarter]: For program point L340(line 340) no Hoare annotation was computed. [2019-11-16 00:36:33,398 INFO L443 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-11-16 00:36:33,398 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 121) no Hoare annotation was computed. [2019-11-16 00:36:33,421 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:36:33 BoogieIcfgContainer [2019-11-16 00:36:33,421 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-16 00:36:33,422 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:36:33,422 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:36:33,422 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:36:33,422 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:36:29" (3/4) ... [2019-11-16 00:36:33,426 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-16 00:36:33,444 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-16 00:36:33,445 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-16 00:36:33,572 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_710dd4bd-ed9b-4ce7-a1b7-a34b1b022009/bin/uautomizer/witness.graphml [2019-11-16 00:36:33,572 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:36:33,574 INFO L168 Benchmark]: Toolchain (without parser) took 4622.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 951.4 MB in the beginning and 936.3 MB in the end (delta: 15.1 MB). Peak memory consumption was 158.8 MB. Max. memory is 11.5 GB. [2019-11-16 00:36:33,575 INFO L168 Benchmark]: CDTParser took 0.52 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:36:33,575 INFO L168 Benchmark]: CACSL2BoogieTranslator took 351.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -187.0 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. [2019-11-16 00:36:33,576 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.48 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:36:33,577 INFO L168 Benchmark]: Boogie Preprocessor took 25.18 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-16 00:36:33,578 INFO L168 Benchmark]: RCFGBuilder took 435.19 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: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. [2019-11-16 00:36:33,578 INFO L168 Benchmark]: TraceAbstraction took 3615.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 943.3 MB in the end (delta: 162.0 MB). Peak memory consumption was 162.0 MB. Max. memory is 11.5 GB. [2019-11-16 00:36:33,578 INFO L168 Benchmark]: Witness Printer took 150.70 ms. Allocated memory is still 1.2 GB. Free memory was 943.3 MB in the beginning and 936.3 MB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-11-16 00:36:33,581 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.52 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 351.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -187.0 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 40.48 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.18 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 435.19 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: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3615.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 943.3 MB in the end (delta: 162.0 MB). Peak memory consumption was 162.0 MB. Max. memory is 11.5 GB. * Witness Printer took 150.70 ms. Allocated memory is still 1.2 GB. Free memory was 943.3 MB in the beginning and 936.3 MB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 340]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 47]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 67]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 361]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 171]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 219]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 183]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 79]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 149]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 109]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 137]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 121]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 273]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 373]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 231]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 328]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 292]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 304]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 277]: Loop Invariant Derived loop invariant: (main__t + 1 <= main__tagbuf_len && 0 <= main__t) && !(0 == __VERIFIER_assert__cond) - InvariantResult [Line: 51]: Loop Invariant Derived loop invariant: main__t <= main__tagbuf_len && 1 <= main__t - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: main__t + 1 <= main__tagbuf_len && 0 <= main__t - InvariantResult [Line: 96]: Loop Invariant Derived loop invariant: 1 <= main__t && main__t + 1 <= main__tagbuf_len - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 75 locations, 18 error locations. Result: SAFE, OverallTime: 3.5s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, HoareTripleCheckerStatistics: 773 SDtfs, 1307 SDslu, 740 SDs, 0 SdLazy, 1080 SolverSat, 123 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 139 GetRequests, 54 SyntacticMatches, 11 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=75occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 318 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 15 NumberOfFragments, 40 HoareAnnotationTreeSize, 6 FomulaSimplifications, 285889 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 6 FomulaSimplificationsInter, 1102 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 228 NumberOfCodeBlocks, 228 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 210 ConstructedInterpolants, 0 QuantifiedInterpolants, 7087 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 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...