./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 54858612 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5b57e964dbb610d8a39ef60225ec1dbb75ce4568 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-5485861 [2020-10-25 22:21:52,771 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-25 22:21:52,776 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-25 22:21:52,819 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-25 22:21:52,820 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-25 22:21:52,821 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-25 22:21:52,823 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-25 22:21:52,826 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-25 22:21:52,829 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-25 22:21:52,830 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-25 22:21:52,832 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-25 22:21:52,833 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-25 22:21:52,834 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-25 22:21:52,836 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-25 22:21:52,837 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-25 22:21:52,842 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-25 22:21:52,844 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-25 22:21:52,845 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-25 22:21:52,848 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-25 22:21:52,851 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-25 22:21:52,853 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-25 22:21:52,855 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-25 22:21:52,857 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-25 22:21:52,858 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-25 22:21:52,862 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-25 22:21:52,863 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-25 22:21:52,863 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-25 22:21:52,865 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-25 22:21:52,865 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-25 22:21:52,867 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-25 22:21:52,868 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-25 22:21:52,869 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-25 22:21:52,870 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-25 22:21:52,871 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-25 22:21:52,873 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-25 22:21:52,873 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-25 22:21:52,874 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-25 22:21:52,875 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-25 22:21:52,875 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-25 22:21:52,877 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-25 22:21:52,878 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-25 22:21:52,879 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-25 22:21:52,912 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-25 22:21:52,913 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-25 22:21:52,915 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-25 22:21:52,917 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-25 22:21:52,917 INFO L138 SettingsManager]: * Use SBE=true [2020-10-25 22:21:52,918 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-25 22:21:52,918 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-25 22:21:52,918 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-25 22:21:52,919 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-25 22:21:52,919 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-25 22:21:52,920 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-25 22:21:52,921 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-25 22:21:52,921 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-25 22:21:52,921 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-25 22:21:52,922 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-25 22:21:52,922 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-25 22:21:52,922 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-25 22:21:52,923 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-25 22:21:52,923 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-25 22:21:52,923 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-25 22:21:52,923 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-25 22:21:52,924 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-25 22:21:52,924 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-25 22:21:52,924 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-25 22:21:52,925 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-25 22:21:52,925 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-25 22:21:52,925 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-25 22:21:52,926 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-25 22:21:52,926 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-25 22:21:52,926 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_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 -> 5b57e964dbb610d8a39ef60225ec1dbb75ce4568 [2020-10-25 22:21:53,412 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-25 22:21:53,478 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-25 22:21:53,482 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-25 22:21:53,484 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-25 22:21:53,485 INFO L275 PluginConnector]: CDTParser initialized [2020-10-25 22:21:53,487 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c [2020-10-25 22:21:53,599 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77a83f436/a8e589f9b72a4c1b86c354f30d75e267/FLAG41f2b17ea [2020-10-25 22:21:54,291 INFO L306 CDTParser]: Found 1 translation units. [2020-10-25 22:21:54,291 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c [2020-10-25 22:21:54,307 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77a83f436/a8e589f9b72a4c1b86c354f30d75e267/FLAG41f2b17ea [2020-10-25 22:21:54,650 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77a83f436/a8e589f9b72a4c1b86c354f30d75e267 [2020-10-25 22:21:54,654 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-25 22:21:54,664 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-25 22:21:54,670 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-25 22:21:54,671 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-25 22:21:54,675 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-25 22:21:54,677 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 10:21:54" (1/1) ... [2020-10-25 22:21:54,681 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e72779f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:21:54, skipping insertion in model container [2020-10-25 22:21:54,681 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 10:21:54" (1/1) ... [2020-10-25 22:21:54,691 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-25 22:21:54,761 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-25 22:21:55,007 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-25 22:21:55,026 INFO L203 MainTranslator]: Completed pre-run [2020-10-25 22:21:55,072 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-25 22:21:55,091 INFO L208 MainTranslator]: Completed translation [2020-10-25 22:21:55,092 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:21:55 WrapperNode [2020-10-25 22:21:55,092 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-25 22:21:55,094 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-25 22:21:55,094 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-25 22:21:55,094 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-25 22:21:55,104 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:21:55" (1/1) ... [2020-10-25 22:21:55,122 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:21:55" (1/1) ... [2020-10-25 22:21:55,158 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-25 22:21:55,159 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-25 22:21:55,159 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-25 22:21:55,160 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-25 22:21:55,170 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:21:55" (1/1) ... [2020-10-25 22:21:55,170 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:21:55" (1/1) ... [2020-10-25 22:21:55,173 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:21:55" (1/1) ... [2020-10-25 22:21:55,174 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:21:55" (1/1) ... [2020-10-25 22:21:55,180 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:21:55" (1/1) ... [2020-10-25 22:21:55,184 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:21:55" (1/1) ... [2020-10-25 22:21:55,186 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:21:55" (1/1) ... [2020-10-25 22:21:55,191 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-25 22:21:55,192 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-25 22:21:55,192 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-25 22:21:55,192 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-25 22:21:55,193 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:21:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-25 22:21:55,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-25 22:21:55,316 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-25 22:21:55,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-25 22:21:55,317 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-25 22:21:56,005 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-25 22:21:56,011 INFO L298 CfgBuilder]: Removed 40 assume(true) statements. [2020-10-25 22:21:56,015 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 10:21:56 BoogieIcfgContainer [2020-10-25 22:21:56,015 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-25 22:21:56,017 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-25 22:21:56,018 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-25 22:21:56,022 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-25 22:21:56,022 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 10:21:54" (1/3) ... [2020-10-25 22:21:56,023 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ff41163 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 10:21:56, skipping insertion in model container [2020-10-25 22:21:56,023 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 10:21:55" (2/3) ... [2020-10-25 22:21:56,024 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ff41163 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 10:21:56, skipping insertion in model container [2020-10-25 22:21:56,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 10:21:56" (3/3) ... [2020-10-25 22:21:56,026 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.v+lhb-reducer.c [2020-10-25 22:21:56,040 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-25 22:21:56,045 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 18 error locations. [2020-10-25 22:21:56,060 INFO L253 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2020-10-25 22:21:56,092 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-25 22:21:56,092 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-25 22:21:56,092 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-25 22:21:56,093 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-25 22:21:56,093 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-25 22:21:56,093 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-25 22:21:56,093 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-25 22:21:56,093 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-25 22:21:56,117 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states. [2020-10-25 22:21:56,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-10-25 22:21:56,123 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:21:56,124 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:21:56,125 INFO L429 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]=== [2020-10-25 22:21:56,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:21:56,132 INFO L82 PathProgramCache]: Analyzing trace with hash 124587310, now seen corresponding path program 1 times [2020-10-25 22:21:56,142 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:21:56,142 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500818307] [2020-10-25 22:21:56,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:21:56,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:21:56,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:21:56,433 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500818307] [2020-10-25 22:21:56,434 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:21:56,434 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 22:21:56,436 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458292348] [2020-10-25 22:21:56,443 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 22:21:56,443 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:21:56,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 22:21:56,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 22:21:56,470 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 4 states. [2020-10-25 22:21:56,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:21:56,713 INFO L93 Difference]: Finished difference Result 141 states and 182 transitions. [2020-10-25 22:21:56,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-25 22:21:56,715 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-10-25 22:21:56,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:21:56,727 INFO L225 Difference]: With dead ends: 141 [2020-10-25 22:21:56,727 INFO L226 Difference]: Without dead ends: 107 [2020-10-25 22:21:56,731 INFO L677 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 [2020-10-25 22:21:56,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2020-10-25 22:21:56,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 69. [2020-10-25 22:21:56,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-10-25 22:21:56,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2020-10-25 22:21:56,785 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 8 [2020-10-25 22:21:56,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:21:56,785 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2020-10-25 22:21:56,786 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 22:21:56,786 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2020-10-25 22:21:56,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-10-25 22:21:56,786 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:21:56,787 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:21:56,787 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-25 22:21:56,788 INFO L429 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]=== [2020-10-25 22:21:56,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:21:56,789 INFO L82 PathProgramCache]: Analyzing trace with hash 120339118, now seen corresponding path program 1 times [2020-10-25 22:21:56,790 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:21:56,790 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200708874] [2020-10-25 22:21:56,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:21:56,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:21:56,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:21:56,916 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200708874] [2020-10-25 22:21:56,916 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:21:56,917 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 22:21:56,917 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896385925] [2020-10-25 22:21:56,919 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 22:21:56,923 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:21:56,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 22:21:56,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 22:21:56,925 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 4 states. [2020-10-25 22:21:57,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:21:57,083 INFO L93 Difference]: Finished difference Result 107 states and 113 transitions. [2020-10-25 22:21:57,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-25 22:21:57,085 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-10-25 22:21:57,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:21:57,089 INFO L225 Difference]: With dead ends: 107 [2020-10-25 22:21:57,089 INFO L226 Difference]: Without dead ends: 105 [2020-10-25 22:21:57,091 INFO L677 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 [2020-10-25 22:21:57,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2020-10-25 22:21:57,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 67. [2020-10-25 22:21:57,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-10-25 22:21:57,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2020-10-25 22:21:57,126 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 8 [2020-10-25 22:21:57,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:21:57,127 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2020-10-25 22:21:57,127 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 22:21:57,127 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2020-10-25 22:21:57,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-25 22:21:57,130 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:21:57,130 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:21:57,131 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-25 22:21:57,131 INFO L429 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]=== [2020-10-25 22:21:57,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:21:57,132 INFO L82 PathProgramCache]: Analyzing trace with hash 734727036, now seen corresponding path program 1 times [2020-10-25 22:21:57,132 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:21:57,133 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974982923] [2020-10-25 22:21:57,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:21:57,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:21:57,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:21:57,230 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974982923] [2020-10-25 22:21:57,231 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:21:57,231 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-25 22:21:57,231 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137865534] [2020-10-25 22:21:57,232 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-25 22:21:57,232 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:21:57,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-25 22:21:57,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-25 22:21:57,234 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 5 states. [2020-10-25 22:21:57,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:21:57,381 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2020-10-25 22:21:57,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-25 22:21:57,382 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-10-25 22:21:57,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:21:57,383 INFO L225 Difference]: With dead ends: 69 [2020-10-25 22:21:57,383 INFO L226 Difference]: Without dead ends: 67 [2020-10-25 22:21:57,384 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-25 22:21:57,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-10-25 22:21:57,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2020-10-25 22:21:57,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-10-25 22:21:57,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2020-10-25 22:21:57,402 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 11 [2020-10-25 22:21:57,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:21:57,403 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2020-10-25 22:21:57,403 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-25 22:21:57,404 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2020-10-25 22:21:57,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-25 22:21:57,404 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:21:57,405 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:21:57,405 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-25 22:21:57,405 INFO L429 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]=== [2020-10-25 22:21:57,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:21:57,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1269245293, now seen corresponding path program 1 times [2020-10-25 22:21:57,407 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:21:57,407 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290650921] [2020-10-25 22:21:57,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:21:57,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:21:57,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:21:57,471 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290650921] [2020-10-25 22:21:57,471 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:21:57,471 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-25 22:21:57,471 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395440377] [2020-10-25 22:21:57,472 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-25 22:21:57,472 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:21:57,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-25 22:21:57,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-25 22:21:57,474 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 5 states. [2020-10-25 22:21:57,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:21:57,604 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2020-10-25 22:21:57,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-25 22:21:57,605 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-10-25 22:21:57,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:21:57,606 INFO L225 Difference]: With dead ends: 67 [2020-10-25 22:21:57,607 INFO L226 Difference]: Without dead ends: 65 [2020-10-25 22:21:57,607 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-25 22:21:57,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-10-25 22:21:57,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2020-10-25 22:21:57,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-10-25 22:21:57,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2020-10-25 22:21:57,615 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 11 [2020-10-25 22:21:57,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:21:57,615 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2020-10-25 22:21:57,615 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-25 22:21:57,616 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2020-10-25 22:21:57,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-25 22:21:57,617 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:21:57,617 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:21:57,617 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-25 22:21:57,618 INFO L429 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]=== [2020-10-25 22:21:57,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:21:57,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1301707833, now seen corresponding path program 1 times [2020-10-25 22:21:57,619 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:21:57,619 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452943053] [2020-10-25 22:21:57,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:21:57,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:21:57,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:21:57,683 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452943053] [2020-10-25 22:21:57,683 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:21:57,684 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 22:21:57,684 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645256110] [2020-10-25 22:21:57,684 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 22:21:57,685 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:21:57,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 22:21:57,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 22:21:57,686 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 4 states. [2020-10-25 22:21:57,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:21:57,774 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2020-10-25 22:21:57,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 22:21:57,775 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-10-25 22:21:57,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:21:57,776 INFO L225 Difference]: With dead ends: 65 [2020-10-25 22:21:57,776 INFO L226 Difference]: Without dead ends: 61 [2020-10-25 22:21:57,777 INFO L677 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 [2020-10-25 22:21:57,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-10-25 22:21:57,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2020-10-25 22:21:57,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-10-25 22:21:57,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2020-10-25 22:21:57,785 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 12 [2020-10-25 22:21:57,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:21:57,785 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2020-10-25 22:21:57,786 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 22:21:57,786 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2020-10-25 22:21:57,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-25 22:21:57,787 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:21:57,787 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:21:57,787 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-25 22:21:57,788 INFO L429 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]=== [2020-10-25 22:21:57,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:21:57,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1302317555, now seen corresponding path program 1 times [2020-10-25 22:21:57,789 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:21:57,789 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927962996] [2020-10-25 22:21:57,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:21:57,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:21:57,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:21:57,844 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927962996] [2020-10-25 22:21:57,845 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:21:57,845 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-25 22:21:57,845 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980604669] [2020-10-25 22:21:57,845 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-25 22:21:57,846 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:21:57,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-25 22:21:57,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-25 22:21:57,847 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 5 states. [2020-10-25 22:21:58,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:21:58,017 INFO L93 Difference]: Finished difference Result 95 states and 101 transitions. [2020-10-25 22:21:58,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-25 22:21:58,017 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-25 22:21:58,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:21:58,019 INFO L225 Difference]: With dead ends: 95 [2020-10-25 22:21:58,019 INFO L226 Difference]: Without dead ends: 93 [2020-10-25 22:21:58,020 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-25 22:21:58,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-10-25 22:21:58,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 57. [2020-10-25 22:21:58,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-10-25 22:21:58,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2020-10-25 22:21:58,026 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 12 [2020-10-25 22:21:58,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:21:58,027 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2020-10-25 22:21:58,027 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-25 22:21:58,027 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2020-10-25 22:21:58,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-25 22:21:58,028 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:21:58,028 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:21:58,029 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-25 22:21:58,029 INFO L429 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]=== [2020-10-25 22:21:58,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:21:58,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1302337415, now seen corresponding path program 1 times [2020-10-25 22:21:58,030 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:21:58,031 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168378004] [2020-10-25 22:21:58,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:21:58,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:21:58,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:21:58,094 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168378004] [2020-10-25 22:21:58,095 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:21:58,095 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-25 22:21:58,095 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443452954] [2020-10-25 22:21:58,095 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-25 22:21:58,095 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:21:58,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-25 22:21:58,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-25 22:21:58,096 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand 5 states. [2020-10-25 22:21:58,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:21:58,299 INFO L93 Difference]: Finished difference Result 100 states and 107 transitions. [2020-10-25 22:21:58,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-25 22:21:58,300 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-25 22:21:58,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:21:58,301 INFO L225 Difference]: With dead ends: 100 [2020-10-25 22:21:58,301 INFO L226 Difference]: Without dead ends: 98 [2020-10-25 22:21:58,305 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-25 22:21:58,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-10-25 22:21:58,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 55. [2020-10-25 22:21:58,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-10-25 22:21:58,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2020-10-25 22:21:58,321 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 12 [2020-10-25 22:21:58,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:21:58,322 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2020-10-25 22:21:58,322 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-25 22:21:58,322 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2020-10-25 22:21:58,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-25 22:21:58,323 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:21:58,323 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:21:58,323 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-25 22:21:58,324 INFO L429 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]=== [2020-10-25 22:21:58,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:21:58,327 INFO L82 PathProgramCache]: Analyzing trace with hash -691892359, now seen corresponding path program 1 times [2020-10-25 22:21:58,327 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:21:58,327 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807690954] [2020-10-25 22:21:58,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:21:58,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:21:58,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:21:58,406 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807690954] [2020-10-25 22:21:58,406 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:21:58,406 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 22:21:58,407 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209282014] [2020-10-25 22:21:58,410 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 22:21:58,410 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:21:58,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 22:21:58,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 22:21:58,411 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 4 states. [2020-10-25 22:21:58,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:21:58,488 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2020-10-25 22:21:58,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 22:21:58,489 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-10-25 22:21:58,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:21:58,490 INFO L225 Difference]: With dead ends: 57 [2020-10-25 22:21:58,490 INFO L226 Difference]: Without dead ends: 53 [2020-10-25 22:21:58,491 INFO L677 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 [2020-10-25 22:21:58,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-10-25 22:21:58,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2020-10-25 22:21:58,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-10-25 22:21:58,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2020-10-25 22:21:58,502 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 12 [2020-10-25 22:21:58,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:21:58,503 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2020-10-25 22:21:58,503 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 22:21:58,504 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2020-10-25 22:21:58,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-25 22:21:58,505 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:21:58,505 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:21:58,505 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-25 22:21:58,506 INFO L429 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]=== [2020-10-25 22:21:58,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:21:58,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1717144761, now seen corresponding path program 1 times [2020-10-25 22:21:58,509 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:21:58,509 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321610846] [2020-10-25 22:21:58,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:21:58,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:21:58,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:21:58,657 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321610846] [2020-10-25 22:21:58,658 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:21:58,658 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-25 22:21:58,658 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865627882] [2020-10-25 22:21:58,658 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-25 22:21:58,659 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:21:58,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-25 22:21:58,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-25 22:21:58,660 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 6 states. [2020-10-25 22:21:58,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:21:58,824 INFO L93 Difference]: Finished difference Result 118 states and 127 transitions. [2020-10-25 22:21:58,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-25 22:21:58,825 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-10-25 22:21:58,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:21:58,826 INFO L225 Difference]: With dead ends: 118 [2020-10-25 22:21:58,827 INFO L226 Difference]: Without dead ends: 116 [2020-10-25 22:21:58,827 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-25 22:21:58,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2020-10-25 22:21:58,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 56. [2020-10-25 22:21:58,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-10-25 22:21:58,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2020-10-25 22:21:58,834 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 13 [2020-10-25 22:21:58,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:21:58,835 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2020-10-25 22:21:58,835 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-25 22:21:58,835 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2020-10-25 22:21:58,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-25 22:21:58,836 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:21:58,837 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:21:58,837 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-25 22:21:58,837 INFO L429 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]=== [2020-10-25 22:21:58,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:21:58,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1717760441, now seen corresponding path program 1 times [2020-10-25 22:21:58,839 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:21:58,839 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641790783] [2020-10-25 22:21:58,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:21:58,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:21:58,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:21:58,997 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641790783] [2020-10-25 22:21:58,997 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:21:58,997 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-25 22:21:58,998 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174432058] [2020-10-25 22:21:58,998 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-25 22:21:58,998 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:21:58,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-25 22:21:59,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-25 22:21:59,000 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand 6 states. [2020-10-25 22:21:59,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:21:59,223 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2020-10-25 22:21:59,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-25 22:21:59,224 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-10-25 22:21:59,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:21:59,225 INFO L225 Difference]: With dead ends: 116 [2020-10-25 22:21:59,225 INFO L226 Difference]: Without dead ends: 114 [2020-10-25 22:21:59,226 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-25 22:21:59,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2020-10-25 22:21:59,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 58. [2020-10-25 22:21:59,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-10-25 22:21:59,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2020-10-25 22:21:59,231 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 13 [2020-10-25 22:21:59,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:21:59,231 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2020-10-25 22:21:59,231 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-25 22:21:59,232 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2020-10-25 22:21:59,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-25 22:21:59,232 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:21:59,232 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:21:59,232 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-25 22:21:59,233 INFO L429 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]=== [2020-10-25 22:21:59,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:21:59,233 INFO L82 PathProgramCache]: Analyzing trace with hash 46983468, now seen corresponding path program 1 times [2020-10-25 22:21:59,234 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:21:59,234 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445080077] [2020-10-25 22:21:59,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:21:59,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:21:59,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:21:59,274 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445080077] [2020-10-25 22:21:59,274 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:21:59,275 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-25 22:21:59,275 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614938721] [2020-10-25 22:21:59,275 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-25 22:21:59,275 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:21:59,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-25 22:21:59,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-25 22:21:59,276 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand 5 states. [2020-10-25 22:21:59,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:21:59,384 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2020-10-25 22:21:59,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-25 22:21:59,384 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-25 22:21:59,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:21:59,385 INFO L225 Difference]: With dead ends: 76 [2020-10-25 22:21:59,385 INFO L226 Difference]: Without dead ends: 74 [2020-10-25 22:21:59,386 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-25 22:21:59,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-10-25 22:21:59,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 56. [2020-10-25 22:21:59,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-10-25 22:21:59,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2020-10-25 22:21:59,390 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 13 [2020-10-25 22:21:59,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:21:59,391 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2020-10-25 22:21:59,391 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-25 22:21:59,391 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2020-10-25 22:21:59,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-25 22:21:59,391 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:21:59,392 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:21:59,392 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-25 22:21:59,392 INFO L429 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]=== [2020-10-25 22:21:59,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:21:59,392 INFO L82 PathProgramCache]: Analyzing trace with hash 49076780, now seen corresponding path program 1 times [2020-10-25 22:21:59,393 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:21:59,393 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954739277] [2020-10-25 22:21:59,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:21:59,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:21:59,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:21:59,446 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954739277] [2020-10-25 22:21:59,446 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:21:59,447 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-25 22:21:59,447 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263419111] [2020-10-25 22:21:59,447 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-25 22:21:59,447 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:21:59,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-25 22:21:59,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-25 22:21:59,448 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand 5 states. [2020-10-25 22:21:59,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:21:59,552 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2020-10-25 22:21:59,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-25 22:21:59,552 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-25 22:21:59,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:21:59,553 INFO L225 Difference]: With dead ends: 57 [2020-10-25 22:21:59,553 INFO L226 Difference]: Without dead ends: 55 [2020-10-25 22:21:59,554 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-25 22:21:59,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-10-25 22:21:59,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2020-10-25 22:21:59,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-10-25 22:21:59,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2020-10-25 22:21:59,559 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 13 [2020-10-25 22:21:59,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:21:59,559 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2020-10-25 22:21:59,560 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-25 22:21:59,560 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2020-10-25 22:21:59,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-25 22:21:59,561 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:21:59,561 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:21:59,561 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-25 22:21:59,561 INFO L429 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]=== [2020-10-25 22:21:59,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:21:59,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1458404191, now seen corresponding path program 1 times [2020-10-25 22:21:59,562 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:21:59,563 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954200433] [2020-10-25 22:21:59,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:21:59,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:21:59,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:21:59,603 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954200433] [2020-10-25 22:21:59,603 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:21:59,603 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-25 22:21:59,604 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275657103] [2020-10-25 22:21:59,604 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-25 22:21:59,605 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:21:59,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-25 22:21:59,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-25 22:21:59,606 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 5 states. [2020-10-25 22:21:59,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:21:59,730 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2020-10-25 22:21:59,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-25 22:21:59,732 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-10-25 22:21:59,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:21:59,733 INFO L225 Difference]: With dead ends: 75 [2020-10-25 22:21:59,733 INFO L226 Difference]: Without dead ends: 73 [2020-10-25 22:21:59,735 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-25 22:21:59,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-10-25 22:21:59,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 52. [2020-10-25 22:21:59,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-10-25 22:21:59,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2020-10-25 22:21:59,748 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 14 [2020-10-25 22:21:59,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:21:59,749 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2020-10-25 22:21:59,749 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-25 22:21:59,749 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2020-10-25 22:21:59,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-25 22:21:59,750 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:21:59,750 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:21:59,750 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-25 22:21:59,751 INFO L429 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]=== [2020-10-25 22:21:59,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:21:59,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1456493596, now seen corresponding path program 1 times [2020-10-25 22:21:59,752 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:21:59,752 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061781222] [2020-10-25 22:21:59,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:21:59,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:21:59,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:21:59,885 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061781222] [2020-10-25 22:21:59,885 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:21:59,885 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-25 22:21:59,885 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273300297] [2020-10-25 22:21:59,886 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-25 22:21:59,886 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:21:59,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-25 22:21:59,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-25 22:21:59,887 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 6 states. [2020-10-25 22:22:00,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:22:00,041 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2020-10-25 22:22:00,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-25 22:22:00,042 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-10-25 22:22:00,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:22:00,044 INFO L225 Difference]: With dead ends: 86 [2020-10-25 22:22:00,045 INFO L226 Difference]: Without dead ends: 84 [2020-10-25 22:22:00,045 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-25 22:22:00,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2020-10-25 22:22:00,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 58. [2020-10-25 22:22:00,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-10-25 22:22:00,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 65 transitions. [2020-10-25 22:22:00,053 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 65 transitions. Word has length 14 [2020-10-25 22:22:00,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:22:00,054 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 65 transitions. [2020-10-25 22:22:00,054 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-25 22:22:00,054 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2020-10-25 22:22:00,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-25 22:22:00,055 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:22:00,055 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:22:00,056 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-25 22:22:00,057 INFO L429 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]=== [2020-10-25 22:22:00,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:22:00,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1521386336, now seen corresponding path program 1 times [2020-10-25 22:22:00,058 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:22:00,059 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568506419] [2020-10-25 22:22:00,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:22:00,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:22:00,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:22:00,245 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568506419] [2020-10-25 22:22:00,245 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:22:00,245 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-25 22:22:00,246 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735695707] [2020-10-25 22:22:00,246 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-25 22:22:00,246 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:22:00,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-25 22:22:00,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-25 22:22:00,247 INFO L87 Difference]: Start difference. First operand 58 states and 65 transitions. Second operand 6 states. [2020-10-25 22:22:00,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:22:00,389 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2020-10-25 22:22:00,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-25 22:22:00,389 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-10-25 22:22:00,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:22:00,390 INFO L225 Difference]: With dead ends: 70 [2020-10-25 22:22:00,390 INFO L226 Difference]: Without dead ends: 66 [2020-10-25 22:22:00,391 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-25 22:22:00,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-10-25 22:22:00,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 59. [2020-10-25 22:22:00,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-10-25 22:22:00,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2020-10-25 22:22:00,402 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 14 [2020-10-25 22:22:00,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:22:00,403 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2020-10-25 22:22:00,403 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-25 22:22:00,403 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2020-10-25 22:22:00,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-25 22:22:00,403 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:22:00,404 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:22:00,404 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-25 22:22:00,407 INFO L429 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]=== [2020-10-25 22:22:00,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:22:00,408 INFO L82 PathProgramCache]: Analyzing trace with hash -2034104204, now seen corresponding path program 1 times [2020-10-25 22:22:00,408 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:22:00,408 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144718306] [2020-10-25 22:22:00,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:22:00,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:22:00,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:22:00,555 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144718306] [2020-10-25 22:22:00,555 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:22:00,555 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-25 22:22:00,555 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186966596] [2020-10-25 22:22:00,556 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-25 22:22:00,556 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:22:00,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-25 22:22:00,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-25 22:22:00,557 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand 6 states. [2020-10-25 22:22:00,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:22:00,728 INFO L93 Difference]: Finished difference Result 87 states and 96 transitions. [2020-10-25 22:22:00,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-25 22:22:00,729 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-10-25 22:22:00,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:22:00,730 INFO L225 Difference]: With dead ends: 87 [2020-10-25 22:22:00,730 INFO L226 Difference]: Without dead ends: 85 [2020-10-25 22:22:00,730 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-25 22:22:00,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2020-10-25 22:22:00,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 62. [2020-10-25 22:22:00,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-10-25 22:22:00,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2020-10-25 22:22:00,738 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 15 [2020-10-25 22:22:00,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:22:00,738 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2020-10-25 22:22:00,738 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-25 22:22:00,738 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2020-10-25 22:22:00,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-25 22:22:00,739 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:22:00,739 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:22:00,740 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-25 22:22:00,740 INFO L429 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]=== [2020-10-25 22:22:00,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:22:00,741 INFO L82 PathProgramCache]: Analyzing trace with hash -468803585, now seen corresponding path program 1 times [2020-10-25 22:22:00,741 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:22:00,741 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257168489] [2020-10-25 22:22:00,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:22:00,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:22:00,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:22:00,771 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257168489] [2020-10-25 22:22:00,771 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:22:00,771 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 22:22:00,771 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316563509] [2020-10-25 22:22:00,772 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 22:22:00,772 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:22:00,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 22:22:00,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 22:22:00,773 INFO L87 Difference]: Start difference. First operand 62 states and 69 transitions. Second operand 4 states. [2020-10-25 22:22:00,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:22:00,818 INFO L93 Difference]: Finished difference Result 62 states and 69 transitions. [2020-10-25 22:22:00,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 22:22:00,819 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-10-25 22:22:00,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:22:00,819 INFO L225 Difference]: With dead ends: 62 [2020-10-25 22:22:00,820 INFO L226 Difference]: Without dead ends: 60 [2020-10-25 22:22:00,820 INFO L677 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 [2020-10-25 22:22:00,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-10-25 22:22:00,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2020-10-25 22:22:00,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-10-25 22:22:00,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2020-10-25 22:22:00,827 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 16 [2020-10-25 22:22:00,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:22:00,827 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2020-10-25 22:22:00,827 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 22:22:00,827 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2020-10-25 22:22:00,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-25 22:22:00,828 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:22:00,828 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:22:00,829 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-25 22:22:00,829 INFO L429 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]=== [2020-10-25 22:22:00,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:22:00,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1648003138, now seen corresponding path program 1 times [2020-10-25 22:22:00,830 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:22:00,830 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814173260] [2020-10-25 22:22:00,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:22:00,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:22:00,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:22:00,859 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814173260] [2020-10-25 22:22:00,859 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:22:00,860 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 22:22:00,860 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195295095] [2020-10-25 22:22:00,860 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 22:22:00,860 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:22:00,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 22:22:00,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 22:22:00,861 INFO L87 Difference]: Start difference. First operand 60 states and 67 transitions. Second operand 4 states. [2020-10-25 22:22:00,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:22:00,919 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2020-10-25 22:22:00,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 22:22:00,920 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2020-10-25 22:22:00,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:22:00,921 INFO L225 Difference]: With dead ends: 60 [2020-10-25 22:22:00,921 INFO L226 Difference]: Without dead ends: 56 [2020-10-25 22:22:00,922 INFO L677 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 [2020-10-25 22:22:00,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2020-10-25 22:22:00,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2020-10-25 22:22:00,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-10-25 22:22:00,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2020-10-25 22:22:00,927 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 17 [2020-10-25 22:22:00,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:22:00,928 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2020-10-25 22:22:00,928 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 22:22:00,928 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2020-10-25 22:22:00,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-25 22:22:00,929 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:22:00,929 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:22:00,929 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-25 22:22:00,929 INFO L429 AbstractCegarLoop]: === Iteration 19 === [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]=== [2020-10-25 22:22:00,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:22:00,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1509691888, now seen corresponding path program 1 times [2020-10-25 22:22:00,930 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:22:00,931 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002122404] [2020-10-25 22:22:00,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:22:00,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:22:01,018 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:22:01,018 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002122404] [2020-10-25 22:22:01,019 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [386475073] [2020-10-25 22:22:01,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 22:22:01,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:22:01,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-25 22:22:01,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 22:22:01,504 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-25 22:22:01,511 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-25 22:22:01,532 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:22:01,533 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 22:22:01,533 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2020-10-25 22:22:01,533 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900722457] [2020-10-25 22:22:01,534 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-25 22:22:01,534 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:22:01,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-25 22:22:01,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2020-10-25 22:22:01,535 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand 13 states. [2020-10-25 22:22:02,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:22:02,038 INFO L93 Difference]: Finished difference Result 121 states and 136 transitions. [2020-10-25 22:22:02,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-25 22:22:02,039 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2020-10-25 22:22:02,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:22:02,040 INFO L225 Difference]: With dead ends: 121 [2020-10-25 22:22:02,040 INFO L226 Difference]: Without dead ends: 119 [2020-10-25 22:22:02,041 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2020-10-25 22:22:02,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2020-10-25 22:22:02,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 52. [2020-10-25 22:22:02,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-10-25 22:22:02,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2020-10-25 22:22:02,049 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 18 [2020-10-25 22:22:02,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:22:02,049 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2020-10-25 22:22:02,049 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-25 22:22:02,050 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2020-10-25 22:22:02,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-25 22:22:02,053 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:22:02,054 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:22:02,267 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 22:22:02,268 INFO L429 AbstractCegarLoop]: === Iteration 20 === [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]=== [2020-10-25 22:22:02,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:22:02,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1509076208, now seen corresponding path program 1 times [2020-10-25 22:22:02,269 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:22:02,269 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143021943] [2020-10-25 22:22:02,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:22:02,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:22:02,359 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:22:02,360 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143021943] [2020-10-25 22:22:02,360 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [125081294] [2020-10-25 22:22:02,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 22:22:02,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:22:02,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-25 22:22:02,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 22:22:02,588 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-25 22:22:02,592 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-25 22:22:02,610 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:22:02,611 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 22:22:02,611 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2020-10-25 22:22:02,611 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414639784] [2020-10-25 22:22:02,611 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-25 22:22:02,612 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:22:02,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-25 22:22:02,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2020-10-25 22:22:02,612 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand 13 states. [2020-10-25 22:22:02,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:22:02,978 INFO L93 Difference]: Finished difference Result 100 states and 113 transitions. [2020-10-25 22:22:02,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-25 22:22:02,979 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2020-10-25 22:22:02,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:22:02,980 INFO L225 Difference]: With dead ends: 100 [2020-10-25 22:22:02,980 INFO L226 Difference]: Without dead ends: 98 [2020-10-25 22:22:02,981 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2020-10-25 22:22:02,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-10-25 22:22:02,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 45. [2020-10-25 22:22:02,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-10-25 22:22:02,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2020-10-25 22:22:02,987 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 18 [2020-10-25 22:22:02,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:22:02,988 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2020-10-25 22:22:02,988 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-25 22:22:02,988 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2020-10-25 22:22:02,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-25 22:22:02,989 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:22:02,989 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:22:03,202 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 22:22:03,203 INFO L429 AbstractCegarLoop]: === Iteration 21 === [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]=== [2020-10-25 22:22:03,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:22:03,203 INFO L82 PathProgramCache]: Analyzing trace with hash 470387004, now seen corresponding path program 1 times [2020-10-25 22:22:03,203 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:22:03,203 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219571779] [2020-10-25 22:22:03,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:22:03,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:22:03,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:22:03,311 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219571779] [2020-10-25 22:22:03,311 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:22:03,312 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-25 22:22:03,312 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37277171] [2020-10-25 22:22:03,312 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-25 22:22:03,312 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:22:03,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-25 22:22:03,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-25 22:22:03,313 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand 6 states. [2020-10-25 22:22:03,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:22:03,455 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2020-10-25 22:22:03,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-25 22:22:03,457 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-10-25 22:22:03,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:22:03,457 INFO L225 Difference]: With dead ends: 60 [2020-10-25 22:22:03,457 INFO L226 Difference]: Without dead ends: 58 [2020-10-25 22:22:03,458 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-10-25 22:22:03,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-10-25 22:22:03,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 40. [2020-10-25 22:22:03,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-10-25 22:22:03,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2020-10-25 22:22:03,472 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 18 [2020-10-25 22:22:03,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:22:03,472 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2020-10-25 22:22:03,472 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-25 22:22:03,472 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2020-10-25 22:22:03,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-25 22:22:03,473 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:22:03,473 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:22:03,473 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-25 22:22:03,474 INFO L429 AbstractCegarLoop]: === Iteration 22 === [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]=== [2020-10-25 22:22:03,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:22:03,474 INFO L82 PathProgramCache]: Analyzing trace with hash -543024337, now seen corresponding path program 1 times [2020-10-25 22:22:03,475 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:22:03,475 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952468119] [2020-10-25 22:22:03,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:22:03,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:22:03,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:22:03,538 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952468119] [2020-10-25 22:22:03,538 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:22:03,538 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-25 22:22:03,538 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464891565] [2020-10-25 22:22:03,539 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-25 22:22:03,539 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:22:03,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-25 22:22:03,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-25 22:22:03,540 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand 7 states. [2020-10-25 22:22:03,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:22:03,640 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2020-10-25 22:22:03,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-25 22:22:03,640 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-10-25 22:22:03,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:22:03,641 INFO L225 Difference]: With dead ends: 52 [2020-10-25 22:22:03,641 INFO L226 Difference]: Without dead ends: 50 [2020-10-25 22:22:03,642 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-10-25 22:22:03,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-10-25 22:22:03,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 35. [2020-10-25 22:22:03,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-10-25 22:22:03,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2020-10-25 22:22:03,655 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 19 [2020-10-25 22:22:03,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:22:03,655 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2020-10-25 22:22:03,656 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-25 22:22:03,656 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2020-10-25 22:22:03,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-25 22:22:03,656 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 22:22:03,657 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 22:22:03,657 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-25 22:22:03,657 INFO L429 AbstractCegarLoop]: === Iteration 23 === [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]=== [2020-10-25 22:22:03,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 22:22:03,658 INFO L82 PathProgramCache]: Analyzing trace with hash -478131597, now seen corresponding path program 1 times [2020-10-25 22:22:03,658 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 22:22:03,658 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372534566] [2020-10-25 22:22:03,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 22:22:03,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 22:22:03,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 22:22:03,721 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372534566] [2020-10-25 22:22:03,721 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 22:22:03,721 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-25 22:22:03,721 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032104518] [2020-10-25 22:22:03,722 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-25 22:22:03,722 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 22:22:03,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-25 22:22:03,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-25 22:22:03,723 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand 7 states. [2020-10-25 22:22:03,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 22:22:03,835 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2020-10-25 22:22:03,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-25 22:22:03,835 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-10-25 22:22:03,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 22:22:03,836 INFO L225 Difference]: With dead ends: 35 [2020-10-25 22:22:03,836 INFO L226 Difference]: Without dead ends: 0 [2020-10-25 22:22:03,836 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-25 22:22:03,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-25 22:22:03,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-25 22:22:03,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-25 22:22:03,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-25 22:22:03,837 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2020-10-25 22:22:03,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 22:22:03,837 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-25 22:22:03,837 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-25 22:22:03,837 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-25 22:22:03,837 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-25 22:22:03,837 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-10-25 22:22:03,840 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-10-25 22:22:04,040 WARN L193 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2020-10-25 22:22:04,394 WARN L193 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 86 [2020-10-25 22:22:04,642 WARN L193 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 24 [2020-10-25 22:22:05,173 WARN L193 SmtUtils]: Spent 410.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 33 [2020-10-25 22:22:05,177 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-10-25 22:22:05,177 INFO L274 CegarLoopResult]: For program point L234(lines 234 242) no Hoare annotation was computed. [2020-10-25 22:22:05,177 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-10-25 22:22:05,178 INFO L274 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-10-25 22:22:05,178 INFO L274 CegarLoopResult]: For program point L152(lines 152 160) no Hoare annotation was computed. [2020-10-25 22:22:05,178 INFO L274 CegarLoopResult]: For program point L20(lines 20 401) no Hoare annotation was computed. [2020-10-25 22:22:05,178 INFO L277 CegarLoopResult]: At program point L400(lines 15 402) the Hoare annotation is: true [2020-10-25 22:22:05,178 INFO L274 CegarLoopResult]: For program point L70(lines 70 94) no Hoare annotation was computed. [2020-10-25 22:22:05,178 INFO L274 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-10-25 22:22:05,178 INFO L274 CegarLoopResult]: For program point L4-1(line 4) no Hoare annotation was computed. [2020-10-25 22:22:05,178 INFO L274 CegarLoopResult]: For program point L4-2(line 4) no Hoare annotation was computed. [2020-10-25 22:22:05,179 INFO L274 CegarLoopResult]: For program point L4-3(line 4) no Hoare annotation was computed. [2020-10-25 22:22:05,179 INFO L274 CegarLoopResult]: For program point L4-4(line 4) no Hoare annotation was computed. [2020-10-25 22:22:05,179 INFO L270 CegarLoopResult]: At program point L384(lines 282 391) the Hoare annotation is: (let ((.cse1 (= ULTIMATE.start_main_~main__t~0 0))) (let ((.cse0 (let ((.cse2 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~13 0)))) (or (and .cse2 .cse1) (and .cse2 (<= 1 ULTIMATE.start_main_~main__t~0)))))) (or (and .cse0 (< 0 ULTIMATE.start_main_~main__tagbuf_len~0) .cse1) (and (< ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0) (<= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~19) .cse0 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~18 0)))))) [2020-10-25 22:22:05,179 INFO L274 CegarLoopResult]: For program point L4-5(line 4) no Hoare annotation was computed. [2020-10-25 22:22:05,179 INFO L270 CegarLoopResult]: At program point L351(lines 32 395) the Hoare annotation is: (or (and (< 0 ULTIMATE.start_main_~main__tagbuf_len~0) (= ULTIMATE.start_main_~main__t~0 0)) (and (< ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0) (let ((.cse2 (<= ULTIMATE.start_main_~main__t~0 1))) (let ((.cse0 (<= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~17)) (.cse1 (let ((.cse3 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~13 0))) (.cse4 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~16 0))) (.cse5 (<= 1 ULTIMATE.start_main_~main__t~0))) (or (and .cse3 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~19 0)) .cse4 .cse5) (and .cse3 .cse4 .cse5 .cse2))))) (or (and (<= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~19) .cse0 .cse1) (and .cse2 .cse0 .cse1)))))) [2020-10-25 22:22:05,179 INFO L274 CegarLoopResult]: For program point L4-6(line 4) no Hoare annotation was computed. [2020-10-25 22:22:05,180 INFO L274 CegarLoopResult]: For program point L4-7(line 4) no Hoare annotation was computed. [2020-10-25 22:22:05,180 INFO L274 CegarLoopResult]: For program point L4-8(line 4) no Hoare annotation was computed. [2020-10-25 22:22:05,180 INFO L274 CegarLoopResult]: For program point L4-9(line 4) no Hoare annotation was computed. [2020-10-25 22:22:05,180 INFO L274 CegarLoopResult]: For program point L4-10(line 4) no Hoare annotation was computed. [2020-10-25 22:22:05,180 INFO L274 CegarLoopResult]: For program point L186(lines 186 196) no Hoare annotation was computed. [2020-10-25 22:22:05,180 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-10-25 22:22:05,180 INFO L274 CegarLoopResult]: For program point L4-11(line 4) no Hoare annotation was computed. [2020-10-25 22:22:05,180 INFO L274 CegarLoopResult]: For program point L4-12(line 4) no Hoare annotation was computed. [2020-10-25 22:22:05,180 INFO L274 CegarLoopResult]: For program point L4-13(line 4) no Hoare annotation was computed. [2020-10-25 22:22:05,180 INFO L274 CegarLoopResult]: For program point L4-14(line 4) no Hoare annotation was computed. [2020-10-25 22:22:05,180 INFO L274 CegarLoopResult]: For program point L4-15(line 4) no Hoare annotation was computed. [2020-10-25 22:22:05,181 INFO L274 CegarLoopResult]: For program point L4-16(line 4) no Hoare annotation was computed. [2020-10-25 22:22:05,181 INFO L274 CegarLoopResult]: For program point L4-17(line 4) no Hoare annotation was computed. [2020-10-25 22:22:05,181 INFO L274 CegarLoopResult]: For program point L4-18(line 4) no Hoare annotation was computed. [2020-10-25 22:22:05,181 INFO L274 CegarLoopResult]: For program point L4-19(line 4) no Hoare annotation was computed. [2020-10-25 22:22:05,181 INFO L274 CegarLoopResult]: For program point L4-20(line 4) no Hoare annotation was computed. [2020-10-25 22:22:05,181 INFO L274 CegarLoopResult]: For program point L4-21(line 4) no Hoare annotation was computed. [2020-10-25 22:22:05,181 INFO L274 CegarLoopResult]: For program point L4-22(line 4) no Hoare annotation was computed. [2020-10-25 22:22:05,181 INFO L274 CegarLoopResult]: For program point L4-23(line 4) no Hoare annotation was computed. [2020-10-25 22:22:05,181 INFO L274 CegarLoopResult]: For program point L4-24(line 4) no Hoare annotation was computed. [2020-10-25 22:22:05,181 INFO L274 CegarLoopResult]: For program point L4-25(line 4) no Hoare annotation was computed. [2020-10-25 22:22:05,181 INFO L274 CegarLoopResult]: For program point L4-26(line 4) no Hoare annotation was computed. [2020-10-25 22:22:05,181 INFO L274 CegarLoopResult]: For program point L4-27(line 4) no Hoare annotation was computed. [2020-10-25 22:22:05,182 INFO L274 CegarLoopResult]: For program point L4-28(line 4) no Hoare annotation was computed. [2020-10-25 22:22:05,182 INFO L274 CegarLoopResult]: For program point L4-29(line 4) no Hoare annotation was computed. [2020-10-25 22:22:05,182 INFO L274 CegarLoopResult]: For program point L4-30(line 4) no Hoare annotation was computed. [2020-10-25 22:22:05,182 INFO L274 CegarLoopResult]: For program point L4-31(line 4) no Hoare annotation was computed. [2020-10-25 22:22:05,182 INFO L274 CegarLoopResult]: For program point L4-32(line 4) no Hoare annotation was computed. [2020-10-25 22:22:05,182 INFO L274 CegarLoopResult]: For program point L4-33(line 4) no Hoare annotation was computed. [2020-10-25 22:22:05,182 INFO L274 CegarLoopResult]: For program point L4-34(line 4) no Hoare annotation was computed. [2020-10-25 22:22:05,182 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-10-25 22:22:05,182 INFO L274 CegarLoopResult]: For program point L4-35(line 4) no Hoare annotation was computed. [2020-10-25 22:22:05,182 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-10-25 22:22:05,182 INFO L274 CegarLoopResult]: For program point L105(lines 105 209) no Hoare annotation was computed. [2020-10-25 22:22:05,182 INFO L274 CegarLoopResult]: For program point L39(lines 39 255) no Hoare annotation was computed. [2020-10-25 22:22:05,183 INFO L274 CegarLoopResult]: For program point L288(lines 288 390) no Hoare annotation was computed. [2020-10-25 22:22:05,183 INFO L274 CegarLoopResult]: For program point L222(lines 222 244) no Hoare annotation was computed. [2020-10-25 22:22:05,183 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-10-25 22:22:05,183 INFO L274 CegarLoopResult]: For program point L24(lines 24 396) no Hoare annotation was computed. [2020-10-25 22:22:05,183 INFO L274 CegarLoopResult]: For program point L140(lines 140 162) no Hoare annotation was computed. [2020-10-25 22:22:05,183 INFO L274 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-10-25 22:22:05,183 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-10-25 22:22:05,183 INFO L274 CegarLoopResult]: For program point L124(lines 124 201) no Hoare annotation was computed. [2020-10-25 22:22:05,183 INFO L274 CegarLoopResult]: For program point L174(lines 174 198) no Hoare annotation was computed. [2020-10-25 22:22:05,183 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-10-25 22:22:05,184 INFO L274 CegarLoopResult]: For program point L307(lines 307 315) no Hoare annotation was computed. [2020-10-25 22:22:05,184 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-10-25 22:22:05,184 INFO L274 CegarLoopResult]: For program point L324(lines 324 389) no Hoare annotation was computed. [2020-10-25 22:22:05,184 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-10-25 22:22:05,184 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-10-25 22:22:05,184 INFO L274 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-10-25 22:22:05,184 INFO L274 CegarLoopResult]: For program point L276(lines 276 391) no Hoare annotation was computed. [2020-10-25 22:22:05,184 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-10-25 22:22:05,184 INFO L274 CegarLoopResult]: For program point L376(lines 376 385) no Hoare annotation was computed. [2020-10-25 22:22:05,184 INFO L274 CegarLoopResult]: For program point L343(lines 343 352) no Hoare annotation was computed. [2020-10-25 22:22:05,184 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-10-25 22:22:05,184 INFO L274 CegarLoopResult]: For program point L112(lines 112 203) no Hoare annotation was computed. [2020-10-25 22:22:05,185 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-10-25 22:22:05,185 INFO L270 CegarLoopResult]: At program point L195(lines 56 253) the Hoare annotation is: (and (<= 1 ULTIMATE.start_main_~main__t~0) (<= ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0)) [2020-10-25 22:22:05,185 INFO L274 CegarLoopResult]: For program point L295(lines 295 317) no Hoare annotation was computed. [2020-10-25 22:22:05,185 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-10-25 22:22:05,185 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-10-25 22:22:05,185 INFO L274 CegarLoopResult]: For program point L32(lines 32 395) no Hoare annotation was computed. [2020-10-25 22:22:05,185 INFO L274 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-10-25 22:22:05,185 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-10-25 22:22:05,185 INFO L274 CegarLoopResult]: For program point L82(lines 82 92) no Hoare annotation was computed. [2020-10-25 22:22:05,185 INFO L277 CegarLoopResult]: At program point L314(lines 32 395) the Hoare annotation is: true [2020-10-25 22:22:05,186 INFO L274 CegarLoopResult]: For program point L215(lines 215 250) no Hoare annotation was computed. [2020-10-25 22:22:05,186 INFO L274 CegarLoopResult]: For program point L50(lines 50 253) no Hoare annotation was computed. [2020-10-25 22:22:05,186 INFO L274 CegarLoopResult]: For program point L364(lines 364 387) no Hoare annotation was computed. [2020-10-25 22:22:05,186 INFO L274 CegarLoopResult]: For program point L331(lines 331 354) no Hoare annotation was computed. [2020-10-25 22:22:05,186 INFO L274 CegarLoopResult]: For program point L265(lines 265 393) no Hoare annotation was computed. [2020-10-25 22:22:05,186 INFO L274 CegarLoopResult]: For program point L133(lines 133 200) no Hoare annotation was computed. [2020-10-25 22:22:05,186 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-10-25 22:22:05,186 INFO L270 CegarLoopResult]: At program point L249(lines 101 251) 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)) [2020-10-25 22:22:05,186 INFO L274 CegarLoopResult]: For program point L101(lines 101 251) no Hoare annotation was computed. [2020-10-25 22:22:05,211 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.10 10:22:05 BoogieIcfgContainer [2020-10-25 22:22:05,212 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-25 22:22:05,212 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-25 22:22:05,212 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-25 22:22:05,213 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-25 22:22:05,213 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 10:21:56" (3/4) ... [2020-10-25 22:22:05,217 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-10-25 22:22:05,234 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2020-10-25 22:22:05,234 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2020-10-25 22:22:05,235 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-10-25 22:22:05,236 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-10-25 22:22:05,347 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-25 22:22:05,347 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-25 22:22:05,352 INFO L168 Benchmark]: Toolchain (without parser) took 10690.83 ms. Allocated memory was 46.1 MB in the beginning and 121.6 MB in the end (delta: 75.5 MB). Free memory was 23.3 MB in the beginning and 42.8 MB in the end (delta: -19.5 MB). Peak memory consumption was 57.5 MB. Max. memory is 16.1 GB. [2020-10-25 22:22:05,352 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 37.7 MB. Free memory was 24.5 MB in the beginning and 24.4 MB in the end (delta: 25.6 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-25 22:22:05,354 INFO L168 Benchmark]: CACSL2BoogieTranslator took 422.54 ms. Allocated memory is still 46.1 MB. Free memory was 22.7 MB in the beginning and 21.7 MB in the end (delta: 966.1 kB). Peak memory consumption was 5.6 MB. Max. memory is 16.1 GB. [2020-10-25 22:22:05,354 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.96 ms. Allocated memory is still 46.1 MB. Free memory was 21.7 MB in the beginning and 29.4 MB in the end (delta: -7.7 MB). Peak memory consumption was 4.8 MB. Max. memory is 16.1 GB. [2020-10-25 22:22:05,354 INFO L168 Benchmark]: Boogie Preprocessor took 31.73 ms. Allocated memory is still 46.1 MB. Free memory was 29.4 MB in the beginning and 27.9 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-25 22:22:05,355 INFO L168 Benchmark]: RCFGBuilder took 823.65 ms. Allocated memory was 46.1 MB in the beginning and 56.6 MB in the end (delta: 10.5 MB). Free memory was 27.9 MB in the beginning and 32.8 MB in the end (delta: -4.9 MB). Peak memory consumption was 12.2 MB. Max. memory is 16.1 GB. [2020-10-25 22:22:05,355 INFO L168 Benchmark]: TraceAbstraction took 9194.16 ms. Allocated memory was 56.6 MB in the beginning and 121.6 MB in the end (delta: 65.0 MB). Free memory was 32.6 MB in the beginning and 49.1 MB in the end (delta: -16.5 MB). Peak memory consumption was 64.3 MB. Max. memory is 16.1 GB. [2020-10-25 22:22:05,356 INFO L168 Benchmark]: Witness Printer took 134.95 ms. Allocated memory is still 121.6 MB. Free memory was 49.1 MB in the beginning and 42.8 MB in the end (delta: 6.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2020-10-25 22:22:05,359 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 37.7 MB. Free memory was 24.5 MB in the beginning and 24.4 MB in the end (delta: 25.6 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 422.54 ms. Allocated memory is still 46.1 MB. Free memory was 22.7 MB in the beginning and 21.7 MB in the end (delta: 966.1 kB). Peak memory consumption was 5.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 64.96 ms. Allocated memory is still 46.1 MB. Free memory was 21.7 MB in the beginning and 29.4 MB in the end (delta: -7.7 MB). Peak memory consumption was 4.8 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 31.73 ms. Allocated memory is still 46.1 MB. Free memory was 29.4 MB in the beginning and 27.9 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 823.65 ms. Allocated memory was 46.1 MB in the beginning and 56.6 MB in the end (delta: 10.5 MB). Free memory was 27.9 MB in the beginning and 32.8 MB in the end (delta: -4.9 MB). Peak memory consumption was 12.2 MB. Max. memory is 16.1 GB. * TraceAbstraction took 9194.16 ms. Allocated memory was 56.6 MB in the beginning and 121.6 MB in the end (delta: 65.0 MB). Free memory was 32.6 MB in the beginning and 49.1 MB in the end (delta: -16.5 MB). Peak memory consumption was 64.3 MB. Max. memory is 16.1 GB. * Witness Printer took 134.95 ms. Allocated memory is still 121.6 MB. Free memory was 49.1 MB in the beginning and 42.8 MB in the end (delta: 6.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4]: 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: 15]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 282]: Loop Invariant Derived loop invariant: ((((!(__VERIFIER_assert__cond == 0) && main__t == 0) || (!(__VERIFIER_assert__cond == 0) && 1 <= main__t)) && 0 < main__tagbuf_len) && main__t == 0) || (((main__t < main__tagbuf_len && 1 <= __VERIFIER_assert__cond) && ((!(__VERIFIER_assert__cond == 0) && main__t == 0) || (!(__VERIFIER_assert__cond == 0) && 1 <= main__t))) && !(__VERIFIER_assert__cond == 0)) - InvariantResult [Line: 56]: Loop Invariant Derived loop invariant: 1 <= main__t && main__t <= main__tagbuf_len - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 101]: Loop Invariant Derived loop invariant: main__t < main__tagbuf_len && 1 <= main__t - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: (0 < main__tagbuf_len && main__t == 0) || (main__t < main__tagbuf_len && (((1 <= __VERIFIER_assert__cond && 1 <= __VERIFIER_assert__cond) && ((((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__t) || (((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__t) && main__t <= 1))) || ((main__t <= 1 && 1 <= __VERIFIER_assert__cond) && ((((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__t) || (((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__t) && main__t <= 1))))) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 93 locations, 18 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 7.7s, OverallIterations: 23, TraceHistogramMax: 2, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1024 SDtfs, 1889 SDslu, 1684 SDs, 0 SdLazy, 1955 SolverSat, 234 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 195 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=93occurred 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.2s AutomataMinimizationTime, 23 MinimizatonAttempts, 528 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 12 NumberOfFragments, 160 HoareAnnotationTreeSize, 6 FomulaSimplifications, 19039930 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 6 FomulaSimplificationsInter, 5050613 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 356 NumberOfCodeBlocks, 356 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 331 ConstructedInterpolants, 0 QuantifiedInterpolants, 18287 SizeOfPredicates, 8 NumberOfNonLiveVariables, 233 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 25 InterpolantComputations, 21 PerfectInterpolantSequences, 4/16 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...