./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_cd408ea5-2c7e-4c83-89f0-3f14160c5454/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_cd408ea5-2c7e-4c83-89f0-3f14160c5454/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_cd408ea5-2c7e-4c83-89f0-3f14160c5454/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_cd408ea5-2c7e-4c83-89f0-3f14160c5454/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c -s /tmp/vcloud-vcloud-master/worker/run_dir_cd408ea5-2c7e-4c83-89f0-3f14160c5454/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_cd408ea5-2c7e-4c83-89f0-3f14160c5454/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5daa60820c0033439eb2fc136c4a16d466a909bc ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 02:21:22,888 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 02:21:22,891 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 02:21:22,904 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 02:21:22,904 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 02:21:22,905 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 02:21:22,907 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 02:21:22,909 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 02:21:22,912 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 02:21:22,913 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 02:21:22,914 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 02:21:22,915 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 02:21:22,916 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 02:21:22,917 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 02:21:22,918 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 02:21:22,919 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 02:21:22,920 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 02:21:22,921 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 02:21:22,924 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 02:21:22,926 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 02:21:22,928 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 02:21:22,929 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 02:21:22,931 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 02:21:22,935 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 02:21:22,938 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 02:21:22,943 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 02:21:22,944 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 02:21:22,945 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 02:21:22,945 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 02:21:22,947 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 02:21:22,949 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 02:21:22,950 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 02:21:22,951 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 02:21:22,953 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 02:21:22,954 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 02:21:22,957 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 02:21:22,958 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 02:21:22,958 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 02:21:22,958 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 02:21:22,959 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 02:21:22,963 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 02:21:22,964 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_cd408ea5-2c7e-4c83-89f0-3f14160c5454/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 02:21:22,979 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 02:21:22,981 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 02:21:22,983 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 02:21:22,983 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 02:21:22,984 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 02:21:22,984 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 02:21:22,984 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 02:21:22,985 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 02:21:22,985 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 02:21:22,985 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 02:21:22,986 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 02:21:22,987 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 02:21:22,987 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 02:21:22,987 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 02:21:22,987 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 02:21:22,988 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 02:21:22,988 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 02:21:22,988 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 02:21:22,988 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 02:21:22,989 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 02:21:22,989 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 02:21:22,989 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 02:21:22,990 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 02:21:22,990 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 02:21:22,990 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 02:21:22,990 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 02:21:22,991 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 02:21:22,991 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 02:21:22,991 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_cd408ea5-2c7e-4c83-89f0-3f14160c5454/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5daa60820c0033439eb2fc136c4a16d466a909bc [2019-11-20 02:21:23,168 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 02:21:23,183 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 02:21:23,189 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 02:21:23,191 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 02:21:23,193 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 02:21:23,194 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_cd408ea5-2c7e-4c83-89f0-3f14160c5454/bin/uautomizer/../../sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c [2019-11-20 02:21:23,264 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_cd408ea5-2c7e-4c83-89f0-3f14160c5454/bin/uautomizer/data/062152690/30cba3305354433da528f391454734c8/FLAGf3ac5e55d [2019-11-20 02:21:23,718 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 02:21:23,720 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_cd408ea5-2c7e-4c83-89f0-3f14160c5454/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c [2019-11-20 02:21:23,727 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_cd408ea5-2c7e-4c83-89f0-3f14160c5454/bin/uautomizer/data/062152690/30cba3305354433da528f391454734c8/FLAGf3ac5e55d [2019-11-20 02:21:24,127 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_cd408ea5-2c7e-4c83-89f0-3f14160c5454/bin/uautomizer/data/062152690/30cba3305354433da528f391454734c8 [2019-11-20 02:21:24,130 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 02:21:24,131 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 02:21:24,141 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 02:21:24,141 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 02:21:24,145 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 02:21:24,146 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:21:24" (1/1) ... [2019-11-20 02:21:24,148 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6709ef4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:21:24, skipping insertion in model container [2019-11-20 02:21:24,149 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:21:24" (1/1) ... [2019-11-20 02:21:24,157 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 02:21:24,215 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 02:21:24,616 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 02:21:24,624 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 02:21:24,676 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 02:21:24,693 INFO L192 MainTranslator]: Completed translation [2019-11-20 02:21:24,693 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:21:24 WrapperNode [2019-11-20 02:21:24,694 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 02:21:24,695 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 02:21:24,695 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 02:21:24,695 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 02:21:24,706 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:21:24" (1/1) ... [2019-11-20 02:21:24,714 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:21:24" (1/1) ... [2019-11-20 02:21:24,748 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 02:21:24,749 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 02:21:24,749 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 02:21:24,749 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 02:21:24,761 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:21:24" (1/1) ... [2019-11-20 02:21:24,761 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:21:24" (1/1) ... [2019-11-20 02:21:24,763 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:21:24" (1/1) ... [2019-11-20 02:21:24,764 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:21:24" (1/1) ... [2019-11-20 02:21:24,769 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:21:24" (1/1) ... [2019-11-20 02:21:24,773 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:21:24" (1/1) ... [2019-11-20 02:21:24,775 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:21:24" (1/1) ... [2019-11-20 02:21:24,780 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 02:21:24,791 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 02:21:24,792 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 02:21:24,792 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 02:21:24,793 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:21:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cd408ea5-2c7e-4c83-89f0-3f14160c5454/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 02:21:24,879 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 02:21:24,880 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 02:21:25,352 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 02:21:25,352 INFO L285 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-20 02:21:25,353 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:21:25 BoogieIcfgContainer [2019-11-20 02:21:25,353 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 02:21:25,354 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 02:21:25,354 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 02:21:25,356 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 02:21:25,357 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 02:21:24" (1/3) ... [2019-11-20 02:21:25,357 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9cb80e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:21:25, skipping insertion in model container [2019-11-20 02:21:25,357 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:21:24" (2/3) ... [2019-11-20 02:21:25,357 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9cb80e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:21:25, skipping insertion in model container [2019-11-20 02:21:25,358 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:21:25" (3/3) ... [2019-11-20 02:21:25,359 INFO L109 eAbstractionObserver]: Analyzing ICFG SpamAssassin-loop.i.v+cfa-reducer.c [2019-11-20 02:21:25,366 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 02:21:25,372 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-11-20 02:21:25,382 INFO L249 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-11-20 02:21:25,404 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 02:21:25,405 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 02:21:25,405 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 02:21:25,405 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 02:21:25,405 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 02:21:25,405 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 02:21:25,405 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 02:21:25,406 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 02:21:25,424 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states. [2019-11-20 02:21:25,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-20 02:21:25,430 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:21:25,431 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:21:25,432 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:21:25,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:21:25,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1241029004, now seen corresponding path program 1 times [2019-11-20 02:21:25,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:21:25,444 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328748565] [2019-11-20 02:21:25,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:21:25,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:21:25,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:21:25,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328748565] [2019-11-20 02:21:25,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:21:25,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 02:21:25,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608145632] [2019-11-20 02:21:25,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 02:21:25,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:21:25,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 02:21:25,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:21:25,612 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 3 states. [2019-11-20 02:21:25,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:21:25,647 INFO L93 Difference]: Finished difference Result 83 states and 110 transitions. [2019-11-20 02:21:25,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 02:21:25,648 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-11-20 02:21:25,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:21:25,655 INFO L225 Difference]: With dead ends: 83 [2019-11-20 02:21:25,655 INFO L226 Difference]: Without dead ends: 72 [2019-11-20 02:21:25,657 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:21:25,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-11-20 02:21:25,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 55. [2019-11-20 02:21:25,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-11-20 02:21:25,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2019-11-20 02:21:25,688 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 9 [2019-11-20 02:21:25,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:21:25,688 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2019-11-20 02:21:25,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 02:21:25,689 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2019-11-20 02:21:25,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-20 02:21:25,689 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:21:25,689 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:21:25,690 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:21:25,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:21:25,690 INFO L82 PathProgramCache]: Analyzing trace with hash -182802478, now seen corresponding path program 1 times [2019-11-20 02:21:25,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:21:25,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844424442] [2019-11-20 02:21:25,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:21:25,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:21:25,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:21:25,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844424442] [2019-11-20 02:21:25,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:21:25,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:21:25,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510779335] [2019-11-20 02:21:25,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:21:25,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:21:25,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:21:25,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:21:25,739 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 4 states. [2019-11-20 02:21:25,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:21:25,863 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2019-11-20 02:21:25,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:21:25,864 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-20 02:21:25,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:21:25,865 INFO L225 Difference]: With dead ends: 73 [2019-11-20 02:21:25,865 INFO L226 Difference]: Without dead ends: 71 [2019-11-20 02:21:25,866 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:21:25,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-20 02:21:25,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 53. [2019-11-20 02:21:25,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-20 02:21:25,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2019-11-20 02:21:25,877 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 10 [2019-11-20 02:21:25,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:21:25,877 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2019-11-20 02:21:25,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:21:25,878 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2019-11-20 02:21:25,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-20 02:21:25,878 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:21:25,879 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:21:25,879 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:21:25,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:21:25,880 INFO L82 PathProgramCache]: Analyzing trace with hash -179156060, now seen corresponding path program 1 times [2019-11-20 02:21:25,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:21:25,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342081203] [2019-11-20 02:21:25,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:21:25,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:21:25,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:21:25,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342081203] [2019-11-20 02:21:25,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:21:25,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:21:25,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453323477] [2019-11-20 02:21:25,949 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:21:25,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:21:25,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:21:25,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:21:25,950 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 4 states. [2019-11-20 02:21:26,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:21:26,059 INFO L93 Difference]: Finished difference Result 143 states and 158 transitions. [2019-11-20 02:21:26,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 02:21:26,061 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-20 02:21:26,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:21:26,063 INFO L225 Difference]: With dead ends: 143 [2019-11-20 02:21:26,063 INFO L226 Difference]: Without dead ends: 93 [2019-11-20 02:21:26,064 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:21:26,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-11-20 02:21:26,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 52. [2019-11-20 02:21:26,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-20 02:21:26,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2019-11-20 02:21:26,082 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 10 [2019-11-20 02:21:26,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:21:26,083 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2019-11-20 02:21:26,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:21:26,083 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2019-11-20 02:21:26,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-20 02:21:26,093 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:21:26,093 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:21:26,094 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:21:26,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:21:26,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1258866483, now seen corresponding path program 1 times [2019-11-20 02:21:26,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:21:26,097 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096933177] [2019-11-20 02:21:26,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:21:26,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:21:26,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:21:26,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096933177] [2019-11-20 02:21:26,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:21:26,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:21:26,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68870887] [2019-11-20 02:21:26,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:21:26,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:21:26,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:21:26,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:21:26,148 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 4 states. [2019-11-20 02:21:26,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:21:26,235 INFO L93 Difference]: Finished difference Result 92 states and 100 transitions. [2019-11-20 02:21:26,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:21:26,236 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-20 02:21:26,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:21:26,237 INFO L225 Difference]: With dead ends: 92 [2019-11-20 02:21:26,238 INFO L226 Difference]: Without dead ends: 90 [2019-11-20 02:21:26,238 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:21:26,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-11-20 02:21:26,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 50. [2019-11-20 02:21:26,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-20 02:21:26,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2019-11-20 02:21:26,248 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 11 [2019-11-20 02:21:26,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:21:26,249 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2019-11-20 02:21:26,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:21:26,249 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2019-11-20 02:21:26,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-20 02:21:26,250 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:21:26,250 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:21:26,251 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:21:26,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:21:26,251 INFO L82 PathProgramCache]: Analyzing trace with hash 420636790, now seen corresponding path program 1 times [2019-11-20 02:21:26,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:21:26,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729866684] [2019-11-20 02:21:26,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:21:26,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:21:26,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:21:26,368 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729866684] [2019-11-20 02:21:26,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:21:26,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 02:21:26,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217100033] [2019-11-20 02:21:26,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 02:21:26,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:21:26,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 02:21:26,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:21:26,370 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 5 states. [2019-11-20 02:21:26,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:21:26,451 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2019-11-20 02:21:26,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 02:21:26,451 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-11-20 02:21:26,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:21:26,452 INFO L225 Difference]: With dead ends: 69 [2019-11-20 02:21:26,452 INFO L226 Difference]: Without dead ends: 67 [2019-11-20 02:21:26,453 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-20 02:21:26,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-11-20 02:21:26,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 48. [2019-11-20 02:21:26,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-20 02:21:26,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2019-11-20 02:21:26,459 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 12 [2019-11-20 02:21:26,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:21:26,460 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2019-11-20 02:21:26,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 02:21:26,460 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2019-11-20 02:21:26,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-20 02:21:26,461 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:21:26,461 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:21:26,461 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:21:26,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:21:26,462 INFO L82 PathProgramCache]: Analyzing trace with hash -370151221, now seen corresponding path program 1 times [2019-11-20 02:21:26,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:21:26,462 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117839137] [2019-11-20 02:21:26,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:21:26,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:21:26,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:21:26,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117839137] [2019-11-20 02:21:26,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:21:26,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 02:21:26,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826182153] [2019-11-20 02:21:26,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 02:21:26,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:21:26,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 02:21:26,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:21:26,518 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 5 states. [2019-11-20 02:21:26,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:21:26,641 INFO L93 Difference]: Finished difference Result 87 states and 95 transitions. [2019-11-20 02:21:26,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 02:21:26,642 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-11-20 02:21:26,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:21:26,643 INFO L225 Difference]: With dead ends: 87 [2019-11-20 02:21:26,643 INFO L226 Difference]: Without dead ends: 85 [2019-11-20 02:21:26,644 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 02:21:26,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-11-20 02:21:26,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 46. [2019-11-20 02:21:26,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-20 02:21:26,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2019-11-20 02:21:26,651 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 12 [2019-11-20 02:21:26,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:21:26,654 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2019-11-20 02:21:26,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 02:21:26,654 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2019-11-20 02:21:26,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-20 02:21:26,655 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:21:26,656 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:21:26,656 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:21:26,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:21:26,660 INFO L82 PathProgramCache]: Analyzing trace with hash 154842714, now seen corresponding path program 1 times [2019-11-20 02:21:26,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:21:26,661 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362330460] [2019-11-20 02:21:26,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:21:26,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:21:26,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:21:26,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362330460] [2019-11-20 02:21:26,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:21:26,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 02:21:26,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325308841] [2019-11-20 02:21:26,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 02:21:26,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:21:26,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 02:21:26,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:21:26,747 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 5 states. [2019-11-20 02:21:26,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:21:26,921 INFO L93 Difference]: Finished difference Result 75 states and 86 transitions. [2019-11-20 02:21:26,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 02:21:26,922 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-11-20 02:21:26,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:21:26,923 INFO L225 Difference]: With dead ends: 75 [2019-11-20 02:21:26,924 INFO L226 Difference]: Without dead ends: 73 [2019-11-20 02:21:26,924 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-20 02:21:26,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-11-20 02:21:26,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 44. [2019-11-20 02:21:26,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-20 02:21:26,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2019-11-20 02:21:26,931 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 13 [2019-11-20 02:21:26,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:21:26,932 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2019-11-20 02:21:26,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 02:21:26,932 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2019-11-20 02:21:26,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-20 02:21:26,933 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:21:26,933 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:21:26,934 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:21:26,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:21:26,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1410218132, now seen corresponding path program 1 times [2019-11-20 02:21:26,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:21:26,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376725797] [2019-11-20 02:21:26,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:21:26,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:21:26,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:21:26,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376725797] [2019-11-20 02:21:26,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:21:26,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:21:26,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489802321] [2019-11-20 02:21:26,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:21:26,975 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:21:26,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:21:26,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:21:26,975 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 4 states. [2019-11-20 02:21:27,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:21:27,053 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2019-11-20 02:21:27,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:21:27,053 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-11-20 02:21:27,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:21:27,054 INFO L225 Difference]: With dead ends: 83 [2019-11-20 02:21:27,055 INFO L226 Difference]: Without dead ends: 81 [2019-11-20 02:21:27,055 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:21:27,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-11-20 02:21:27,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 42. [2019-11-20 02:21:27,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-20 02:21:27,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2019-11-20 02:21:27,062 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 13 [2019-11-20 02:21:27,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:21:27,063 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2019-11-20 02:21:27,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:21:27,063 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2019-11-20 02:21:27,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-20 02:21:27,064 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:21:27,064 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:21:27,065 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:21:27,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:21:27,065 INFO L82 PathProgramCache]: Analyzing trace with hash 505160957, now seen corresponding path program 1 times [2019-11-20 02:21:27,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:21:27,066 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78822436] [2019-11-20 02:21:27,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:21:27,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:21:27,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:21:27,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78822436] [2019-11-20 02:21:27,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:21:27,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-20 02:21:27,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998894488] [2019-11-20 02:21:27,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 02:21:27,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:21:27,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 02:21:27,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-20 02:21:27,228 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 7 states. [2019-11-20 02:21:27,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:21:27,402 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2019-11-20 02:21:27,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 02:21:27,402 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2019-11-20 02:21:27,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:21:27,403 INFO L225 Difference]: With dead ends: 62 [2019-11-20 02:21:27,404 INFO L226 Difference]: Without dead ends: 60 [2019-11-20 02:21:27,404 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2019-11-20 02:21:27,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-11-20 02:21:27,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 40. [2019-11-20 02:21:27,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-20 02:21:27,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2019-11-20 02:21:27,411 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 14 [2019-11-20 02:21:27,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:21:27,418 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2019-11-20 02:21:27,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 02:21:27,418 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2019-11-20 02:21:27,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-20 02:21:27,419 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:21:27,419 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:21:27,420 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:21:27,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:21:27,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1519875391, now seen corresponding path program 1 times [2019-11-20 02:21:27,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:21:27,421 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106338108] [2019-11-20 02:21:27,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:21:27,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:21:27,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:21:27,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106338108] [2019-11-20 02:21:27,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:21:27,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:21:27,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744986340] [2019-11-20 02:21:27,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:21:27,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:21:27,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:21:27,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:21:27,508 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 4 states. [2019-11-20 02:21:27,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:21:27,569 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2019-11-20 02:21:27,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:21:27,573 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-20 02:21:27,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:21:27,574 INFO L225 Difference]: With dead ends: 57 [2019-11-20 02:21:27,574 INFO L226 Difference]: Without dead ends: 55 [2019-11-20 02:21:27,574 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:21:27,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-20 02:21:27,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 38. [2019-11-20 02:21:27,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-20 02:21:27,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2019-11-20 02:21:27,579 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 15 [2019-11-20 02:21:27,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:21:27,580 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2019-11-20 02:21:27,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:21:27,580 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2019-11-20 02:21:27,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-20 02:21:27,581 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:21:27,581 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:21:27,581 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:21:27,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:21:27,582 INFO L82 PathProgramCache]: Analyzing trace with hash 128507268, now seen corresponding path program 1 times [2019-11-20 02:21:27,582 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:21:27,582 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23376649] [2019-11-20 02:21:27,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:21:27,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:21:27,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:21:27,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23376649] [2019-11-20 02:21:27,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:21:27,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 02:21:27,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049533298] [2019-11-20 02:21:27,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 02:21:27,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:21:27,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 02:21:27,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:21:27,660 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 5 states. [2019-11-20 02:21:27,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:21:27,755 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2019-11-20 02:21:27,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 02:21:27,756 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-11-20 02:21:27,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:21:27,757 INFO L225 Difference]: With dead ends: 65 [2019-11-20 02:21:27,757 INFO L226 Difference]: Without dead ends: 63 [2019-11-20 02:21:27,757 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-20 02:21:27,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-20 02:21:27,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 36. [2019-11-20 02:21:27,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-20 02:21:27,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2019-11-20 02:21:27,762 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 16 [2019-11-20 02:21:27,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:21:27,762 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2019-11-20 02:21:27,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 02:21:27,763 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2019-11-20 02:21:27,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-20 02:21:27,763 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:21:27,763 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:21:27,764 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:21:27,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:21:27,764 INFO L82 PathProgramCache]: Analyzing trace with hash -311237848, now seen corresponding path program 1 times [2019-11-20 02:21:27,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:21:27,765 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142213239] [2019-11-20 02:21:27,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:21:27,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:21:27,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:21:27,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142213239] [2019-11-20 02:21:27,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:21:27,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 02:21:27,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138808139] [2019-11-20 02:21:27,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 02:21:27,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:21:27,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 02:21:27,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:21:27,845 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 5 states. [2019-11-20 02:21:27,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:21:27,917 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2019-11-20 02:21:27,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:21:27,918 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-20 02:21:27,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:21:27,919 INFO L225 Difference]: With dead ends: 54 [2019-11-20 02:21:27,919 INFO L226 Difference]: Without dead ends: 52 [2019-11-20 02:21:27,919 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-20 02:21:27,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-11-20 02:21:27,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 34. [2019-11-20 02:21:27,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-20 02:21:27,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2019-11-20 02:21:27,924 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 17 [2019-11-20 02:21:27,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:21:27,924 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2019-11-20 02:21:27,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 02:21:27,924 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2019-11-20 02:21:27,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-20 02:21:27,925 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:21:27,925 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:21:27,925 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:21:27,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:21:27,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1058434549, now seen corresponding path program 1 times [2019-11-20 02:21:27,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:21:27,926 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959047830] [2019-11-20 02:21:27,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:21:27,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:21:28,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:21:28,026 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959047830] [2019-11-20 02:21:28,026 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:21:28,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-20 02:21:28,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473279646] [2019-11-20 02:21:28,027 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 02:21:28,027 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:21:28,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 02:21:28,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-20 02:21:28,028 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 7 states. [2019-11-20 02:21:28,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:21:28,184 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2019-11-20 02:21:28,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 02:21:28,185 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-11-20 02:21:28,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:21:28,185 INFO L225 Difference]: With dead ends: 58 [2019-11-20 02:21:28,186 INFO L226 Difference]: Without dead ends: 56 [2019-11-20 02:21:28,186 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-11-20 02:21:28,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-20 02:21:28,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 32. [2019-11-20 02:21:28,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-20 02:21:28,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2019-11-20 02:21:28,192 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 18 [2019-11-20 02:21:28,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:21:28,192 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2019-11-20 02:21:28,192 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 02:21:28,192 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2019-11-20 02:21:28,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-20 02:21:28,193 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:21:28,193 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:21:28,193 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:21:28,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:21:28,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1548271503, now seen corresponding path program 1 times [2019-11-20 02:21:28,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:21:28,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521848093] [2019-11-20 02:21:28,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:21:28,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:21:28,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:21:28,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521848093] [2019-11-20 02:21:28,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:21:28,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 02:21:28,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479677225] [2019-11-20 02:21:28,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 02:21:28,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:21:28,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 02:21:28,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:21:28,252 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 5 states. [2019-11-20 02:21:28,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:21:28,308 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2019-11-20 02:21:28,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:21:28,308 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-11-20 02:21:28,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:21:28,309 INFO L225 Difference]: With dead ends: 53 [2019-11-20 02:21:28,309 INFO L226 Difference]: Without dead ends: 51 [2019-11-20 02:21:28,309 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-20 02:21:28,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-20 02:21:28,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 30. [2019-11-20 02:21:28,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-20 02:21:28,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2019-11-20 02:21:28,313 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 19 [2019-11-20 02:21:28,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:21:28,313 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2019-11-20 02:21:28,313 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 02:21:28,313 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2019-11-20 02:21:28,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-20 02:21:28,314 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:21:28,314 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:21:28,314 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:21:28,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:21:28,314 INFO L82 PathProgramCache]: Analyzing trace with hash 751780498, now seen corresponding path program 1 times [2019-11-20 02:21:28,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:21:28,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631106170] [2019-11-20 02:21:28,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:21:28,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:21:28,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:21:28,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631106170] [2019-11-20 02:21:28,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:21:28,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-20 02:21:28,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956578584] [2019-11-20 02:21:28,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 02:21:28,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:21:28,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 02:21:28,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-20 02:21:28,390 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 6 states. [2019-11-20 02:21:28,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:21:28,521 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2019-11-20 02:21:28,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 02:21:28,522 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-11-20 02:21:28,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:21:28,522 INFO L225 Difference]: With dead ends: 56 [2019-11-20 02:21:28,522 INFO L226 Difference]: Without dead ends: 54 [2019-11-20 02:21:28,523 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-11-20 02:21:28,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-11-20 02:21:28,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 28. [2019-11-20 02:21:28,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-20 02:21:28,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-11-20 02:21:28,527 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 20 [2019-11-20 02:21:28,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:21:28,527 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-11-20 02:21:28,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 02:21:28,527 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-11-20 02:21:28,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-20 02:21:28,528 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:21:28,528 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:21:28,528 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:21:28,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:21:28,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1830363126, now seen corresponding path program 1 times [2019-11-20 02:21:28,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:21:28,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241148467] [2019-11-20 02:21:28,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:21:28,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:21:28,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:21:28,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241148467] [2019-11-20 02:21:28,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:21:28,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-20 02:21:28,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214939925] [2019-11-20 02:21:28,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 02:21:28,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:21:28,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 02:21:28,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-20 02:21:28,601 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 6 states. [2019-11-20 02:21:28,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:21:28,701 INFO L93 Difference]: Finished difference Result 81 states and 95 transitions. [2019-11-20 02:21:28,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 02:21:28,701 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-11-20 02:21:28,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:21:28,702 INFO L225 Difference]: With dead ends: 81 [2019-11-20 02:21:28,702 INFO L226 Difference]: Without dead ends: 0 [2019-11-20 02:21:28,702 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-20 02:21:28,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-20 02:21:28,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-20 02:21:28,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-20 02:21:28,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-20 02:21:28,703 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2019-11-20 02:21:28,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:21:28,703 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 02:21:28,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 02:21:28,703 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-20 02:21:28,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-20 02:21:28,708 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-20 02:21:28,839 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 62 [2019-11-20 02:21:28,958 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 10 [2019-11-20 02:21:29,089 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 84 [2019-11-20 02:21:29,469 WARN L191 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 40 [2019-11-20 02:21:29,472 INFO L444 ceAbstractionStarter]: For program point L93(lines 93 120) no Hoare annotation was computed. [2019-11-20 02:21:29,472 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 172) no Hoare annotation was computed. [2019-11-20 02:21:29,472 INFO L444 ceAbstractionStarter]: For program point L250(lines 250 260) no Hoare annotation was computed. [2019-11-20 02:21:29,472 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 54) no Hoare annotation was computed. [2019-11-20 02:21:29,472 INFO L444 ceAbstractionStarter]: For program point L52(lines 52 281) no Hoare annotation was computed. [2019-11-20 02:21:29,472 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 212) no Hoare annotation was computed. [2019-11-20 02:21:29,472 INFO L444 ceAbstractionStarter]: For program point L69(lines 69 124) no Hoare annotation was computed. [2019-11-20 02:21:29,473 INFO L440 ceAbstractionStarter]: At program point L259(lines 26 301) the Hoare annotation is: (let ((.cse4 (<= 0 ULTIMATE.start_main_~main__i~0)) (.cse1 (<= (+ ULTIMATE.start_main_~main__limit~0 4) ULTIMATE.start_main_~main__bufsize~0))) (or (and (let ((.cse0 (let ((.cse3 (< ULTIMATE.start_main_~main__j~0 ULTIMATE.start_main_~main__bufsize~0))) (let ((.cse2 (or (and (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~8)) .cse4) (and .cse3 .cse4)))) (or (and .cse2 .cse3) (and .cse2 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~12)))))))) (or (and (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~14)) .cse0 .cse1) (and .cse0 .cse1 (<= (+ ULTIMATE.start_main_~main__j~0 4) ULTIMATE.start_main_~main__bufsize~0)))) (<= 1 ULTIMATE.start_main_~main__j~0)) (and (and (<= (+ ULTIMATE.start_main_~main__i~0 1) ULTIMATE.start_main_~main__len~0) .cse4) .cse1 (<= 0 ULTIMATE.start_main_~main__j~0)))) [2019-11-20 02:21:29,473 INFO L444 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-11-20 02:21:29,473 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 95) no Hoare annotation was computed. [2019-11-20 02:21:29,473 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-20 02:21:29,473 INFO L444 ceAbstractionStarter]: For program point L61(lines 61 280) no Hoare annotation was computed. [2019-11-20 02:21:29,473 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-20 02:21:29,474 INFO L444 ceAbstractionStarter]: For program point L210(lines 210 266) no Hoare annotation was computed. [2019-11-20 02:21:29,474 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 252) no Hoare annotation was computed. [2019-11-20 02:21:29,474 INFO L444 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-11-20 02:21:29,474 INFO L444 ceAbstractionStarter]: For program point L95(line 95) no Hoare annotation was computed. [2019-11-20 02:21:29,474 INFO L444 ceAbstractionStarter]: For program point L252(line 252) no Hoare annotation was computed. [2019-11-20 02:21:29,474 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 270) no Hoare annotation was computed. [2019-11-20 02:21:29,474 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 200) no Hoare annotation was computed. [2019-11-20 02:21:29,474 INFO L444 ceAbstractionStarter]: For program point L54(line 54) no Hoare annotation was computed. [2019-11-20 02:21:29,474 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 83) no Hoare annotation was computed. [2019-11-20 02:21:29,475 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 240) no Hoare annotation was computed. [2019-11-20 02:21:29,475 INFO L444 ceAbstractionStarter]: For program point L170(lines 170 272) no Hoare annotation was computed. [2019-11-20 02:21:29,475 INFO L444 ceAbstractionStarter]: For program point L71(line 71) no Hoare annotation was computed. [2019-11-20 02:21:29,475 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 136) no Hoare annotation was computed. [2019-11-20 02:21:29,475 INFO L444 ceAbstractionStarter]: For program point L212(line 212) no Hoare annotation was computed. [2019-11-20 02:21:29,475 INFO L444 ceAbstractionStarter]: For program point L146(lines 146 276) no Hoare annotation was computed. [2019-11-20 02:21:29,475 INFO L444 ceAbstractionStarter]: For program point L105(lines 105 118) no Hoare annotation was computed. [2019-11-20 02:21:29,475 INFO L444 ceAbstractionStarter]: For program point L31(lines 31 295) no Hoare annotation was computed. [2019-11-20 02:21:29,475 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 107) no Hoare annotation was computed. [2019-11-20 02:21:29,476 INFO L444 ceAbstractionStarter]: For program point L188(line 188) no Hoare annotation was computed. [2019-11-20 02:21:29,477 INFO L444 ceAbstractionStarter]: For program point L81(lines 81 122) no Hoare annotation was computed. [2019-11-20 02:21:29,477 INFO L444 ceAbstractionStarter]: For program point L15(lines 15 307) no Hoare annotation was computed. [2019-11-20 02:21:29,477 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 262) no Hoare annotation was computed. [2019-11-20 02:21:29,477 INFO L444 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-11-20 02:21:29,477 INFO L444 ceAbstractionStarter]: For program point L40(lines 40 283) no Hoare annotation was computed. [2019-11-20 02:21:29,477 INFO L440 ceAbstractionStarter]: At program point L288(lines 33 289) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~main__j~0 5) ULTIMATE.start_main_~main__bufsize~0) (<= 0 ULTIMATE.start_main_~main__i~0) (<= (+ ULTIMATE.start_main_~main__limit~0 4) ULTIMATE.start_main_~main__bufsize~0) (<= (+ ULTIMATE.start_main_~main__i~0 1) ULTIMATE.start_main_~main__len~0) (<= 0 ULTIMATE.start_main_~main__j~0)) [2019-11-20 02:21:29,477 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-20 02:21:29,477 INFO L444 ceAbstractionStarter]: For program point L222(lines 222 264) no Hoare annotation was computed. [2019-11-20 02:21:29,477 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 160) no Hoare annotation was computed. [2019-11-20 02:21:29,478 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 42) no Hoare annotation was computed. [2019-11-20 02:21:29,478 INFO L444 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-11-20 02:21:29,478 INFO L447 ceAbstractionStarter]: At program point L305(lines 8 308) the Hoare annotation is: true [2019-11-20 02:21:29,478 INFO L444 ceAbstractionStarter]: For program point L107(line 107) no Hoare annotation was computed. [2019-11-20 02:21:29,478 INFO L444 ceAbstractionStarter]: For program point L198(lines 198 268) no Hoare annotation was computed. [2019-11-20 02:21:29,478 INFO L444 ceAbstractionStarter]: For program point L33(lines 33 289) no Hoare annotation was computed. [2019-11-20 02:21:29,478 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-20 02:21:29,478 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 148) no Hoare annotation was computed. [2019-11-20 02:21:29,478 INFO L444 ceAbstractionStarter]: For program point L83(line 83) no Hoare annotation was computed. [2019-11-20 02:21:29,479 INFO L444 ceAbstractionStarter]: For program point L240(line 240) no Hoare annotation was computed. [2019-11-20 02:21:29,479 INFO L444 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2019-11-20 02:21:29,479 INFO L444 ceAbstractionStarter]: For program point L224(line 224) no Hoare annotation was computed. [2019-11-20 02:21:29,479 INFO L444 ceAbstractionStarter]: For program point L158(lines 158 274) no Hoare annotation was computed. [2019-11-20 02:21:29,479 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 188) no Hoare annotation was computed. [2019-11-20 02:21:29,479 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 71) no Hoare annotation was computed. [2019-11-20 02:21:29,479 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 224) no Hoare annotation was computed. [2019-11-20 02:21:29,480 INFO L440 ceAbstractionStarter]: At program point L299(lines 20 307) the Hoare annotation is: (and (<= 0 ULTIMATE.start_main_~main__i~0) (<= (+ ULTIMATE.start_main_~main__limit~0 4) ULTIMATE.start_main_~main__bufsize~0)) [2019-11-20 02:21:29,480 INFO L444 ceAbstractionStarter]: For program point L200(line 200) no Hoare annotation was computed. [2019-11-20 02:21:29,480 INFO L444 ceAbstractionStarter]: For program point L134(lines 134 278) no Hoare annotation was computed. [2019-11-20 02:21:29,511 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 02:21:29 BoogieIcfgContainer [2019-11-20 02:21:29,512 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 02:21:29,512 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 02:21:29,512 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 02:21:29,512 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 02:21:29,513 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:21:25" (3/4) ... [2019-11-20 02:21:29,515 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-20 02:21:29,527 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-20 02:21:29,527 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-20 02:21:29,640 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_cd408ea5-2c7e-4c83-89f0-3f14160c5454/bin/uautomizer/witness.graphml [2019-11-20 02:21:29,640 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 02:21:29,642 INFO L168 Benchmark]: Toolchain (without parser) took 5511.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.0 MB). Free memory was 944.7 MB in the beginning and 913.1 MB in the end (delta: 31.6 MB). Peak memory consumption was 193.6 MB. Max. memory is 11.5 GB. [2019-11-20 02:21:29,642 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 02:21:29,643 INFO L168 Benchmark]: CACSL2BoogieTranslator took 553.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.0 MB). Free memory was 944.7 MB in the beginning and 1.2 GB in the end (delta: -210.9 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. [2019-11-20 02:21:29,643 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-20 02:21:29,643 INFO L168 Benchmark]: Boogie Preprocessor took 42.05 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 02:21:29,644 INFO L168 Benchmark]: RCFGBuilder took 562.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2019-11-20 02:21:29,644 INFO L168 Benchmark]: TraceAbstraction took 4157.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 920.1 MB in the end (delta: 207.7 MB). Peak memory consumption was 207.7 MB. Max. memory is 11.5 GB. [2019-11-20 02:21:29,645 INFO L168 Benchmark]: Witness Printer took 128.73 ms. Allocated memory is still 1.2 GB. Free memory was 920.1 MB in the beginning and 913.1 MB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-11-20 02:21:29,647 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 553.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.0 MB). Free memory was 944.7 MB in the beginning and 1.2 GB in the end (delta: -210.9 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 53.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 42.05 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 562.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4157.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 920.1 MB in the end (delta: 207.7 MB). Peak memory consumption was 207.7 MB. Max. memory is 11.5 GB. * Witness Printer took 128.73 ms. Allocated memory is still 1.2 GB. Free memory was 920.1 MB in the beginning and 913.1 MB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 54]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 160]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 148]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 252]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 83]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 42]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 71]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 212]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 95]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 107]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 136]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 188]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 240]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 224]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 200]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 172]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: (((main__j + 5 <= main__bufsize && 0 <= main__i) && main__limit + 4 <= main__bufsize) && main__i + 1 <= main__len) && 0 <= main__j - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: 0 <= main__i && main__limit + 4 <= main__bufsize - InvariantResult [Line: 8]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: ((((!(0 == __VERIFIER_assert__cond) && ((((!(0 == __VERIFIER_assert__cond) && 0 <= main__i) || (main__j < main__bufsize && 0 <= main__i)) && main__j < main__bufsize) || (((!(0 == __VERIFIER_assert__cond) && 0 <= main__i) || (main__j < main__bufsize && 0 <= main__i)) && !(0 == __VERIFIER_assert__cond)))) && main__limit + 4 <= main__bufsize) || ((((((!(0 == __VERIFIER_assert__cond) && 0 <= main__i) || (main__j < main__bufsize && 0 <= main__i)) && main__j < main__bufsize) || (((!(0 == __VERIFIER_assert__cond) && 0 <= main__i) || (main__j < main__bufsize && 0 <= main__i)) && !(0 == __VERIFIER_assert__cond))) && main__limit + 4 <= main__bufsize) && main__j + 4 <= main__bufsize)) && 1 <= main__j) || (((main__i + 1 <= main__len && 0 <= main__i) && main__limit + 4 <= main__bufsize) && 0 <= main__j) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 60 locations, 16 error locations. Result: SAFE, OverallTime: 4.0s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.7s, HoareTripleCheckerStatistics: 845 SDtfs, 1238 SDslu, 620 SDs, 0 SdLazy, 780 SolverSat, 111 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 124 GetRequests, 41 SyntacticMatches, 5 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 395 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 19 NumberOfFragments, 162 HoareAnnotationTreeSize, 4 FomulaSimplifications, 137551921 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 4 FomulaSimplificationsInter, 15217 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 230 NumberOfCodeBlocks, 230 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 214 ConstructedInterpolants, 0 QuantifiedInterpolants, 10026 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...