./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 f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_e55f2ed7-0d47-4362-804f-9a0c40ead389/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_e55f2ed7-0d47-4362-804f-9a0c40ead389/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_e55f2ed7-0d47-4362-804f-9a0c40ead389/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_e55f2ed7-0d47-4362-804f-9a0c40ead389/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_e55f2ed7-0d47-4362-804f-9a0c40ead389/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_e55f2ed7-0d47-4362-804f-9a0c40ead389/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.25-f470102 [2019-12-07 12:08:44,950 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 12:08:44,951 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 12:08:44,959 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 12:08:44,959 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 12:08:44,959 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 12:08:44,960 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 12:08:44,962 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 12:08:44,963 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 12:08:44,963 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 12:08:44,964 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 12:08:44,965 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 12:08:44,965 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 12:08:44,966 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 12:08:44,966 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 12:08:44,967 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 12:08:44,968 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 12:08:44,968 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 12:08:44,970 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 12:08:44,971 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 12:08:44,972 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 12:08:44,973 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 12:08:44,974 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 12:08:44,974 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 12:08:44,976 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 12:08:44,976 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 12:08:44,976 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 12:08:44,977 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 12:08:44,977 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 12:08:44,977 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 12:08:44,978 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 12:08:44,978 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 12:08:44,978 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 12:08:44,979 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 12:08:44,979 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 12:08:44,979 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 12:08:44,980 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 12:08:44,980 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 12:08:44,980 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 12:08:44,981 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 12:08:44,981 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 12:08:44,982 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_e55f2ed7-0d47-4362-804f-9a0c40ead389/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 12:08:44,991 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 12:08:44,991 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 12:08:44,992 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 12:08:44,992 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 12:08:44,992 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 12:08:44,992 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 12:08:44,992 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 12:08:44,993 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 12:08:44,993 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 12:08:44,993 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 12:08:44,993 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 12:08:44,993 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 12:08:44,993 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 12:08:44,993 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 12:08:44,993 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 12:08:44,994 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 12:08:44,994 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 12:08:44,994 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 12:08:44,994 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 12:08:44,994 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 12:08:44,994 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 12:08:44,994 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 12:08:44,994 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 12:08:44,995 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 12:08:44,995 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 12:08:44,995 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 12:08:44,995 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 12:08:44,995 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 12:08:44,995 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 12:08:44,995 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_e55f2ed7-0d47-4362-804f-9a0c40ead389/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-12-07 12:08:45,093 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 12:08:45,102 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 12:08:45,104 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 12:08:45,105 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 12:08:45,105 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 12:08:45,106 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_e55f2ed7-0d47-4362-804f-9a0c40ead389/bin/uautomizer/../../sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c [2019-12-07 12:08:45,143 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e55f2ed7-0d47-4362-804f-9a0c40ead389/bin/uautomizer/data/be95d09e8/28b4d1acfcaf451e805e3f6fff05ece0/FLAGacf2d595d [2019-12-07 12:08:45,589 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 12:08:45,590 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_e55f2ed7-0d47-4362-804f-9a0c40ead389/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c [2019-12-07 12:08:45,595 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e55f2ed7-0d47-4362-804f-9a0c40ead389/bin/uautomizer/data/be95d09e8/28b4d1acfcaf451e805e3f6fff05ece0/FLAGacf2d595d [2019-12-07 12:08:45,603 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_e55f2ed7-0d47-4362-804f-9a0c40ead389/bin/uautomizer/data/be95d09e8/28b4d1acfcaf451e805e3f6fff05ece0 [2019-12-07 12:08:45,605 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 12:08:45,606 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 12:08:45,607 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 12:08:45,607 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 12:08:45,610 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 12:08:45,610 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:08:45" (1/1) ... [2019-12-07 12:08:45,613 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ce49fbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:08:45, skipping insertion in model container [2019-12-07 12:08:45,613 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:08:45" (1/1) ... [2019-12-07 12:08:45,619 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 12:08:45,644 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 12:08:45,803 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:08:45,807 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 12:08:45,834 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:08:45,844 INFO L208 MainTranslator]: Completed translation [2019-12-07 12:08:45,844 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:08:45 WrapperNode [2019-12-07 12:08:45,844 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 12:08:45,845 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 12:08:45,845 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 12:08:45,845 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 12:08:45,850 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:08:45" (1/1) ... [2019-12-07 12:08:45,855 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:08:45" (1/1) ... [2019-12-07 12:08:45,873 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 12:08:45,873 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 12:08:45,873 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 12:08:45,873 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 12:08:45,879 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:08:45" (1/1) ... [2019-12-07 12:08:45,879 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:08:45" (1/1) ... [2019-12-07 12:08:45,880 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:08:45" (1/1) ... [2019-12-07 12:08:45,881 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:08:45" (1/1) ... [2019-12-07 12:08:45,884 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:08:45" (1/1) ... [2019-12-07 12:08:45,885 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:08:45" (1/1) ... [2019-12-07 12:08:45,887 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:08:45" (1/1) ... [2019-12-07 12:08:45,888 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 12:08:45,889 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 12:08:45,889 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 12:08:45,889 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 12:08:45,889 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:08:45" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e55f2ed7-0d47-4362-804f-9a0c40ead389/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-12-07 12:08:45,927 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 12:08:45,927 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 12:08:46,158 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 12:08:46,158 INFO L287 CfgBuilder]: Removed 4 assume(true) statements. [2019-12-07 12:08:46,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:08:46 BoogieIcfgContainer [2019-12-07 12:08:46,159 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 12:08:46,160 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 12:08:46,160 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 12:08:46,162 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 12:08:46,163 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 12:08:45" (1/3) ... [2019-12-07 12:08:46,163 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cc8e1c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:08:46, skipping insertion in model container [2019-12-07 12:08:46,163 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:08:45" (2/3) ... [2019-12-07 12:08:46,164 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cc8e1c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:08:46, skipping insertion in model container [2019-12-07 12:08:46,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:08:46" (3/3) ... [2019-12-07 12:08:46,165 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.v+lhb-reducer.c [2019-12-07 12:08:46,172 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 12:08:46,175 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 18 error locations. [2019-12-07 12:08:46,182 INFO L249 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2019-12-07 12:08:46,197 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 12:08:46,198 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 12:08:46,198 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 12:08:46,198 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 12:08:46,198 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 12:08:46,198 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 12:08:46,198 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 12:08:46,198 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 12:08:46,211 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states. [2019-12-07 12:08:46,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-07 12:08:46,214 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:08:46,214 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:08:46,215 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:08:46,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:08:46,219 INFO L82 PathProgramCache]: Analyzing trace with hash 123910062, now seen corresponding path program 1 times [2019-12-07 12:08:46,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:08:46,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176685166] [2019-12-07 12:08:46,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:08:46,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:08:46,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:08:46,355 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176685166] [2019-12-07 12:08:46,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:08:46,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:08:46,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439827726] [2019-12-07 12:08:46,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:08:46,359 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:08:46,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:08:46,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:08:46,369 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 4 states. [2019-12-07 12:08:46,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:08:46,457 INFO L93 Difference]: Finished difference Result 128 states and 168 transitions. [2019-12-07 12:08:46,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:08:46,458 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-12-07 12:08:46,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:08:46,465 INFO L225 Difference]: With dead ends: 128 [2019-12-07 12:08:46,465 INFO L226 Difference]: Without dead ends: 107 [2019-12-07 12:08:46,467 INFO L630 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-12-07 12:08:46,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-12-07 12:08:46,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 69. [2019-12-07 12:08:46,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-12-07 12:08:46,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2019-12-07 12:08:46,493 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 8 [2019-12-07 12:08:46,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:08:46,494 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2019-12-07 12:08:46,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:08:46,494 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2019-12-07 12:08:46,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-07 12:08:46,494 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:08:46,494 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:08:46,495 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:08:46,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:08:46,495 INFO L82 PathProgramCache]: Analyzing trace with hash 120339118, now seen corresponding path program 1 times [2019-12-07 12:08:46,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:08:46,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166879733] [2019-12-07 12:08:46,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:08:46,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:08:46,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:08:46,518 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166879733] [2019-12-07 12:08:46,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:08:46,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:08:46,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482637306] [2019-12-07 12:08:46,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:08:46,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:08:46,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:08:46,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:08:46,520 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 4 states. [2019-12-07 12:08:46,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:08:46,568 INFO L93 Difference]: Finished difference Result 107 states and 113 transitions. [2019-12-07 12:08:46,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:08:46,569 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-12-07 12:08:46,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:08:46,570 INFO L225 Difference]: With dead ends: 107 [2019-12-07 12:08:46,570 INFO L226 Difference]: Without dead ends: 105 [2019-12-07 12:08:46,571 INFO L630 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-12-07 12:08:46,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-12-07 12:08:46,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 67. [2019-12-07 12:08:46,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-12-07 12:08:46,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2019-12-07 12:08:46,577 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 8 [2019-12-07 12:08:46,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:08:46,577 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2019-12-07 12:08:46,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:08:46,577 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2019-12-07 12:08:46,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 12:08:46,578 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:08:46,578 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:08:46,578 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:08:46,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:08:46,578 INFO L82 PathProgramCache]: Analyzing trace with hash 2031737892, now seen corresponding path program 1 times [2019-12-07 12:08:46,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:08:46,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908158575] [2019-12-07 12:08:46,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:08:46,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:08:46,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:08:46,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908158575] [2019-12-07 12:08:46,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:08:46,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 12:08:46,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651438493] [2019-12-07 12:08:46,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:08:46,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:08:46,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:08:46,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:08:46,622 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 5 states. [2019-12-07 12:08:46,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:08:46,669 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2019-12-07 12:08:46,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:08:46,670 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-12-07 12:08:46,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:08:46,670 INFO L225 Difference]: With dead ends: 67 [2019-12-07 12:08:46,671 INFO L226 Difference]: Without dead ends: 65 [2019-12-07 12:08:46,671 INFO L630 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-12-07 12:08:46,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-12-07 12:08:46,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-12-07 12:08:46,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-12-07 12:08:46,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2019-12-07 12:08:46,677 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 11 [2019-12-07 12:08:46,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:08:46,677 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2019-12-07 12:08:46,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:08:46,678 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2019-12-07 12:08:46,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 12:08:46,678 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:08:46,678 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:08:46,679 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:08:46,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:08:46,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1271153903, now seen corresponding path program 1 times [2019-12-07 12:08:46,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:08:46,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648977971] [2019-12-07 12:08:46,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:08:46,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:08:46,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:08:46,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648977971] [2019-12-07 12:08:46,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:08:46,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 12:08:46,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037403966] [2019-12-07 12:08:46,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:08:46,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:08:46,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:08:46,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:08:46,710 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 5 states. [2019-12-07 12:08:46,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:08:46,760 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2019-12-07 12:08:46,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:08:46,761 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-12-07 12:08:46,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:08:46,761 INFO L225 Difference]: With dead ends: 67 [2019-12-07 12:08:46,761 INFO L226 Difference]: Without dead ends: 65 [2019-12-07 12:08:46,762 INFO L630 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-12-07 12:08:46,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-12-07 12:08:46,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2019-12-07 12:08:46,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-12-07 12:08:46,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2019-12-07 12:08:46,767 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 11 [2019-12-07 12:08:46,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:08:46,767 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2019-12-07 12:08:46,767 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:08:46,767 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2019-12-07 12:08:46,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 12:08:46,768 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:08:46,768 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:08:46,769 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:08:46,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:08:46,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1440630601, now seen corresponding path program 1 times [2019-12-07 12:08:46,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:08:46,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722458530] [2019-12-07 12:08:46,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:08:46,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:08:46,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:08:46,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722458530] [2019-12-07 12:08:46,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:08:46,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:08:46,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867921288] [2019-12-07 12:08:46,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:08:46,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:08:46,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:08:46,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:08:46,800 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 4 states. [2019-12-07 12:08:46,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:08:46,838 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2019-12-07 12:08:46,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:08:46,839 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-12-07 12:08:46,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:08:46,839 INFO L225 Difference]: With dead ends: 65 [2019-12-07 12:08:46,839 INFO L226 Difference]: Without dead ends: 61 [2019-12-07 12:08:46,840 INFO L630 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-12-07 12:08:46,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-12-07 12:08:46,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2019-12-07 12:08:46,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-12-07 12:08:46,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2019-12-07 12:08:46,843 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 12 [2019-12-07 12:08:46,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:08:46,843 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2019-12-07 12:08:46,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:08:46,843 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2019-12-07 12:08:46,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 12:08:46,844 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:08:46,844 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:08:46,844 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:08:46,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:08:46,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1440142029, now seen corresponding path program 1 times [2019-12-07 12:08:46,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:08:46,845 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170803547] [2019-12-07 12:08:46,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:08:46,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:08:46,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:08:46,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170803547] [2019-12-07 12:08:46,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:08:46,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 12:08:46,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608641442] [2019-12-07 12:08:46,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:08:46,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:08:46,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:08:46,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:08:46,882 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 5 states. [2019-12-07 12:08:46,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:08:46,943 INFO L93 Difference]: Finished difference Result 94 states and 100 transitions. [2019-12-07 12:08:46,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:08:46,943 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-12-07 12:08:46,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:08:46,944 INFO L225 Difference]: With dead ends: 94 [2019-12-07 12:08:46,944 INFO L226 Difference]: Without dead ends: 92 [2019-12-07 12:08:46,944 INFO L630 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-12-07 12:08:46,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-12-07 12:08:46,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 57. [2019-12-07 12:08:46,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-12-07 12:08:46,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2019-12-07 12:08:46,948 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 12 [2019-12-07 12:08:46,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:08:46,948 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2019-12-07 12:08:46,948 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:08:46,949 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2019-12-07 12:08:46,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 12:08:46,949 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:08:46,949 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:08:46,949 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:08:46,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:08:46,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1440126141, now seen corresponding path program 1 times [2019-12-07 12:08:46,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:08:46,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12082559] [2019-12-07 12:08:46,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:08:46,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:08:46,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:08:46,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12082559] [2019-12-07 12:08:46,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:08:46,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 12:08:46,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19281984] [2019-12-07 12:08:46,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:08:46,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:08:46,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:08:46,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:08:46,985 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand 5 states. [2019-12-07 12:08:47,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:08:47,043 INFO L93 Difference]: Finished difference Result 99 states and 106 transitions. [2019-12-07 12:08:47,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:08:47,043 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-12-07 12:08:47,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:08:47,044 INFO L225 Difference]: With dead ends: 99 [2019-12-07 12:08:47,044 INFO L226 Difference]: Without dead ends: 97 [2019-12-07 12:08:47,044 INFO L630 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-12-07 12:08:47,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-12-07 12:08:47,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 55. [2019-12-07 12:08:47,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-12-07 12:08:47,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2019-12-07 12:08:47,048 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 12 [2019-12-07 12:08:47,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:08:47,048 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2019-12-07 12:08:47,048 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:08:47,048 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2019-12-07 12:08:47,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 12:08:47,049 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:08:47,049 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:08:47,049 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:08:47,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:08:47,050 INFO L82 PathProgramCache]: Analyzing trace with hash -751061257, now seen corresponding path program 1 times [2019-12-07 12:08:47,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:08:47,050 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560947029] [2019-12-07 12:08:47,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:08:47,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:08:47,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:08:47,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560947029] [2019-12-07 12:08:47,068 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:08:47,068 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:08:47,068 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467935627] [2019-12-07 12:08:47,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:08:47,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:08:47,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:08:47,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:08:47,069 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 4 states. [2019-12-07 12:08:47,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:08:47,102 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2019-12-07 12:08:47,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:08:47,103 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-12-07 12:08:47,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:08:47,103 INFO L225 Difference]: With dead ends: 57 [2019-12-07 12:08:47,103 INFO L226 Difference]: Without dead ends: 53 [2019-12-07 12:08:47,104 INFO L630 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-12-07 12:08:47,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-12-07 12:08:47,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2019-12-07 12:08:47,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-12-07 12:08:47,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2019-12-07 12:08:47,107 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 12 [2019-12-07 12:08:47,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:08:47,107 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2019-12-07 12:08:47,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:08:47,107 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2019-12-07 12:08:47,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 12:08:47,108 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:08:47,108 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:08:47,108 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:08:47,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:08:47,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1694725733, now seen corresponding path program 1 times [2019-12-07 12:08:47,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:08:47,109 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860194524] [2019-12-07 12:08:47,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:08:47,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:08:47,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:08:47,148 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860194524] [2019-12-07 12:08:47,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:08:47,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 12:08:47,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785012346] [2019-12-07 12:08:47,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:08:47,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:08:47,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:08:47,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:08:47,149 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 5 states. [2019-12-07 12:08:47,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:08:47,211 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2019-12-07 12:08:47,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:08:47,211 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-07 12:08:47,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:08:47,212 INFO L225 Difference]: With dead ends: 82 [2019-12-07 12:08:47,212 INFO L226 Difference]: Without dead ends: 80 [2019-12-07 12:08:47,213 INFO L630 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-12-07 12:08:47,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-12-07 12:08:47,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 49. [2019-12-07 12:08:47,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-12-07 12:08:47,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2019-12-07 12:08:47,217 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 13 [2019-12-07 12:08:47,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:08:47,217 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2019-12-07 12:08:47,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:08:47,218 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2019-12-07 12:08:47,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 12:08:47,218 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:08:47,218 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:08:47,219 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:08:47,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:08:47,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1694233189, now seen corresponding path program 1 times [2019-12-07 12:08:47,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:08:47,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099889561] [2019-12-07 12:08:47,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:08:47,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:08:47,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:08:47,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099889561] [2019-12-07 12:08:47,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:08:47,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 12:08:47,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183091405] [2019-12-07 12:08:47,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:08:47,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:08:47,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:08:47,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:08:47,265 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 5 states. [2019-12-07 12:08:47,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:08:47,327 INFO L93 Difference]: Finished difference Result 86 states and 93 transitions. [2019-12-07 12:08:47,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:08:47,327 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-07 12:08:47,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:08:47,328 INFO L225 Difference]: With dead ends: 86 [2019-12-07 12:08:47,328 INFO L226 Difference]: Without dead ends: 84 [2019-12-07 12:08:47,329 INFO L630 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-12-07 12:08:47,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-12-07 12:08:47,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 47. [2019-12-07 12:08:47,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-12-07 12:08:47,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2019-12-07 12:08:47,331 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 13 [2019-12-07 12:08:47,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:08:47,332 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2019-12-07 12:08:47,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:08:47,332 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2019-12-07 12:08:47,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 12:08:47,332 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:08:47,332 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:08:47,333 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:08:47,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:08:47,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1791008026, now seen corresponding path program 1 times [2019-12-07 12:08:47,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:08:47,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018954711] [2019-12-07 12:08:47,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:08:47,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:08:47,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:08:47,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018954711] [2019-12-07 12:08:47,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:08:47,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 12:08:47,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309137074] [2019-12-07 12:08:47,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:08:47,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:08:47,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:08:47,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:08:47,353 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 5 states. [2019-12-07 12:08:47,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:08:47,399 INFO L93 Difference]: Finished difference Result 66 states and 72 transitions. [2019-12-07 12:08:47,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:08:47,400 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-07 12:08:47,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:08:47,400 INFO L225 Difference]: With dead ends: 66 [2019-12-07 12:08:47,400 INFO L226 Difference]: Without dead ends: 64 [2019-12-07 12:08:47,401 INFO L630 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-12-07 12:08:47,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-12-07 12:08:47,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 45. [2019-12-07 12:08:47,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-12-07 12:08:47,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2019-12-07 12:08:47,404 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 13 [2019-12-07 12:08:47,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:08:47,404 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2019-12-07 12:08:47,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:08:47,404 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2019-12-07 12:08:47,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 12:08:47,405 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:08:47,405 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:08:47,405 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:08:47,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:08:47,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1789284122, now seen corresponding path program 1 times [2019-12-07 12:08:47,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:08:47,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733625454] [2019-12-07 12:08:47,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:08:47,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:08:47,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:08:47,448 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733625454] [2019-12-07 12:08:47,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:08:47,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 12:08:47,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773111691] [2019-12-07 12:08:47,448 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:08:47,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:08:47,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:08:47,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:08:47,449 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 6 states. [2019-12-07 12:08:47,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:08:47,486 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2019-12-07 12:08:47,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:08:47,486 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-12-07 12:08:47,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:08:47,487 INFO L225 Difference]: With dead ends: 47 [2019-12-07 12:08:47,487 INFO L226 Difference]: Without dead ends: 45 [2019-12-07 12:08:47,487 INFO L630 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-12-07 12:08:47,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-12-07 12:08:47,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2019-12-07 12:08:47,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-12-07 12:08:47,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2019-12-07 12:08:47,490 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 13 [2019-12-07 12:08:47,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:08:47,491 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2019-12-07 12:08:47,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:08:47,491 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2019-12-07 12:08:47,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 12:08:47,492 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:08:47,492 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:08:47,492 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:08:47,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:08:47,492 INFO L82 PathProgramCache]: Analyzing trace with hash 313330138, now seen corresponding path program 1 times [2019-12-07 12:08:47,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:08:47,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061547952] [2019-12-07 12:08:47,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:08:47,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:08:47,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:08:47,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061547952] [2019-12-07 12:08:47,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:08:47,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 12:08:47,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545535639] [2019-12-07 12:08:47,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:08:47,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:08:47,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:08:47,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:08:47,521 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 5 states. [2019-12-07 12:08:47,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:08:47,565 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2019-12-07 12:08:47,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:08:47,566 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-07 12:08:47,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:08:47,566 INFO L225 Difference]: With dead ends: 59 [2019-12-07 12:08:47,566 INFO L226 Difference]: Without dead ends: 57 [2019-12-07 12:08:47,566 INFO L630 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-12-07 12:08:47,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-12-07 12:08:47,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 41. [2019-12-07 12:08:47,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-12-07 12:08:47,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2019-12-07 12:08:47,568 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 14 [2019-12-07 12:08:47,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:08:47,568 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2019-12-07 12:08:47,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:08:47,569 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2019-12-07 12:08:47,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 12:08:47,569 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:08:47,569 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:08:47,569 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:08:47,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:08:47,570 INFO L82 PathProgramCache]: Analyzing trace with hash 314877283, now seen corresponding path program 1 times [2019-12-07 12:08:47,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:08:47,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544443956] [2019-12-07 12:08:47,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:08:47,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:08:47,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:08:47,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544443956] [2019-12-07 12:08:47,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:08:47,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 12:08:47,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915271071] [2019-12-07 12:08:47,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:08:47,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:08:47,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:08:47,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:08:47,603 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 6 states. [2019-12-07 12:08:47,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:08:47,649 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2019-12-07 12:08:47,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:08:47,649 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-12-07 12:08:47,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:08:47,649 INFO L225 Difference]: With dead ends: 61 [2019-12-07 12:08:47,649 INFO L226 Difference]: Without dead ends: 59 [2019-12-07 12:08:47,650 INFO L630 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-12-07 12:08:47,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-12-07 12:08:47,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 39. [2019-12-07 12:08:47,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-12-07 12:08:47,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-12-07 12:08:47,652 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 14 [2019-12-07 12:08:47,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:08:47,652 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-12-07 12:08:47,652 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:08:47,652 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-12-07 12:08:47,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 12:08:47,653 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:08:47,653 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:08:47,653 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:08:47,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:08:47,653 INFO L82 PathProgramCache]: Analyzing trace with hash 366771218, now seen corresponding path program 1 times [2019-12-07 12:08:47,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:08:47,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956401004] [2019-12-07 12:08:47,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:08:47,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:08:47,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:08:47,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956401004] [2019-12-07 12:08:47,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:08:47,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 12:08:47,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384886340] [2019-12-07 12:08:47,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:08:47,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:08:47,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:08:47,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:08:47,683 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 5 states. [2019-12-07 12:08:47,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:08:47,716 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2019-12-07 12:08:47,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:08:47,717 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-07 12:08:47,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:08:47,717 INFO L225 Difference]: With dead ends: 39 [2019-12-07 12:08:47,717 INFO L226 Difference]: Without dead ends: 35 [2019-12-07 12:08:47,717 INFO L630 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-12-07 12:08:47,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-12-07 12:08:47,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-12-07 12:08:47,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-12-07 12:08:47,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2019-12-07 12:08:47,719 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 14 [2019-12-07 12:08:47,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:08:47,720 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2019-12-07 12:08:47,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:08:47,720 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2019-12-07 12:08:47,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 12:08:47,720 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:08:47,720 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:08:47,721 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:08:47,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:08:47,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1171265312, now seen corresponding path program 1 times [2019-12-07 12:08:47,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:08:47,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541190582] [2019-12-07 12:08:47,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:08:47,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:08:47,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:08:47,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541190582] [2019-12-07 12:08:47,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:08:47,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 12:08:47,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130696995] [2019-12-07 12:08:47,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:08:47,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:08:47,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:08:47,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:08:47,756 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 5 states. [2019-12-07 12:08:47,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:08:47,801 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2019-12-07 12:08:47,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:08:47,801 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-12-07 12:08:47,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:08:47,801 INFO L225 Difference]: With dead ends: 50 [2019-12-07 12:08:47,801 INFO L226 Difference]: Without dead ends: 48 [2019-12-07 12:08:47,802 INFO L630 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-12-07 12:08:47,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-12-07 12:08:47,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 33. [2019-12-07 12:08:47,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-12-07 12:08:47,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-12-07 12:08:47,803 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 15 [2019-12-07 12:08:47,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:08:47,804 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-12-07 12:08:47,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:08:47,804 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-12-07 12:08:47,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 12:08:47,804 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:08:47,804 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:08:47,804 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:08:47,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:08:47,805 INFO L82 PathProgramCache]: Analyzing trace with hash 462679229, now seen corresponding path program 1 times [2019-12-07 12:08:47,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:08:47,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805789732] [2019-12-07 12:08:47,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:08:47,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:08:47,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:08:47,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805789732] [2019-12-07 12:08:47,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:08:47,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 12:08:47,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366429284] [2019-12-07 12:08:47,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:08:47,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:08:47,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:08:47,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:08:47,830 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 6 states. [2019-12-07 12:08:47,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:08:47,883 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2019-12-07 12:08:47,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:08:47,884 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-12-07 12:08:47,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:08:47,885 INFO L225 Difference]: With dead ends: 52 [2019-12-07 12:08:47,885 INFO L226 Difference]: Without dead ends: 50 [2019-12-07 12:08:47,886 INFO L630 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-12-07 12:08:47,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-12-07 12:08:47,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 31. [2019-12-07 12:08:47,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-12-07 12:08:47,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2019-12-07 12:08:47,888 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 16 [2019-12-07 12:08:47,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:08:47,888 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-12-07 12:08:47,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:08:47,888 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2019-12-07 12:08:47,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 12:08:47,889 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:08:47,889 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:08:47,889 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:08:47,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:08:47,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1458158324, now seen corresponding path program 1 times [2019-12-07 12:08:47,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:08:47,889 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952048863] [2019-12-07 12:08:47,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:08:47,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:08:47,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:08:47,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952048863] [2019-12-07 12:08:47,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:08:47,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:08:47,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789893169] [2019-12-07 12:08:47,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:08:47,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:08:47,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:08:47,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:08:47,904 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 4 states. [2019-12-07 12:08:47,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:08:47,927 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2019-12-07 12:08:47,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:08:47,927 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-07 12:08:47,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:08:47,927 INFO L225 Difference]: With dead ends: 33 [2019-12-07 12:08:47,927 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 12:08:47,927 INFO L630 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-12-07 12:08:47,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 12:08:47,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 12:08:47,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 12:08:47,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 12:08:47,928 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2019-12-07 12:08:47,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:08:47,928 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 12:08:47,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:08:47,928 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 12:08:47,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 12:08:47,930 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 12:08:48,125 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 219) no Hoare annotation was computed. [2019-12-07 12:08:48,126 INFO L246 CegarLoopResult]: For program point L27(lines 27 390) no Hoare annotation was computed. [2019-12-07 12:08:48,126 INFO L246 CegarLoopResult]: For program point L283(lines 283 385) no Hoare annotation was computed. [2019-12-07 12:08:48,126 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 67) no Hoare annotation was computed. [2019-12-07 12:08:48,126 INFO L246 CegarLoopResult]: For program point L217(lines 217 239) no Hoare annotation was computed. [2019-12-07 12:08:48,126 INFO L246 CegarLoopResult]: For program point L19(lines 19 391) no Hoare annotation was computed. [2019-12-07 12:08:48,126 INFO L246 CegarLoopResult]: For program point L77(lines 77 87) no Hoare annotation was computed. [2019-12-07 12:08:48,126 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 292) no Hoare annotation was computed. [2019-12-07 12:08:48,126 INFO L246 CegarLoopResult]: For program point L135(lines 135 157) no Hoare annotation was computed. [2019-12-07 12:08:48,126 INFO L246 CegarLoopResult]: For program point L292(line 292) no Hoare annotation was computed. [2019-12-07 12:08:48,126 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 121) no Hoare annotation was computed. [2019-12-07 12:08:48,126 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 12:08:48,126 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-12-07 12:08:48,127 INFO L246 CegarLoopResult]: For program point L119(lines 119 196) no Hoare annotation was computed. [2019-12-07 12:08:48,127 INFO L249 CegarLoopResult]: At program point L309(lines 27 390) the Hoare annotation is: true [2019-12-07 12:08:48,127 INFO L246 CegarLoopResult]: For program point L210(lines 210 245) no Hoare annotation was computed. [2019-12-07 12:08:48,127 INFO L246 CegarLoopResult]: For program point L45(lines 45 248) no Hoare annotation was computed. [2019-12-07 12:08:48,127 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 340) no Hoare annotation was computed. [2019-12-07 12:08:48,127 INFO L246 CegarLoopResult]: For program point L169(lines 169 193) no Hoare annotation was computed. [2019-12-07 12:08:48,127 INFO L246 CegarLoopResult]: For program point L359(lines 359 382) no Hoare annotation was computed. [2019-12-07 12:08:48,127 INFO L246 CegarLoopResult]: For program point L326(lines 326 349) no Hoare annotation was computed. [2019-12-07 12:08:48,127 INFO L246 CegarLoopResult]: For program point L260(lines 260 388) no Hoare annotation was computed. [2019-12-07 12:08:48,127 INFO L246 CegarLoopResult]: For program point L128(lines 128 195) no Hoare annotation was computed. [2019-12-07 12:08:48,127 INFO L246 CegarLoopResult]: For program point L219(line 219) no Hoare annotation was computed. [2019-12-07 12:08:48,127 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 273) no Hoare annotation was computed. [2019-12-07 12:08:48,127 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 109) no Hoare annotation was computed. [2019-12-07 12:08:48,128 INFO L242 CegarLoopResult]: 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-12-07 12:08:48,128 INFO L246 CegarLoopResult]: For program point L79(line 79) no Hoare annotation was computed. [2019-12-07 12:08:48,128 INFO L246 CegarLoopResult]: For program point L302(lines 302 310) no Hoare annotation was computed. [2019-12-07 12:08:48,128 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 328) no Hoare annotation was computed. [2019-12-07 12:08:48,128 INFO L246 CegarLoopResult]: For program point L137(line 137) no Hoare annotation was computed. [2019-12-07 12:08:48,128 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 149) no Hoare annotation was computed. [2019-12-07 12:08:48,128 INFO L246 CegarLoopResult]: For program point L96(lines 96 246) no Hoare annotation was computed. [2019-12-07 12:08:48,128 INFO L246 CegarLoopResult]: For program point L319(lines 319 384) no Hoare annotation was computed. [2019-12-07 12:08:48,128 INFO L246 CegarLoopResult]: For program point L121(line 121) no Hoare annotation was computed. [2019-12-07 12:08:48,128 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION(line 373) no Hoare annotation was computed. [2019-12-07 12:08:48,128 INFO L246 CegarLoopResult]: For program point L47(line 47) no Hoare annotation was computed. [2019-12-07 12:08:48,128 INFO L246 CegarLoopResult]: For program point L171(line 171) no Hoare annotation was computed. [2019-12-07 12:08:48,128 INFO L246 CegarLoopResult]: For program point L361(line 361) no Hoare annotation was computed. [2019-12-07 12:08:48,129 INFO L246 CegarLoopResult]: For program point L328(line 328) no Hoare annotation was computed. [2019-12-07 12:08:48,129 INFO L246 CegarLoopResult]: For program point L229(lines 229 237) no Hoare annotation was computed. [2019-12-07 12:08:48,129 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 137) no Hoare annotation was computed. [2019-12-07 12:08:48,129 INFO L246 CegarLoopResult]: For program point L147(lines 147 155) no Hoare annotation was computed. [2019-12-07 12:08:48,129 INFO L246 CegarLoopResult]: For program point L304(line 304) no Hoare annotation was computed. [2019-12-07 12:08:48,129 INFO L246 CegarLoopResult]: For program point L15(lines 15 396) no Hoare annotation was computed. [2019-12-07 12:08:48,129 INFO L246 CegarLoopResult]: For program point L271(lines 271 386) no Hoare annotation was computed. [2019-12-07 12:08:48,129 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION(line 361) no Hoare annotation was computed. [2019-12-07 12:08:48,129 INFO L249 CegarLoopResult]: At program point L395(lines 10 397) the Hoare annotation is: true [2019-12-07 12:08:48,129 INFO L246 CegarLoopResult]: For program point L65(lines 65 89) no Hoare annotation was computed. [2019-12-07 12:08:48,129 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-12-07 12:08:48,129 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 183) no Hoare annotation was computed. [2019-12-07 12:08:48,129 INFO L242 CegarLoopResult]: 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-12-07 12:08:48,129 INFO L242 CegarLoopResult]: 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-12-07 12:08:48,130 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 47) no Hoare annotation was computed. [2019-12-07 12:08:48,130 INFO L246 CegarLoopResult]: For program point L181(lines 181 191) no Hoare annotation was computed. [2019-12-07 12:08:48,130 INFO L246 CegarLoopResult]: For program point L371(lines 371 380) no Hoare annotation was computed. [2019-12-07 12:08:48,130 INFO L246 CegarLoopResult]: For program point L338(lines 338 347) no Hoare annotation was computed. [2019-12-07 12:08:48,130 INFO L246 CegarLoopResult]: For program point L107(lines 107 198) no Hoare annotation was computed. [2019-12-07 12:08:48,130 INFO L246 CegarLoopResult]: For program point L231(line 231) no Hoare annotation was computed. [2019-12-07 12:08:48,130 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 12:08:48,130 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 171) no Hoare annotation was computed. [2019-12-07 12:08:48,130 INFO L242 CegarLoopResult]: 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-12-07 12:08:48,130 INFO L246 CegarLoopResult]: For program point L149(line 149) no Hoare annotation was computed. [2019-12-07 12:08:48,130 INFO L246 CegarLoopResult]: For program point L273(line 273) no Hoare annotation was computed. [2019-12-07 12:08:48,130 INFO L246 CegarLoopResult]: For program point L100(lines 100 204) no Hoare annotation was computed. [2019-12-07 12:08:48,130 INFO L246 CegarLoopResult]: For program point L67(line 67) no Hoare annotation was computed. [2019-12-07 12:08:48,130 INFO L246 CegarLoopResult]: For program point L34(lines 34 250) no Hoare annotation was computed. [2019-12-07 12:08:48,130 INFO L246 CegarLoopResult]: For program point L290(lines 290 312) no Hoare annotation was computed. [2019-12-07 12:08:48,131 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 231) no Hoare annotation was computed. [2019-12-07 12:08:48,131 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 79) no Hoare annotation was computed. [2019-12-07 12:08:48,131 INFO L246 CegarLoopResult]: For program point L183(line 183) no Hoare annotation was computed. [2019-12-07 12:08:48,131 INFO L246 CegarLoopResult]: For program point L373(line 373) no Hoare annotation was computed. [2019-12-07 12:08:48,131 INFO L246 CegarLoopResult]: For program point L340(line 340) no Hoare annotation was computed. [2019-12-07 12:08:48,131 INFO L246 CegarLoopResult]: For program point L109(line 109) no Hoare annotation was computed. [2019-12-07 12:08:48,131 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 304) no Hoare annotation was computed. [2019-12-07 12:08:48,145 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 12:08:48 BoogieIcfgContainer [2019-12-07 12:08:48,145 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 12:08:48,145 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 12:08:48,145 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 12:08:48,145 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 12:08:48,146 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:08:46" (3/4) ... [2019-12-07 12:08:48,148 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 12:08:48,158 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-12-07 12:08:48,158 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 12:08:48,221 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_e55f2ed7-0d47-4362-804f-9a0c40ead389/bin/uautomizer/witness.graphml [2019-12-07 12:08:48,221 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 12:08:48,223 INFO L168 Benchmark]: Toolchain (without parser) took 2616.22 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 93.8 MB). Free memory was 946.2 MB in the beginning and 883.2 MB in the end (delta: 63.0 MB). Peak memory consumption was 156.9 MB. Max. memory is 11.5 GB. [2019-12-07 12:08:48,223 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:08:48,223 INFO L168 Benchmark]: CACSL2BoogieTranslator took 238.03 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 93.8 MB). Free memory was 946.2 MB in the beginning and 1.1 GB in the end (delta: -142.4 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-12-07 12:08:48,223 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.95 ms. Allocated memory is still 1.1 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-12-07 12:08:48,224 INFO L168 Benchmark]: Boogie Preprocessor took 15.41 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:08:48,224 INFO L168 Benchmark]: RCFGBuilder took 270.60 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 11.5 GB. [2019-12-07 12:08:48,224 INFO L168 Benchmark]: TraceAbstraction took 1985.01 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 895.3 MB in the end (delta: 160.7 MB). Peak memory consumption was 160.7 MB. Max. memory is 11.5 GB. [2019-12-07 12:08:48,224 INFO L168 Benchmark]: Witness Printer took 76.01 ms. Allocated memory is still 1.1 GB. Free memory was 895.3 MB in the beginning and 883.2 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2019-12-07 12:08:48,225 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 238.03 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 93.8 MB). Free memory was 946.2 MB in the beginning and 1.1 GB in the end (delta: -142.4 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 27.95 ms. Allocated memory is still 1.1 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 15.41 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 270.60 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1985.01 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 895.3 MB in the end (delta: 160.7 MB). Peak memory consumption was 160.7 MB. Max. memory is 11.5 GB. * Witness Printer took 76.01 ms. Allocated memory is still 1.1 GB. Free memory was 895.3 MB in the beginning and 883.2 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 67]: 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: 171]: 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: 340]: 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: 109]: 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: 79]: 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: 121]: 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: 149]: 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: 304]: 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: 219]: 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: 1.7s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, HoareTripleCheckerStatistics: 773 SDtfs, 1307 SDslu, 740 SDs, 0 SdLazy, 1080 SolverSat, 123 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 139 GetRequests, 54 SyntacticMatches, 11 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s 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.0s AutomataMinimizationTime, 18 MinimizatonAttempts, 318 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 15 NumberOfFragments, 40 HoareAnnotationTreeSize, 6 FomulaSimplifications, 285942 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 6 FomulaSimplificationsInter, 1102 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.4s 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...